Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
From MaRDI portal
Publication:1631324
DOI10.1007/978-3-030-03810-6_7zbMath1430.94088OpenAlexW2885338459MaRDI QIDQ1631324
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_7
Related Items (1)
Cites Work
- A ciphertext-size lower bound for order-preserving encryption with limited leakage
- Random oracles and non-uniformity
- The Discrete Logarithm problem with preprocessing
- Cryptographic Assumptions: A Position Paper
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
- Structured Encryption and Controlled Disclosure
- Indistinguishability Obfuscation from Compact Functional Encryption
- Order-Preserving Symmetric Encryption
- A cryptanalytic time-memory trade-off
- Practical Order-Revealing Encryption with Limited Leakage
- Foundations of Cryptography
- Rigorous Time/Space Trade-offs for Inverting Functions
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
- Multi-input Functional Encryption
- Separating succinct non-interactive arguments from all falsifiable assumptions
- From Minicrypt to Obfustopia via Private-Key Functional Encryption
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
This page was built for publication: Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound