{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:16Z","timestamp":1725496636034},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"},{"type":"electronic","value":"9783540384243"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-38424-3_27","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T08:05:56Z","timestamp":1196669156000},"page":"366-377","source":"Crossref","is-referenced-by-count":14,"title":["Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L. Babai","year":"1988","unstructured":"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\u2013276.","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR2","unstructured":"M. Bellare and S. Goldwasser, New Paradigms for Digital Signatures and Message Authentication based on Non-interactive Zero-knowledge Proofs, Crypto 1989."},{"key":"27_CR3","unstructured":"M. Bellare and S. Micali, Non-interactive Oblivious Transfer and Applications, Crypto 1989."},{"key":"27_CR4","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, preprint."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, 1988.","DOI":"10.1145\/62212.62222"},{"key":"27_CR6","unstructured":"M. Blum, How to Prove a Theorem So No One Else Can Claim It, Proceedings of the International Congress of Mathematicians, Berkeley, California, 1986, pp. 1444\u20131451."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"S. A. Cook, The Complexity of Theorem-Proving Procedures, Proc. 3rd Ann. ACM Symp. on Theory of Computing, New York, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"27_CR8","unstructured":"Y. Desmeth, Abuse-free Cryptosystems: Particularly Subliminal-Free Authentication and Signature, preprint."},{"issue":"6","key":"27_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman, New Directions in Cryptography, IEEE Transactions on Information Theory, vol. IT-22, no. 6, Nov. 1976, pp. 644\u2013654.","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR10","unstructured":"A. De Santis and G. Petsiano, Public-Randomness in Public-key Cryptosystems, Eurocrypt-90."},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"A. Santis De","year":"1987","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof-Systems with Preprocessing, Crypto 1988.","DOI":"10.1007\/3-540-48184-2_5"},{"key":"27_CR13","unstructured":"A. De Santis and M. Yung, Non-Interactive Metaproofs and Non-Interactive Protocols, Manuscript."},{"key":"27_CR14","unstructured":"S. Even, O. Goldreich, and S. Micali, On-line\/Off-line Digital Signatures, Crypto 1989."},{"key":"27_CR15","unstructured":"U. Feige, D. Lapidot and A. Shamir, Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String, Focs 90."},{"key":"27_CR16","unstructured":"U. Feige, and A. Shamir, Witness-Hiding Protocols, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990, announcement in Crypto-89."},{"key":"27_CR17","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979."},{"key":"27_CR18","unstructured":"O. Goldreich, A Uniform-Complexity Treatment of Encryption and Zero-Knowledge, Technical Report no. 568, Technion, June 1989."},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, How to Construct Random Functions, Journal of the Association for Computing Machinery, vol. 33, no. 4, 1986, pp. 792\u2013807.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Science, vol. 28, n. 2, 1984, pp. 270\u2013299.","journal-title":"Journal of Computer and System Science"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"Shafi Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.","journal-title":"SIAM Journal on Computing"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attack, SIAM Journal of Computing, vol. 17, n. 2, April 1988, pp. 281\u2013308.","journal-title":"SIAM Journal of Computing"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design, Proceedings of 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Pseudorandom Generation under Uniform Assumptions, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990.","DOI":"10.1145\/100216.100270"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, and M. Luby, Pseudo-Random Generation from One-way Functions, Proceedings of 21st STOC, May 1989.","DOI":"10.1145\/73007.73009"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably Secure as Subset Sum, Proceedings of 30th FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"27_CR28","series-title":"Lect Notes Comput Sci","first-page":"40","volume-title":"Advances in Cryptology \u2014 CRYPTO 87","author":"R. Impagliazzo","year":"1987","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in \u201cAdvances in Cryptology \u2014 CRYPTO 87\u201d, vol. 293 of \u201cLecture Notes in Computer Science\u201d, Springer Verlag pp. 40\u201351."},{"key":"27_CR29","unstructured":"D. Lapidot and A. Shamir, These Proceedings."},{"key":"27_CR30","unstructured":"M. Naor, Bit Commitment using Pseudo-randomness, Crypto 1989."},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Public-key Cryptosystems Probably Secure Against Chosen Ciphertext Attacks, Proceedings of the 22th Annual ACM Symposium on Theory of Computing, 1990.","DOI":"10.1145\/100216.100273"},{"key":"27_CR32","unstructured":"J. Rompel, One-way functions are Necessary and Sufficient for Secure Signatures, STOC 90."},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"A. Yao, Theory and Applications of Trapdoor Functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T09:20:39Z","timestamp":1557048039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545088","9783540384243"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1991]]}}}