Journal of Systems Science and Complexity

, Volume 24, Issue 1, pp 186–194

A pairing-based publicly verifiable secret sharing scheme


DOI: 10.1007/s11424-011-8408-6

Cite this article as:
Wu, TY. & Tseng, YM. J Syst Sci Complex (2011) 24: 186. doi:10.1007/s11424-011-8408-6


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.

Key words

Bilinear pairingcryptographyrandom oracle modelsecret sharing

Copyright information

© Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Department of MathematicsNational Changhua University of EducationChang-HuaTaiwan