Testing disjointness of private datasets

Lecture Notes in Computer Science

Volumn 3570, Issue , 2005, Pages 109-124

  Kiayias, Aggelos ^a   Mitrofanova, Antonina ^b  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION ANALYSIS; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

COMMUNICATION COMPLEXITY; DATASETS;

CRYPTOGRAPHY;

EID: 26444553355     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11507840_13     Document Type: Conference Paper

References (25)

1. Mihir Bellare and Oded Goldreich, On Defining Proofs of Knowledge, CRYPTO 1992: 390-420.
2. Jan Camenisch, Victor Shoup, Practical Verifiable Encryption and Decryption of Discrete Logarithms, CRYPTO 2003: 126-144
3. Ran Canetti and Marc Fischlin, Universally Composable Commitments, CRYPTO 2001: 19-40
4. David Chaum, Jan-Hendrik Evertse and Jeroen van de Graaf, An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations, EUROCRYPT 1987: 127-141
5. D. Chaum and T. Pedersen Wallet databases with observers, In Advances in Cryptology - Crypto '92, pages 89-105, 1992.
6. Ronald Cramer and Ivan Damgard Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?, CRYPTO 1998: 424-441
7. Ronald Cramer, Ivan Damgard, Berry Schoenmakers, Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, CRYPTO 1994: 174-187
8. Ronald Cramer, Rosario Gennaro and Berry Schoenmakers, A Secure and Optimally Efficient Multi-Authority Election Scheme, EUROCRYPT 1997, pp. 103-118.
9. Ivan Damgard, Efficient Concurrent Zero-Knowledge in the Auxiliary String Model EUROCRYPT 2000: 418-430
10. Ivan Damgard, Jesper Buus Nielsen, Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor, CRYPTO 2002. pp. 581-596.
11. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano and Moti Yung, On Monotone Formula Closure of SZK, FOCS 1994: 454-465.
12. T. ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, IT-31(4):469-472, July 1985.
13. Ronald Fagin, Moni Naor, and Peter Winkler. Comparing information without leaking it. Communications of the ACM, 39(5):77-85, 1996.
14. Amos Fiat and Adi Shamir How to Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO 1986: 186-194.
15. Michael Freedman, Kobbi Nissim and Benny Pinkas, Efficient private matching and set intersection, EUROCRYPT 2004.
16. Shafi Goldwasser, Silvio Micali and Charles Rackoff, The Knowledge Complexity of Interactive Proof Systems SIAM J. Comput. 18(1): 186-208 (1989)
17. Bart Goethals, Sven Laur, Helger Lipmaa and Taneli Mielikäinen, On Secure Scalar Product Computation for Privacy-Preserving Data Mining., The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), December 2-3, 2004.
18. Oded Goldreich, Secure Multi-Party Computation, unpublished manuscript, 2002. http://www.wisdom.weizmann.ac.il/oded/pp.html.
19. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection, SIAM Journal on Discrete Math, 5(5):545-557, 1992.
20. Helger Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In Advances in Cryptology, ASIACRYPT 2003, pp. 416-433.
21. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. The Fairplay project, http://www.cs.huji.ac.il/labs/danss/FairPlay.
22. Moni Naor and Benny Pinkas. Oblivious transfer and polynomial evaluation. In Proc. 31st Annual ACM Symposium on Theory of Computing, pages 245-254, Atlanta, Georgia, May 1999.
23. Alexander A. Razborov, On the Distributional Complexity of Disjointness, Theor. Comput. Sci. 106(2): 385-390 (1992)
24. Berry Schoenmakers and Pim Tuyls, Practical Two-Party Computation Based on the Conditional Gate, ASIACRYPT 2004, pp. 119-136.
25. A. C. Yao, How to generate and exchange secrets, In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.