On monotone formula closure of SZK

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 454-465

  de Santis, Alfredo ^a   Di Crescenzo, Giovanni ^b   Persiano, Giuseppe ^c   Yung, Moti ^d  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CATANIA   (Italy)

^d IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FORMULAE; CLOSURE PROPERTY; INTERACTIVE MODELS; LOGICAL FORMULAS; MONOTONE FORMULAS; NEW PROTOCOL; PROOF SYSTEM; SELF-REDUCIBLE LANGUAGES; STATISTICAL ZERO KNOWLEDGE; ZERO-KNOWLEDGE PROOFS;

BOOLEAN FUNCTIONS;

EID: 84958950087     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365745     Document Type: Conference Paper

References (44)

1. M. Abadi, J. Feigenbaum, and J. Kilian on Hiding Information from an Oracle, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 195-203.
2. W. Aiello and J. Hastad. Statistical Zero Knowledge Can Be Recognized in Two Rounds J. Com-put. System Sci. 42, 1991, pp. 327-345.
3. L. Babai and S. Moran, Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, Journal of Computer and System Sciences, vol. 36, 1988, pp. 254-276.
4. M. Bellare and O. Goldreich, on Defining Proofs of Knowledge, in Proc. of CRYPTO '92.
5. M. Bellare, S. Micali, and R. Ostrovsky, Perfect Zero Knowledge in Constant Rounds, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 482-493.
6. M. Bellare, S. Micali, and R. Ostrovsky. The (True) Complexity of Statistical Zero Knowledge, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 494-502.
7. M. Bellare and E. Petrank. Making Zero-Knowledge Provers Efficient. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 711-722.
8. M. Bellare and P. Rogaway, Perfct Non-Interactive Zero-Knowledge, Unpublished Manuscript, 1990.
9. M. Bellare and M. Yung, Certifying Cryptographic Tools: The Case of Trapdoor Permutations, in Proc. of CRYPTO 92.
10. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in Proc. of CRYPTO 88.
11. M. Blum, Program Result Checking: A New Approach to Making Programs More Reliable, Proceedings of 20th ICALP, 1993, pp. 1-14.
12. M. Blum, A. De Santis, S. Micali, and G. Persiano, Nonlnteractive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec. 1991, pp. 1084-1118.
13. M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 103-112.
14. M. Blum and S. Kannan, Designing Programs that Check their Work, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 86-97.
15. J. Boyar, K. Friedl, and C. Lund, Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies, J. of Cryptology, n. 4, pp. 185-206, 1991.
16. R. Boppana, J. Hastad, and S. Zachos, Does co-NP have Short Interactive Proofs ?, Inf. Proc. Lett., vol. 25, May 1987, pp. 127-132.
17. G. Brassard, D. Chaum, and C. Crepeau, Minimum Disclosure Proofs of Knowledge, Journal of Computer and System Sciences, vol. 37, no. 2, 1988, pp. 156-189.
18. G. Brassard, C. Crepeau, and M. Yung, Perfect Zero-Knowledge Computationally Convincing Proofs for NP in Constant Rounds, Theoretical Computer Science, vol. 84, n. 1 (1991) pp. 23-52.
19. R. Cramer, I. Damgird, and B. Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, in Proc. of CRYPTO 94.
20. A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, in Proc. of CRYPTO 93.
21. A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in Proc. of CRYPTO 87.
22. A. De Santis, G. Persiano, and M. Yung, Formulae over Random Self-Reducible Languages: The Extended Power of Perfect Zero Knowledge, manuscript, 92.
23. U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, J. of Cryptology, vol. 1, 1988, pp. 77-94.
24. U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 308-317.
25. M. Fischer, S. Micali, and C. Rackoff, A Secure Protocol for the Oblivious Transfer, A talk given in Eurocrypt 1984.
26. L. Fortnow, The Complexity of Perfect Zero Knowledge, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, pp. 204-209.
27. Z. Galil, S. Haber, and M. Yung, Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM Journal on Computing, 1989. (originally: FOCS 85)
28. O. Goldreich and H. Krawczyk, on the Composition of Zero-Knowledge Proof Systems, Proceedings of 17th ICALP, 1986, pp. 174-187.
29. O. Goldreich and E. Kushilevitz, A Perfect Zero Knowledge Proof for a Decision Problem Equivalent to Discrete Logarithm, in Proc. of CRYPTO 88.
30. O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems Journal of the ACM, vol. 38, n. 1, 1991, pp. 691-729.
31. O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, J. of Cryptology, v. 7, n. 1 pp. 1-32, 1994.
32. O. Goldreich, R. Ostrovsky, and E. Petrank, Computational Complexity and Knowledge Complexity, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994.
33. O. Goldreich and E. Petrank, Quantifying Knowledge Complexity, in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991.
34. S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.
35. R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in Proc. of CRYPTO 87.
36. M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Schemes Realizing General Access Structures, in Proc. of IEEE Globcom 87.
37. C. Lund, L. Fortnow, H. Karloff and N. Nisan, Algebraic Methods for Interactive Proof Systems in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 2-10.
38. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, Perfectly-Secure Zero-Knowledge Arguments Can be Based on General Complexity Assumptions, in Proc. of CRYPTO 92.
39. R. Ostrovsky, R. Venkatesan, and M. Yung, Interactive Hashing Simplifies Zero-Knowledge Protocol Design, in Proc. of EUROCRYPT '93.
40. E. Petrank, personal communication, Sept. 93.
41. A. Shamir, How to Share a Secret, Communication of the ACM, vol. 22, n. 11, November 1979, pp. 612-613.
42. A. Shamir, IP=PSPACE, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 11-15. (also JACM).
43. M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knowledge Interactive Proofs of Possession of Information, in Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 472-482.
44. L. Valiant, Short Monotone Formulae for the Majority Function, Journal of Algorithms, vol. 5, 1984, pp. 363-366.