You are looking at a specific version 20151218:021158 of this paper. See the latest version.

Paper 2015/067

An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting

Susumu Kiyoshima

Abstract

We give a new proof of the existence of public-coin concurrent zero-knowledge arguments for NP in the plain model under the existence of collision-resistant hash function families, which was originally proven by Goyal (STOC'13). In the proof, we use a new variant of the non-black-box simulation technique of Barak (FOCS'01). An important property of our simulation technique is that the simulator runs in a straight-line manner in the fully concurrent setting. Compared with the simulation technique of Goyal, which also has such a property, the analysis of our simulation technique is (arguably) simpler.

Note: Proofs are modified so that the existence of one-to-one one-way functions can be removed from the assumptions.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A major revision of an IACR publication in TCC 2015
Keywords
concurrent zero-knowledgenon-black-box simulation
Contact author(s)
kiyoshima susumu @ lab ntt co jp
History
2019-03-14: last of 2 revisions
2015-01-29: received
See all versions
Short URL
https://ia.cr/2015/067
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.