Public Verifiability from Pairings in Secret Sharing Schemes

Authors:
Somayeh Heidarvand;Jorge L. Villar
Affiliations:
Universitat Politècnica de Catalunya, Spain;Universitat Politècnica de Catalunya, Spain
Venue:
Selected Areas in Cryptography
Year:
2009

Citing 0
Cited 2

Increased resilience in threshold cryptography: sharing a secret with devices that cannot store shares

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
A practical (non-interactive) publicly verifiable secret sharing scheme

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience

Quantified Score

Hi-index	0.00

Visualization

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 scheme tolerates active and adaptive adversaries.