A New Searchable Encryption Scheme with Integrity Preservation Property
- PDF / 1,796,065 Bytes
- 24 Pages / 439.37 x 666.142 pts Page_size
- 49 Downloads / 184 Views
A New Searchable Encryption Scheme with Integrity Preservation Property Mohammad Zamani1 · Masoumeh Safkhani1 Amir Abbasian1
· Negin Daneshpour1 ·
Accepted: 14 September 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Searchable encryption schemes allow documents’ owners to store their encrypted documents on servers, search for the desired keyword and then download only the desired encrypted file and then decrypt. Storing files on remote servers can be further developed, which, in addition to allow access to files at any location and at any time, it also gives the data owners the confidence that their files are stored without any change in the servers. This property can be interpreted as the integrity preservation property of encrypted documents in the searchable encryption schemes. Recently, in Yang et al. (Concurr Comput Pract Exp 29:e4211, 2017), Yang et al. proposed a semantic keyword searchable proxy re-encryption scheme and claimed their scheme resists against collusion and provides data privacy. However, in this paper, we show that unfortunately, their searchable encryption scheme does not provide the perfect security and their scheme is vulnerable against integrity contradiction attack. Our proposed attack is implemented in three different scenarios, its success probability of each scenario is one and its complexity is only one run of the scheme. We also improve Yang et al. scheme and show informally and formally that the improved scheme is secure against the attacks presented in this paper and also other known active and passive attacks. Comparisons also showed that the proposed scheme, in addition to the complete security it provides, is acceptable in terms of communication, storage and computational costs. Keywords Searchable encryption scheme · Encrypted documents · Digital signature · Integrity preservation · Integrity contradiction attack · Cloud computing
B
Masoumeh Safkhani [email protected] Mohammad Zamani [email protected] Negin Daneshpour [email protected] Amir Abbasian [email protected]
1
Computer Engineering Department, Shahid Rajaee Teacher Training University, Tehran, Iran
123
M. Zamani et al.
1 Introduction One of today’s needs is remote storage resources that can be accessed comprehensively and from everywhere, such as Gmail servers, Yahoo mail, and etc. Users typically encrypt sensitive data on honest-but-curious or semi honest-but-curious servers. Encryption hides all information about the data, and the client must download and decrypt all encrypted documents so that he/she can find the document with the specific keyword. Searchable encryption schemes help the client to only download and then decrypt the specific document of target. In fact, searchable encryption schemes attempt to help the client searchs its document among encrypted files by disclosing minimum information to the server. At the same time, an issue that is often neglected is the integrity preservation of the encrypted documents during the transfer to the server or vice
Data Loading...
