Vipul Goyal
ABSTRACT
Motivated by theoretical and practical interest, the challenging task of designing cryptographic 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 nonblack-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 blackbox 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 nonblack-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.
Supplemental Material
- G. Asharov and Y. Lindell. A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation. (ECCC), 2011.Google Scholar
- S. Arora and S. Safra. Probabilistic Checking of Proofs; A New Characterization of NP. In FOCS, 1992. Google ScholarDigital Library
- B. Barak. How to go beyond the black-box simulation barrier. In FOCS, 2001. Google ScholarDigital Library
- B. Barak and O. Goldreich. Universal arguments and their applications. In SIAM J. Comput., 2008. Google ScholarDigital Library
- M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In CCS, 1993. Google ScholarDigital Library
- M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In STOC, 1988. Google ScholarDigital Library
- E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. P. Vadhan. Robust pcps of proximity, shorter pcps, and applications to coding. SIAM J. Comput., 2006. Google ScholarDigital Library
- N. Bitansky and O. Paneth. On the impossibility of approximate obfuscation and applications to resettable cryptography. In STOC, 2013. Google ScholarDigital Library
- S. G. Choi, D. Dachman-Soled, T. Malkin, and H. Wee. Simple, black-box constructions of adaptively secure protocols. In TCC, 2009. Google ScholarDigital Library
- K. Chung, R. Ostrovsky, R. Pass, and I. Visconti. Simultaneous Resettability from One-Way Functions. In FOCS, 2013 Google ScholarDigital Library
- K. Chung, R. Ostrovsky, R. Pass, M. Venkitasubramaniam, and I. Visconti. 4-Round Resettably-Sound Zero Knowledge. In TCC, 2014.Google ScholarCross Ref
- B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In FOCS, 1985. Google ScholarDigital Library
- K.-M. Chung, R. Pass, and K. Seth. Non-black-box simulation from one-way functions and applications to resettable security. In STOC, 2013. Google ScholarDigital Library
- I. Damgaard. Towards practical public key systems secure against chosen ciphertext attacks. In CRYPTO, 1991. Google ScholarDigital Library
- A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, 1986. Google ScholarDigital Library
- R. Gennaro, Y. Ishai, E. Kushilevitz, and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In STOC, 2001. Google ScholarDigital Library
- V. Goyal. Constant round non-malleable protocols using one way functions. In STOC, 2011. Google ScholarDigital Library
- V. Goyal, C.-K. Lee, R. Ostrovsky, and I. Visconti. Constructing non-malleable commitments: A black-box approach. In FOCS, 2012. Google ScholarDigital Library
- I. Haitner. Semi-honest to malicious oblivious transfer - the black-box way. In TCC 2008, 2008. Google ScholarDigital Library
- D. Hofheinz. Possibility and impossibility results for selective decommitments. J. Cryptology, 2011. Google ScholarDigital Library
- S. Kiyoshima, Y. Manabe and Tatsuaki Okamoto Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. In TCC, 2014.Google Scholar
- R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In STOC, 1989. Google ScholarDigital Library
- Y. Ishai, E. Kushilevitz, Y. Lindell, and E. Petrank. Black-box constructions for secure computation. In STOC, 2006. Google ScholarDigital Library
- Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Zero-knowledge from secure multiparty computation. In STOC, 2007. Google ScholarDigital Library
- Y. Ishai and M. Weiss. Probabilistically checkable proofs of proximity with zero-knowledge. In TCC, 2014.Google ScholarCross Ref
- J. Kilian. Founding cryptography on oblivious transfer. In STOC, 1988. Google ScholarDigital Library
- J. Kilian. A note on efficient zero-knowledge proofs and arguments. In STOC, 1992. Google ScholarDigital Library
- H. Lin and R. Pass. Black-box constructions of composable protocols without set-up. In STOC, 2012.Google ScholarDigital Library
- S. Micali. Cs proofs (extended abstracts). In FOCS, 1994. Google ScholarDigital Library
- M. Naor. Bit commitment using pseudorandomness. J. Cryptology, 1991.Google Scholar
- M. Naor. On cryptographic assumptions and challenges. In CRYPTO, 2003.Google ScholarCross Ref
- M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In STOC, 1989. Google ScholarDigital Library
- R. Ostrovsky, V. Rao, A. Scafuro, and I. Visconti. Revisiting lower and upper bounds for selective decommitments. In TCC, 2013. Google ScholarDigital Library
- R. Pass and A. Rosen. Concurrent nonmalleable commitments. SIAM J. Comput., 2008. Google ScholarDigital Library
- R. Pass and H. Wee. Black-box constructions of two-party protocols from one-way functions. In TCC, 2009. Google ScholarDigital Library
- J. Rompel. One-way functions are necessary and sufficient for secure signatures. In STOC, 1990. Google ScholarDigital Library
- H. Wee. Black-box, round-efficient secure computation via non-malleability amplification. In FOCS, 2010. Google ScholarDigital Library
- D. Xiao. (Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks. In TCC, 2011. Google ScholarDigital Library
Index Terms
- Black-box non-black-box zero knowledge
Recommendations
Two-Round MPC: Information-Theoretic and Black-Box
Theory of CryptographyAbstractWe continue the study of protocols for secure multiparty computation (MPC) that require only two rounds of interaction. The recent works of Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin (Eurocrypt 2018) essentially settle the ...
Non-black-box simulation in the fully concurrent setting
STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of ComputingWe present a new zero-knowledge argument protocol by relying on the non-black-box simulation technique of Barak (FOCS'01). Similar to the protocol of Barak, ours is public-coin, is based on the existence of collision-resistant hash functions, and, is ...
Lower bounds for non-black-box zero knowledge
Special issue on FOCS 2003We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity assumptions:1.There does not exist a two-round zero-knowledge proof ...
Comments