A PAIRING-BASED PUBLICLY VERIFIABLE SECRET SHARING SCHEME

作     者：Tsu-Yang WU Yuh-Min TSENG 

作者机构：Department of Mathematics National Changhua University of Education Jin-De Campus Chang-Hua 500 Taiwan 

出 版 物：《Journal of Systems Science & Complexity》 (系统科学与复杂性学报（英文版）)

年 卷 期：2011年第24卷第1期

页      面：186-194页

核心收录：

学科分类：11[军事学] 07[理学] 08[工学] 070104[理学-应用数学] 110505[军事学-密码学] 110503[军事学-军事通信学] 0810[工学-信息与通信工程] 1205[管理学-图书情报与档案管理] 1105[军事学-军队指挥学] 0839[工学-网络空间安全] 0811[工学-控制科学与工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Council  Taiwan  under Grant 

主　　题：Bilinear pairing cryptography random oracle model secret sharing. 

摘      要：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 cryp- tographic 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-HeUman assumption, the authors prove that the proposed scheme is a secure PVSS scheme.