Paper 2015/067 Original: eprint.iacr.org/2015/067 ↗
Non-black-box Simulation in the Fully Concurrent Setting, Revisited
Abstract
We give a new proof of the existence of $O(n^{\epsilon})$-round public-coin concurrent zero-knowledge arguments for NP, where $\epsilon>0$ is an arbitrary constant. The security is proven in the plain model under the assumption that collision-resistant hash functions exist. (The existence of such concurrent zero-knowledge arguments was previously proven by Goyal (STOC'13) in the plain model under the same assumption.) 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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2019-03-14: last updated
- 2015-01-29: published
- Short URL
- https://ia.cr/2015/067
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/067,
author = {Susumu Kiyoshima},
title = {Non-black-box Simulation in the Fully Concurrent Setting, Revisited},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/067},
year = {2015},
url = {https://eprint.iacr.org/2015/067}
}