Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Public verifiability from pairings in secret sharing schemes

Autor
Heidarvand, S.; Villar, J.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2009
Volum
5381
Pàgina inicial
294
Pàgina final
308
DOI
https://doi.org/10.1007/978-3-642-04159-4 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/8968 Obrir en finestra nova
Resum
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...
Citació
Heidarvand, S.; Villar, J. Public verifiability from pairings in secret sharing schemes. "Lecture notes in computer science", 2009, vol. 5381, p. 294-308.
Grup de recerca
MAK - Matemàtica Aplicada a la Criptografia

Participants