Referenced Items are not available for this document.
We present two logical systems for reasoning about cryptographic constructions which are sound with respect to standard cryptographic definitions of security. Soundness of the first system is proved using techniques from nonstandard models of arithmetic. Soundness of the second system is proved by an interpretation into the first system. We also present examples of how these systems may be used to formally prove the correctness of some elementary cryptographic constructions.
Published in:
Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on
Date of Conference: 11-14 Oct. 2003
- Page(s):
- 372 - 383
- ISSN :
- 0272-5428
- Print ISBN:
- 0-7695-2040-5
- INSPEC Accession Number:
- 7847063
- Digital Object Identifier :
- 10.1109/SFCS.2003.1238211
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
