Honest-verifier private disjointness testing without random oracles

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

Volumn 4258 LNCS, Issue , 2006, Pages 277-294

  Hohenberger, Susan ^a   Weis, Stephen A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Anonymous login; Private data mining; Private disjointness testing; Private intersection cardinality; Subgroup decision assumption

Indexed keywords

CARDINALITIES; DISJOINTNESS; PRIVATE DATA; PRIVATE DATA MINING; PRIVATE DISJOINTNESS TESTING;

DATA PRIVACY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 56749157577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11957454_16     Document Type: Conference Paper

References (22)

1. Azar, Y., Broder, A. Z., Karlin, A. R., and Upfal, E. Balanced allocations. SIAM Journal on Computing 29, 1 (1999), 180-200.
2. Bellare, M., and Rogaway, P. Random oracles are practical: A paradigm for designing efficient protocols. In CCS (1993), ACM Press, pp. 62-73.
3. Boneh, D., Goh, E.-J., and Nissim, K. Evaluating 2-DNF formulas on ciphertexts. In TCC (2005), J. Kilian, Ed., vol. 3378 of LNCS, pp. 325-341.
4. Camenisch, J., and Michels, M. Proving in zero-knowledge that a number is the product of two safe primes. In EUROCRYPT'99 (1999), J. Stern, Ed., vol. 1592 of LNCS, pp. 107-122.
5. Camenisch, J., and Shoup, V. Practical verifiable encryption and decryption of discrete logarithms. In CRYPTO '03 (2003), vol. 2729 of LNCS, pp. 126-144.
6. Canetti, R., and Fischlin, M. Universally composable commitments. In CRYPTO '01 (2001), J. Kilian, Ed., vol. 2139 of LNCS, pp. 19-40.
7. Canetti, R., Goldreich, O., and Halevi, S. The random oracle methodology, revisited. Journal of the ACM 51, 4 (July 2004), 557-594.
8. Canetti, R., Lindell, Y., Ostrovsky, R., and Sahai, A. Universally composable two-party and multi-party secure computation. In STOC (2002), J. H. Reif, Ed., ACM Press, pp. 495-503.
9. Cramer, R., Gennaro, R., and Schoenmakers, B. A secure and optimally efficient multi- authority election scheme. In EUROCRYPT '97 (1997), W. Fumy, Ed., vol. 1233 of LNCS, pp. 103-118.
10. Damgård, I., and Nielsen, J. B. Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In CRYPTO '02 (2002), M. Yung, Ed., vol. 2442 of LNCS, pp. 581-596.
11. Freedman, M. J., Nissim, K., and Pinkas, B. Efficient private matching and set intersection. In EUROCRYPT '04 (2004), vol. 3027 of LNCS, pp. 1-19.
12. Goldreich, O., Micali, S., and Wigderson, A. How to play any mental game. In STOC (January 1987), ACM Press, pp. 218-229.
13. Groth, J., Ostrovsky, R., and Sahai, A. Perfect non-interactive zero knowledge for NP. In EUROCRYPT '06 (2006), vol. 4004, pp. 339-358.
14. Kiayias, A., and Mitrofanova, A. Testing disjointness of private datasets. In Financial Cryptography (2005), vol. 3570 of LNCS, pp. 109-124.
15. Kissner, L., and Song, D. Privacy-preserving set operations. In CRYPTO '05 (2005), V. Shoup, Ed., vol. 3621 of LNCS, pp. 241-257.
16. Micali, S., Rabin, M., and Kilian, J. Zero-knowledge sets. In Foundations of Computer Science - FOCS (2003), M. Sudan, Ed., IEEE Press, pp. 80-91.
17. Naor, M., and Pinkas, B. Oblivious transfer and polynomial evaluation. In STOC (May 1999), T. Leighton, Ed., ACM Press, pp. 245-254.
18. Paillier, P. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT '99 (1999), vol. 1592 of LNCS, pp. 223-238.
19. Paillier, P. Trapdooring discrete logarithms on elliptic curves over rings. In ASIACRYPT '00 (2000), T. Okamoto, Ed., vol. 1976 of LNCS, pp. 573-584.
20. Pedersen, T. P. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO '91 (1991), vol. 576 of LNCS, pp. 129-140.
21. Yamamura, A., and Saito, T. Private information retrieval based on the private information retrieval based on subgroup membership problem. In Australasian Conf. on Info. Security and Privacy (2001), vol. 2119 of LNCS, pp. 206-220.
22. Yao, A. C. How to generate and exchange secrets. In Foundations of Computer Science - FOCS (1986), IEEE Press, pp. 162-167.