### Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security

Kai-Min Chung, Rafael Pass, and Karn Seth

##### Abstract

The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) introduced a novel non-black-box simulation technique. This technique enabled the construction of new cryptographic primitives, such as resettably-sound zero-knowledge arguments, that cannot be proven secure using just black-box simulation techniques. The work of Barak and its follow-ups, however, all require stronger cryptographic hardness assumptions than the minimal assumption of one-way functions: the work of Barak requires the existence of collision-resistant hash functions, and a very recent result by Bitansky and Paneth (FOCS'12) instead requires the existence of an Oblivious Transfer protocol. In this work, we show how to perform non-black-box simulation assuming just the existence of one-way functions. In particular, we demonstrate the existence of a constant-round resettably-sound zero-knowledge argument based only on the existence of one-way functions. Using this technique, we determine necessary and sufficient assumptions for several other notions of resettable security of zero-knowledge proofs. An additional benefit of our approach is that it seemingly makes practical implementations of non-black-box zero-knowledge viable.

Note: Section 6.3 was added in the revision.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
non-black-box simulationsresettable securityone-way functionszero-knowledges
Contact author(s)
chung @ cs cornell edu
History
2013-02-05: revised
See all versions
Short URL
https://ia.cr/2013/008

CC BY

BibTeX

@misc{cryptoeprint:2013/008,
author = {Kai-Min Chung and Rafael Pass and Karn Seth},
title = {Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security},
howpublished = {Cryptology ePrint Archive, Paper 2013/008},
year = {2013},
note = {\url{https://eprint.iacr.org/2013/008}},
url = {https://eprint.iacr.org/2013/008}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.