{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:45:13Z","timestamp":1777376713642,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642144226","type":"print"},{"value":"9783642144233","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14423-3_15","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T12:13:34Z","timestamp":1276863214000},"page":"211-228","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Fuzzy Matching and Intersection on Private Datasets"],"prefix":"10.1007","author":[{"given":"Qingsong","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-70936-7_30","volume-title":"Theory of Cryptography","author":"B. Adida","year":"2007","unstructured":"Adida, B., Wikstrom, D.: How to shuffle in public. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 555\u2013574. Springer, Heidelberg (2007)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.tcs.2007.02.043","volume":"379","author":"D. Bleichenbacher","year":"2007","unstructured":"Bleichenbacher, D., Kiayias, A., Yung, M.: Decoding interleaved reed-solomon codes over noisy channels. Theoretical Computer Science\u00a0379, 348\u2013360 (2007)","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1109\/ARES.2008.170","volume-title":"The 3rd International Conference on Availability, Security and Reliability","author":"L. Chmielewski","year":"2008","unstructured":"Chmielewski, L., Hoepman, J.-H.: Fuzzy private matching (extended abstract). In: The 3rd International Conference on Availability, Security and Reliability, pp. 327\u2013334. IEEE CS Press, Los Alamitos (2008)"},{"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","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometric codes. IEEE Transactions on Information Theory\u00a045, 1757\u20131767 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11681878_13","volume-title":"Theory of Cryptography","author":"P. Indyk","year":"2006","unstructured":"Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 245\u2013264. Springer, Heidelberg (2006); See also ECCC, Report No. 117 (2005)"},{"key":"15_CR7","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay \u2013 a secure two-party computation system. In: Proceedings of the 13th USENIX Security Symposium. USENIX Association (2004)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"15_CR9","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)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of Society for Industrial and Applied Mathematics\u00a08(2), 300\u2013304 (1960)","journal-title":"Journal of Society for Industrial and Applied Mathematics"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM\u00a027, 701\u2013717 (1980)","journal-title":"Journal of the ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: Proceedings of the 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Information, Security and Cryptology \u2013 ICISC 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14423-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T22:06:26Z","timestamp":1676066786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14423-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144226","9783642144233"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14423-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}