Probabilistic Properties of the Spatial Bloom Filters and Their Relevance to Cryptographic Protocols

@article{Calderoni2018ProbabilisticPO,
  title={Probabilistic Properties of the Spatial Bloom Filters and Their Relevance to Cryptographic Protocols},
  author={Luca Calderoni and Paolo Palmieri and Dario Maio},
  journal={IEEE Transactions on Information Forensics and Security},
  year={2018},
  volume={13},
  pages={1710-1721}
}
The classical Bloom filter data structure is a crucial component of hundreds of cryptographic protocols. It has been used in privacy preservation and secure computation settings, often in conjunction with the (somewhat) homomorphic properties of ciphers such as Paillier’s. In 2014, a new data structure extending and surpassing the capabilities of the classical Bloom filter has been proposed. The new primitive, called spatial Bloom filter (SBF) retains the hash-based membership-query design of… 
View on IEEE
cora.ucc.ie
8 Citations
Background Citations
3
Methods Citations
3

Figures and Tables from this paper

8 Citations

Citation Type

Citation Type

Bloom filter variants for multiple sets: a comparative assessment
TLDR
The comparison of two probabilistic data structures for association queries derived from the well-known Bloom filter shows that the ShBF provides better space efficiency, but at a significantly higher computational cost than the SBF.
Dual-load Bloom filter: Application for name lookup
An Analysis of Enrollment and Query Attacks on Hierarchical Bloom Filter-Based Biometric Systems
TLDR
HBF-based biometric system security under well-defined attack vectors is evaluated and it is concluded that the framework is more difficult to attack than the classical Bloom Filter and that soft biometric information is kept private.
Spatial bloom filter in named data networking: a memory efficient solution
TLDR
A new data structure is proposed to support the NDN forwarding procedure by replacing the current Forwarding Information Base (FIB): the Spatial Bloom Filter (SBF), a probabilistic data structure that guarantees fast lookup and efficient memory consumption.
Privacy preservation in outsourced mobility traces through compact data structures
A privacy-preserving protocol for indoor wi-fi localization
TLDR
This paper presents a privacy-preserving cryptographic protocol for indoor Wi-Fi localization, that prevents the SP from learning the exact location of the user outside of certain pre-defined sensitive areas, while keeping the SP's database secure.
Ethics-aware Data Governance (Vision Paper)
TLDR
A comprehensive checklist of ethical desiderata for data protection and processing needs to be developed, along with methods and techniques to ensure and verify that these ethically motivated requirements and related legal norms are fulfilled throughout the data selection and exploration processes.
Side Channel Attacks vs Approximate Computing
TLDR
This paper focuses on the problem of side channel attacks, and discusses how they can be different when carried out in approximated circuits.

References

SHOWING 1-10 OF 14 REFERENCES
Location privacy without mutual trust: The spatial Bloom filter
Privacy-Enhanced Searches Using Encrypted Bloom Filters
TLDR
This work proposes a search scheme based on Bloom filters and group ciphers such as Pohlig-Hellman encryption that can transform one party’s search queries to a form suitable for querying the other party's database, in such a way that neither the third party nor the database owner can see the original query.
Bloom filter applications in network security: A state-of-the-art survey
Privacy-preserving record linkage using Bloom filters
TLDR
A new protocol for privacy-preserving record linkage with encrypted identifiers allowing for errors in identifiers has been developed, based on Bloom filters on q-grams of identifiers, which yields linkage results comparable to non-encrypted identifiers and superior to results from phonetic encodings.
Space/time trade-offs in hash coding with allowable errors
TLDR
Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications
TLDR
This paper provides two multi-party protocols for privacy-preserving computation of location information, based on the known homomorphic properties of public key encryption schemes, which keep the user’s exact position private, but allow the provider of the service to learn when the user is close to specific points of interest, or inside predefined areas.
A new analysis of the false positive rate of a Bloom filter
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
TLDR
A new trapdoor mechanism is proposed and three encryption schemes are derived : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA, which are provably secure under appropriate assumptions in the standard model.
Enabling mutually private location proximity services in smart cities: A comparative assessment
TLDR
This work analyzes three encryption based approaches that provide granular proximity detection without openly divulging any location information and compares the security and privacy guarantees, and the efficiency and accuracy of each approach.
Private inter-network routing for Wireless Sensor Networks and the Internet of Things
TLDR
A protocol achieving anonymous routing between different interconnected IoT or WSN networks, based on the Spatial Bloom Filter (SBF) data structure is proposed, which preserves context privacy, and prevents adversaries from learning the network structure and topology.
...
1
2
...