Privacy preserving set intersection protocol secure against malicious behaviors

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Volumn , Issue , 2007, Pages 461-468

  Sang, Yingpeng ^a   Shen, Hong ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Cryptographic protocol; Distributed datasets; Privacy preservation; Set intersection; Zero knowledge proof

Indexed keywords

INTERSECTIONS; PROBABILITY;

CRYPTOGRAPHIC PROTOCOL; DISTRIBUTED DATASETS; PRIVACY PRESERVATION; SET INTERSECTION; ZERO-KNOWLEDGE PROOF;

CRYPTOGRAPHY;

EID: 48049104079     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2007.4420204     Document Type: Conference Paper

References (19)

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. A. D. Santis, G. D. Crescenzo, G. Persiano, and M. Yung. "On Monotone Formula Closure of SZK". in Proc. of the 35th Annual Symposium on Foundations of Computer Science, pp. 454-465, IEEE Computer Society, 1994.
4. R. Fagin, M. Naor, and P. Winkler, "Comparing Information without Leaking It", in Communications of the ACM, 39(5): 77-85, 1996.
5. 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.
6. P. Fouque and D. Pointcheval, "Threshold Cryptosystems Secure against Chosen-ciphertext Attacks", in Proc. of Asiacrypt 2001, pp. 351 - 368, 2001.
7. 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.
8. O. Goldreich, "Foundations of Cryptography: Volume 2, Basic Applications", Cambridge University Press, 2004.
9. O. Goldreich, S. Micali, and A. Wigderson, "How to Play Any Mental Game", in Proc. of 19th STOC, pp. 218-229, 1987.
10. M. Jakobsson and A. Juels, "Mix and Match: Secure Function Evaluation via Ciphertexts", in ASI-ACRYPT 2000, pp 162-177, 2000.
11. L. Kissner and D. Song, "Privacy-Preserving Set Operations", in Advances in Cryptology - CRYPTO 2005, LNCS, Springer, vol.3621, pp. 241-257, 2005.
12. L. Kissner and D. Song, "Privacy-Preserving Set Operations", in Technical Report CMU-CS-05-113, Carnegie Mellon University, June 2005.
13. Y. Lindell. "Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation", in Journal of Cryptology, 16(3): pp. 143-184, 2003.
14. H. Lipmaa, "Verifiable Homomorphic Oblivious Transfer and Private Equality Test", in Advances in Cryptography ASIACRYPT 2003, pp. 416-433, 2003.
15. 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.
16. P. Paillier, "Public-key Cryptosystems based on Composite Degree Residuosity Classes", in Proc. of EUROCRYPT 1999, pp. 573-584, 2000.
17. D. Randall, "Efficient Generation of Random Non-singular Matrices", in Random Structures and Algorithms, vol. 4(1), pp. 111-118, 1993.
18. Y. Sang, H. Shen, Y. Tan and N. Xiong, "Efficient Protocols for Privacy Preserving Matching Against Distributed Datasets", accepted by the 8th International Conference on Information and Communications Security (ICICS '06), LNCS, 2006.
19. A.C. Yao, "Protocols for Secure Computations", in Proc. of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 160 - 164, 1982.