{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:46:48Z","timestamp":1758271608189},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_10","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T00:36:33Z","timestamp":1194222993000},"page":"140-149","source":"Crossref","is-referenced-by-count":5,"title":["Randomness Recycling in Constant-Round Private Computations"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Blundo","sequence":"first","affiliation":[]},{"given":"Clemente","family":"Galdi","sequence":"additional","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of round of interaction. In Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pages 36\u201344, 1989.","DOI":"10.1145\/72981.72995"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Advances in Cryptology\u2013CRYPTO 90, pages 62\u201376, 1990.","DOI":"10.1007\/3-540-38424-3_5"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proceedings of 22th Symposium on Theory of Computation, pages 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of 20th Symposium on Theory of Computation, pages 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"10_CR5","unstructured":"C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private multiparty protocols. To appear in Computational Complexity (preliminary version ICALP 95), 1998."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Crepeau, and I. Damg\u00e4rd. Multiparty unconditionally secure protocols. In Proceedings of 20th Symposium on Theory of Computation, pages 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B. Chor","year":"1991","unstructured":"B. Chor and E. Kushilevitz. A communication-privacy tradeoff for modular addition. Information Processing Letters, 45:205\u2013210, 1991.","journal-title":"Information Processing Letters"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM Journal of Disc. Mat., 4(1):36\u201346, 1991.","journal-title":"SIAM Journal of Disc. Mat."},{"key":"10_CR9","volume-title":"Combinatorial Groups Testing and its Applications","author":"D.Z. Du","year":"1993","unstructured":"D.Z. Du and F.K. Hwang. Combinatorial Groups Testing and its Applications. World Scientific, Singapore, 1993."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u00f6s","year":"1985","unstructured":"P. Erd\u00f6s, P. Frankl, and Z. F\u00fcredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79\u201389, 1985.","journal-title":"Israel Journal of Mathematics"},{"key":"10_CR11","unstructured":"E. Kushilevitz and Y. Mansour. Small sample spaces and privacy. In Proceedings of 15th ACM Symposium on Principles of Distributed Computing, 1996."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and A. Ros\u00e8n. Characterizing linear size circuit in terms of privacy. In Proceedings of 28th ACM Symposium on Theory of Computing, 1996.","DOI":"10.1145\/237814.238002"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and A. Ros\u00e8n. Amortizing randomness in private multiparty computations. In Proc. Seventeenth ACM Symposium on Principles of Distributed Computing, 1998.","DOI":"10.1145\/277697.277710"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/S089548019427634X","volume":"11","author":"E. Kushilevitz","year":"1998","unstructured":"E. Kushilevitz and A. Ros\u00e8n. A randomness-round tradeoff in private computation. SIAM Journal of Disc. Mat., 11(1):61\u201380, 1998.","journal-title":"SIAM Journal of Disc. Mat."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:05:43Z","timestamp":1556931943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}