Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
From MaRDI portal
Publication:2948396
DOI10.1007/978-3-662-46803-6_19zbMath1375.94105OpenAlexW754106230MaRDI QIDQ2948396
Amit Sahai, Mariana Raykova, Kevin Lewi, Joe Zimmerman, Dan Boneh, Mark Zhandry
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_19
Related Items (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 ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Efficient multi-client order-revealing encryption and its applications ⋮ Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security ⋮ CDPS: a cryptographic data publishing system ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Multilinear maps from obfuscation ⋮ Multi-key and multi-input predicate encryption from learning with errors ⋮ Multiparty non-interactive key exchange and more from isogenies on elliptic curves ⋮ Approximate distance-comparison-preserving symmetric encryption ⋮ Finding one common item, privately ⋮ An Almost Non-interactive Order Preserving Encryption Scheme ⋮ A survey on functional encryption ⋮ Enabling Compressed Encryption for Cloud Based Big Data Stores ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Multi-input Inner-Product Functional Encryption from Pairings ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Order-Revealing Encryption and the Hardness of Private Learning ⋮ Multilinear Maps from Obfuscation ⋮ How to Avoid Obfuscation Using Witness PRFs ⋮ Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits ⋮ Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 ⋮ Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting ⋮ Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Ad Hoc PSM Protocols: Secure Computation Without Coordination
This page was built for publication: Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
