{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:58:56Z","timestamp":1787504336537,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631651","type":"print"},{"value":"9783540691945","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_225","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:12:04Z","timestamp":1330279924000},"page":"716-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Randomness-efficient non-interactive zero knowledge"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Di Crescenzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"67_CR1","unstructured":"M. Ajtai and A. Wigderson, Deterministic Simulation of Probabilistic Constant Depth Circuits, in Proceedings of STOC 85."},{"key":"67_CR2","unstructured":"M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in Interactive Proof Systems, in Proceedings of FOCS 90."},{"key":"67_CR3","unstructured":"M. Bellare and J. Rompel, Randomness in Interactive Proof Systems, in Proceedings of FOCS 94."},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and M. Yung, Certifying Cryptographic Tools: the case of Trapdoor Permutations, in Journal of Cryptology, vol. 9, n. 1, pp. 149\u2013166.","DOI":"10.1007\/s001459900009"},{"issue":"no.6","key":"67_CR5","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge, SIAM Journal of Computing, vol. 20, no. 6, Dec 1991, pp. 1084\u20131118.","journal-title":"SIAM Journal of Computing"},{"key":"67_CR6","unstructured":"M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge and Applications, in Proceedings of STOC 88."},{"key":"67_CR7","unstructured":"C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro, On the number of random bits in totally private computations, in Proceedings of ICALP 95."},{"key":"67_CR8","unstructured":"J. Boyar and R. Peralta, Short Discreet Proofs, in Proc. of EUROCRYPT 96."},{"key":"67_CR9","unstructured":"I. Damgaard, Non-interactive circuit-based proofs and non-interactive perfect zero-knowledge with preprocessing, in Proceedings of EUROCRYPT 92."},{"key":"67_CR10","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, Secret Sharing and Perfect Zero-Knowledge, in Proceedings of CRYPTO 93."},{"key":"67_CR11","doi-asserted-by":"crossref","unstructured":"A. De Santis, G. Di Crescenzo, and G. Persiano, The Knowledge Complexity of Quadratic Residuosity Languages, in Theor. Comp. Sc., Vol. 132, pp. 291\u2013317.","DOI":"10.1016\/0304-3975(94)90237-2"},{"key":"67_CR12","unstructured":"A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, in Proceedings of CRYPTO 87."},{"key":"67_CR13","unstructured":"A. De Santis and M. Yung, Cryptographic Applications of the Metaproof and Many-Prover Systems, in Proceedings of CRYPTO 90."},{"key":"67_CR14","unstructured":"G. Di Crescenzo, Recycling Random Bits for Composed Perfect Zero-Knowledge, in Proceedings of EUROCRYPT 95."},{"key":"67_CR15","unstructured":"U. Feige, D. Lapidot, and A. Shamir, Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String, in Proceedings of FOCS 90."},{"key":"67_CR16","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge, in Proc. of STOC 87."},{"issue":"n.1","key":"67_CR17","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"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\u2013729.","journal-title":"Journal of the ACM"},{"key":"67_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, vol. 7, 1994, pp. 1\u201332.","journal-title":"Journal of Cryptology"},{"key":"67_CR19","doi-asserted-by":"crossref","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.","DOI":"10.1137\/0218012"},{"key":"67_CR20","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, in Proceedings of FOCS 89."},{"key":"67_CR21","unstructured":"J. Kilian, On the Complexity of Bounded-interaction and Non-interactive Zero-knowledge Proofs, in Proceedings of FOCS 94."},{"key":"67_CR22","unstructured":"J. Kilian and E. Petrank, An Efficient Zero-knowledge Proof System for NP under General Assumptions, in Electronic Colloquium on Computational Complexity, Technical Report no. TR95-038."},{"key":"67_CR23","unstructured":"R. Impagliazzo, N. Nisan, and A. Wigderson, Pseudorandomness for Network Algorithms, in Proceedings of STOC 94."},{"key":"67_CR24","unstructured":"M. Naor and M. Yung, Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attack, in Proceedings of STOC 90."},{"key":"67_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01375474","volume":"11","author":"N. Nisan","year":"1991","unstructured":"N. Nisan, Pseudorandom Bits for Constant Depth Circuits, Combinatorica, 11, pp. 63\u201370, 1991.","journal-title":"Combinatorica"},{"key":"67_CR26","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/BF01305237","volume":"12","author":"N. Nisan","year":"1992","unstructured":"N. Nisan, Pseudorandom Sequences for Space Bounded Computations, Combinatorica, 12, pp. 449\u2013461, 1992.","journal-title":"Combinatorica"},{"key":"67_CR27","unstructured":"N. Nisan and D. Zuckerman, More deterministic simulation in LOGSPACE, in Proceedings of STOC 93."},{"key":"67_CR28","volume-title":"An Introduction to the Theory of Numbers","author":"I. Niven","year":"1960","unstructured":"I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers, John Wiley and Sons, 1960, New York."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:22:45Z","timestamp":1578518565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_225"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_225","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}