Privacy-preserving set union

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

Volumn 4521 LNCS, Issue , 2007, Pages 237-252

  Frikken, Keith ^a  

^a MIAMI UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PRIVACY; LEARNING SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; NETWORK SECURITY;

MALICIOUS ADVERSARY MODELS; PRIVACY-PRESERVING SET UNION PROTOCOLS;

DATA PRIVACY;

EID: 38049089776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_16     Document Type: Conference Paper

References (24)

1. J. Brickel and V. Shmatikov. Privacy-preserving graph algorithms in the semihonest model. In Proceedings of Advances in Cryptology - ASIACRYPT '05, volume 3788 of Lecture Notes in Computer Science, pages 236-252, 2005.
2. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proceedings of Advances in Cryptology - EUROCRYPT '01, volume 2045 of Lecture Notes in Computer Science, pages 280-299, 2001.
3. I. Damgård and Y. Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Proceedings of Advances in Cryptology - CRYPTO '05, volume 3621 of Lecture Notes in Computer Science, pages 378-411, 2005.
4. I. Damgard and M. Jurik. Efficient protocols based on probabilistic encryption using composite degree residue classes, 2000.
5. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In PKC '01: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography, pages 119-136, London, UK, 2001. Springer-Verlag.
6. A. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data mining. In PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 211-222, New York, NY, USA, 2003. ACM Press.
7. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proceedings of Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194, 1986.
8. Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. Lecture Notes in Computer Science, 1962: 90-104, 2001.
9. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Proceedings of Advances in Cryptology - EUROCRYPT '04, volume 3027 of Lecture Notes in Computer Science, pages 1-19, 2004.
10. O. Goldreich. Foundations of Cryptography: Volume II Basic Application. Cambridge University Press, 2004.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC '87: Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 218-229, New York, NY, USA, 1987. ACM Press.
12. S. Goldwasser and S. Micali. Probabilistic encryption, 1984.
13. P. Golle and M. Jakobsson. Reusable anonymous return channels. In WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society, pages 94-100, New York, NY, USA, 2003. ACM Press.
14. B. Huberman, M. Franklin, and T. Hogg. Enhancing privacy and trust in electronic communities. In EC '99: Proceedings of the 1st ACM conference on Electronic commerce, pages 78-86, New York, NY, USA, 1999. ACM Press.
15. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proceedings of USENIX'02, pages 339-353, 2002.
16. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering, 16(9): 1026-1037, September 2004.
17. A. Kiayias and A. Mitrofanova. Testing disjointness of private datasets. In Proceedings of Financial Cryptography, volume 3570 of Lecture Notes in Computer Science, pages 109-124, 2005.
18. L. Kissner and D. Song. Privacy-preserving set operations. In Proceedings of Advances in Cryptology - CRYPTO '05, volume 3621 of Lecture Notes in Computer Science, 2005. Full version appears at http://www.cs.cmu.edu/leak/.
19. C.A. Neff. A verifiable secret shuffle and its application to e-voting. In CCS '01: Proceedings of the 8th ACM conference on Computer and Communications Security, pages 116-125, New York, NY, USA, 2001. ACM Press.
20. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Proceedings of ICICS '97, volume 1334 of Lecture Notes in Computer Science, pages 440-444, 1997.
21. C. O'Keefe, M. Yung, L. Gu, and R. Baxter. Privacy-preserving data linkage protocols. In WPES '04: Proceedings of the 2004 ACM workshop on Privacy in the electronic society, pages 94-102, New York, NY, USA, 2004. ACM Press.
22. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 573-584, 1999.
23. J. Vaidya and C. Clifton. Privacy - preserving top-k queries. In Proceedings of the 21st International Conference on Data Engineering (ICDE 2005), pages 545-546, 2005.
24. A. Yao. How to generate and exchange secrets. In Proceedings of FOCS, pages 162-167, 1986.