Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings |
| Pages | 225-235 |
| Number of pages | 11 |
| Edition | PART 4 |
| DOIs | |
| Publication status | Published - 2010 May 20 |
| Event | 2010 International Conference on Computational Science and Its Applications, ICCSA 2010 - Fukuoka, Japan Duration: 2010 Mar 23 → 2010 Mar 26 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Number | PART 4 |
| Volume | 6019 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 2010 International Conference on Computational Science and Its Applications, ICCSA 2010 |
|---|---|
| Country | Japan |
| City | Fukuoka |
| Period | 10-03-23 → 10-03-26 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
}
A novel convinced diffie-hellman computation scheme and its cryptographic application. / Tseng, Yuh Min; Wu, Tsu Yang.
Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4. ed. 2010. p. 225-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6019 LNCS, No. PART 4).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A novel convinced diffie-hellman computation scheme and its cryptographic application
AU - Tseng, Yuh Min
AU - Wu, Tsu Yang
PY - 2010/5/20
Y1 - 2010/5/20
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77952313076&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952313076&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-12189-0-20
DO - 10.1007/978-3-642-12189-0-20
M3 - Conference contribution
AN - SCOPUS:77952313076
SN - 3642121888
SN - 9783642121883
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 225
EP - 235
BT - Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings
ER -