Magic functions

Journal of the ACM

Volumn 50, Issue 6, 2003, Pages 852-921

  Dwork, Cynthia ^a   Naor, Moni ^b   Reingold, Omer ^b   Stockmeyer, Larry ^c  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Digital signature; Fiat Shamir methodology; Interactive argument; Interactive proof system; Magic function; Selective decommitment; Zero knowledge

Indexed keywords

FIAT-SHAMIR METHODOLGY; INTERACTIVE ARGUEMENTS; MAGIC FUNCTIONS; SELECTIVE DECOMMITMENT; ZERO KNOWLEDGE;

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ELECTRONIC COMMERCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTIONS; INFORMATION THEORY; INTERACTIVE COMPUTER SYSTEMS; SECURITY OF DATA; THEOREM PROVING;

PROBLEM SOLVING;

EID: 4243148483     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/950620.950623     Document Type: Article

References (36)

1. ABDALLA, M., AN, J. H., BELLARE, M., AND NAMPREMPRE, C. 2002. From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security. In Proceedings of Advances in Cryptology - EUROCRYPT 2002. Lecture Notes in Computer Science, vol. 2332. Springer-Verlag, Berlin, Germany, 418-433.
2. BALCAZAR, J. L., DIAZ, J., AND GABARRO, J. 1988. Structural Complexity I. Springer-Verlag, Berlin, Germany.
3. BARAK, B. 2001. How to go beyond the black-box simulation barrier. In Proceedings of the 42th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 106-115.
4. BARAK, B., GOLDREICH, O., IMPAGLIAZZO, R., RUDICH, S., SAHAI, A., VADHAN, S. P., AND YANG, K. 2001. On the (im)possibility of obfuscating programs. In Proceedings of Advances in Cryptology - CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139. Springer-Verlag, Berlin, Germany, 1-18.
5. BELLARE, M., GOLDREICH, O., AND IMPAGLIAZZO, R. 1998. The correlation intractability of ideal families. Unpublished manuscript.
6. BELLARE, M., IMPAGLIAZZO, R., AND NAOR, M. 1997. Does parallel repetition reduce the error in computationally sound protocols? In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 374-383.
7. CANETTI, R., DWORK, C., NAOR, M., AND OSTROVSKY, R. 1997. Deniable encryption. In Proceedings of Advances in Cryptology - CRYPTO '97. Lecture Notes in Computer Science, vol. 1294. Springer-Verlag, Berlin, Germany, 90-104.
8. CANETTI, R., FEIGE, U., GOLDREICH, O., AND NAOR, M. 1996. Adaptively secure multiparty computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM, New York, 639-648.
9. CANETTI, R., AND GENNARO, R. 1996. Incoercible multiparty computation (extended abstract). In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 504-513.
10. CANETTI, R., GOLDREICH, O., AND HALEVI, S. 1998. The random oracle methodology, revisited. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York.
11. CARTER, L., AND WEGMAN, M. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 143-154.
12. CRAMER, R., AND SHOUP, V. 1998. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Proceedings of Advances in Cryptology - CRYPTO '98. Lecture Notes in Computer Science, vol. 1462. Springer-Verlag, Berlin, 13-25.
13. DOLEV, D., DWORK, C., AND NAOR, M. 2000. Non-malleable cryptography. SIAM J. Comput. 30, 391-437.
14. DWORK, C., NAOR, M., AND SAHAI, A. 1998. Concurrent zero-knowledge. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, 409-418.
15. FEIGE, U., FIAT, A., AND SHAMIR, A. 1988. Zero knowledge proofs of identity. J. Crypt. 1, 2, 77-94.
16. FEIGE, U., AND SHAMIR, A. 1990. Witness indistinguishability and witness hiding protocols. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM, New York, 416-426.
17. FIAT, A., AND SHAMIR, A. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings of Advances in Cryptology - CRYPTO '86. Lecture Notes in Computer Science, vol. 263. Springer-Verlag, Berlin, Germany, 186-194.
18. GOLDREICH, O. 1989. A uniform-complexity treatment of encryption and zero-knowledge. Tech. Rep. CS-TR 570, Technion. June. Revised August 1998.
19. GOLDREICH, O., AND KRAWCZYK, H. 1996. On the composition of zero knowledge proof systems. SIAM J. Comput. 25, 1, 169-192.
20. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1991. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38, 3, 691-729.
21. GOLDREICH, O., AND OREN, Y. 1994. Definitions and properties of zero-knowledge proof systems. J. Crypt. 7, 1, 1-32.
22. GOLDWASSER, S., AND MICALI, S. 1984. Probabilistic encryption. J. Comput. Syst. Sci. 28, 2, 270-299.
23. GOLDWASSER, S., MICALI, S., AND RACKOEF, C. 1989. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18, 1, 186-208.
24. GOLDWASSER, S., MICALI, S., AND RIVEST, R. L. 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17, 2, 281-308.
25. GOLDWASSER, S., AND TAUMAN, Y. 2003. On the (in)security of the Fiat-Shamir paradigm. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. Cryptology ePrint Archive, Report 2003/034.
26. HADA, S., AND TANAKA, T. 1999. A relationship between one-wayness and correlation intractability. Cryptology ePrint Archive, Report 1999/010, http://eprint.iacr.org.
27. HÅSTAD, J., IMPAGLIAZZO, R., LEVIN, L., AND LUBY, M. 1999. A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 4, 1364-1396.
28. IMPAGLIAZZO, R. 1995. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 538-545.
29. IMPAGLIAZZO, R., LEVIN, L., AND LUBY, M. 1989. Pseudo-random generation from one-way functions (extended abstract). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. ACM, New York, 12-24.
30. MICALI, S., RACKOFF, C., AND SLOAN, R. 1988. The notion of security for probabilistic cryptosystems. SIAM J. Comput. 17, 2, 412-426.
31. NAOR, M. 1991. Bit commitment using pseudorandomness. J. Crypt. 4, 151-158.
32. NAOR, M., OSTROVSKY, R., VENKATESAN, R., AND YUNG, M. 1998. Perfect zero-knowledge arguments for NP using any one-way permutation. J. Crypt. 11, 87-108.
33. NAOR, M., AND WOOL, A. 1998. Access control and signatures via quorum secret sharing. IEEE Trans. Parall. Distrib. Syst. 9, 909-922.
34. OREN, Y. 1987. On the cunning power of cheating verifiers: some observations about zero knowledge proofs. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 462-471.
35. PEDERSON, T. P. 1991. Distributed provers with application to undeniable signatures. In Proceedings of Advances in Cryptology - EUROCRYPT '91. Lecture Notes in Computer Science, vol. 547. Springer-Verlag, Berlin, Germany, 221-238.
36. POINTCHEVAL, D., AND STERN, J. 1996. Security proofs for signature schemes. In Proceedings of Advances in Cryptology - EUROCRYPT '96. Lecture Notes in Computer Science, vol. 1070. Springer-Verlag, Berlin, Germany, 387-398.