4-round resettably-sound zero knowledge

Kai Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti

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

19 Scopus citations

Abstract

While 4-round constructions of zero-knowledge arguments are known based on the existence of one-way functions, constuctions of resettably-sound zero-knowledge arguments require either stronger assumptions (the existence of a fully-homomorphic encryption scheme), or more communication rounds. We close this gap by demonstrating a 4-round resettably-sound zero-knowledge argument for NP based on the existence of one-way functions.

Original languageEnglish
Title of host publicationTheory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, Proceedings
PublisherSpringer Verlag
Pages192-216
Number of pages25
ISBN (Print)9783642542411
DOIs
StatePublished - 2014
Externally publishedYes
Event11th Theory of Cryptography Conference on Theory of Cryptography, TCC 2014 - San Diego, CA, United States
Duration: 24 Feb 201426 Feb 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8349 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Theory of Cryptography Conference on Theory of Cryptography, TCC 2014
Country/TerritoryUnited States
CitySan Diego, CA
Period24/02/1426/02/14

Funding

FundersFunder number
National Science Foundation

    Fingerprint

    Dive into the research topics of '4-round resettably-sound zero knowledge'. Together they form a unique fingerprint.

    Cite this