Property-preserving hash functions for Hamming distance from standard assumptions
From MaRDI portal
Publication:2170070
DOI10.1007/978-3-031-07085-3_26zbMath1497.94088arXiv2106.06453OpenAlexW4285134895MaRDI QIDQ2170070
Mark Simkin, Kasper Green Larsen, Nils Fleischhacker
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2106.06453
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Nearly optimal property preserving hashing ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- On data structures and asymmetric communication complexity
- Robust property-preserving hash functions for Hamming distance and more
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Hardness of SIS and LWE with Small Parameters
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Bloom Filters in Adversarial Environments
- A Framework for Adversarially Robust Streaming Algorithms
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
- How robust are linear sketches to adaptive inputs?
- Space/time trade-offs in hash coding with allowable errors
- Compressed sensing
This page was built for publication: Property-preserving hash functions for Hamming distance from standard assumptions
