loading...
Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications
Rockport, Massachusetts June 10-June 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.1997.59678410th Computer Security Foundations Wo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
James W. Gray, Hong Kong University of Science and Techology
Kin Fai Epsilon Ip, Hong Kong University of Science and Techology
King-Shan Lui, University of California, Santa Barbara
We develop an approach to deriving concrete engineering advice for cryptographic protocols from provable-security-style proofs of security. The approach is illustrated with a simple, yet useful protocol. The proof is novel and is the first published proof that provides an exact relationship between a high-level protocol and multiple cryptographic primitives.
Citation:
James W. Gray, Kin Fai Epsilon Ip, King-Shan Lui, "Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications," csfw, pp.45, 10th Computer Security Foundations Workshop (CSFW '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.