Loading...
Loading...

Go to the content (press return)

Public verifiability from pairings in secret sharing schemes

Author
Heidarvand, S.; Villar, J.
Type of activity
Journal article
Journal
Lecture notes in computer science
Date of publication
2009
Volume
5381
First page
294
Last page
308
DOI
https://doi.org/10.1007/978-3-642-04159-4 Open in new window
Repository
http://hdl.handle.net/2117/8968 Open in new window
Abstract
In this paper we propose a new publicly verifiable secret sharing scheme using pairings with close relations to Shoenmakers’ scheme. This scheme is efficient, multiplicatively homomorphic and with unconditional verifiability in the standard model. We formalize the notion of Indistinguishability of Secrets and prove that out scheme achieves it under the Decisional Bilinear Square (DBS) Assumption that is a natural variant of the Decisional Bilinear Diffie Hellman Assumption. Moreover, our schem...
Citation
Heidarvand, S.; Villar, J. Public verifiability from pairings in secret sharing schemes. "Lecture notes in computer science", 2009, vol. 5381, p. 294-308.
Group of research
MAK - Mathematics Applied to Cryptography

Participants