Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
From MaRDI portal
Publication:5199214
DOI10.1007/978-3-642-22792-9_33zbMath1290.94045OpenAlexW2163992091MaRDI QIDQ5199214
Nathan Chenette, Alexandra Boldyreva, Adam O'Neill
Publication date: 12 August 2011
Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_33
Related Items (22)
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 ⋮ Verifiable Range Query Processing for Cloud Computing ⋮ Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries ⋮ Efficient multi-client order-revealing encryption and its applications ⋮ Research on quantum authentication methods for the secure access control among three elements of cloud computing ⋮ Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security ⋮ Efficient request-based comparable encryption scheme based on sliding window method ⋮ Practical Attacks on Relational Databases Protected via Searchable Encryption ⋮ MDOPE: efficient multi-dimensional data order preserving encryption scheme ⋮ Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation ⋮ Approximate distance-comparison-preserving symmetric encryption ⋮ An Almost Non-interactive Order Preserving Encryption Scheme ⋮ CPP: towards comprehensive privacy preserving for query processing in information networks ⋮ Enabling Compressed Encryption for Cloud Based Big Data Stores ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Processing secure, verifiable and efficient SQL over outsourced database ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Semi-order preserving encryption ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination
This page was built for publication: Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions