Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2013, Pages 955-966

  Jawurek, Marek ^a   Kerschbaum, Florian ^a   Orlandi, Claudio ^b  

^a SAP RESEARCH   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

efficiency; garbled circuits; zero knowledge proof

Indexed keywords

CRYPTOGRAPHIC APPLICATIONS; EFFICIENT PROTOCOLS; FUNDAMENTAL CONCEPTS; GARBLED CIRCUITS; SECURE TWO-PARTY COMPUTATIONS; SECURITY PARAMETERS; ZERO KNOWLEDGE PROOF; ZERO-KNOWLEDGE PROTOCOLS;

COMPUTATION THEORY; CRYPTOGRAPHY; EFFICIENCY;

SECURITY OF DATA;

EID: 84888985541     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2508859.2516662     Document Type: Conference Paper

References (52)

1. William Aiello, Yuval Ishai, and Omer Reingold. Priced oblivious transfer: How to sell digital goods. In Birgit Pfitzmann, editor, EUROCRYPT, volume 2045 of Lecture Notes in Computer Science, pages 119-135. Springer, 2001.
2. Rikke Bendlin and Ivan Damgård. Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems. In TCC, pages 201-218, 2010.
3. Stephanie Bayer and Jens Groth. Efficient zero-knowledge argument for correctness of a shuffe. In EUROCRYPT, pages 263-280, 2012.
4. Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, and Phillip Rogaway. Efficient garbling from a fixed-key blockcipher. In IEEE Symposium on Security and Privacy, pages 478-492, 2013.
5. Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. Adaptively secure garbling with applications to one-time programs and secure outsourcing. In ASIACRYPT, pages 134-153, 2012.
6. Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. Foundations of garbled circuits. In ACM Conference on Computer and Communications Security, pages 784-796, 2012.
7. Nir Bitansky and Omer Paneth. Point obfuscation and 3-round zero-knowledge. In TCC, pages 190-208, 2012.
8. Ran Canetti. Security and composition of multiparty cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
9. Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. FOCS, 2001. Updated version at http://eprint.iacr.org/ 2000/067.
10. Ronald Cramer, Ivan Damgård, and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO, pages 174-187, 1994.
11. Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, and Hong-Sheng Zhou. On the security of the "free-XOR" technique. In TCC, pages 39-53, 2012.
12. Jan Camenisch, Stephan Krenn, and Victor Shoup. A framework for practical universally composable zero-knowledge protocols. In ASIACRYPT, pages 449-467, 2011.
13. Jan Camenisch and Markus Michels. Proving in zero-knowledge that a number is the product of two safe primes. In EUROCRYPT, pages 107-122, 1999.
14. Claude Crépeau. Verifiable disclosure of secrets and applications (abstract). In EUROCRYPT, pages 150-154, 1989.
15. Claude Crépeau, Jeroen van de Graaf, and Alain Tapp. Committed oblivious transfer and private multi-party computation. In CRYPTO, pages 110-123, 1995.
16. Ivan Damgård, Jesper Buus Nielsen, and Claudio Orlandi. Essentially optimal universally composable oblivious transfer. In ICISC, pages 318-335, 2008.
17. Yael Ejgenberg, Moriya Farbstein, Meital Levy, and Yehuda Lindell. Scapi: The secure computation application programming interface. Cryptology ePrint Archive, Report 2012/629, 2012. http://crypto.biu.ac.il/scapi.
18. David Evans, William Melicher, and Samee Zahur. Interpreter for Garbled Circuits Intermediate Language, 2012. http://mightbeevil.org/gcparser/.
19. Tore Kasper Frederiksen, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Peter Sebastian Nordholt, and Claudio Orlandi. Minilego: Efficient secure two-party computation from general assumptions. In EUROCRYPT, 2013.
20. Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO, pages 186-194, 1986.
21. Rosario Gennaro, Craig Gentry, and Bryan Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In CRYPTO, pages 465-482, 2010.
22. Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. Quadratic span programs and succinct nizks without pcps. In EUROCRYPT, pages 626-645, 2013.
23. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting data privacy in private information retrieval schemes. In Jeffrey Scott Vitter, editor, STOC, pages 151-160. ACM, 1998.
24. Oded Goldreich and Hugo Krawczyk. On the composition of zero-knowledge proof systems. SIAM J. Comput., 25(1):169-192, 1996.
25. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems (extended abstract). In Robert Sedgewick, editor, STOC, pages 291-304. ACM, 1985.
26. Oded Goldreich. Foundations of Cryptography Volume 2, Basic Applications. Cambridge University Press, 2004.
27. Jens Groth, Rafail Ostrovsky, and Amit Sahai. Non-interactive zaps and new techniques for nizk. In CRYPTO, pages 97-111, 2006.
28. Jens Groth, Rafail Ostrovsky, and Amit Sahai. Perfect non-interactive zero knowledge for np. In EUROCRYPT, pages 339-358, 2006.
29. Jens Groth. Short pairing-based non-interactive zero-knowledge arguments. In ASIACRYPT, pages 321-340, 2010.
30. Jens Groth and Amit Sahai. Efficient noninteractive proof systems for bilinear groups. SIAM J. Comput., 41(5):1193-1232, 2012.
31. Essam Ghadafi, Nigel P. Smart, and Bogdan Warinschi. Groth-sahai proofs revisited. In Public Key Cryptography, pages 177-192, 2010.
32. Yan Huang, David Evans, Jonathan Katz, and Lior Malka. Faster secure two-party computation using garbled circuits. In USENIX Security Symposium, 2011.
33. Yan Huang, Jonathan Katz, and Dave Evans. Efficient secure two-party computation using symmetric cut-and-choose. In CRYPTO, 2013.
34. Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. Zero-knowledge from secure multiparty computation. In David S. Johnson and Uriel Feige, editors, STOC, pages 21-30. ACM, 2007.
35. Marek Jawurek, Florian Kerschbaum, and Claudio Orlandi. Zero-knowledge using garbled circuits: How to prove non-algebraic statements efficiently. Cryptology ePrint Archive, Report 2013/073, 2013. http://eprint.iacr.org/.
36. Abhishek Jain, Stephan Krenn, Krzysztof Pietrzak, and Aris Tentes. Commitments and efficient zero-knowledge proofs from learning parity with noise. In ASIACRYPT, pages 663-680, 2012.
37. Shahram Khazaei, Tal Moran, and Douglas Wikström. A mix-net from any cca2 secure cryptosystem. In ASIACRYPT, pages 607-625, 2012.
38. Mehmet S. Kiraz and Berry Schoenmakers. A protocol issue for the malicious case of yao's garbled circuit construction. In In Proceedings of 27th Symposium on Information Theory in the Benelux, pages 283-290, 2006.
39. Vladimir Kolesnikov and Thomas Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP (2), pages 486-498, 2008.
40. Benjamin Kreuter, Abhi Shelat, and Chih-Hao Shen. Towards billion-gate secure computation with malicious adversaries. IACR Cryptology ePrint Archive, 2012:179, 2012.
41. Yehuda Lindell. Highly-efficient universally-composable commitments based on the ddh assumption. In EUROCRYPT, pages 446-466, 2011.
42. Yehuda Lindell. Fast cut-and-choose based protocols for malicious and covert adversaries. In CRYPTO, 2013.
43. Helger Lipmaa. Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In TCC, pages 169-189, 2012.
44. Daniele Micciancio and Salil P. Vadhan. Statistical zero-knowledge proofs with efficient provers: Lattice problems and more. In CRYPTO, pages 282-298, 2003.
45. Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. A new approach to practical active-secure two-party computation. In CRYPTO, pages 681-700, 2012.
46. Moni Naor, Benny Pinkas, and Reuban Sumner. Privacy preserving auctions and mechanism design. In ACM Conference on Electronic Commerce, pages 129-139, 1999.
47. Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. Pinocchio: Nearly practical verifiable computation. In IEEE Symposium on Security and Privacy, pages 238-252, 2013.
48. Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554-571, 2008.
49. Claus-Peter Schnorr. Efficient identification and signatures for smart cards. In CRYPTO, pages 239-252, 1989.
50. Abhi Shelat and Chih-Hao Shen. Two-output secure computation with malicious adversaries. In EUROCRYPT, pages 386-405, 2011.
51. Nigel Smart and Stefan Tillich. Circuits of basic functions suitable for mpc and fhe, 2012. http://www.cs.bris.ac.uk/Research/CryptographySecurity/MPC/.
52. Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS, pages 160-164. IEEE Computer Society, 1982.