Building an Encrypted, Distributed, and Searchable Key-value Store

被引:17
作者
Yuan, Xingliang [1 ,2 ]
Wang, Xinyu [1 ,2 ]
Wang, Cong [1 ,2 ]
Qian, Chen [3 ]
Lin, Jianxiong [1 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] City Univ Hong Kong, Shenzhen Res Inst, Shenzhen, Hong Kong, Peoples R China
[3] Univ Kentucky, Dept Comp Sci, Lexington, KY 40506 USA
来源
ASIA CCS'16: PROCEEDINGS OF THE 11TH ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY | 2016年
关键词
Key-value Store; Searchable Encryption;
D O I
10.1145/2897845.2897852
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Modern distributed key-value stores are offering superior performance, incremental scalability, and fine availability for data-intensive computing and cloud-based applications. Among those distributed data stores, the designs that ensure the confidentiality of sensitive data, however, have not been fully explored yet. In this paper, we focus on designing and implementing an encrypted, distributed, and searchable key-value store. It achieves strong protection on data privacy while preserving all the above prominent features of plaintext systems. We first design a secure data partition algorithm that distributes encrypted data evenly across a cluster of nodes. Based on this algorithm, we propose a secure transformation layer that supports multiple data models in a privacy-preserving way, and implement two basic APIs for the proposed encrypted key-value store. To enable secure search queries for secondary attributes of data, we leverage searchable symmetric encryption to design the encrypted secondary indexes which consider security, efficiency, and data locality simultaneously, and further enable secure query processing in parallel. For completeness, we present formal security analysis to demonstrate the strong security strength of the proposed designs. We implement the system prototype and deploy it to a cluster at Microsoft Azure. Comprehensive performance evaluation is conducted in terms of Put/Get throughput, Put/Get latency under different workloads, system scaling cost, and secure query performance. The comparison with Redis shows that our prototype can function in a practical manner.
引用
收藏
页码:547 / 558
页数:12
相关论文
共 30 条
[1]  
Aggarwal G., 2005, 2 BIENNIAL C INNOVAT
[2]  
[Anonymous], P EUROCRYPT
[3]   DEPSKY: Dependable and Secure Storage in a Cloud-of-Clouds [J].
Bessani, Alysson ;
Correia, Miguel ;
Quaresma, Bruno ;
Andre, Fernando ;
Sousa, Paulo .
ACM TRANSACTIONS ON STORAGE, 2013, 9 (04)
[4]  
Boldyreva A., 2011, P CRYPTO
[5]  
Cash D., 2014, P NDSS
[6]  
Cash D., 2015, P ACM CCS
[7]  
Chase M., 2010, P ASIACRYPT
[8]  
Chow S. S. M., 2009, P NDSS
[9]   Combining Fragmentation and Encryption to Protect Privacy in Data Storage [J].
Ciriani, Valentina ;
Di Vimercati, Sabrina De Capitani ;
Foresti, Sara ;
Jajodia, Sushil ;
Paraboschi, Stefano ;
Samarati, Pierangela .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2010, 13 (03)
[10]  
Cooper B.F., 2010, P ACM S CLOUD COMPUT, DOI 10.1145/1807128.1807152