Constant-round concurrent zero knowledge from P-certificates

Kai Min Chung, Huijia Lin, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, and a new, but in our eyes, natural complexitytheoretic assumption: The existence of P-certificates-that is, "succinct" non-interactive proofs/arguments for P. As far as we know, our results yield the first constant-round concurrent zero-knowledge protocol for NP with an explicit zero-knowledge simulator based on any assumption.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013
Pages50-59
Number of pages10
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 - Berkeley, CA, United States
Duration: 27 Oct 201329 Oct 2013

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Conference

Conference2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013
Country/TerritoryUnited States
CityBerkeley, CA
Period27/10/1329/10/13

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'Constant-round concurrent zero knowledge from P-certificates'. Together they form a unique fingerprint.

Cite this