{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:54:31Z","timestamp":1773348871146,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281146","type":"print"},{"value":"9783540318705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_15","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T13:20:34Z","timestamp":1292851234000},"page":"241-257","source":"Crossref","is-referenced-by-count":340,"title":["Privacy-Preserving Set Operations"],"prefix":"10.1007","author":[{"given":"Lea","family":"Kissner","sequence":"first","affiliation":[]},{"given":"Dawn","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Widgerson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. of STOC (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traore, J.: A fair and efficient solution to the socialist millionaires\u2019 problem. Discrete Applied Mathematics\u00a0111, 77\u201385 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR3","unstructured":"Camenisch, J.: Proof systems for general statements about discrete logarithms. Technical Report 260, Dept. of Computer Science, ETH Zurich (March 1997)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM\u00a024, 84\u201388 (1981)","journal-title":"Communications of the ACM"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-47721-7_14","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"D. Chaum","year":"1987","unstructured":"Chaum, D., Evertse, J.-H., van de Graaf, J., Peralta, R.: Demonstrating possession of a discrete log without revealing it. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 200\u2013212. Springer, Heidelberg (1987)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013299. Springer, Heidelberg (2001)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I.B., Maurer, U.M.: General secure multi-party computation from any linear secret sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 316. Springer, Heidelberg (2000)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"Y. Desmedt","year":"2000","unstructured":"Desmedt, Y., Kurosawa, K.: How to break a practical mix and design a new one. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 557\u2013572. Springer, Heidelberg (2000)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Communications of the ACM\u00a039, 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting of lotteries. In: Proc. of Financial Cryptography (2000)","DOI":"10.1007\/3-540-45472-1_7"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","first-page":"573","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Pointcheval, D.: Threshold cryptosystems secure against chosen-ciphertext attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 573\u2013584. Springer, Heidelberg (2001)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Freedman","year":"2004","unstructured":"Freedman, M., 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_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"R. Gennaro","year":"2002","unstructured":"Gennaro, R., Shoup, V.: Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology\u00a015, 75\u201396 (2002)","journal-title":"Journal of Cryptology"},{"key":"15_CR15","unstructured":"Goldreich, O.: The foundations of cryptography \u2013 vol 2, http:\/\/www.wisdom.weizmann.ac.il\/~oded\/foc-vol2.html"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and Systems Science\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Computer and Systems Science"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Jakobsson","year":"1998","unstructured":"Jakobsson, M.: A practical mix. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 448\u2013461. Springer, Heidelberg (1998)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Private and threshold set-intersection. Technical Report CMU-CS-05-113, Carnegie Mellon University (February 2005)","DOI":"10.21236\/ADA461119"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-40061-5_27","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: Verifiable homomorphic oblivious transfer and private equality test. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 416\u2013433. Springer, Heidelberg (2003)"},{"key":"15_CR20","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1996","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proc. ACM Symposium on Theory of Computing, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Neff, A.: A verifiable secret shuffle and its application to e-voting. In: ACM CCS, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"15_CR23","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Proc. of Asiacrypt, pp. 573\u2013584 (2000)"},{"key":"15_CR24","unstructured":"Shoup, V.: A computational introduction to number theory and algebra, http:\/\/shoup.net\/ntb\/"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: Proc. of FOCS (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:55Z","timestamp":1605625855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11535218_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}