{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:18Z","timestamp":1725516558097},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699712"},{"type":"electronic","value":"9783540705000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70500-0_12","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"155-169","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Disjointness Tests for Private Datasets"],"prefix":"10.1007","author":[{"given":"Qingsong","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian-Mo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/11507840_13","volume-title":"Financial Cryptography and Data Security","author":"A. Kiayias","year":"2005","unstructured":"Kiayias, A., Mitrofanova, A.: Testing disjointness and private datasets. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"12_CR2","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\u20139. Springer, Heidelberg (2004)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11957454_16","volume-title":"Privacy Enhancing Technologies","author":"S. Hohenberger","year":"2006","unstructured":"Hohenberger, S., Weis, S.A.: Honest-verifier private disjointness testing without random oracles. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 277\u2013294. Springer, Heidelberg (2006)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: 31st annual ACM Symposium on Theory of Computing (STOC 1999), Atlanta, Georgia, May 1999, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"12_CR8","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 operaitons. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11602897_9","volume-title":"Information and Communications Security","author":"S. Laur","year":"2005","unstructured":"Laur, S., Lipmaa, H., Mielikainen, T.: Private itemset support counting. In: Qing, S., Mao, W., L\u00f3pez, J., Wang, G. (eds.) ICICS 2005. LNCS, vol.\u00a03783, pp. 97\u2013111. Springer, Heidelberg (2005)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/11767480_33","volume-title":"Applied Cryptography and Network Security","author":"A. Kiayias","year":"2006","unstructured":"Kiayias, A., Mitrofanova, A.: Syntax-driven private evaluation of quantified membership queries. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol.\u00a03989, pp. 470\u2013485. Springer, Heidelberg (2006)"},{"issue":"5","key":"12_CR11","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(5), 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"12_CR13","first-page":"1332","volume-title":"The 2nd Workshop on Advances in Information Security (conjuncted with ARES 2008)","author":"Q. Ye","year":"2008","unstructured":"Ye, Q., Wang, H., Tartary, C.: Privacy-preserving distributed set intersection. In: The 2nd Workshop on Advances in Information Security (conjuncted with ARES 2008), Barcelona, Spain, March 2008, pp. 1332\u20131339. IEEE Computer Society Press, Los Alamitos (2008)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-79104-1_25","volume-title":"ISPEC 2008","author":"Q. Ye","year":"2008","unstructured":"Ye, Q., Wang, H., Pieprzyk, J.: Distributed private matching and set operations. In: ISPEC 2008, April 2008. LNCS, vol.\u00a04991, pp. 347\u2013360. Springer, Heidelberg (2008)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damgard, I.: Secure distributed linear algebra in a constant number of rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/11745853_4","volume-title":"Public Key Cryptography - PKC 2006","author":"P. Mohassel","year":"2006","unstructured":"Mohassel, P., Franklin, M.: Efficient polynomial operations in the shared-coefficients setting. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 44\u201357. Springer, Heidelberg (2006)"},{"key":"12_CR17","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/72981.72995","volume-title":"8th ACM Annual Symposium on Principles of Distributed Computing (PODC 1989)","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: 8th ACM Annual Symposium on Principles of Distributed Computing (PODC 1989), pp. 201\u2013209. ACM Press, New York (1989)"},{"key":"12_CR19","first-page":"254","volume-title":"20th annual ACM Symposium on Theory of Computing (STOC 1988)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. In: 20th annual ACM Symposium on Theory of Computing (STOC 1988), pp. 254\u2013257. ACM Press, New York (1988)"},{"key":"12_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computing\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computing"},{"issue":"3-4","key":"12_CR22","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00037-004-0185-3","volume":"13","author":"E. Kaltofen","year":"2005","unstructured":"Kaltofen, E., Villard, G.: On the complexity of computing determinants. Computational Complexity\u00a013(3-4), 91\u2013130 (2005)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70500-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:18:40Z","timestamp":1620015520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70500-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699712","9783540705000"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70500-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}