Verifiable top-k searchable encryption for cloud data

被引:4
作者
Elizabeth, B. Lydia [1 ]
Prakash, A. John [2 ]
机构
[1] Anna Univ, Dept Informat Technol, Chennai, Tamil Nadu, India
[2] Anna Univ, Ramanujan Comp Ctr, Chennai, Tamil Nadu, India
来源
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES | 2019年 / 45卷 / 01期
关键词
Secure cloud storage; searchable encryption; dynamic search; verifiable search; top-k search; KEYWORD RANKED SEARCH; OUTSOURCED DATABASE; SECURE; EFFICIENT;
D O I
10.1007/s12046-019-1227-5
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
With the proliferation of data and the appealing features of cloud computing, the data owners are motivated to outsource their data to the public cloud. Privacy and security, especially for sensitive data, are still a concern, as the data owners have no physical control over the outsourced data. To ensure confidentiality, sensitive data is encrypted before outsourcing to the cloud, which obsoletes the data utilization using traditional keyword-based search. To address this issue, a verifiable top-k searchable encryption for cloud data (VSED) is proposed with provisions for dynamic update operations like addition and deletion of documents. Specifically, an encrypted inverted index is constructed using a secret orthogonal vector and partial homomorphic encryption. To support the ranked search, the widely used term frequency and inverse document frequency rule is used to find the top-k documents. To verify the query results returned by the cloud server, this scheme provides a verifiable search using keyed hashes. Security analysis demonstrates that the proposed scheme is semantically secure, with correctness and privacy guarantees proved in the standard security simulation model. Simulations performed on real-world dataset demonstrate that the proposed scheme is efficient and practical.
引用
收藏
页数:16
相关论文
共 46 条
[1]  
AGAIAN SS, 1985, LECT NOTES MATH, V1168, P1
[2]  
[Anonymous], 2013, Financial Cryptography Data Security
[3]  
[Anonymous], 2013, PROC ADV SCI TECHNOL
[4]  
Armbrust M, 2009, 2813 UCBEECS
[5]   Sorting and Searching Behind the Curtain [J].
Baldimtsi, Foteini ;
Ohrimenko, Olga .
Financial Cryptography and Data Security (FC 2015), 2015, 8975 :127-146
[6]  
Basu A, 2014, P 29 ANN ACM S APPL, P1706
[7]  
Bellare M, 1993, P 1 ACM C COMP COMM, P62, DOI [DOI 10.1145/168588.168596, 10.1145/168588.168596]
[8]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[9]   A Survey of Provably Secure Searchable Encryption [J].
Bosch, Christoph ;
Hartel, Pieter ;
Jonker, Willem ;
Peter, Andreas .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[10]   Universally composable security: A new paradigm for cryptographic protocols [J].
Canetti, R .
42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :136-145