Syntax-driven private evaluation of quantified membership queries

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

Volumn 3989 LNCS, Issue , 2006, Pages 470-485

  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

COMMUNICATION; DATA ACQUISITION; DATA PRIVACY; NETWORK PROTOCOLS; PROGRAM COMPILERS; SEMANTICS;

DATA-SETS; PRIVACY-PRESERVING EVALUATION; SET-THEORETIC DATA-MINING PROCEDURES; SUBSET-INCLUSION;

QUERY LANGUAGES;

EID: 33746660642     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11767480_33     Document Type: Conference Paper

References (24)

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. Bart Goethals and Mohammed Javeed Zaki, Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03, FIMI '03, Frequent Itemset Mining Implementations, Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations, 19 December 2003, Melbourne, Florida, USA.
14. Lea Kissner AND Dawn Xiaodong Song, Privacy-Preserving Set Operations, CRYPTO 2005, pp. 241-257.
15. Sven Laur, Helger Lipmaa and Taneli Mielikainen Private Itemset Support Counting, ICICS '05, Vol. 3783 LNCS, pages 97-111, 2005
16. Ronald Fagin, Moni Naor, and Peter Winkler. Comparing information without leaking it. Communications of the ACM, 39(5):77-85, 1996.
17. Michael Freedman, Kobbi Nissim and Benny Pinkas, Efficient private matching and set intersection, EUROCRYPT 2004.
18. Shafi Goldwasser, Silvio Micali and Charles Rackoff, The Knowledge Complexity of Interactive Proof Systems SIAM J. Comput. 18(1), pp. 186-208, 1989.
19. Oded Goldreich, Secure Multi-Party Computation, unpublished manuscript, 2002. http://www.wisdom.weizmann.ac.il/oded/pp.html.
20. Aggelos Kiayias and Antonina Mitrofanova, Testing Disjointness of Private Datasets, Financial Cryptography and Data Security 2005, pp. 109-124.
21. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. The Fairplay project, http://www.es.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. Berry Schoenmakers and Pim Tuyls, Practical Two-Party Computation Based on the Conditional Gate, ASIACRYPT 2004, pp. 119-136.
24. A. C. Yao, How to generate and exchange secrets, In Proceedings of the 27th FOCS, pages 162-167, 1986.