Universal arguments and their applications

SIAM Journal on Computing

Volumn 38, Issue 5, 2008, Pages 1661-1694

  Barak, Boaz ^a   Goldreich, Oded ^b  

^a Princeton University   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Collision resistant hashing; Computationally sound proof systems; Error correcting codes; Probabilistic checkable proofs; Probabilistic proof systems; Proofs of knowledge; Tree hashing; Witness indistinguishable proof systems; Zero knowledge proof systems

Indexed keywords

COLLISION-RESISTANT HASHING; COMPUTATIONALLY SOUND PROOF SYSTEMS; PROBABILISTIC CHECKABLE PROOFS; PROBABILISTIC PROOF SYSTEMS; PROOFS OF KNOWLEDGE; TREE HASHING; WITNESS INDISTINGUISHABLE PROOF SYSTEMS; ZERO-KNOWLEDGE PROOF SYSTEMS;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; INFORMATION THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBABILITY;

PROGRAMMABLE LOGIC CONTROLLERS;

EID: 57849098189     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070709244     Document Type: Article

References (23)

1. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractability of approximation problems, J. ACM, 45 (1998), p. 501-555.
2. S. ARORA AND S. SAFRA, Probabilistic checkable proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
3. L. BABAI, Trading group theory for randomness, in Proceedings of the 17th Symposium on Theory of Computing, Providence, RI, 1985, pp. 421-429.
4. L. BABAI, L. FORTNOW, AND C. LUND, Non-deterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3-40.
5. L. BABAI, L. FORTNOW, L. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd Symposium on Theory of Computing, New Orleans, 1991, pp. 21-31.
6. B. BARAK, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, 2001, pp. 106-115. A full version appears as [7, Chapter 4].
7. B. BARAK, Non-black-box techniques in cryptography, Ph.D. thesis, Rehovdt, Israel, Weizmann Institute of Science, 2004; Also available at http://www.es.princeton.edu/~boaz /research.php.
8. B. BARAK AND O. GOLDREICH, Universal arguments and their applications, Electronic Colloqium on Computational Complexity, 2001, report TR01-093.
9. M. BELLARE AND O. GOLDREICH, On defining proofs of knowledge, in Advances in Cryptology Cryptol-92, Lecture Notes in Comput. Sci. 740, Springer-Verlag, Berlin, 1993, pp. 390-420.
10. M. BEN-OR, O. GOLDREICH, S. GOLDWASSER, J. HÅSTAD, J. KILIAN, S. MICALI, AND P. ROGAWAY, Everything provable is provable in zero-knowledge, in Cryptology-Crypto'88, Lecture Notes in Comput. Sci. 403, Springer-Verlag, Berlin, 1990, pp. 37-56.
11. M. BEN-OR, S. GOLDWASSER, J. KILIAN, AND A. WIGDERSON, Multi-prover interactive proofs: How to remove intractability, in Proceedings of the 20th Symposium on Theory of Computing, Chicago, 1988, pp. 113-131.
12. G. BRASSARD, D. CHAUM, AND C. CRÉPEAU, Minimum disclosure proofs of knowledge, J. Comput. System Sci., 37 (1988), pp. 156-189.
13. R. CANETTI, O. GOLDREICH, AND S. HALEVI, The random oracle methodology, revisited, J. ACM, 51 (2004), pp. 557-594.
14. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP-complete, J. ACM, 43 (1996), pp. 268-292.
15. L. FORTNOW, J. ROMPEL, AND M. SIPSER, On the power of multi-prover interactive protocols, Theoret. Comput. Sci., 134 (1994), pp. 545-557.
16. O. GOLDREICH, Foundation of Cryptography - Basic Tools, Cambridge University Press, Cambridge, 2001.
17. O. GOLDREICH, Foundation of Cryptography - Basic Applications, Cambridge University Press, Cambridge, 2004.
18. O. GOLDREICH, Computational Complexity: A Conceptual Perspective, Cambridge University Press, Cambridge, 2008.
19. O. GOLDREICH, S. MICALI, AND A. WIGDERSON, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J. ACM, 38 (1991), pp. 691-729.
20. S. GOLDWASSER, S. MICALI, AND C. RACKOFF, The knowledge complexity of interactive proof systems, SIAM Comput., 18 (1989), pp. 186-208.
21. J. KILIAN, A note on efficient zero-knowledge proofs and arguments, in Proceedings of the 24th Symposium on Theory of Computing, Victoria, Canada, 1992, pp. 723-732.
22. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.
23. S. MICALI, Computationally sound proofs, SIAM J. Comput., 30 (2000), pp. 1253-1298.