Journal
NONLINEAR DYNAMICS
Volume 94, Issue 2, Pages 1127-1132Publisher
SPRINGER
DOI: 10.1007/s11071-018-4413-9
Keywords
Cloud storage services; Searchable encryption; Chaotic maps; Chebyshev polynomials; Keyword guessing attack
Categories
Ask authors/readers for more resources
Recently, Li et al. employed chaotic maps to propose a public key encryption with keyword search scheme. The authors claimed that their scheme provides security against keyword guessing attack (KGA) performed by inside and outside adversaries. The goal of this paper is to show that this claim is not true about inside attackers. We prove that it is possible for an inside adversary to launch an attack even more severe than KGA and obtain the corresponding keyword to any searchable ciphertext. We further propose a simple fix to overcome the proposed attack.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available