Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
type: Item
instance of: scholarly article
title: Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
zbMATH Open document ID: 1503.94042
DOI: 10.1007/978-3-030-56784-2_15
author: Sarvar Patel
author: Giuseppe Persiano
author: Kevin Yeo
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614547
zbMATH Keywords: leakage cell probe model
zbMATH Keywords: global key-equality patter
describes a project that uses: CryptDB
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 15
OpenAlex ID: W3048898007
cites work: OptORAMa: optimal oblivious RAM
cites work: Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
cites work: Tight tradeoffs in searchable symmetric encryption
cites work: Deterministic and Efficiently Searchable Encryption
cites work: Order-Preserving Symmetric Encryption
cites work: Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation
cites work: Is there an oblivious RAM lower bound?
cites work: Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
cites work: The Locality of Searchable Symmetric Encryption
cites work: Structured Encryption and Controlled Disclosure
cites work: Searchable encryption with optimal locality: achieving sublogarithmic read efficiency
cites work: Dynamic Perfect Hashing: Upper and Lower Bounds
cites work: TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
cites work: Fully homomorphic encryption using ideal lattices
cites work: Software protection and simulation on oblivious RAMs
cites work: Multi-key searchable encryption, revisited
cites work: Stronger lower bounds for online ORAM
cites work: Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity
cites work: SQL on structurally-encrypted databases
cites work: Computationally volume-hiding structured encryption
cites work: Structured encryption and leakage suppression
cites work: The cell probe complexity of dynamic range counting
cites work: Yes, there is an oblivious RAM lower bound!
cites work: Lower bounds for multi-server oblivious RAMs
cites work: Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds
cites work: Lower bounds for differentially private RAMs
cites work: Logarithmic Lower Bounds in the Cell-Probe Model
cites work: Is there an oblivious RAM lower bound for online reads?
cites work: Should Tables Be Sorted?
Recommended article: Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
Recommended article: A ciphertext-size lower bound for order-preserving encryption with limited leakage
Recommended article: Lower bounds for leakage-resilient secret sharing
Recommended article: Low-Leakage Secure Search for Boolean Expressions
Recommended article: Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
Recommended article: Limits of a conjecture on a leakage-resilient cryptosystem
Recommended article: Leakage-Resilient Inner-Product Functional Encryption in the Bounded-Retrieval Model
Recommended article: Efficient Boolean search over encrypted data with reduced leakage
Recommended article: Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
description: scientific article; zbMATH DE number 7614547