Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Anonymous Fingerprinting with Direct Non-repudiation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Round-Optimal Contributory Conference Key Agreement
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
CLIQUES: A New Approach to Group Key Agreement
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
The random oracle methodology, revisited
Journal of the ACM (JACM)
A Robust Multi-Party Key Agreement Protocol Resistant to Malicious Participants
The Computer Journal
Modeling insider attacks on group key-exchange protocols
Proceedings of the 12th ACM conference on Computer and communications security
A secure and scalable Group Key Exchange system
Information Processing Letters
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The Diffie-Hellman (DH) problem is an important security assumption in modern cryptography. In this paper, a new type of cryptographic technique called a convinced Diffie-Hellman (DH) computation scheme is proposed. In the convinced DH computation scheme, an issuer can convince a verifier that the computation of the Diffie-Hellman problem is correct under without revealing any exponential parts of two Diffie-Hellman public values. Firstly, the formal framework and security requirements for this new cryptographic scheme are defined. Then a concrete scheme is proposed. In the random oracle model and under the difficulty of computing discrete logarithm, we demonstrate that the proposed scheme meets the defined security requirements. Finally, we present an important application of the convinced DH computation scheme. Most group key agreement protocols provide only the functionality of detecting the existence of malicious participants, but don’t identify who malicious participants are. The novel convinced DH computation scheme can be embedded in many multi-round group key agreement protocols to identify malicious participants and provide fault tolerance.