An efficient bloom filter based solution for multiparty private matching

Proceedings of The 2006 International Conference on Security and Management, SAM'06

Volumn , Issue , 2006, Pages

  Lai, Pierre K Y ^a   Yiu, S M ^a   Chow, K P ^a   Chong, C F ^a   Hui, Lucas C K ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Bloom filter; Database operation; Multiparty matching; Privacy

Indexed keywords

BLOOM FILTER; DATABASE OPERATION; FALSE POSITIVES; FILTER-BASED; FUNDAMENTAL PROBLEMS; MULTIPARTY MATCHING; ONLINE COLLABORATIONS; PRIVACY; TRUSTED THIRD PARTIES;

BLOOMS (METAL);

EID: 66149159225     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. th Annual Symposium on the Theory of Computing (STOC), ACM, 1987, pp. 218-229.
2. M. Ben-Or, S. Goldwasser and A. Wigderson. "Completeness theorems for non cryptographic fault tolerant distributed computation". Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), ACM, 1988, pp. 1-9.
3. D. Chaum, C. Crepeau and I. Damgard. "Multiparty unconditionally secure protocols". Proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), ACM, 1988, pp. 11-19.
4. M. Naor and B. Pinkas. "Oblivious Transfer and Polynomial Evaluation". In Proc. of the 31th ACM Symposium on Theory of Computing, pages 245-254, Atlanta, Georgia, 1999.
5. M. Freedman, K. Nissim and B. Pinkas. "Efficient Private Matching and Set Intersection". In Advances in Cryptology - Eurocrypt '2004 Proceedings, LNCS 3027, Springer-Verlag, pp. 1-19, May 2004.
6. G. Schadow, S. J. Grannis, and C. J. McDonald, "Privacy-preserving distributed queries for a clinical case research network", in IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, Maebshi City, Japan. Conferences in Research and Practice in Information Technilogy, Vol.14. C. Clifton and V. Estivill-Castro, Eds.
7. B. Bloom. "Space/time trade-offs in hash coding with allowable errors". Communications of the ACM, 13(7):422-426, Jul 1970.
8. L. Fan, P. Cao, J. Almeida, and A. Broder. "Summary cache: a scalable wide-area Web cache sharing protocol". IEEE/ACM Transactions on Networking, 8(3):281-293, Jun 2000.
9. R. Agrawal, A. Evfimievski, and R. Srikant. "Information sharing across private databases". In Proceedings of the 2003 ACM SIGMOD Int'l Conf. on Management of Data, San Diego, CA, 2003.
10. L. Yaping, J.D. Tygar, and J. M. Hellerstein, "Private Matching". Proceedings of the 30th VLDB Conference, Toronto, Canada, 2004.