eprint.iacr.org will be offline for approximately an hour for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between April 12 and April 14, and some authors have been notified that they need to resubmit their papers.

Paper 2014/390

Black-Box Non-Black-Box Zero Knowledge

Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, and Ivan Visconti

Abstract

Motivated by theoretical and practical interest, the challenging task of designing crypto- graphic protocols having only black-box access to primitives has generated various breakthroughs in the last decade. Despite such positive results, even though nowadays we know black-box constructions for secure two-party and multi-party computation even in constant rounds, there still are in Cryptography several constructions that critically require non-black-box use of primitives in order to securely realize some fundamental tasks. As such, the study of the gap between black-box and non-black-box constructions still includes major open questions. In this work we make progress towards filling the above gap. We consider the case of black- box constructions for computations requiring that even the size of the input of a player remains hidden. We show how to commit to a string of arbitrary size and to prove statements over the bits of the string. Both the commitment and the proof are succinct, hide the input size and use standard primitives in a black-box way. We achieve such a result by giving a black-box construction of an extendable Merkle tree that relies on a novel use of the “MPC in the head” paradigm of Ishai et al. [STOC 2007]. We show the power of our new techniques by giving the first black-box constant-round public-coin zero knowledge argument for NP. To achieve this result we use the non-black-box simulation technique introduced by Barak [FOCS 2001], the PCP of Proximity introduced by Ben-Sasson et al. [STOC 2004], together with a black-box public-coin witness indistinguishable universal argument that we construct along the way. Additionally we show the first black-box construction of a generalization of zero-knowledge sets introduced by Micali et al. [FOCS 2003]. The generalization that we propose is a strengthening that requires both the size of the set and the size of the elements of the set to remain private.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Minor revision. STOC'14 ACM
DOI
10.1145/2591796.2591879
Keywords
Black-box ConstructionsNon-black-box SimulationInput-size hiding
Contact author(s)
alescafu @ gmail com
History
2014-05-30: received
Short URL
https://ia.cr/2014/390
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/390,
      author = {Vipul Goyal and Rafail Ostrovsky and Alessandra Scafuro and Ivan Visconti},
      title = {Black-Box Non-Black-Box Zero Knowledge},
      howpublished = {Cryptology ePrint Archive, Paper 2014/390},
      year = {2014},
      doi = {10.1145/2591796.2591879},
      note = {\url{https://eprint.iacr.org/2014/390}},
      url = {https://eprint.iacr.org/2014/390}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.