Order-preserving encryption revisited: improved security analysis and alternative solutions
From MaRDI portal
Recommendations
Cited in
(35)- Impossibility of order-revealing encryption in idealized models
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- Parameter-hiding order revealing encryption
- Security of stateful order-preserving encryption
- On the average cost of order-preserving encryption based on hypergeometric distribution
- Processing secure, verifiable and efficient SQL over outsourced database
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Efficient multi-client order-revealing encryption and its applications
- Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security
- An efficiently searchable encrypted data structure for range queries
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- CPP: towards comprehensive privacy preserving for query processing in information networks
- Semi-order preserving encryption
- Research on quantum authentication methods for the secure access control among three elements of cloud computing
- Efficient request-based comparable encryption scheme based on sliding window method
- Order-revealing encryption and the hardness of private learning
- Request-based comparable encryption
- Order-Preserving Encryption Secure Beyond One-Wayness
- Enabling compressed encryption for cloud based big data stores
- Order-Preserving Symmetric Encryption
- Practical order-revealing encryption with limited leakage
- An improved negative binomial approximation with high accuracy to the negative hypergeometric probability for order-preserving encryption
- Verifiable Range Query Processing for Cloud Computing
- Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries
- Ad hoc PSM protocols: secure computation without coordination
- Short comparable encryption
- Data and Applications Security XIX
- Practical Attacks on Relational Databases Protected via Searchable Encryption
- MDOPE: efficient multi-dimensional data order preserving encryption scheme
- Approximate distance-comparison-preserving symmetric encryption
- An Almost Non-interactive Order Preserving Encryption Scheme
- On the security of frequency-hiding order-preserving encryption
- Parameter-hiding order-revealing encryption without pairings
- Tight bounds for monotone minimal perfect hashing
This page was built for publication: Order-preserving encryption revisited: improved security analysis and alternative solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199214)