Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model

2020 ◽  
pp. 433-463
Author(s):  
Sarvar Patel ◽  
Giuseppe Persiano ◽  
Kevin Yeo
Keyword(s):  
Lower Bounds ◽  
Searchable Encryption

scholarly journals Security-Efficiency Tradeoffs in Searchable Encryption

2019 ◽  
Vol 2019 (4) ◽  
pp. 132-151 ◽  
Author(s):  
Raphael Bost ◽  
Pierre-Alain Fouque
Keyword(s):  
Lower Bounds ◽  
Minimum Cost ◽  
Searchable Encryption ◽  
Search Queries ◽  
Trade Offs ◽  
Encryption Schemes ◽  
Security Properties ◽  
Client State ◽  
The Relationship

Abstract Besides their security, the efficiency of searchable encryption schemes is a major criteria when it comes to their adoption: in order to replace an unencrypted database by a more secure construction, it must scale to the systems which rely on it. Unfortunately, the relationship between the efficiency and the security of searchable encryption has not been widely studied, and the minimum cost of some crucial security properties is still unclear. In this paper, we present new lower bounds on the trade-offs between the size of the client state, the efficiency and the security for searchable encryption schemes. These lower bounds target two kinds of schemes: schemes hiding the repetition of search queries, and forward-private dynamic schemes, for which updates are oblivious. We also show that these lower bounds are tight, by either constructing schemes matching them, or by showing that even a small increase in the amount of leaked information allows for constructing schemes breaking the lower bounds.

Two Lower Bounds for Shortest Double-Base Number System

2015 ◽  
Vol E98.A (6) ◽  
pp. 1310-1312 ◽  
Author(s):  
Parinya CHALERMSOOK ◽  
Hiroshi IMAI ◽  
Vorapong SUPPAKITPAISARN
Keyword(s):  
Lower Bounds ◽  
Number System ◽  
Base Number ◽  
Double Base

Lower bounds on the dimension of the Rauzy gasket

2020 ◽  
Vol 148 (2) ◽  
pp. 321-327
Author(s):  
Rodolfo Gutiérrez-Romo ◽  
Carlos Matheus
Keyword(s):  
Lower Bounds

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers

10.37236/1188 ◽  
1994 ◽  
Vol 1 (1) ◽  
Author(s):  
Geoffrey Exoo
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Ramsey Numbers

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

Sign in / Sign up

Export Citation Format

Share Document