{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:51:13Z","timestamp":1787503873053,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540600848","type":"print"},{"value":"9783540494256","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:38:19Z","timestamp":1330259899000},"page":"171-182","source":"Crossref","is-referenced-by-count":5,"title":["On the number of random bits in totally private computation"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Blundo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, STOC 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"15_CR2","first-page":"568","volume":"820","author":"C. Blundo","year":"1994","unstructured":"C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, ICALP 1994, Vol. 820 of LNCS, 1994, pp. 568\u2013579.","journal-title":"LNCS"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01200118","volume":"3","author":"R. Canetti","year":"1993","unstructured":"R. Canetti and O. Goldreich, Bounds on Tradeoffs Between Randomness and Communication Complexity, Computational Complexity 3, pp. 141\u2013167, 1993.","journal-title":"Computational Complexity"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"S. Chari, P. Rohatgi, and A. Srinivasan, Randomness-Optimal Unique Element Isolation, with Application to Perfect Matching and Related Problems, STOC 1993, pp. 458\u2013467.","DOI":"10.1145\/167088.167213"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd, Multiparty Unconditionally Secure Protocols, STOC 1988, pp. 11\u201319.","DOI":"10.1145\/62212.62214"},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00195209","volume":"7","author":"B. Chor","year":"1994","unstructured":"B. Chor, M. Gereb-Graus, and E. Kushilevitz, On The Structure of the Privacy Hierarchy, J. of Cryptology 7, 1994, pp. 53\u201360.","journal-title":"J. of Cryptology"},{"key":"15_CR7","doi-asserted-by":"crossref","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 J. Discrete Math., 4, 1991, pp. 36\u201347.","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B. Chor","year":"1993","unstructured":"B. Chor and E. Kushilevitz, A Communication-Privacy Tradeoff for Modular Addition, Information Processing Letters, Vol. 45, 1993, pp. 205\u2013210.","journal-title":"Information Processing Letters"},{"key":"15_CR9","unstructured":"B. Chor and N. Shani, The Privacy of Dense Symmetric Functions, to appear in Computational Complexity."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"15_CR11","first-page":"390","volume":"486","author":"R. Fleischer","year":"1991","unstructured":"R. Fleischer, H. Jung, and K. Melhorn, A Time-Randomness Tradeoff for Communication Complexity, 4th International Workshop on Distributed Algorithms, Vol. 486 of LNCS, 1991, pp. 390\u2013401.","journal-title":"LNCS"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, FOCS 1989 pp. 248\u2013255.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"15_CR13","unstructured":"D.E. Knuth and A.C. Yao, The Complexity of Nonuniform Random Number Generation, in \u201cAlgorithms and Complexity\u201d, Academic Press, 1976, pp. 357\u2013428."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, STOC 1988, pp. 93\u2013102.","DOI":"10.1145\/62212.62221"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, Privacy and Communication Complexity, SIAM J. Discrete Math., 5, pp. 273\u2013284.","DOI":"10.1137\/0405021"},{"key":"15_CR16","unstructured":"E. Kushilevitz, S. Micali, and R. Ostrowsky, Universal Boolean Judges and their Characterization, FOCS 1994, pp. 478\u2013489."},{"key":"15_CR17","unstructured":"E. Kushilevitz and Y. Mansour, Small Sample Spaces and Privacy, manuscript."},{"key":"15_CR18","first-page":"397","volume":"839","author":"E. Kushilevitz","year":"1994","unstructured":"E. Kushilevitz and A. Rosen, A Randomness-Rounds Tradeoff in Private Computation, CRYPTO 94, Vol. 839 of LNCS, 1994, pp. 397\u2013410.","journal-title":"LNCS"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"P. Raghavan and M. Snir, Memory Versus Randomization in On-line Algorithms, ICALP 1989, LNCS, 1989, pp. 687\u2013703.","DOI":"10.1007\/BFb0035792"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"D. Zuckerman, Simulating BPP Using a General Weak Random Source, FOCS 1991, pp. 79\u201389.","DOI":"10.1109\/SFCS.1991.185351"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:54:41Z","timestamp":1605628481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}