2/2016 - 2 |
Secure Multi-Keyword Search with User/Owner-side Efficiency in the CloudLEE, Y. , KIM, P. , PARK, Y. |
Extra paper information in |
Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF (1,453 KB) | Citation | Downloads: 1,130 | Views: 3,316 |
Author keywords
keyword search, encryption, data security, information security, security
References keywords
data(7), cloud(7), security(6), privacy(6), search(5), preserving(5), encrypted(5), text(4), secure(4), keyword(4)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2016-05-31
Volume 16, Issue 2, Year 2016, On page(s): 11 - 18
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2016.02002
Web of Science Accession Number: 000376996100002
SCOPUS ID: 84974851886
Abstract
As the amount of data in the cloud grows, ranked search system, the similarity of a query to data is ranked, are of significant importance. on the other hand, to protect privacy, searchable encryption system are being actively studied. In this paper, we present a new similarity-based multi-keyword search scheme for encrypted data. This scheme provides high flexibility in the pre- and post-processing of encrypted data, including splitting stem/suffix and computing from the encrypted index-term matrix, demonstrated to support Latent Semantic Indexing(LSI). On the client side, the computation and communication costs are one to two orders of magnitude lower than those of previous methods, as demonstrated in the experimental results. we also provide a security analysis of the proposed scheme. |
References | | | Cited By «-- Click to see who has cited this paper |
[1] L. M. Vaquero, L. Rodero-Merino, J. Caceres, and M. Lindner, "A Break in the Clouds: towards a Cloud Definition", ACM SIGCOMM Comput. Commun. Rev., vol. 39, no.1, pp. 50-55, 2009. [CrossRef] [2] S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing", Proc. IEEE INFOCOM, pp. 1-9, 2010. [CrossRef] [3] C. Wang, Q. Wang, K. Ren, and W. Lou, "Privacy-preserving Public auditing for Data Storage Security in Cloud Computing", Proc. IEEE INFOCOM, pp. 1-9, 2010. [CrossRef] [SCOPUS Times Cited 1122] [4] T. Yu, S. Jajodia, "Secure Data Management in Decentralized Systems." Advances in Information Security, vol. 33, pp. 355-380, Springer Press, 2007. [CrossRef] [5] H. Pang, X. Ding, and X. Xiao. "Embellishing Text Search Queries to Protect User Privacy." Proc. VLDB Endowment vol. 3.1/2, pp. 598-607, 2007. [CrossRef] [Web of Science Times Cited 28] [SCOPUS Times Cited 36] [6] D. Song, D. Wagner, and A. Perrig, "Practical Techniques for Searches on Encrypted Data", Proc. IEEE Security and Privacy, pp. 44-55, 2000. [CrossRef] [7] R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions", Proc. ACM Computer and Communication Security, pp. 79-88, 2006. [CrossRef] [SCOPUS Times Cited 1450] [8] M. Bellare, A. Boldyreva, and A. O'Neill, "Deterministic and Efficiently Searchable Encryption", Proc. Advances in Cryptology - CRYPTO, pp. 535-552, 2007. [CrossRef] [SCOPUS Times Cited 545] [9] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, "Searchable Encryption Revisited: Consistency properties, relation to Anonymous IBE, and Extensions", Journal of Cryptology, vol. 21, no. 3, pp. 350-391, 2008. [CrossRef] [Web of Science Times Cited 209] [SCOPUS Times Cited 272] [10] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, "Fuzzy Keyword Search over Encrypted Data in Cloud Computing", Proc. IEEE INFOCOM'10 Mini-Conference, pp. 1-5, San Diego, CA, USA, March 2010. [CrossRef] [SCOPUS Times Cited 776] [11] C. Wang, N. Cao, J. Li, K. Ren and W. Lou, "Secure Ranked Keyword Search over Encrypted Cloud Data", in Proc. ICDCS'10, pp.253-362, 2010. [CrossRef] [SCOPUS Times Cited 626] [12] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. "Privacy-preserving Multi-keyword Ranked Search over Encrypted Cloud Data", in Proc IEEE INFOCOM'11, pp.222-233, 2011. [CrossRef] [SCOPUS Times Cited 486] [13] Sun, W. et al. "Verifiable Privacy-Preserving Multi-keyword Text Search in the Cloud Supporting Similarity-based Ranking." IEEE Trans. on Parallel and Distributed Systems, in Press, 2013. [CrossRef] [Web of Science Times Cited 154] [SCOPUS Times Cited 209] [14] H. Pang, J. Shen, and R. Krishnan, "Privacy-Preserving Similarity-Based Text Retrieval", ACM Transactions on Internet Technology, vol. 10, no. 1, article #4, Feb. 2010. [CrossRef] [Web of Science Times Cited 37] [SCOPUS Times Cited 52] [15] S. T. Dumais, "Latent Semantic Indexing (LSI) and TREC-2", In Second Text REtrieval Conference (TREC2), D. Harman, ed., pp. 105-115, March 1994. [16] T. K. Landauer, D. S. McNamara, S. Dennis, and W. Kintsch, "Handbook of Latent Semantic Analysis," 1st edition, ISBN-13: 978-0805854183, pp. 293-322, Psychology Press, 2007. [17] M. Bellare, A. Boldyreva, L. Knudsen, and C. Namprempre, "Online ciphers and the hash-CBC construction", Proc. Advances in Cryptology - CRYPTO, 2001, pp.292-309, 2001. [CrossRef] [SCOPUS Times Cited 49] [18] A. Boldyreva, N. Chenette, Y. Lee, and A. O'Neill, "Order Preserving Symmetric Encryption", Proc. Advances in Cryptology - EUROCRYPT'09, pp. 224-241, 2009. [CrossRef] [SCOPUS Times Cited 672] [19] M. Bellare, "Practice-oriented provable-security", in Proc. Information Security. Springer Berlin Heidelberg, pp. 221-231, 1998. [CrossRef] [SCOPUS Times Cited 54] [20] W. Wong, D. W. Cheung, B. Kai, and N. Mamouolis, "Secure kNN computation on encrypted databases", Proc. ACM SIGMOD'09, pp. 139-152, 2009. [CrossRef] [SCOPUS Times Cited 806] Web of Science® Citations for all references: 428 TCR SCOPUS® Citations for all references: 7,155 TCR Web of Science® Average Citations per reference: 20 ACR SCOPUS® Average Citations per reference: 341 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-11-21 21:12 in 123 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.