{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:17:34Z","timestamp":1764688654659,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"196-214","source":"Crossref","is-referenced-by-count":21,"title":["Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Blum M., A. DeSantis, S. Micali and G. Persiano, \u201cNon-Interactive Zero-Knowledge\u201d SIAM J.Comp. 91"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum M., and S. Micali \u201cHow to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits\u201d SIAM J. on Computing, Vol 13, 1984, pp. 850\u2013864, FOCS 82.","journal-title":"SIAM J. on Computing"},{"key":"14_CR3","unstructured":"Blum M., P. Feldman, and S. Micali \u201cNon-Interactive Zero-Knowledge Proof Systems and Applications\u201d STOC 88."},{"key":"14_CR4","unstructured":"Bellare, M., S. Micali and R. Ostrovsky, \u201cThe (True) Complexity of Statistical Zero Knowledge\u201d STOC 90."},{"key":"14_CR5","unstructured":"Blum, M., \u201cCoin Flipping over the Telephone,\u201d IEEE COMPCON 1982, pp. 133\u2013137."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF00204448","volume":"2","author":"J. Boyar","year":"1990","unstructured":"J. Boyar, S. Kurtz, and M. Krental A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs, Journal of Cryptology, V. 2 N. 2, 1990, pp. 63\u201376, Springer International.","journal-title":"Journal of Cryptology"},{"key":"14_CR7","unstructured":"Bellare M., and O. Goldreich, \u201cOn Defining Proof of Knowledge,\u201d CRYPTO 92 (this proceedings)."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, \u201cNon-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond\u201d, FOCS 86 pp. 188\u2013195.","DOI":"10.1109\/SFCS.1986.33"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau, Minimum Disclosure Proofs of Knowledge, JCSS, v. 37, pp 156\u2013189.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"14_CR10","unstructured":"Brassard G., C. Cr\u00e9peau, and M. Yung, \u201cEverything in NP can be proven in Perfect Zero Knowledge in a bounded number of rounds,\u201d ICALP 89. (Also in TCS)."},{"key":"14_CR11","unstructured":"Brassard G., and M. Yung, \u201cOne-Way Group Action,\u201d CRYPTO 90."},{"key":"14_CR12","unstructured":"Chaum, D., \u201cDemonstrating that a public predicate can be satisfied without revealing any information about how\u201d, Crypto 86."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"D. Chaum, I. Damg\u00e5rd and J. van de Graaf, Multiparty Computations Ensuring Secrecy of each Party\u2019s Input and Correctness of the Output, Proc. of Crypto 87, pp. 462.","DOI":"10.1007\/3-540-48184-2_7"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat and A. Shamir, Zero-Knowledge Proofs of Identity, STOC 87, pp. 210\u2013217.","DOI":"10.1145\/28395.28419"},{"key":"14_CR15","unstructured":"O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness, FOCS 90."},{"key":"14_CR16","unstructured":"O. Goldreich, H. Krawczyk, and M. Luby, On the Existence of Pseudo-Random Generators, FOCS 88."},{"key":"14_CR17","unstructured":"S. Goldreich, S. Micali and A. Wigderson, Proofs that Yields Nothing But their Validity, FOCS 86, pp. 174\u2013187. (also in JACM)."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, STOC 85, pp. 291\u2013304. (also in SIAM J. COMP.)","DOI":"10.1145\/22145.22178"},{"key":"14_CR19","unstructured":"H\u00e5stad, J., \u201cPseudo-Random Generators under Uniform Assumptions\u201d, STOC 90."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"I. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"14_CR21","unstructured":"R. Impagliazzo and M. Luby, One-way Functions are Essential for Complexity-Based Cryptography FOCS 89, pp. 230\u2013235."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset-Sum, Proc. of FOCS 89, pp. 236\u2013241.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"14_CR23","unstructured":"R. Impagliazzo and S. Rudich, On the Limitations of certain One-Way Permutations, Proc. of STOC 89, pp. 44\u201361."},{"key":"14_CR24","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Proc. of Crypto 87, Springer Verlag."},{"key":"14_CR25","volume-title":"Cryptography: a primer","author":"A. G. Konheim","year":"1981","unstructured":"A. G. Konheim, Cryptography: a primer, Wiley, New York, 1981."},{"key":"14_CR26","unstructured":"M. Naor \u201cBit Commitment Using Pseudo-Randomness\u201d Crypto-89 pp. 123\u2013132."},{"key":"14_CR27","unstructured":"M. Naor and M. Yung, Universal One-Way Hash Functions and their Cryptographic Applications, STOC 89."},{"key":"14_CR28","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Fair Games Against an All-Powerful Adversary, Sequences 91, (to appear)."},{"key":"14_CR29","series-title":"Lect Notes Comput Sci","volume-title":"Secure Commitment Against A Powerful Adversary, STACS 92","author":"R. Ostrovsky","year":"1992","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Secure Commitment Against A Powerful Adversary, STACS 92, Springer Verlag LNCS, 1992."},{"key":"14_CR30","unstructured":"R. Ostrovsky and A. Wigderson, One-Way Functions are Essential For Non-Trivial Zero-Knowledge Proofs, (preliminary manuscript)."},{"key":"14_CR31","unstructured":"J. Rompel \u201cOne-way Functions are Necessary and Sufficient for Secure Signatures\u201d STOC 90."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"M. Tompa and H. Woll, Random Self-Reducibility and Zero-Knoweldge Interactive-Proofs of Possession of Information, Proc. of FOCS 1987.","DOI":"10.1109\/SFCS.1987.49"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:20:31Z","timestamp":1737346831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_14","relation":{},"subject":[]}}