Cryptographically secure bloom-filters

Transactions on Data Privacy

Volumn 2, Issue 2, 2009, Pages 131-139

  Nojima, Ryo ^a   Kadobayashi, Youki ^b  

^a NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BLIND SIGNATURES; PRIVACY PRESERVING; PSEUDO-RANDOM FUNCTIONS; SECURITY DEFINITIONS; TRACEBACK; WEB CACHE SHARING;

BLOOMS (METAL); INTERNET PROTOCOLS;

NETWORK SECURITY;

EID: 78651538727     PISSN: 18885063     EISSN: 20131631     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. S.M. Bellovin, W.R. Cheswick, Privacy-Enhanced Searches Using Encrypted Bloom Filters, Cryptology ePrint Archive, 2004/022.
2. M. Bellare, C. Namprempre, D. Pointcheval, M. Semanko, The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme, Financial Cryptography 2001, pp.309-328, 2001.
3. M. Bellare, P. Rogaway, Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, ACM Conference on Computer and Communications Security 1993, pp.62-73, 1993.
4. B.H. Bloom, Space/time Trade-offs inHash Coding with Allowable Errors, Communication of the ACM 13(7), pp.422-427, 1970.
5. A. Boldyreva, Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie- Hellman-Group Signature Scheme, Public Key Cryptography 2003, pp.31-46, 2003.
6. A. Broder, M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Math, Volume 1, Number 4 (2003), 485-509.
7. J. Camenisch, G. Neven, A. Shelat, Simulatable Adaptive Oblivious Transfer, EUROCRYPT 2007, pp.573-590, 2007.
8. D. Chaum, Blind Signature for Untraceable Payments, CRYPTO 1982, pp.199-203, 1983.
9. M.J. Freedman, Y. Ishai, B. Pinkas, O. Reingold, Keyword Search and Oblivious Pseudorandom Functions, TCC 2005, pp.303-324, 2005.
10. M.J. Freedman, K. Nissim, B. Pinkas, Efficient Private Matching and Set Intersection, EUROCRYPT 2004, pp.1-19, 2004.
11. O. Goldreich, Foundations of Cryptography II: Basic Applications, Cambridge University Press, 2004.
12. C. Hazay, Y. Lindell, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, TCC 2008, pp.155-175, 2008.
13. E.J. Goh, Secure Indexes, Cryptology ePrint Archive, 2003/216.
14. W. Ogata, K. Kurosawa, Oblivious Keyword Search, J. Complexity 20(2-3), pp.356-371, 2004.