Privacy-preserving distributed set intersection

ARES 2008 - 3rd International Conference on Availability, Security, and Reliability, Proceedings

Volumn , Issue , 2008, Pages 1332-1339

  Ye, Qingsong ^a,c   Wang, Huaxiong ^b   Tartary, Christophe ^a  

^a MACQUARIE UNIVERSITY   (Australia)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; CRYPTOGRAPHY;

CARDINALITY; DIFFIE-HELLMAN ASSUMPTIONS; GROWING DEMAND; HOMOMORPHIC ENCRYPTIONS; INTERNATIONAL CONFERENCES; PRIVACY-PRESERVING; PROVABLY SECURE; SECRET SHARING SCHEMES; SET INTERSECTION;

INTERSECTIONS;

EID: 49049102977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2008.134     Document Type: Conference Paper

References (23)

1. B. Adida and D. Wikstrom. How to shuffle in public. In 4th Theory of Cryptography Conference (TCC '07), volume accepted of LNCS. Springer-Verlag, 2007.
2. B. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. In B. Pfitzmann, editor, Advances in Cryptology - Eurocrypt '01, volume 2045 of LNCS, pages 119-135. Springer-Verlag Berlin Heidelberg, 2001.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In 20th Annual ACM Symposium on Theory of Computing, pages 1-10. ACM Press, 1988.
4. R. Cramer, R. Gennaro, and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. In Advances in Cryptology - Eurocrypt '97, volume 1233 of LNCS, pages 103-118. Springer - Verlag, 1997.
5. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. Chaum, editors, Advances in Cryptology - Crypto '84, volume 196, pages 19-22. Springer-Verlag, August 1984.
6. R. Fagin, M. Naor, and P. Winkler. Comparing information without leaking it. Communications of the ACM, 39(5):77-85, 1996.
7. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - Eurocrypt '04, volume 3024 of LNCS, pages 1-9. Springer-Verlag Berlin Heidelberg, 2004.
8. O. Goldreich. The Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
9. S. Hohenberger and S. A. Weis. Honest-verifier private disjointness testing without random oracles. In 6th Workshop on Privacy Enhancing Technologies (PET'06), volume 4258 of LNCS, pages 277-294. Springer-Verlag Berlin Heidelberg, 2006.
10. A. Kiayias and A. Mitrofanova. Testing disjointness and private datasets. In A. S. Patrick and M. Yung, editors, Finanicial Cryptography (FC'05), volume 3570, pages 109-124. Springer-Verlag Berlin Heidelberg, 2005.
11. A. Kiayias and A. Mitrofanova. Syntax-driven private evaluation of quantified membership queries. In 4th International Conference on Applied Cryptography and Network Security (ACNS'06), volume 3989 of LNCS, pages 470-485. Springer-Verlag, 2006.
12. L. Kissner and D. Song. Privacy-preserving set operaitons. In V. Shoup, editor, Advances in Cryptology - Crypto '05, volume 3621 of LNCS, pages 241-257. Springer-Verlag Berlin Heidelberg, 2005.
13. S. Laur, H. Lipmaa, and T. Mielikainen. Private itemset support counting. In 7th International Conference on Information and Communications Security, volume 3783 of LNCS, pages 97-111. Springer-Verlag, 2005.
14. H. Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In C. S. Laih, editor, Advances in Cryptology - Asiacrypt '03, volume 2894, pages 416-433. Springer-Verlag Berlin Heidelberg, 2003.
15. P. Mohassel and M. Franklin. Efficient polynomial operations in the shared-coefficients setting. In M. Yung, editor, Public Key Cryptography (PKC'06), volume 3958 of LNCS, pages 44-57. Springer-Verlag, 2006.
16. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In 31st annual ACM Symposium on Theory of Computing (STOC '99), pages 245-254, Atlanta, Georgia, May 1999.
17. M. Naor and B. Pinkas. Distributed oblivious transfer. In T. Okanoto, editor, Advances in Cryptology - Asiacrypt '00, volume 1976 of LNCS, pages 205-219. Springer-Verlag, 2000.
18. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - Eurocrypt '99, volume 1592 of LNCS, pages 223-238. Springer-Verlag, 1999.
19. J. Pieprzyk, T. Hardjono, and J. Seberry. Fundamentals of Computer Security. Springer, 2003.
20. Y. Sang, H. Shen, Y. Tan, and N. Xiong. Efficient protocols for privacy preserving matching against distributed datasets. In 8th International Conference of Information and Communications Security (ICICS'06), volume 4307 of LNCS, pages 210-227. Springer - Verlag, 2006.
21. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
22. Y. Tsiounis and M. Yung. On the security of elgamal based encryption. In Public Key Cryptography (PKC'98), volume 1431 of LNCS, pages 117-134. Springer-Verlag, 1998.
23. A. C. Yao. Protocols for secure computations. In 23rd Symposium on Foundations of Computer Science (FOCS), pages 160-164. IEEE, 1982.