{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T00:29:19Z","timestamp":1665448159545},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T00:00:00Z","timestamp":1154995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2006,12,18]]},"DOI":"10.1007\/s10207-006-0007-5","type":"journal-article","created":{"date-parts":[[2006,8,7]],"date-time":"2006-08-07T05:48:20Z","timestamp":1154929700000},"page":"15-26","source":"Crossref","is-referenced-by-count":2,"title":["Low-randomness constant-round private XOR computations"],"prefix":"10.1007","volume":"6","author":[{"given":"Carlo","family":"Blundo","sequence":"first","affiliation":[]},{"given":"Clemente","family":"Galdi","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,8]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D. Non-cryptographic fault-tolerant computing in a constant number of round of interaction. In: Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pp. 36\u201344 (1989)","DOI":"10.1145\/72981.72995"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Beaver, D., Feigenbaum, J., Kilian, J., Rogaway, P. Security with low communication overhead. In: Advances in Cryptology \u2013 CRYPTO 90, pp. 62\u201376 (1990)","DOI":"10.1007\/3-540-38424-3_5"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P. The round complexity of secure protocols. In: Proceedings of 22nd Symposium on Theory of Computing, pp. 503\u2013513 (1990)","DOI":"10.1145\/100216.100287"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of 20th Symposium on Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"7_CR5","first-page":"251","volume-title":"Advances in Cryptography \u2013 Crypto 86","author":"J. Benaloh","year":"1986","unstructured":"Benaloh J. (1986). Secret sharing homomorphism: Keeping shares of a secret secret. In: Odlyzko A. (eds). Advances in Cryptography \u2013 Crypto 86. Lecture Notes in Computer Science, vol. 263, Springer, Berlin Heidelberg New York, pp. 251\u2013260"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Blundo, C., Galdi, C., Persiano, P. Randomness recycling in constant round private computations. In: Jayanti, P. (ed.) Proceedings of 13th International Symposium on Distributed Computing (DISC 99), vol. 1693 of LNCS, pp. 138\u2013150 (1999)","DOI":"10.1007\/3-540-48169-9_10"},{"issue":"2","key":"7_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s000370050025","volume":"8","author":"C. Blundo","year":"1999","unstructured":"Blundo C., Santis A.D., Persiano G., Vaccaro U. (1999) Randomness complexity of private multiparty protocols. Comput. Complex. 8(2): 145\u2013168","journal-title":"Comput. Complex."},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s001459910005","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti R., Kushilevitz E., Ostrovsky R., Ros\u00e9n A. (2000) Randomness versus fault-tolerance. J. Cryptol. 13(1): 107\u2013142","journal-title":"J. Cryptol."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damg\u00e4rd, I. Multiparty unconditionally secure protocols. In: Proceedings of 20th Symposium on Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B. Chor","year":"1991","unstructured":"Chor B., Kushilevitz E. (1991) A communication-privacy tradeoff for modular addition. Inf. Process. Lett. 45, 205\u2013210","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor B., Kushilevitz E. (1991) A zero-one law for boolean privacy. SIAM J. Discrete Mat. 4(1): 36\u201346","journal-title":"SIAM J. Discrete Mat."},{"key":"7_CR12","doi-asserted-by":"crossref","DOI":"10.1142\/1936","volume-title":"Combinatorial Groups Testing and its Applications","author":"D. Du","year":"1993","unstructured":"Du D., Hwang F. (1993) Combinatorial Groups Testing and its Applications. World Scientific, Singapore"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s P., Frankl P., F\u00fcredi Z. (1985) Families of finite sets in which no set is covered by the union of r others. Isr. J. Math. 51: 79\u201389","journal-title":"Isr. J. Math."},{"issue":"4","key":"7_CR14","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0895480196306130","volume":"10","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz E., Mansour Y. (1997) Randomness in private computations. SIAM J. Discrete Math. 10(4): 647\u2013651","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e8n, A. 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":"7_CR16","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e8n, A.: Amortizing randomness in private multiparty computations. In: Proceedings of 17th ACM Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277710"},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1137\/S089548019427634X","volume":"11","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz E., Ros\u00e8n A. (1998) A randomness-round tradeoff in private computation. SIAM J. Discerete Math. 11(1): 61\u201380","journal-title":"SIAM J. Discerete Math."},{"key":"7_CR18","unstructured":"Lang, S. Linear Algebra. Addison-Wesley, Reading"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-006-0007-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-006-0007-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-006-0007-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:01:22Z","timestamp":1559127682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-006-0007-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,8]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,12,18]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s10207-006-0007-5","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,8]]}}}