Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
verfasst von : Yehuda Lindell
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol for a relation
R
and outputs a non-interactive zero-knowledge proof (not of knowledge) for the associated language
L
R
, in the common reference string model. As in the Fiat-Shamir transform, we use a hash function
H
. However, zero-knowledge is achieved under standard assumptions in the common reference string model (without any random oracle), and soundness is achieved in the
non-programmable
random oracle model. The concrete computational complexity of the transform is only slightly higher than the original Fiat-Shamir transform.