Efficient Diffie-Hellmann two-party key agreement protocols based on elliptic curves

Authors:
Maurizio Adriano Strangio
Affiliations:
University of Rome "Tor Vergata" Rome, Italy
Venue:
Proceedings of the 2005 ACM symposium on Applied computing
Year:
2005

Citing 7
Cited 4

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An unknown key-share attack on the MQV key agreement protocol

ACM Transactions on Information and System Security (TISSEC)
An Efficient Protocol for Authenticated Key Agreement

Designs, Codes and Cryptography
Entity Authentication and Key Distribution

CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Key Agreement Protocols and Their Security Analysis

Proceedings of the 6th IMA International Conference on Cryptography and Coding
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography

Supporting symmetric 128-bit AES in networked embedded systems: an elliptic curve key establishment protocol-on-chip

EURASIP Journal on Embedded Systems
Access control in user hierarchy based on elliptic curve cryptosystem

Information Sciences: an International Journal
A secure and efficient three-pass authenticated key agreement protocol based on elliptic curves

NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
An efficient dynamic group key agreement protocol for imbalanced wireless networks

International Journal of Network Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Key agreement protocols are of fundamental importance for ensuring the confidentiality of communications between two (or more) parties over an insecure network. In this paper we review existing two-party protocols whose security rests upon the intractability of Diffie-Hellmann and Discrete Logarithm problems over elliptic curve groups. In addition, we propose a new two-party mutual authenticated key agreement protocol and collectively evaluate the security and performance of all the schemes considered. Elliptic curve techniques are used to minimise the computational workload on resource-constrained devices and to afford security levels with possibly fewer bits.