Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography

  • Vipul Goyal
  • Yuval Ishai
  • Mohammad Mahmoody
  • Amit Sahai
Conference paper

DOI: 10.1007/978-3-642-14623-7_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Goyal V., Ishai Y., Mahmoody M., Sahai A. (2010) Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs for NP. We show that such protocols exist in the interactive PCP model of Kalai and Raz (ICALP ’08), where one of the provers is replaced by a PCP oracle. This strengthens the feasibility result of Ben-Or, Goldwasser, Kilian, and Wigderson (STOC ’88) which requires two stateful provers. In contrast to previous zero-knowledge PCPs of Kilian, Petrank, and Tardos (STOC ’97), in our protocol both the prover and the PCP oracle are efficient given an NP witness.

Our main technical tool is a new primitive that we call interactive locking, an efficient realization of an unconditionally secure commitment scheme in the interactive PCP model. We implement interactive locking by adapting previous constructions of interactive hashing protocols to our setting, and also provide a direct construction which uses a minimal amount of interaction and improves over our interactive hashing based constructions.

Finally, we apply the above results towards showing the feasibility of basing unconditional cryptography on stateless tamper-proof hardware tokens, and obtain the following results. (1) We show that if tokens can be used to encapsulate other tokens, then there exist unconditional and statistically secure (in fact, UC secure) protocols for general secure computation. (2) Even if token encapsulation is not possible, there are unconditional and statistically secure commitment protocols and zero-knowledge proofs for NP. (3) Finally, if token encapsulation is not possible, then no protocol can realize statistically secure oblivious transfer.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Vipul Goyal
    • 1
  • Yuval Ishai
    • 2
  • Mohammad Mahmoody
    • 3
  • Amit Sahai
    • 4
  1. 1.Microsoft ResearchIndia
  2. 2.Technion and UCLA 
  3. 3.Princeton University 
  4. 4.UCLA 

Personalised recommendations