Authentication and authenticated key exchanges
Designs, Codes and Cryptography
Time bounds for real-time process control in the presence of timing uncertainty
Information and Computation
On the Borowsky-Gafni simulation algorithm
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Specifying and using a partitionable group communication service
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
Journal of the ACM (JACM)
Computer-assisted verification of an algorithm for concurrent timestamps
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
The inductive approach to verifying cryptographic protocols
Journal of Computer Security
Distributed Algorithms
Protection in Programming-Language Translations
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Specifications and Proofs for Ensemble Layers
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Secure Implementation of Channel Abstractions
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Top-Down Look at a Secure Message
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Proving a WS-federation passive requestor profile with a browser model
Proceedings of the 2005 workshop on Secure web services
A derivation system and compositional logic for security protocols
Journal of Computer Security
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling a Secure Agent with Team Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
Browser model for security analysis of browser-based protocols
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
The combination of two security protocols, a simple shared-key communication protocol and the Diffie-Hellman key distribution protocol, is modeled formally and proved correct. The modeling is based on the I/O automaton model for distributed algorithms, and the proofs are based on invariant assertions, simulation relations, and compositional reasoning. Arguments about the cryptosystems are handled separately from arguments about the protocols.