Multi-receiver Encryption Scheme Research Articles

A certificateless Multi-receiver Encryption scheme based on SM2 signature algorithm

The Multi-receiver Encryption (MRE) scheme can meet the secure data transmission requirements in multicast and broadcast scenarios. To meet compliance, critical information infrastructure in China should be protected with Chinese national commercial cryptographic algorithms. Designing an MRE scheme based on Elliptic Curve Cryptography (ECC) is one of the current design methods with better flexibility and performance. However, the research on MRE schemes based on SM2 elliptic curve public-key cryptography is still in a blank state. This paper proposes a Certificateless SM2-based Multi-receiver Encryption (CL-SM2-MRE) scheme. We prove the security of the CL-SM2-MRE scheme under the Random Oracle Model (ROM) and analyze the performance.

Anonymous Certificateless Multireceiver Encryption Scheme for Mobile Communication Devices

With the rapid development of wireless communication technologies and the popularity of mobile communication devices, people can easily access the Internet through their mobile communication devices. Compared with the traditional wired communication, this brings great convenience to people’s lives, but at the same time, it also brings greater challenges in terms of security and privacy. In order to protect the confidentiality of the transmitted message and prevent the identity information of message recipients from being leaked, some certificateless multireceiver encryption (CLMRE) schemes that could realize the anonymity of the receivers have been proposed. But most of the proposed schemes are either under the random oracle model (ROM), or based on bilinear pairings and hash-to-point (HTP) operations, which lead to expensive operation costs in encryption or decryption. In the ROM, in order to gain the value of the hash function, the adversary makes a query to the challenger, but in the standard model (SM), the adversary can compute the hash function directly. The cryptographic scheme based on the SM has higher security than the cryptographic scheme based on the ROM. Therefore, it is very meaningful and necessary to design an efficient CLMRE scheme without bilinear pairings and HTP operations under the SM, which is suitable for mobile communication devices. In this article, we propose the first CLMRE scheme without bilinear parings and HTP operations in the SM, and we prove that this scheme is indistinguishable and anonymous against Type-I adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {A}_\text{I}$</tex-math></inline-formula> and Type-II adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {A}_{\text{II}}$</tex-math></inline-formula> . Additionally, we compare our scheme’s performance in calculation and communication with several previous schemes. The analysis shows that our novel scheme based on the SM is efficient in terms of calculation, communication, and it is suitable for mobile communication devices.

Anonymous certificateless multi-receiver encryption scheme for smart community management systems

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.

An Anonymous Multireceiver with Online/Offline Identity-Based Encryption

Anonymous multireceiver encryption scheme can not only protect the privacy of the receiver but also ensure the security of message. However, the computational cost of this scheme is very large. It is not suitable for the sender which has limited resources, such as mobile devices and sensor nodes. In this work, an anonymous multireceiver online/offline identity-based encryption is proposed based on offline/online and identity-based encryption (IBE). In identity-based encryption scheme, the sender can encrypt the message using the unique information of the user (such as identity number or e-mail address) as its public key. The receiver obtains the private key from a central authority. For mobile device with limited resource, the online/offline encryption scheme can reduce the computational cost. Compared to the previous anonymous multireceiver schemes, the proposed scheme can efficiently encrypt message with offline/online method and ensure the anonymity of receivers. The analysis results also show that our scheme is efficient in terms of computational cost by comparing to the previous works.

Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings

With the growing development of Internet technology and popularization of mobile devices, we easily access the Internet anytime and anywhere by mobile devices. It has brought great convenience for our lives. But it brought more challenges than traditional wired communication, such as confidentiality and privacy. In order to improve security and privacy protection in using mobile network, numerous multi-receiver identity-based encryption schemes have been proposed with bilinear pairing and probabilistic hap-to-point (HTP) function. To address the troubles of private key escrow in multi-receiver encryption scheme based on ID-PKC, recently, some certificateless anonymous multi-receiver encryption (CLAMRE) schemes are introduced. But previous CLAMRE schemes using the bilinear pairing are not suitable to mobile device because the use of bilinear pairing and probabilistic hash-to-point (HTP) function results in expensive operation costs in encryption or decryption. In this paper, we propose an efficient CLAMRE scheme using elliptic curve cryptography (ECC) without bilinear pairing and HTP hash function. Since our scheme does not use bilinear pairing and HTP operation during the encryption and decryption process, the proposed CLAMRE scheme has much less computation cost than the latest CLAMRE schemes. Performance analysis shows that runtime of our scheme is much less when the sender generates ciphertext, compared with existing schemes. Security analysis shows proposed CLAMRE scheme provides confidentiality of message and receiver anonymity under the random oracle model with the difficulties of decision Diffie-Hellman problem and against the adversaries defined in CL-PKC system.

Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices

