Parameter-hiding order revealing encryption

DOI10.1007/978-3-030-03326-2_7zbMath1440.68055OpenAlexW2885967006MaRDI QIDQ1633450

David Cash, Adam O'Neill, Feng-Hao Liu, Cong Zhang, Mark Zhandry

Publication date: 20 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_7

zbMATH Keywords

order-revealing encryptionprimitive for outsourcing encrypted databases

Mathematics Subject Classification ID

Database theory (68P15) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Efficient multi-client order-revealing encryption and its applications ⋮ Approximate distance-comparison-preserving symmetric encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfectly secure oblivious parallel RAM
• Memory lower bounds of reductions revisited
• Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
• Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs
• Simple and efficient two-server ORAM
• More is less: perfectly secure oblivious algorithms in the multi-server setting
• Improved (almost) tightly-secure structure-preserving signatures
• Perfectly secure oblivious RAM with sublinear bandwidth overhead
• Sub-logarithmic distributed oblivious RAM with small block size
• Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM
• Compactly Hiding Linear Spans
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Oblivious RAMs without cryptogrpahic assumptions
• Tightly Secure Signatures and Public-Key Encryption
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• The Kernel Matrix Diffie-Hellman Assumption
• Perfectly Secure Oblivious RAM without Random Oracles
• Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Securing threshold cryptosystems against chosen ciphertext attack
• Software protection and simulation on oblivious RAMs
• Path ORAM
• Distributed Oblivious RAM for Secure Two-Party Computation
• Advances in Cryptology – CRYPTO 2004
• Why Proving HIBE Systems Secure Is Difficult
• Asymptotically Tight Bounds for Composing ORAM with PIR

This page was built for publication: Parameter-hiding order revealing encryption