Our reduction relies on a new non-black-box simulation technique which does not use the PCP theorem. In addition to assuming diO, our reduction also assumes (standard and polynomial time) cryptographic assumptions such as collision-resistant hash functions.
The round complexity of our protocol also sheds new light on the *exact* round complexity of concurrent zero-knowledge. It shows, for the first time, that in the realm of non-black-box simulation, concurrent zero-knowledge may not necessarily require more rounds than *stand alone* zero-knowledge!
Category / Keywords: foundations / Obfuscation, Concurrent Zero Knowledge, Non-black-box Simulation Date: received 14 Nov 2013 Contact author: omkant at uiuc edu Available format(s): PDF | BibTeX Citation Version: 20131117:022017 (All versions of this report) Discussion forum: Show discussion | Start new discussion