Efficient protocols for privacy preserving matching against distributed datasets

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

Volumn 4307 LNCS, Issue , 2006, Pages 210-227

  Sang, Yingpeng ^a   Shen, Hong ^b   Tan, Yasuo ^a   Xiong, Naixue ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Cryptographic protocol; Distributed database; Privacy preservation; Set intersection; Set matching

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DISTRIBUTED DATABASE; PRIVACY PRESERVATION; SET INTERSECTION; SET MATCHING;

CRYPTOGRAPHY;

EID: 41549104640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935308_15     Document Type: Conference Paper

References (24)

1. F. Boudot, B. Schoenmakers and J. Traor’e, “A Fair and Efficient Solution to the Socialist Millionaires’ Problem”, in Discrete Applied Mathematics, 111(1-2), pp. 23-36, 2001.
2. R.Cramer, I.Damgard, and J.Nielsen, “Multiparty Computation from Threshold Homomorphic Encryption”, in Advances in Cryptology - EUROCRYPT 2001, LNCS, Springer, vol. 2045, pp. 280-300, 2001.
3. W.Du and M.Attalah, “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.
4. R.Fagin, M.Naor, and P.Winkler, “Comparing Information without Leaking It”, in Communications of the ACM, 39(5): 77-85, 1996.
5. J.Feigenbaum, Y.Ishai, T.Malkin, K.Nissim, M.Strauss, and R.Wright, “Secure Multiparty Computation of Approximations”, in Proc. of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), pp. 927-938, 2001.
6. P.Fouque, G.Poupard and J.Stern, “Sharing Decryption in the Context of Voting or Lotteries”, in Proc. of the 4th International Conference on Financial Cryptography, pp. 90 - 104, 2000.
7. P.Fouque and D.Pointcheval, “Threshold Cryptosystems Secure against Chosenciphertext Attacks”, in Proc. of Asiacrypt2001, pp. 351-368, 2001.
8. M.Freedman, K.Nissim and B.Pinkas, “Efficient Private Matching and Set Intersection”, in Proc. of Eurocrypt’04, LNCS, Springer, vol. 3027, pp. 1-19, 2004.
9. B.Goethals, S.Laur, H.Lipmaa, and T.Mielikainen, “On Secure Scalar Product Computation for Privacy-Preserving Data Mining”, in Proc. of ICISC, 2004.
10. O.Goldreich, “Foundations of Cryptography: Volume 1, Basic Tools”, Cambridge University Press, 2001.
11. O.Goldreich, “Foundations of Cryptography: Volume 2, Basic Applications”, Cambridge University Press, 2004.
12. O.Goldreich, S.Micali, and A.Wigderson, “How to Play Any Mental Game”, in Proc.of19thSTOC, pp. 218-229, 1987.
13. T.Hartman and R.Raz, “On the Distribution of the Number of Roots of Polynomials and Explicit Weak Designs”, in Random Structures and Algorithms, Vol.23 (3), pp. 235 - 263, 2003.
14. S.Hohenberger and S. A.Weis, “Honest-Verifier Private Disjointness Testing without Random Oracles”, in Workshop on Privacy Enhancing Technologies (PET), 2006.
15. P.Indyk and D.Woodruff, “Polylogarithmic Private Approximations and Efficient Matching”, in Proc. of the Third Theory of Cryptography Conference (TCC 2006), LNCS, Springer, vol. 3876, pp. 245-264, 2006.
16. M.Jakobsson, A.Juels, “Mix and Match: Secure Function Evaluation via Ciphertexts”, in ASIACRYPT2000, pp 162-177, 2000.
17. A.Kiayias and A.Mitrofanova, “Testing disjointness of private datasets”, in Proc. of Financial Cryptography (FC 2005), LNCS, Springer, vol. 3570, pp. 109C124, 2005.
18. L.Kissner and D.Song, “Privacy-Preserving Set Operations”, in Advances in Cryptology - CRYPTO 2005, LNCS, Springer, vol.3621, pp. 241-257, 2005.
19. H.Lipmaa, “Verifiable Homomorphic Oblivious Transfer and private Equality Test”, in Advances in Cryptography ASIACRYPT2003, pp. 416-433, 2003.
20. M.Naor and B.Pinkas, “Oblivious Transfer and Polynomial Evaluation”, in Proc. of the 31st Annual ACM Symposium on Theory of Computing, pp. 245-254, 1999.
21. P.Paillier, “Public-key Cryptosystems based on Composite Degree Residuosity Classes”, in Proc. of Asiacrypt2000, pp. 573-584, 2000.
22. D.Randall, “Efficient Generation of Random Nonsingular Matrices”, in Random Structures and Algorithms, vol. 4(1), pp. 111-118, 1993.
23. N.Xiong, X.Defago, X.Jia, Y.Yang, and Y.He, “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.
24. A.C.Yao, “Protocols for Secure Computations”, in Proc. of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 160-164, 1982.