資料載入中.....
|
請使用永久網址來引用或連結此文件:
http://ir.ncue.edu.tw/ir/handle/987654321/12170
|
| 題名: | A Novel Convinced Diffie-Hellman Computation Scheme and Its Cryptographic Application |
| 作者: | Tseng, Yuh-Min;Wu, T. Y. |
| 貢獻者: | 數學系 |
| 關鍵詞: | Diffie-Hellman problem;Convinced computation;Malicious participant;Group key agreement;Cryptography |
| 日期: | 2010
|
| 上傳時間: | 2012-07-03T03:45:23Z
|
| 出版者: | SpringerLink |
| 摘要: | 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. |
| 關聯: | Computational Science and Its Applications-ICCSA 2010, 6019: 225-235 |
| 顯示於類別: | [數學系] 期刊論文
|
文件中的檔案:
| 檔案 |
大小 | 格式 | 瀏覽次數 |
|---|
| 2020100910024.pdf | 25Kb | Adobe PDF | 450 | 檢視/開啟 |
|
在NCUEIR中所有的資料項目都受到原著作權保護.
|
