{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T02:30:28Z","timestamp":1776825028039,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540494966","type":"print"},{"value":"9783540494973","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11935308_15","type":"book-chapter","created":{"date-parts":[[2006,11,15]],"date-time":"2006-11-15T06:26:42Z","timestamp":1163572002000},"page":"210-227","source":"Crossref","is-referenced-by-count":49,"title":["Efficient Protocols for Privacy Preserving Matching Against Distributed Datasets"],"prefix":"10.1007","author":[{"given":"Yingpeng","family":"Sang","sequence":"first","affiliation":[]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Yasuo","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Naixue","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traor\u2019e, J.: A Fair and Efficient Solution to the Socialist Millionaires\u2019 Problem. Discrete Applied Mathematics\u00a0111(1-2), 23\u201336 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR2","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., Damgard, I., Nielsen, J.: Multiparty Computation from Threshold Homomorphic Encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 280\u2013300. Springer, Heidelberg (2001)"},{"key":"15_CR3","unstructured":"Du, W., Attalah, M.: Protocols for Secure Remote Database Access with Approximate Matching. In: Proc. of the 7th ACM CCS, the 1st Workshop on Security and Privacy in E-commerce (2000)"},{"issue":"5","key":"15_CR4","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":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/3-540-48224-5_75","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Ishai, Y., Malkin, T., Nissim, K., Strauss, M., Wright, R.: Secure Multiparty Computation of Approximations. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 927\u2013938. Springer, Heidelberg (2001)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P. Fouque","year":"2001","unstructured":"Fouque, P., Poupard, G., Stern, J.: Sharing Decryption in the Context of Voting or Lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013140. Springer, Heidelberg (2001)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-45682-1_21","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"P. Fouque","year":"2001","unstructured":"Fouque, P., Pointcheval, D.: Threshold Cryptosystems Secure against Chosen-ciphertext Attacks. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 351\u2013368. Springer, Heidelberg (2001)"},{"key":"15_CR8","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_CR9","doi-asserted-by":"crossref","unstructured":"Goethals, B., Laur, S., Lipmaa, H., Mielikainen, T.: On Secure Scalar Product Computation for Privacy-Preserving Data Mining. In: Proc. of ICISC (2004)","DOI":"10.1007\/11496618_9"},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"15_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: Proc. of 19th STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/rsa.10095","volume":"23","author":"T. Hartman","year":"2003","unstructured":"Hartman, T., Raz, R.: On the Distribution of the Number of Roots of Polynomials and Explicit Weak Designs. Random Structures and Algorithms\u00a023(3), 235\u2013263 (2003)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Weis, S.A.: Honest-Verifier Private Disjointness Testing without Random Oracles. In: Workshop on Privacy Enhancing Technologies (PET) (2006)","DOI":"10.1007\/11957454_16"},{"key":"15_CR15","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)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Jakobsson","year":"2000","unstructured":"Jakobsson, M., Juels, A.: Mix and Match: Secure Function Evaluation via Ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 162\u2013177. Springer, Heidelberg (2000)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 of private datasets. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"15_CR18","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_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":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: Proc. of the 31st Annual ACM Symposium on Theory of Computing, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key Cryptosystems based on Composite Degree Residuosity Classes. In: Proc. of Asiacrypt 2000, pp. 573\u2013584 (2000)","DOI":"10.1007\/3-540-44448-3_44"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/rsa.3240040108","volume":"4","author":"D. Randall","year":"1993","unstructured":"Randall, D.: Efficient Generation of Random Nonsingular Matrices. Random Structures and Algorithms\u00a04(1), 111\u2013118 (1993)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Xiong, N., Defago, X., Jia, X., Yang, Y., He, Y.: Design and Analysis of a Self-tuning Proportional and Integral Controller for Active Queue Management Routers to support TCP Flows. In: Proc. of IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.189"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for Secure Computations. In: Proc. of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11935308_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T20:08:31Z","timestamp":1566763711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11935308_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540494966","9783540494973"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11935308_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}