Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
From MaRDI portal
Publication:2948396
DOI10.1007/978-3-662-46803-6_19zbMATH Open1375.94105OpenAlexW754106230MaRDI QIDQ2948396FDOQ2948396
Authors: Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, Joe Zimmerman 
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
Recommendations
Cited In (41)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Order-Preserving Encryption Secure Beyond One-Wayness
- Approximate distance-comparison-preserving symmetric encryption
- Finding one common item, privately
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors
- Multi-key and multi-input predicate encryption from learning with errors
- Multi-input inner-product functional encryption from pairings
- 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
- Impossibility of order-revealing encryption in idealized models
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Multilinear maps from obfuscation
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Function-revealing encryption (definitions and constructions)
- Order-revealing encryption and the hardness of private learning
- How to avoid obfuscation using witness PRFs
- From Minicrypt to Obfustopia via private-key functional encryption
- Breaking the sub-exponential barrier in obfustopia
- Practical order-revealing encryption with limited leakage
- A survey on functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Multilinear maps from obfuscation
- Efficient multi-client order-revealing encryption and its applications
- Compact \textsf{FE} for unbounded attribute-weighted sums for logspace from \textsf{SXDH}
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Functional encryption: deterministic to randomized functions from simple assumptions
- Ad hoc PSM protocols: secure computation without coordination
- Secure Obfuscation in a Weak Multilinear Map Model
- Parameter-hiding order-revealing encryption without pairings
- From cryptomania to obfustopia through secret-key functional encryption
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting
- An Almost Non-interactive Order Preserving Encryption Scheme
- Enabling compressed encryption for cloud based big data stores
- CDPS: a cryptographic data publishing system
- Two-party decision tree training from updatable order-revealing encryption
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security
This page was built for publication: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948396)
