14th IEEE Computer Security Foundations Workshop (CSFW'01) Proving Secrecy is Easy Enough Cape Breton, Novia Scotia, Canada June 11-June 13 ISBN: 0-7695-1146-5
Abstract: We develop a systematic proof procedure for establishing secrecy results for cryptographic protocols. Part of the procedure is to reduce messages to simplified constituents, and its core is a search procedure for establishing secrecy results. This procedure is sound but incomplete in that it may fail to establish secrecy for some secure protocols. However, it is amenable to mechanization, and it also has a convenient visual representation. We demonstrate the utility of our procedure with secrecy proofs for standard benchmarks such as the Yahalom protocol.
Citation:
Véronique Cortier, Jon Millen, Harald Rueß, "Proving Secrecy is Easy Enough," csfw, pp.0097, 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||