Approximate distance-comparison-preserving symmetric encryption
From MaRDI portal
Publication:6134814
DOI10.1007/978-3-031-14791-3_6zbMATH Open1518.94062MaRDI QIDQ6134814FDOQ6134814
Authors: Georg Fuchsbauer, Riddhi Ghosal, Nathan Hauke, Adam O'Neill
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Differential Privacy: A Survey of Results
- Title not available (Why is that?)
- Title not available (Why is that?)
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls
- Deterministic and Efficiently Searchable Encryption
- Structured encryption and controlled disclosure
- Function-revealing encryption (definitions and constructions)
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Order-Preserving Symmetric Encryption
- Practical order-revealing encryption with limited leakage
- Order-preserving encryption revisited: improved security analysis and alternative solutions
- Parameter-hiding order revealing encryption
- Revealing encryption for partial ordering
- Practical sketching algorithms for low-rank matrix approximation
- Distributed differential privacy via shuffling
- The privacy blanket of the shuffle model
- Amplification by shuffling: from local to central differential privacy via anonymity
- Order-Preserving Encryption Secure Beyond One-Wayness
- Property preserving symmetric encryption revisited
- Property preserving symmetric encryption
- Approximate distance-comparison-preserving symmetric encryption
Cited In (3)
This page was built for publication: Approximate distance-comparison-preserving symmetric encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134814)