Efficient fuzzy matching and intersection on private datasets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5984 LNCS, Issue , 2010, Pages 211-228

  Ye, Qingsong ^a   Steinfeld, Ron ^a   Pieprzyk, Josef ^a   Wang, Huaxiong ^a,b  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

error correction; fuzzy private matching; homomorphic encryption; Private matching; private set intersection; secret sharing

Indexed keywords

COMMUNICATION COMPLEXITY; DATA SETS; FUZZY MATCHING; HOMOMORPHIC-ENCRYPTIONS; MATCHING PROBLEMS; PARAMETER VALUES; PASSIVE ADVERSARY; PRIVATE MATCHING; PROVABLY SECURE; SECRET SHARING; SECRET SHARING SCHEMES; SET INTERSECTION;

DECODING; IMAGE QUALITY; NETWORK PROTOCOLS; NETWORK SECURITY; OPTICAL COMMUNICATION; REED-SOLOMON CODES; VECTORS;

CRYPTOGRAPHY;

EID: 77954608051     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14423-3_15     Document Type: Conference Paper

References (14)

1. Adida, B., Wikstrom, D.: How to shuffle in public. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 555-574. Springer, Heidelberg (2007)
2. Bleichenbacher, D., Kiayias, A., Yung, M.: Decoding interleaved reed-solomon codes over noisy channels. Theoretical Computer Science 379, 348-360 (2007) (Pubitemid 46754585)
3. Chmielewski, L., Hoepman, J.-H.: Fuzzy private matching (extended abstract). In: The 3rd International Conference on Availability, Security and Reliability, pp. 327-334. IEEE CS Press, Los Alamitos (2008)
4. Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1-19. Springer, Heidelberg (2004)
5. Guruswami, V., Sudan, M.: Improved decoding of reed-solomon and algebraic-geometric codes. IEEE Transactions on Information Theory 45, 1757-1767 (1999) (Pubitemid 32871911)
6. Indyk, P., Woodruff, D.: Polylogarithmic private approximations and efficient matching. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 245-264. Springer, Heidelberg (2006);
7. See also ECCC, Report No. 117 (2005)
8. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: Proceedings of the 13th USENIX Security Symposium. USENIX Association (2004)
9. Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 308-318. Springer, Heidelberg (1998)
10. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
11. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of Society for Industrial and Applied Mathematics 8(2), 300-304 (1960)
12. Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27, 701-717 (1980)
13. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
14. Yao, A.: How to generate and exchange secrets. In: Proceedings of the 27th FOCS, pp. 162-167 (1986)