Volume 17, Issue 4 (2-2021)                   JSDP 2021, 17(4): 123-138 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

soleimanian A, Khazaei S. Fuzzy retrieval of encrypted data by multi-purpose data-structures. JSDP. 2021; 17 (4) :123-138
URL: http://jsdp.rcisp.ac.ir/article-1-901-en.html
Department of Mathematics and Computer Science, Kharazmi University
Abstract:   (257 Views)
The growing amount of information that has arisen from emerging technologies has caused organizations to face challenges in maintaining and managing their information. Expanding hardware, human resources, outsourcing data management, and maintenance an external organization in the form of cloud storage services, are two common approaches to overcome these challenges; The first approach costs of the organization is only a temporary solution. By contrast, the cloud storage services approach allows the organization to pay only a small fee for the space actually in use (rather than the total reserved capacity) and always has access to the data and management tools with the most up-to-date mechanisms available. Despite the benefits of cloud storage services, security challenges arise because the organization's data is stored and managed outside of the most important organization’s supervision. One challenge is confidentiality protection of outsourced data. Data encryption before outsourcing can overcome this challenge, but common encryption schemes may fail to support various functionalities in the cloud storage service. One of the most widely used functionalities in cloud storage services is secure keyword search on the encrypted documents collection. Searchable encryption schemes, enable users to securely search over encrypted data. Based on the users’ needs, derivatives of this functionality have recently been considered by researchers. One of these derivatives is ranked search that allows the server to extract results based on their similarity to the searched keyword. This functionality reduces the communication overheads between the cloud server and the owner organization, as well as the response time for the search. In this paper, we focus on the ranked symmetric searchable encryption schemes. In this regard, we review structures proposed in the symmetric searchable encryption schemes, and show that these two data structures have capabilities beyond their original design goal. More precisely, we show that by making the data structures, it is possible to support secure ranked search efficiently. In addition, by small changes on these data, we present two ranked symmetric searchable encryption schemes for single keyword search and Boolean structures which introduced-keyword search based on the data.
Full-Text [PDF 5854 kb]   (61 Downloads)    
Type of Study: بنیادی | Subject: Paper
Received: 2018/09/23 | Accepted: 2019/09/2 | Published: 2021/02/22 | ePublished: 2021/02/22

