2006 IEEE International Conference on Communications · 2006 · 33 citations · 7 references
ComputingCommunicationComputer ScienceCryptographyNetwork SecuritySecurity ProtocolsAd Hoc Mobile NetworksCryptographic Protocol DesignElliptic Curve CryptographyElliptic CurvesKey Exchange ProtocolsWireless Network SecurityAd Hoc NetworksDiffie-hellman Key ExchangeDiffie-hellman ProtocolsDiscrete Logarithm ProblemElliptic Curve Diffie-hellmanElliptic Curve Diffie-hellman Key ExchangeGroup Key ExchangeSecure Group Communication
The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.
7
New directions in cryptography
Whitfield Diffie, Martin E. Hellman · IEEE Transactions on Information Theory · 1976 · 14.4K citations