Abstract

In community management services, it is a common requirement for management centers to send the same encrypted message to some units and individuals in the community, while avoiding the leakage of personal information of the user. In order to achieve this goal safely and efficiently, the multi-receiver encryption is a good option. In the setting, a sender generates the ciphertext for a designed group of receivers. Any receiver in the group can obtain the plaintext by decrypting the ciphertext using his own private key, and the true identity of the receiver is kept secret to anyone including other receivers. Recently, several certificateless multi-receiver encryption (CLMRE) schemes have been introduced, and all of them are proved to be secure in the random oracles model (ROM). ROM is a simulation of the hash function and can not replace the real hash function computation. In this paper, a new CLMRE scheme is constructed and it is proved to be secure based on decision bilinear Diffie–Hellman problem in the standard model (SM). It achieves the anonymity of the receivers and is suitable for smart community management systems.

Full Text
Published version (Free)

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