Abstract
Public key encryption with equality test enables the user to determine whether two ciphertexts contain the same information without decryption. Therefore, it may serve as promising cryptographic technique for cloud-assisted wireless sensor networks (CWSNs) to maintain data privacy. In this paper, an efficient RSA with equality test algorithm is proposed. The presented scheme also handles the attackers based on their authorization ability. Precisely, the proposed scheme is proved to be one-way against chosen-ciphertext attack security and indistinguishable against chosen ciphertext attacks. Moreover, the experimental evaluations depict that the underlying scheme is efficient in terms of encryption, decryption, and equality testing. Thus, this scheme may be used as a practical solution in context of CWSNs, where the users may compare two ciphertexts without decryption.
Highlights
Internet of Things (IoT) as a new information network technology is booming
We present the details of proposed PKEwET-FA-RSA scheme as follows
Different from the previous equality test schemes, a noval RSA with equality test scheme is proposed in this paper
Summary
Internet of Things (IoT) as a new information network technology is booming. Chen et al proposed a server-aided public key encryption encryption scheme with the keyword search that obtained the security against the offline keyword guessing attack [16]. In 2010, Yang et al proposed an public key encryption with equality test (PKEwET) to compare whether two ciphertexts contain the same information without decryption [20]. To merge the functionality of ciphertext matching in RSA scheme [26,27,28], the construction of public key encryption with equality test based on RSA is proposed in this paper. The idea of public key encryption with equality test is introduced into RSA scheme. The proposed scheme fills the gap of RSA algorithm in the context of equality test over ciphertext. In 2020, Chen et al introduced the equality test algorithm into blockchain and proposed blockchain-based proxy re-encryption with equality test [35]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have