Deriving Cryptographically Sound Implementations Using Composition and Formally Verified Bisimulation
- 9 July 2002
- book chapter
- Published by Springer Nature
- p. 310-329
- https://doi.org/10.1007/3-540-45614-7_18
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- I/O automaton models and proofs for shared-key communication systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Composition and integrity preservation of secure reactive systemsPublished by Association for Computing Machinery (ACM) ,2000
- Reconciling Two Views of CryptographyPublished by Springer Nature ,2000
- Probabilistic Polynomial-Time Equivalence and Security AnalysisPublished by Springer Nature ,1999
- A Calculus for Cryptographic Protocols: The Spi CalculusInformation and Computation, 1999
- A probabilistic poly-time framework for protocol analysisPublished by Association for Computing Machinery (ACM) ,1998
- The inductive approach to verifying cryptographic protocolsJournal of Computer Security, 1998
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- PVS: A prototype verification systemLecture Notes in Computer Science, 1992
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983