English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6469/11641
Visitors : 16932052      Online Users : 424
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/12177

Title: A PAIRING-BASED PUBLICLY VERIFIABLE SECRET SHARING SCHEME
Authors: Wu, Tsu-Yang;Tseng, Yuh-Min
Contributors: 數學系
Keywords: Bilinear pairing;Cryptography;Random oracle model;Secret sharing
Date: 2011
Issue Date: 2012-07-03T03:45:43Z
Publisher: SpringerLink
Abstract: A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the special property that anyone is able to verify the shares whether they are correctly distributed by a dealer. PVSS plays an important role in many applications such as electronic voting, payment systems with revocable anonymity, and key escrow. Up to now, all PVSS schemes are based on the traditional public-key systems. Recently, the pairing-based cryptography has received much attention from cryptographic researchers. Many pairing-based schemes and protocols have been proposed. However, no PVSS scheme using bilinear pairings is proposed. This paper presents the first pairing-based PVSS scheme. In the random oracle model and under the bilinear Diffie-Hellman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.
Relation: Journal of Systems Science and Complexity, 24(1): 186-194
Appears in Collections:[數學系] 期刊論文

Files in This Item:

File SizeFormat
2020100910025.pdf25KbAdobe PDF422View/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