2001 · 87 citations · 20 references
ComputingComputer ScienceCryptographyFormal MethodsSecurity ProtocolsCryptographic ProtocolsDeductive VerificationModel CheckingProtocol AnalysisProtocol VerificationSecurity Protocol VerificationFinite-state ProcessesFormal Verification Of Cryptographic ProtocolsFormal Verification Of Security PropertiesModel Checking Of Infinite-state SystemsModel Checking Of Security ProtocolsProtocol Formal VerificationSymbolic AnalysisSymbolic Protocol Verification
We consider the problem of automatically verifing infinite-state cryptographic protocols. Specifically, we present an algorithm that given a finite process describing a protocol in a hostile environment (trying to force the system into a "bad" state) computes a model of traces on which security properties can be checked. Because of unbounded inputs from the environment, even finite processes have an infinite set of traces: the main focus of our approach is the reduction of this infinite set to a finite set by a symbolic analysis of the knowledge of the environment. Our algorithm is sound (and we conjecture complete) for protocols with shared-key encryption-decryption that use arbitrary messages as keys; further it is complete in the common and important case in which the cryptographic keys are messages of bounded size.
20
On the security of public key protocols
Danny Dolev, A. Yao · IEEE Transactions on Information Theory · 1983 · 5.7K citations
Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations
A calculus of mobile processes, I
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 2.8K citations · Full text
Communicating sequential processes
Microprocessors and Microsystems · 1986 · 2.2K citations
A calculus of mobile processes, II
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 1.7K citations · Full text