Netinfo Security ›› 2020, Vol. 20 ›› Issue (3): 29-35.doi: 10.3969/j.issn.1671-1122.2020.03.004

Previous Articles     Next Articles

Fault - tolerant and Verifiable Public Key Searchable Encryption Scheme Based on FBDH Algorithm

ZHOU Quan, YANG Ningbin, XU Shumei   

  1. School of Mathematics and Information Science, Guangzhou University, Guangzhou 510006, China
  • Received:2019-11-26 Online:2020-03-10 Published:2020-05-11

Abstract:

In the cloud storage service, in order to protect the privacy of user’s retrieved data, researchers propose searchable encryption schemes, among which the public key searchable encryption scheme is an effective ciphertext retrieval scheme. This paper proposes a public key searchable encryption scheme based on FBDH algorithm and ElGamal encryption and signature algorithm. Firstly, FBDH algorithm is used to encrypt data plaintext, which makes the decryption process of data ciphertext fault-tolerant and efficient. Secondly, ElGamal encryption and signature algorithm is used to encrypt the identity of the data owner and the keywords signature, so that the ciphertext returned after the cloud server successfully verifies the validity of the keywords can be verified by the data user. This paper gives the proof that the scheme satisfies the accuracy of calculation, and proves that the scheme can resist the guessing attack of off-line keywords by using the challenge response game.

Key words: ElGamal, FBDH algorithm, searchable encryption, verifiability, fault-tolerance

CLC Number: