Show simple item record

dc.contributor.authorHeidarvand, Somayed
dc.contributor.authorVillar Santos, Jorge Luis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.identifier.citationHeidarvand, S.; Villar, J. Public verifiability from pairings in secret sharing schemes. "Lecture notes in computer science", 2009, vol. 5381, p. 294-308.
dc.description.abstractIn 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.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
dc.subject.lcshThreshold cryptosystem
dc.subject.lcshCryptography -- Mathematical models
dc.titlePublic verifiability from pairings in secret sharing schemes
dc.subject.lemacCriptografia -- Mètodes estadístics
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.description.peerreviewedPeer Reviewed
dc.rights.accessRestricted access - publisher's policy
dc.description.versionPostprint (published version)
local.citation.authorHeidarvand, S.; Villar, J.
local.citation.publicationNameLecture notes in computer science

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder