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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 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.

Original languageEnglish
Title of host publicationTheory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
EditorsYevgeniy Dodis, Jesper Buus Nielsen
PublisherSpringer Verlag
Pages93-109
Number of pages17
ISBN (Electronic)9783662464939
DOIs
StatePublished - 2015
Event12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland
Duration: 23 Mar 201525 Mar 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9014

Conference

Conference12th Theory of Cryptography Conference, TCC 2015
Country/TerritoryPoland
CityWarsaw
Period23/03/1525/03/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle'. Together they form a unique fingerprint.

Cite this