1. [1] F. Baldimtsi, O. Ohrimenko, ''Sorting and Searching Behind the Curtain,'' Lecture Notes in Computer Science, FC 2015, Berlin. No.8975. pp. 127-146, 2015. [DOI:10.1007/978-3-662-47854-7_8]
2. [2] A. Boldyreva, N. Chenette, '' Efficient fuzzy search on encrypted data'', FSE 2014, UK. pp. 613-633, 2014. [DOI:10.1007/978-3-662-46706-0_31]
3. [3] R. Bost, B. Minaud, O. Ohrimenko, ''Forward and Backward Private Searchable Encryption from Constrained Cryptographic Primitives'', pp. 1465-1482, 2017. [DOI:10.1145/3133956.3133980]
4. [4] N. Cao, C. Wang, M. Li, K. Ren, W. Lou, ''Privacy-preserving multi-keyword ranked search over encrypted cloud data'', IEEE Trans. Parallel Distrib, vol. 25(1), pp. 222-233, 2014. [DOI:10.1109/TPDS.2013.45]
5. [5] D. Cash, J. Jaeger, S. Jarecki, C.S. Jutla, H. Krawczyk, M. Rosu, M. Steiner, ''Dynamic searchable encryption in very-large databases: Data structures and implementation'', NDSS 2014, USA, 2014. [DOI:10.14722/ndss.2014.23264]
6. [6] D. Cash, S. Jarecki, C.S. Jutla, H. Krawczyk, M. Rosu, M. Steiner, '' Highly-scalable searchable symmetric encryption with support for boolean queries,'' Advances in Cryptology- CRYPTO 2013 USA. Proceedings, Part I, pp. 353-373, 2013. [DOI:10.1007/978-3-642-40041-4_20]
7. [7] S. Cui, M. Asghar, S. Galbraith, G. Russello, ObliviousDB, ''Practical and Efficient Searchable Encryption with Controllable Leakage'', FPS 2017, pp. 189-205, 2017. [DOI:10.1007/978-3-319-75650-9_13]
8. [8] R. Curtmola, J.A. Garay, S. Kamara, R.Ostrovsky, ''Searchable symmetric encryption: improved definitions and efficient constructions'', CCS 2006, USA, pp. 79-88, 2006. [DOI:10.1145/1180405.1180417]
9. [9] E. Etemad, A. Küpçü, C. Papamanthou, D. Evans, '' Efficient Dynamic Searchable Encryption with Forward Privacy'', PoPETs 2018, vol.1, pp. 5-20, 2018. [DOI:10.1515/popets-2018-0002]
10. [10] E.Goh, ''secure indexes'', IACR Cryptology ePrint Archive 2003, pp. 216, 2003.
11. [11] S. Kamara, T. Moataz, Boolean, ''searchable symmetric encryption with worst-case sub-linear complexity'', EUROCRYPT, vol. 3, pp. 94-124 2017. [DOI:10.1007/978-3-319-56617-7_4]
12. [12] S. Kamara, T. Moataz, SQL on Structurally-Encrypted Databases, IACR Cryptology ePrint Archive, pp. 453, 2016.
13. [13] S. Kamara, C. Papamanthou, Parallel and dynamic searchable symmetric encryption, Japan. pp. 258-274, 2013. [DOI:10.1007/978-3-642-39884-1_22]
14. [14] S. Kamara, C. Papamanthou, T. Roeder, Dynamic searchable symmetric encryption, CCS 2012, USA. pp. 965-976, 2012. [DOI:10.1145/2382196.2382298]
15. [15] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, W. Lou, Fuzzy keyword search over encrypted data in cloud computing, INFOCOM 2010, USA, pp. 441-445 , 2010. [DOI:10.1109/INFCOM.2010.5462196]
16. [16] X. Phuong, L. Ngoc, Efficient Secure Text Retrieval on Multi-Keyword Search, SoICT 2017, pp. 270-277, 2017. [DOI:10.1145/3155133.3155159]
17. [17] T. Radecki, Fuzzy set theoretical approach to document retrieval, Inf. Process, Manage, vol. 15(5), pp. 247-259, 1979. [DOI:10.1016/0306-4573(79)90031-1]
18. [18] D.X. Song, D. Wagner, A. Perrig, ''Practical techniques for searches on encrypted data'', IEEE SP 2000, USA, pp. 44-55, 2000.
19. [19] E. Stefanov, C. Papamanthou, E. Shi, Practical dynamic searchable encryption with small leakage, IACR Cryptology ePrint Archive 2013, pp.832, 2013. [DOI:10.14722/ndss.2014.23298]
20. [20] M. Strizhov, I. Ray, Multi-keyword Similarity Search over Encrypted Cloud Data, SEC 2014: ICT Systems Security and Privacy Protection. Berlin. Vol. 428, pp. 52-65, 2014. [DOI:10.1007/978-3-642-55415-5_5]
21. [21] C. Wang, N. Cao, K. Ren, W. Lou, ''Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data'', IEEE Trans. Parallel Distrib. Syst, vol. 23(8), pp. 1467-1479, 2012. [DOI:10.1109/TPDS.2011.282]
22. [22] Z. Xia, X. Wang, X. Sun, Q. Wang, '' A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data'', IEEE Trans. Parallel Distrib. Syst. Vol. 27(2), pp. 340-352, 2016. [DOI:10.1109/TPDS.2015.2401003]
23. [23] W. Zhang, Y. Lin, S. Xiao, J. Wu, S. Zhou, ''Privacy Preserving Ranked Multi-Keyword Search for Multiple Data Owners in Cloud Computing'', IEEE Trans. Computers, vol. 65(5). pp. 1566-1577, 2016. [DOI:10.1109/TC.2015.2448099]
24. [24] X. Zhu, H. Dai, H. Yi, G. Yang, X. Li, ''MUSE: An Efficient and Accurate Verifiable Privacy-Preserving Multi-keyword Text Search over Encrypted Cloud Data'' Security and Communication Networks 2017, pp. 1-17, 2017. [DOI:10.1155/2017/1923476]

Add your comments about this article : Your username or Email:

Send email to the article author

© 2015 All Rights Reserved | Signal and Data Processing