Abstract

Public key encryption with keyword search (PEKS) is a useful paradigm that enables a user to delegate searching capabilities on publicly encrypted data to an untrusted third party without revealing the data contents. In 2013, Fang et al. proposed a secure channel free PEKS (SCF-PEKS) scheme without random oracle and asserted that their scheme can withstand the keyword guessing (KG) attacks by outsider attackers. Later, Shao and Yang presented an improvement of Fang et al.’s SCF-PEKS scheme so as to obtain the security against KG attacks by malicious insider servers. In this paper, we demonstrate that both Fang et al.’s SCF-PEKS scheme and the improved scheme proposed by Shao and Yang fail in achieving their security goal. Our cryptanalysis shows that the former is vulnerable to the KG attacks by outsider attackers while the latter is vulnerable to the KG attacks by malicious insider servers. To overcome the security weaknesses in these two schemes, we present a new improvement of Fang et al.’s SCF-PEKS scheme. The analysis indicates that the improved scheme provides resistance against KG attacks by either outsider attackers or malicious insider servers.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.