Ciphertext retrieval technology has been widely explored with the increasing popularity of cloud computing. Proxy re-encryption with Keyword search (PREKS) can support multi-user retrieval without increasing data owner's overhead, but users can continue searching once they have obtained search rights. It is difficult for a data owner to revoke a user's access rights because the data is stored in the cloud. In general, under the premise of forward and backward security, the user's search permission can be revoked by updating the ciphertext. Nevertheless, this approach may expose user or data privacy to cloud servers. In this paper, we utilize the Chinese Remainder Theorem to generate DO-Authorization and DU-Authentication factors, and realizes the authorization and revocation of a specific single user by adding or deleting authorization items. In addition, we use a designated tester algorithm in the ciphertext retrieval process to improve system security. Subsequent security analysis proves that the proposed scheme can resist the Chosen Keyword Attack and Keyword Guessing Attack. Simulation results indicate that the proposed scheme has high efficiency, especially in the user revocation phase

Electronic Health Record (EHR) sharing can improve the accuracy of medical diagnosis and promote the development of the public medical field. However, plaintext medical records expose patient privacy, and it is challenging to share medical records between different hospitals, making it difficult for doctors to securely retrieve medical records and massively analyze the same diseases from different patients. In this paper, we propose a flexible ciphertext retrieval scheme in electronic health sharing system that supports multi-patient and multi-keyword medical records retrieval. The proxy free ciphertext retrieval technology based on cloud servers enables doctors to retrieve multiple patients' medical records simultaneously. On this basis, we utilize the time encoding algorithm to ensure that the trapdoor associated with the old time cannot retrieve the ciphertext index bound with the latest time, so as to realize the lightweight forward security. Besides, the encoding time signed by the deniable signature can avoid forgery by malicious users or adversaries. In addition, the scheme supports evil user traceable and revocable. The security analysis indicates that the scheme can satisfy the keyword privacy, the forward security of updated ciphertexts, and the deniability of time encoding signatures. Experimental evaluation illustrates that our scheme is lightweight and efficient

In order to ensure data security and improve data usability, searchable encryption has been widely used in cloud computing systems. However, the evil single users with search privileges bring heavy privacy threats to the system. Threshold searchable encryption provides a collaborative search service for group users; a single user cannot search for ciphertext. However, the threshold searchable encryption based on the Shamir secret sharing mechanism cannot achieve flexible user dynamic since the Lagrange interpolation polynomial for recovering the secret value changes with the group user add or delete, resulting in the ciphertext or trapdoor containing Lagrange interpolation formula needs to be recreated. In this paper, the conjunctive keyword search with dynamic group-user scheme (CKSDGU) is proposed to realize group-user flexible addition and deletion. The proposed CKSDGU scheme can match successfully without the data owner resetting ciphertext and the original data user generating trapdoors. In addition, multi-keyword conjunctive retrieval is implemented in the CKSDGU scheme, and group users can search the target ciphertexts that contain all users’ query keyword sets. The security analysis illustrates that the CKSDGU scheme can resist chosen keyword attacks and keyword guessing attacks. The performance analysis presents that our scheme has considerable overhead and efficient computational cost in the user dynamic stage.

Ciphertext retrieval for cloud-based Internet of Things has been widely explored with the increasing popularity of cloud computing. However, in most existing solutions, the security and efficiency of the retrieval process are difficult to achieve simultaneously. To this end, we develop a novel secure matrix index, and we utilize identity-based encryption to encrypt keywords and homomorphic encryption to encrypt matrix values. The former can guarantee the security of the keyword, and the latter can realize the efficiency of the operation while ensuring safety. Then, we develop an identity-based bidirectional authentication algorithm to ensure that only authenticated users can retrieve ciphertext. In addition, we use different scoring formulas to calculate the relevance scores of documents with different lengths, ensuring that the documents are appropriately returned to users. Finally, we design a new retrieval structure to protect the privacy of the correspondence between keywords and ciphertexts. The security proof shows that the index and trapdoor can resist chosen keyword attack and keyword Guessing attack. The extensive simulation shows that our scheme is efficient.

Searchable encryption for Cloud-based Internet of Things has been widely explored with the increasing popularity of cloud computing. The public-key encryption with keyword search (PEKS) system support multiuser retrieval. However, the PEKS search time is linearly increasing as the index keyword number growth, and the search time would be huge if the index keywords consistently increase. In this article, we introduce a novel scheme named as public-key inverted-index keyword search with designated tester and multiuser key decryption (IDPEKS). First of all, we design an inverted index based on B-plus tree to reduce the search time to a logarithmic level. On this basis, we optimized the TF-IDF formula and added user preference factor and font size factor to make the relevance score calculation more consistent with needs of receiver. Besides, we design a multiuser key decryption algorithm to protect the system symmetric key. In addition, we set index server to perform the index-trapdoor retrieval process. The designated index server tester can resist the attack of the cloud server on keywords. The security proof shows that the scheme can resist the chosen keyword attack (CKA), keyword guessing attack (KGA), and key guessing attack (KeyGA). The experimental results show that the algorithm can improve retrieval efficiency while have a short encryption time.