Runtime verification of cryptographic protocols
There has been a significant amount of work devoted to the static verification of security protocol designs. Virtually all of these results, when applied to an actual implementation of a security protocol, rely on certain implicit assumptions on the implementation (for example, that the cryptographic checks that according to the design have to be performed by the protocol participants are carried out correctly). So far there seems to be no approach that would enforce these implicit assumptions...[Show more]
|Collections||ANU Research Publications|
|Source:||Computers and Security|
|01_Bauer_Runtime_verification_of_2010.pdf||194.7 kB||Adobe PDF||Request a copy|
|02_Bauer_Runtime_verification_of_2010.pdf||1.22 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.