Approximate distance-comparison-preserving symmetric encryption
From MaRDI portal
Publication:6134814
DOI10.1007/978-3-031-14791-3_6zbMath1518.94062MaRDI QIDQ6134814
Nathan Hauke, Adam O'Neill, Riddhi Ghosal, Georg Fuchsbauer
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls
- Parameter-hiding order revealing encryption
- Revealing encryption for partial ordering
- Function-revealing encryption (definitions and constructions)
- Distributed differential privacy via shuffling
- The privacy blanket of the shuffle model
- Property Preserving Symmetric Encryption Revisited
- Property Preserving Symmetric Encryption
- Order-Preserving Encryption Secure Beyond One-Wayness
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Structured Encryption and Controlled Disclosure
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Differential Privacy: A Survey of Results
- Deterministic and Efficiently Searchable Encryption
- Order-Preserving Symmetric Encryption
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Practical Order-Revealing Encryption with Limited Leakage
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
- Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
- Approximate distance-comparison-preserving symmetric encryption