A PAIRING-BASED PUBLICLY VERIFIABLE SECRET SHARING SCHEME

被引:29
作者
Wu, Tsu-Yang [1 ]
Tseng, Yuh-Min [1 ]
机构
[1] Natl Changhua Univ Educ, Dept Math, Changhua 500, Taiwan
关键词
Bilinear pairing; cryptography; random oracle model; secret sharing; KEY AGREEMENT PROTOCOL; EFFICIENT; SIGNATURES;
D O I
10.1007/s11424-011-8408-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:186 / 194
页数:9
相关论文
共 40 条
[1]  
[Anonymous], 8 ACIS INT C SOFTW E
[2]  
[Anonymous], 6 ANN ACM SIAM S DIS
[3]  
[Anonymous], 1999, LECT NOTES COMPUTER, DOI DOI 10.1007/3-540-48405-1_10
[4]  
[Anonymous], 1995, International Conference on the Theory and Applications of Cryptographic Techniques
[5]  
[Anonymous], INT J COMPUTER SCI
[6]  
[Anonymous], LNCS
[7]  
[Anonymous], 5 ANN ACM S PRINC DI
[8]  
[Anonymous], ACM INT C P SERIES
[9]  
[Anonymous], 1987, Ph.D. thesis
[10]  
[Anonymous], LNCS