Efficient and dynamic verifiable multi-keyword searchable symmetric encryption with full security

Increasing the popularity of cloud computing raises the importance of efforts to improve the services of this paradigm. Searching over encrypted data is a requirement for cloud storage to provide, in addition to privacy-preserving, convenient and low-cost access to some of the outsourced data. Secur...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Multimedia tools and applications Ročník 80; číslo 17; s. 26049 - 26068
Hlavní autoři: Najafi, Aniseh, Javadi, Hamid Haj Seyyed, Bayat, Majid
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2021
Springer Nature B.V
Témata:
Algorithms
Cloud computing
Communication
Complexity
Computer Communication Networks
Computer Science
Data storage
Data Structures and Information Theory
Design
Dictionaries
Efficiency
Encryption
Keywords
Multimedia
Multimedia Information Systems
Privacy
Searching
Security
Special Purpose and Application-Based Systems
Binary search
Verifiability
Dynamics
Plaintext privacy
Randomized symmetric searchable encryption
Multi-keyword search
Full security
Predicate privacy
ISSN:1380-7501, 1573-7721
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Increasing the popularity of cloud computing raises the importance of efforts to improve the services of this paradigm. Searching over encrypted data is a requirement for cloud storage to provide, in addition to privacy-preserving, convenient and low-cost access to some of the outsourced data. Security and functionality along with efficiency are important characteristics of searchable encryption schemes that improve them make this schemes more applicable to the real world. There are proposed structures for symmetric searchable encryption (SSE) in this paper, by adding functionalities to randomized SSE schemes, to provide a optimal scheme. We design a rFSMSE scheme that allows searching by multiple keywords. This scheme is fully secure and its search time complexity is logarithmic. Then we upgrad this scheme to the verifiable rFSMSE scheme called rFSVMSE, without increasing the complexity of search time, storage, and communication. We demonstrate that the proposed schemes are upgradable to dynamic ones. Simulations show the time taken to search for multi-keywords in the rFSMSE and rFSVMSE schemes is less than that in the previous randomized SSE.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-021-10844-w