An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

Yehuda Lindell

doi:10.1007/978-3-662-46494-6_5

An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

Yehuda Lindell

Department of Computer Science and Artificial Intelligence

Bar-Ilan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol for a relation R and outputs a noninteractive 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.

Original language	English
Title of host publication	Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
Editors	Yevgeniy Dodis, Jesper Buus Nielsen
Publisher	Springer Verlag
Pages	93-109
Number of pages	17
ISBN (Electronic)	9783662464939
DOIs	https://doi.org/10.1007/978-3-662-46494-6_5
State	Published - 2015
Event	12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland Duration: 23 Mar 2015 → 25 Mar 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9014

Conference

Conference	12th Theory of Cryptography Conference, TCC 2015
Country/Territory	Poland
City	Warsaw
Period	23/03/15 → 25/03/15

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-46494-6_5

Cite this

Lindell, Y. (2015). An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. In Y. Dodis, & J. B. Nielsen (Eds.), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings (pp. 93-109). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9014). Springer Verlag. https://doi.org/10.1007/978-3-662-46494-6_5

Lindell, Yehuda. / An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. editor / Yevgeniy Dodis ; Jesper Buus Nielsen. Springer Verlag, 2015. pp. 93-109 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{803c9ecc54fb4660a4d9602c876dc14c,

title = "An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle",

abstract = "In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol for a relation R and outputs a noninteractive zero-knowledge proof (not of knowledge) for the associated language LR, 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.",

author = "Yehuda Lindell",

note = "Publisher Copyright: {\textcopyright} International Association for Cryptologic Research 2015.; 12th Theory of Cryptography Conference, TCC 2015 ; Conference date: 23-03-2015 Through 25-03-2015",

year = "2015",

doi = "10.1007/978-3-662-46494-6\_5",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "93--109",

editor = "Yevgeniy Dodis and Nielsen, \{Jesper Buus\}",

booktitle = "Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings",

address = "Germany",

}

Lindell, Y 2015, An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. in Y Dodis & JB Nielsen (eds), Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9014, Springer Verlag, pp. 93-109, 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, 23/03/15. https://doi.org/10.1007/978-3-662-46494-6_5

An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. / Lindell, Yehuda.
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. ed. / Yevgeniy Dodis; Jesper Buus Nielsen. Springer Verlag, 2015. p. 93-109 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9014).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

AU - Lindell, Yehuda

PY - 2015

Y1 - 2015

N2 - In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol for a relation R and outputs a noninteractive zero-knowledge proof (not of knowledge) for the associated language LR, 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.

AB - In this short paper, we present a Fiat-Shamir type transform that takes any Sigma protocol for a relation R and outputs a noninteractive zero-knowledge proof (not of knowledge) for the associated language LR, 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.

UR - https://www.scopus.com/pages/publications/84924690710

U2 - 10.1007/978-3-662-46494-6_5

DO - 10.1007/978-3-662-46494-6_5

M3 - Conference contribution

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 93

EP - 109

BT - Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings

A2 - Dodis, Yevgeniy

A2 - Nielsen, Jesper Buus

PB - Springer Verlag

T2 - 12th Theory of Cryptography Conference, TCC 2015

Y2 - 23 March 2015 through 25 March 2015

ER -

Lindell Y. An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle. In Dodis Y, Nielsen JB, editors, Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings. Springer Verlag. 2015. p. 93-109. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-46494-6_5

An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this