Cryptographically Secure Bloom-Filters

Authors:
Ryo Nojima;Youki Kadobayashi
Affiliations:
National Institute of Information and Communications Technology (NICT)/ 4-2-1 Nukuikitamachi/ Koganei/ Tokyo 184-8795/ Japan. e-mail: ryo-no@nict.go.jp;Nara Institute of Science of Technology (NAIST)/ 8916-5 Takayamacho/ Ikoma/ Nara 630-0192/ Japan. e-mail:
Venue:
Transactions on Data Privacy
Year:
2009

Citing 8
Cited 2

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme

FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Keyword search and oblivious pseudorandom functions

TCC'05 Proceedings of the Second international conference on Theory of Cryptography

Public-key encrypted bloom filters with applications to supply chain integrity

DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
"Better than nothing" privacy with bloom filters: to what extent?

PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a privacy-preserving variant of Bloom-filters. The Bloom-filter has many applications such as hash-based IP-traceback systems and Web cache sharing. In some of those applications, equipping the Bloom-filter with the privacy-preserving mechanism is crucial for the deployment. In this paper, we propose a cryptographically secure privacy-preserving Bloom-filter protocol. We propose such two protocols based on blind signatures and oblivious pseudorandom functions, respectively. To show that the proposed protocols are secure, we provide a reasonable security definition and prove the security.