Robust property-preserving hash functions for Hamming distance and more
From MaRDI portal
Publication:2056796
DOI10.1007/978-3-030-77883-5_11zbMath1497.94089OpenAlexW3096246760MaRDI QIDQ2056796
Mark Simkin, Nils Fleischhacker
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_11
Related Items (3)
Property-preserving hash functions for Hamming distance from standard assumptions ⋮ Nearly optimal property preserving hashing ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The communication complexity of threshold private set intersection
- Correlated-Input Secure Hash Functions
- Sparse and Lopsided Set Disjointness via Information Theory
- Bloom Filters in Adversarial Environments
- Set reconciliation with nearly optimal communication complexity
- Cuckoo hashing
- Advances in Cryptology - EUROCRYPT 2004
- How robust are linear sketches to adaptive inputs?
- Space/time trade-offs in hash coding with allowable errors
This page was built for publication: Robust property-preserving hash functions for Hamming distance and more
