{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:46Z","timestamp":1725493606300},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433194"},{"type":"electronic","value":"9783540458616"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45861-1_19","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:40:01Z","timestamp":1193553601000},"page":"244-257","source":"Crossref","is-referenced-by-count":0,"title":["Private Computation with Shared Randomness over Broadcast Channel"],"prefix":"10.1007","author":[{"given":"Clemente","family":"Galdi","sequence":"first","affiliation":[]},{"given":"Pino","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,23]]},"reference":[{"key":"19_CR1","unstructured":"D. Beaver. Perfect privacy for two-party protocols. Technical Report TR-11-89, Harvard University, 1989."},{"key":"19_CR2","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"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s000370050025","volume":"8","author":"C. Blundo","year":"1999","unstructured":"C. Blundo, A. De Santis, G. Persiano, and U. Vaccaro. Randomness complexity of private multiparty protocols. Computational Complexity, 8(2):145\u2013168, 1999.","journal-title":"Computational Complexity"},{"key":"19_CR4","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"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65\u201375, 1988.","journal-title":"Journal of Cryptology"},{"key":"19_CR6","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"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley & Sons, Singapore, 1991."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proceedings of 26th ACM Symposium on Theory of Computation, pages 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung. Secure hypergraphs: Privacy from partial broadcast. In Proceedings of 27th ACM Symposium on Theory of Computing, pages 36\u201344, 1995.","DOI":"10.1145\/225058.225077"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Y. Ishai and E. Kushilevitz. Private simultaneous messages protocols and applications. In Proceedings of ISCTS 97.","DOI":"10.1109\/ISTCS.1997.595170"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"E. Kushilevitz. Privacy and communication complexity. SIAM Journal of Disc. Mat., 5(2):273\u2013284, 1992.","journal-title":"SIAM Journal of Disc. Mat."},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in cryptology-EUROCRYPT\u2019 89","author":"M. Waidner","year":"1989","unstructured":"Michael Waidner. Unconditional sender and recipient untraceability in spite of active attacks. In Advances in cryptology-EUROCRYPT\u2019 89, volume 434 of Lecture Notes in Computer Science, 1989. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45861-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:29:12Z","timestamp":1556936952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45861-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433194","9783540458616"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45861-1_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}