Privacy-preserving set operations

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

Volumn 3621 LNCS, Issue , 2006, Pages 241-257

  Kissner, Lea ^a   Song, Dawn ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSABLE METHODS; FRAMEWORK; MULTISET OPERATIONS; PRIVACY-PRESERVING COMPUTATION;

COMPUTATION THEORY; COMPUTER SIMULATION; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

DATA PRIVACY;

EID: 33745160750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of STOC, 1988.
2. Fabirce Boudot, Berry Schoenmakers, and Jacques Traore. A fair and efficient solution to the socialist millionaires' problem. Discrete Applied Mathematics, 111:77-85, 2001.
3. Jan Camenisch. Proof systems for general statements about discrete logarithms. Technical Report 260, Dept. of Computer Science, ETH Zurich, Mar 1997.
4. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24:84-8, 1981.
5. David Chaum, Jan-Hendrick Evertse, Jeroen van de Graaf, and Rene Peralta. Demonstrating possession of a discrete log without revealing it. In A.M. Odlyzko, editor, Proc. of Crypto, pages 200-212. Springer-Verlag, 1986.
6. R. Cramer, I. Damgård, and J. Buus Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of Eurocrypt, pages 280-99. Springer-Verlag, 2001.
7. Ronald Cramer, Ivan Damgård, and Ueli Maurer. General secure multi-party computation from any linear secret sharing scheme. In Proc. of Eurocrypt. Springer-Verlag, May 2000.
8. Y. Desmedt and K. Kurosawa. How to break a practical mix and design a new one. In Proc. of Eurocrypt, pages 557-72. Springer-Verlag, 2000.
9. Ronald Fagin, Moni Naor, and Peter Winkler. Comparing information without leaking it. Communications of the ACM, 39:77-85, 1996.
10. P. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting of lotteries. In Proc. of Financial Cryptography, 2000.
11. Pierre-Alain Fouque and David Pointcheval. Threshold cryptosystems secure against chosen-ciphertext attacks. In Proc. of Asiacrypt, pages 573-84, 2000.
12. Michael Freedman, Kobi Nissim, and Benny Pinkas. Efficient private matching and set intersection. In Proc. of Eurocrypt, volume LNCS 3027, pages 1-19. Springer-Verlag, May 2004.
13. J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Proc. of Crypto, pages 368-87. Springer-Verlag, 2001.
14. Rosario Gennaro and Victor Shoup. Securing threshold cryptosystems against chosen ciphertext attack. Journal of Cryptology, 15:75-96, 2002.
15. Oded Goldreich. The foundations of cryptography - volume 2. http://www.wisdom.weizmann.ac.il/ oded/foc-vol2.html.
16. Shafi Goldwasser and Silvio Micali. Probabilistic encryption. Journal of Computer and Systems Science, 28:270-99, 1984.
17. M. Jakobsson. A practical mix. In Proc. of Eurocrypt, pages 448-61. Springer-Verlag, 1998.
18. Lea Kissner and Dawn Song. Private and threshold set-intersection. Technical Report CMU-CS-05-113, Carnegie Mellon University, February 2005.
19. Helger Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In Proc. of Asiacrypt, pages 416-33, 2003.
20. Alfred J. Menezes, Paul C. van Oorschot, and Scott A, Vanstone. Handbook of Applied Cryptography. RC Press, October 1996.
21. Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. ACM Symposium on Theory of Computing, pages 245-54, 1999.
22. A. Neff. A verifiable secret shuffle and its application to e-voting. In ACM CCS, pages 116-25, 2001.
23. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. of Asiacrypt, pages 573-84, 2000.
24. Victor Shoup. A computational introduction to number theory and algebra. http://shoup.net/ntb/.
25. Andrew C-C Yao. Protocols for secure computations. In Proc. of FOCS, 1982.