2014 Twelfth Annual International Conference on Privacy, Security and Trust 2014
DOI: 10.1109/pst.2014.6890956
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Searchable Symmetric Encryption

Abstract: Abstract-Searchable Symmetric Encryption (SSE) allows a client to store encrypted data on a storage provider in such a way, that the client is able to search and retrieve the data selectively without the storage provider learning the contents of the data or the words being searched for. Practical SSE schemes usually leak (sensitive) information during or after a query (e.g., the search pattern). Secure schemes on the other hand are not practical, namely they are neither efficient in the computational search co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(15 citation statements)
references
References 26 publications
0
15
0
Order By: Relevance
“…A number of attacks (e.g., [16], [25], [26], [27], [28]) have been demonstrated. Several DSSE schemes have been proposed to deal with such leakages (e.g., [29], [30]) but they are neither efficient nor provably secure. ORAM techniques (e.g., [19]) can hide search and access patterns in DSSE.…”
Section: Related Workmentioning
confidence: 99%
“…A number of attacks (e.g., [16], [25], [26], [27], [28]) have been demonstrated. Several DSSE schemes have been proposed to deal with such leakages (e.g., [29], [30]) but they are neither efficient nor provably secure. ORAM techniques (e.g., [19]) can hide search and access patterns in DSSE.…”
Section: Related Workmentioning
confidence: 99%
“…Encryption schemes supporting queries on ciphertext are called searchable encryption (SE) schemes, which have two different types of research roadmap. One is searchable symmetric encryption (SSE) [6][7][8][9][10][11][12]. The other is public key encryption with keyword search (PEKS) [13][14][15][16].…”
Section: Related Work Querying On Encrypted Data Is a Long-termmentioning
confidence: 99%
“…The server computes the addresses of DictW entries to be accessed as h(K w , i||0) and the respective values for unmasking the entries as h(K w , i||1), for 1 ≤ i ≤ n w . Once the file identifiers are found, the server returns the respective files to the client and deletes 1 the referenced DictW entries (lines [3][4][5][6].…”
Section: Protocolsmentioning
confidence: 99%