Public-coin parallel zero-knowledge for NP

Rafael Pass; Alon Rosen; Wei Lung Dustin Tseng

doi:10.1007/s00145-011-9110-5

Public-coin parallel zero-knowledge for NP

Rafael Pass, Alon Rosen, Wei Lung Dustin Tseng

Research output: Contribution to journal › Article › peer-review

Abstract

We show that, assuming the existence of collision-resistant hash functions, every language in NP has a constant-round public-coin zero-knowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak's zero-knowledge argument (FOCS 2001), and has a non-black-box simulator. This result stands in sharp contrast with the recent result by Pass, Tseng and Wikstrom (Crypto 2010) showing that only languages in BPP have public-coin parallel zero-knowledge arguments with black-box simulators.

Original language	English
Pages (from-to)	1-10
Number of pages	10
Journal	Journal of Cryptology
Volume	26
Issue number	1
DOIs	https://doi.org/10.1007/s00145-011-9110-5
State	Published - Jan 2013
Externally published	Yes

Keywords

Non-black-box simulation
Parallel composition
Zero-knowledge

All Science Journal Classification (ASJC) codes

Software
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00145-011-9110-5

Cite this

@article{ba79431cb1ab47b3b46a4e9739e972ac,

title = "Public-coin parallel zero-knowledge for NP",

abstract = "We show that, assuming the existence of collision-resistant hash functions, every language in NP has a constant-round public-coin zero-knowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak's zero-knowledge argument (FOCS 2001), and has a non-black-box simulator. This result stands in sharp contrast with the recent result by Pass, Tseng and Wikstrom (Crypto 2010) showing that only languages in BPP have public-coin parallel zero-knowledge arguments with black-box simulators.",

keywords = "Non-black-box simulation, Parallel composition, Zero-knowledge",

author = "Rafael Pass and Alon Rosen and Tseng, {Wei Lung Dustin}",

note = "Funding Information: R. Pass{\textquoteright}s work is supported in part by a Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF CAREER Award CCF-0746990, AFOSR Award FA9550-08-1-0197, BSF Grant 2006317.",

year = "2013",

month = jan,

doi = "10.1007/s00145-011-9110-5",

language = "الإنجليزيّة",

volume = "26",

pages = "1--10",

journal = "Journal of Cryptology",

issn = "0933-2790",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Public-coin parallel zero-knowledge for NP

AU - Pass, Rafael

AU - Rosen, Alon

AU - Tseng, Wei Lung Dustin

N1 - Funding Information: R. Pass’s work is supported in part by a Alfred P. Sloan Fellowship, Microsoft New Faculty Fellowship, NSF CAREER Award CCF-0746990, AFOSR Award FA9550-08-1-0197, BSF Grant 2006317.

PY - 2013/1

Y1 - 2013/1

N2 - We show that, assuming the existence of collision-resistant hash functions, every language in NP has a constant-round public-coin zero-knowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak's zero-knowledge argument (FOCS 2001), and has a non-black-box simulator. This result stands in sharp contrast with the recent result by Pass, Tseng and Wikstrom (Crypto 2010) showing that only languages in BPP have public-coin parallel zero-knowledge arguments with black-box simulators.

AB - We show that, assuming the existence of collision-resistant hash functions, every language in NP has a constant-round public-coin zero-knowledge argument that remains secure under unbounded parallel composition (a.k.a. parallel zero knowledge.) Our protocol is a variant of Barak's zero-knowledge argument (FOCS 2001), and has a non-black-box simulator. This result stands in sharp contrast with the recent result by Pass, Tseng and Wikstrom (Crypto 2010) showing that only languages in BPP have public-coin parallel zero-knowledge arguments with black-box simulators.

KW - Non-black-box simulation

KW - Parallel composition

KW - Zero-knowledge

UR - http://www.scopus.com/inward/record.url?scp=84878484187&partnerID=8YFLogxK

U2 - 10.1007/s00145-011-9110-5

DO - 10.1007/s00145-011-9110-5

M3 - مقالة

SN - 0933-2790

VL - 26

SP - 1

EP - 10

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 1

ER -

Public-coin parallel zero-knowledge for NP

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this