Sigma protocols and efficient zero-knowledge1

Carmit Hazay, Yehuda Lindell

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

28 Scopus citations

Abstract

A zero-knowledge proof is an interactive proof with the additional property that the verifier learns nothing beyond the correctness of the statement being proved. The theory of zero-knowledge proofs is beautiful and rich, and is a cornerstone of the foundations of cryptography. In the context of cryptographic protocols, zero-knowledge proofs can be used to enforce “good behavior” by having parties prove that they indeed followed the protocol correctly. These proofs must reveal nothing about the parties’ private inputs, and as such must be zero knowledge. Zero-knowledge proofs are often considered an expensive (and somewhat naive) way of enforcing honest behavior, and those who view them in this way consider them to be not very useful when constructing efficient protocols.

Original languageEnglish
Title of host publicationInformation Security and Cryptography
PublisherSpringer International Publishing
Pages147-175
Number of pages29
DOIs
StatePublished - 2010

Publication series

NameInformation Security and Cryptography
Volume15
ISSN (Print)1619-7100
ISSN (Electronic)2197-845X

Bibliographical note

Publisher Copyright:
© 2010, Springer-Verlag Berlin Heidelberg.

Fingerprint

Dive into the research topics of 'Sigma protocols and efficient zero-knowledge1'. Together they form a unique fingerprint.

Cite this