With the popularity of mobile devices, how to enhance the security and privacy in wireless communications has gained comprehensive attention. Many cryptographic schemes have been introduced for practical applications. In the multi-receiver encryption (MRE) scheme, a sender is allowed to generate the same ciphertext for a designed group of receivers. Any receiver can get the plaintext by decrypting the ciphertext; however, the real identity of receiver cannot be known by other receivers. Due to the above advantage, the MRE scheme can be used to protect the receiver’s privacy. Recently, the certificateless anonymous multi-receiver encryption (CLAMRE) scheme using the bilinear paring was introduced to solve the certificate management problem existing in MRE schemes based on the public key infrastructure and the private key escrow problem existing in MRE schemes based on identity-based cryptography. However, previous CLAMRE scheme using the bilinear paring is not suitable for mobile devices because the number of bilinear paring operations and Hash-to-Point (HTP) operations executed by the sender increases linearly as the increase of the receivers’ number. In this paper, an efficient CLAMRE scheme based on elliptic curve cryptography for mobile devices is proposed to improve performance. Because no bilinear paring or HTP operation is involved in the process of encryption, the proposed CLAMRE scheme has much less computation cost than the latest CLAMRE scheme. Security analysis shows the proposed CLAMRE scheme is provably secure in the random oracle model.

Efficient public key encryption with revocable keyword search in cloud computing

Public key encryption with keyword search plays very important role in the outsourced data management. In most of public key encryption schemes with keyword search, the server can unlimitedly execute keyword search ability after obtaining a trapdoor information of a keyword. To restrict the ability of the server's unlimited search, we propose a novel public key encryption with revocable keyword search by combining hash chain and anonymous multi-receiver encryption scheme in this paper. The scheme can not only achieve security property of the indistinguishability of ciphertexts against an adaptive chosen keywords attack, but also resist off-line keyword guess attack. By comparison with Yu et al.'s scheme, our scheme is more efficient in terms of computational cost and communication overhead for the whole system.

Concurrently deniable ring authentication and its application to LBS in VANETs

Deniable ring authentication can be used to facilitate privacy-preserving communication since the receiver accepts authentication while cannot convince a third party that the fact of this authentication occurred. Besides that, the receiver cannot decide the actual sender as the sender identity is hidden among a group of participants. However, the concurrent problem has not been studied well in the interactive deniable ring authentication so far. In this work, we propose a deniable ring authentication protocol to handle concurrent scenario, which achieves full deniability. We construct a CCA2-secure (which is secure against Adaptive Chosen Ciphertext attack) multi-receiver encryption scheme to support this protocol and it requires only 2 communication rounds, which is round-optimal in fully deniable ring authentications. In addition, we observe that efficient fully deniable ring authentication can be applied to location-based service in VANETs to protect vehicle privacy.

An anonymous data access scheme for VANET using pseudonym-based cryptography

Vehicular ad-hoc network (VANET) is an emerging technology which can offer a wide variety of promising applications, such as safety-related and infotainment applications. However, VANET also raises important security and privacy concerns that must be properly addressed for widespread deployment. In this paper, we first proposed a provable secure pseudonym-based cryptosystem with a trusted authority, including a pseudonym-based encryption scheme, a pseudonym-based multi-receiver encryption scheme, a pseudonym-based signature scheme, and a pseudonym-based one-pass key establishment protocol. We then presented a secure and efficient data access scheme for VANET based on cooperative caching technology and the proposed pseudonym-based cryptosystem. The efficiency of data access was greatly improved by allowing the sharing and coordination of cached data among multiple vehicles, and the anonymity of vehicles, data confidentiality, integrity and non-repudiation were guaranteed by employing the proposed pseudonym-based cryptosystem. Simulation results have shown that the proposed data access scheme is suitable to the VANET environment.

Efficient Constructions of Anonymous Multireceiver Encryption Protocol and Their Deployment in Group E-mail Systems With Privacy Preservation

We first propose an efficient anonymous multireceiver encryption scheme to achieve the security properties of confidentiality and anonymity, which protects the receiver identity privacy and keeps the message confidential. The anonymity of proposed scheme is secure against outer attackers and inner attackers simultaneously. Based on the first construction, we also present a dual-anonymous multireceiver encryption that supports the security properties such as identity privacy of both sender and receiver, sender undeniability, forward security, and forward anonymity, which has a perfect premise for privacy-carrying e-mail systems. We design a deployment in a secure e-mail delivery system and give some experimental results. We evaluate the performance in theoretical analysis and practical assessment, and show that our proposed schemes achieve an effective balance in strong security, low computation cost, and light communication load.