Approximate distance-comparison-preserving symmetric encryption
From MaRDI portal
Publication:6134814
Recommendations
Cites work
- scientific article; zbMATH DE number 3850307 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- Amplification by shuffling: from local to central differential privacy via anonymity
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Approximate distance-comparison-preserving symmetric encryption
- Deterministic and Efficiently Searchable Encryption
- Differential Privacy: A Survey of Results
- Distributed differential privacy via shuffling
- Function-revealing encryption (definitions and constructions)
- On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls
- Order-Preserving Encryption Secure Beyond One-Wayness
- Order-Preserving Symmetric Encryption
- Order-preserving encryption revisited: improved security analysis and alternative solutions
- Parameter-hiding order revealing encryption
- Practical order-revealing encryption with limited leakage
- Practical sketching algorithms for low-rank matrix approximation
- Property preserving symmetric encryption
- Property preserving symmetric encryption revisited
- Revealing encryption for partial ordering
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- Structured encryption and controlled disclosure
- The privacy blanket of the shuffle model
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)