Title
Practical Backward-Secure Searchable Encryption from Symmetric Puncturable Encryption.
Abstract
Symmetric Searchable Encryption (SSE) has received wide attention due to its practical application in searching on encrypted data. Beyond search, data addition and deletion are also supported in dynamic SSE schemes. Unfortunately, these update operations leak some information of updated data. To address this issue, forward-secure SSE is actively explored to protect the relations of newly updated data and previously searched keywords. On the contrary, little work has been done in backward security, which enforces that search should not reveal information of deleted data. In this paper, we propose the first practical and non-interactive backward-secure SSE scheme. In particular, we introduce a new form of symmetric encryption, named symmetric puncturable encryption (SPE), and construct a generic primitive from simple cryptographic tools. Based on this primitive, we then present a backward-secure SSE scheme that can revoke a server's searching ability on deleted data. We instantiate our scheme with a practical puncturable pseudorandom function and implement it on a large dataset. The experimental results demonstrate its efficiency and scalability. Compared to the state-of-the-art, our scheme achieves a speedup of almost 50x in search latency, and a saving of 62% in server storage consumption.
Year
DOI
Venue
2018
10.1145/3243734.3243782
ACM Conference on Computer and Communications Security
Keywords
Field
DocType
Symmetric Searchable Encryption, Puncturable Encryption, Backward Security
Pseudorandom function family,Symmetric-key algorithm,Latency (engineering),Computer security,Cryptography,Computer science,Computer network,Encryption,Speedup,Scalability
Conference
ISBN
Citations 
PageRank 
978-1-4503-5693-0
6
0.43
References 
Authors
23
7
Name
Order
Citations
PageRank
Shifeng Sun15915.53
Xingliang Yuan217125.91
Joseph K. Liu3113467.24
Ron Steinfeld4237.99
Amin Sakzad5505.14
Viet Vo660.43
Surya Nepal71486186.76