Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Algorithms for computer algebra
Algorithms for computer algebra
Diffie-Hillman is as Strong as Discrete Log for Certain Primes
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Two-Pass Authenticated Key Arrangement Protocol with Key Confirmation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
A Tool Box of Cryptographic Functions Related to the Diffie-Hellman Function
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Extended Password Key Exchange Protocols Immune to Dictionary Attacks
WET-ICE '97 Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises
ID-Based Group Password-Authenticated Key Exchange
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
A new security model for authenticated key agreement
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Deniable internet key exchange
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
A secure and efficient authenticated Diffie-Hellman protocol
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Strongly secure certificateless key exchange without pairing
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Identity-based key exchange protocols without pairings
Transactions on computational science X
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Authenticated key agreement without subgroup element verification
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
The square root Diffie---Hellman problem
Designs, Codes and Cryptography
A novel convinced diffie-hellman computation scheme and its cryptographic application
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Relationships between diffie-hellman and “index oracles”
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
HMQV: a high-performance secure diffie-hellman protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Public key cryptography sans certificates in ad hoc networks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Making the diffie-hellman protocol identity-based
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
A complementary analysis of the (s)YZ and DIKE protocols
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
| Hi-index | 0.00 |
This paper consists of three parts. First, various types of Diffie-Hellman oracles for a cyclic group G and subgroups of G are defined and their equivalence is proved. In particular, the security of using a subgroup of G instead of G in the Diffie-Hellman protocol is investigated. Second, we derive several new conditions for the polynomial-time equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms in G which extend former results by den Boer and Maurer. Finally, efficient constructions of Diffie-Hellman groups with provable equivalence are described.