English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 15347532      Online Users : 395
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/12170

Title: A Novel Convinced Diffie-Hellman Computation Scheme and Its Cryptographic Application
Authors: Tseng, Yuh-Min;Wu, T. Y.
Contributors: 數學系
Keywords: Diffie-Hellman problem;Convinced computation;Malicious participant;Group key agreement;Cryptography
Date: 2010
Issue Date: 2012-07-03T03:45:23Z
Publisher: SpringerLink
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.
Relation: Computational Science and Its Applications-ICCSA 2010, 6019: 225-235
Appears in Collections:[數學系] 期刊論文

Files in This Item:

File SizeFormat
2020100910024.pdf25KbAdobe PDF338View/Open


All items in NCUEIR are protected by copyright, with all rights reserved.

 


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback