{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T04:58:56Z","timestamp":1781672336643,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540727378","type":"print"},{"value":"9783540727385","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72738-5_15","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T20:36:01Z","timestamp":1182544561000},"page":"226-236","source":"Crossref","is-referenced-by-count":30,"title":["An Unconditionally Secure Protocol for Multi-Party Set Intersection"],"prefix":"10.1007","author":[{"given":"Ronghua","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chuankun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11681878_16","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2006","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Efficient Multi-Party Computation with Dispute Control. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 305\u2013328. Springer, Heidelberg (2006)"},{"key":"15_CR3","first-page":"1","volume-title":"20th Annual Symposium on the Theory of Computing (STOC\u201988)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th Annual Symposium on the Theory of Computing (STOC\u201988), pp. 1\u201310. ACM Press, New York (1988)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"15_CR5","first-page":"218","volume-title":"19th ACM Symposium on the Theory of Computing (STOC\u201987)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game \u2014 A Completeness Theorem for Protocols with Honest Majority. In: 19th ACM Symposium on the Theory of Computing (STOC\u201987), pp. 218\u2013229. ACM Press, New York (1987)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient Secure Multi-Party Computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 143\u2013161. Springer, Heidelberg (2000)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-Preserving Set Operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Private and Threshold Set-Intersection. Technical Report CMU-CS-05-113, Carnegie Mellon University (2005)","DOI":"10.21236\/ADA461119"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1977","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM\u00a022, 612\u2013613 (1977)","journal-title":"Communications of the ACM"},{"key":"15_CR10","first-page":"160","volume-title":"23rd IEEE Symposium on Foundations of Computer Science (FOCS\u201982)","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for Secure Computations. In: 23rd IEEE Symposium on Foundations of Computer Science (FOCS\u201982), pp. 160\u2013164. IEEE Computer Society Press, Los Alamitos (1982)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72738-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:48:10Z","timestamp":1558259290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72738-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727378","9783540727385"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72738-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}