Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications

James W. Gray; Kin Fai Epsilon Ip; King-Shan Lui

doi:10.1109/CSFW.1997.596784

Previous
Next
Table of Contents

Computer Security Foundations Workshop, IEEE

Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications

Year: 1997, Pages: 45

DOI Bookmark: 10.1109/CSFW.1997.596784

Authors

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

Abstract

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.

Like what you’re reading?

Already a member?

Get this article FREE with a new membership!