How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
The Interrogator: Protocol Secuity Analysis
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
On the security of ping-pong protocols when implemented using the RSA
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Verification of network security protocols
Computers and Security
Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract)
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Cryptographic protocols
Confidentiality-Preserving Refinement
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A novel common control channel security framework for cognitive radio networks
International Journal of Autonomous and Adaptive Communications Systems
| Hi-index | 0.00 |
This paper shows how to derive a representation of the participants' knowledge in a cryptographic protocol. The modelization is based on the assumption that the underlying cryptographic system is perfect and is an extension of the "Hidden Automorphism Model" introduced by Merritt. It can be used to establish the security of the protocols.