A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
- Mahabir Prasad JhanwarAffiliated withC R RAO Advanced Institute of Mathematics, Statistics and Computer Science, University of Hyderabad Campus
Efficient non-interactive public verification.
Proving security for the public verifiability in the standard model.
In this paper we propose a (t, n)-threshold PVSS scheme which satisfies both of these properties. Efficiency of the non-interactive public verification step of the proposed scheme is optimal (in terms of computations of bilinear maps (pairing)) while comparing with the earlier solution by . In public verification step of , one needs to compute 2n many pairings, where n is the number of shareholders, whereas in our scheme the number of pairing computations is 4 only. This count is irrespective of the number of shareholders. We also provide a formal proof for the semantic security (IND) of our scheme based on the hardness of a problem that we call the (n,t)-multi-sequence of exponents Diffie-Hellman problem (MSE-DDH). This problem falls under the general Diffie-Hellman exponent problem framework .
KeywordsSecret sharing non-interactive PVSS general Diffie-Hellman exponent problem
- A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
- Book Title
- Information Security Practice and Experience
- Book Subtitle
- 7th International Conference, ISPEC 2011, Guangzhou, China, May 30 – June 1, 2011. Proceedings
- pp 273-287
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Secret sharing
- non-interactive PVSS
- general Diffie-Hellman exponent problem
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.