Provably secure key exchange: an engineering approach

Authors:
Yiu Shing Terry Tin;Colin Boyd;Juanma Gonzalez Nieto
Affiliations:
Information Security Research Centre, Queensland University of Technology, PO Box 2434, Brisbane, QLD 4001, Australia;Information Security Research Centre, Queensland University of Technology, PO Box 2434, Brisbane, QLD 4001, Australia;Information Security Research Centre, Queensland University of Technology, PO Box 2434, Brisbane, QLD 4001, Australia
Venue:
ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
Year:
2003

Citing 7
Cited 4

Provably secure session key distribution: the three party case

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Entity Authentication and Key Distribution

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Public-key encryption in a multi-user setting: security proofs and improvements

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

SAM: secure access of media independent information service with user anonymity

EURASIP Journal on Wireless Communications and Networking
On the security of the canetti-krawczyk model

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Security requirements for key establishment proof models: revisiting Bellare–Rogaway and Jeong–Katz–Lee protocols

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Efficient anonymous roaming and its security analysis

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

We promote an engineering approach to design of provably secure key exchange protocols. Using the model of Canetti and Krawczyk we present a systematic method to arrive at efficient and practical protocols with proven security and illustrate its use with existing building blocks. We further show a dual approach which allows protocols with known features to be 'reverse engineered', thereby allowing easier security proofs and providing new building blocks for future designs.