Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Islam, SK Hafizul; Khan, Muhammad Khurram; Al-Khouri, Ali M.

doi:10.1002/sec.1165

Cited by 55 publications

(60 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Very recently, Islam et al [32] proposed the first anonymous multireceiver certificateless encryption (AMCLE) scheme by adopting the same polynomial technique used in AMIBE scheme of Tseng et al [20]. Although their scheme did not require any bilinear pairing operations, the required encryption/decryption costs are not efficient.…”

Section: A Related Workmentioning

confidence: 99%

Efficient Anonymous Multireceiver Certificateless Encryption

Hung

Huang

Tseng

et al. 2017

IEEE Systems Journal

View full text Add to dashboard Cite

To protect receiver privacy, researchers constructed anonymous multireceiver encryption by implanting anonymity in multireceiver encryption. It allows a sender to produce the identical ciphertext for multiple designated receivers. Every designated receiver can decrypt the ciphertext, but does not know who the other designated receivers are. Recently, several anonymous multireceiver identity (ID)-based encryption (AMIBE) schemes were proposed without the utilization of certificates. However, these AMIBE schemes are not efficient because their decryption cost of each receiver grows linearly with the number of the designated receivers. Moreover, all the ID-based cryptographic schemes suffer from the key escrow problem, which has been resolved by using certificateless public key settings. Very recently, Islam et al. proposed an anonymous multireceiver certificateless encryption (AMCLE) scheme. However, the encryption cost of a sender is quadric with the number of designated receivers, whereas the decryption cost of each receiver is linear with the number. In this paper, we propose an efficient AMCLE scheme with constant decryption cost, namely, the required decryption cost of each receiver is independent of the number of receivers. When compared with previously proposed AMIBE and AMCLE schemes, our scheme solves the key escrow problem and improves the efficiency of encryption/decryption significantly as well.

show abstract

Section: A Related Workmentioning

confidence: 99%

Efficient Anonymous Multireceiver Certificateless Encryption

Hung

Huang

Tseng

et al. 2017

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…In order to address the problem in Hung et al's CLAMRE scheme, this paper proposes an efficient CLAMRE scheme using the ECC. Compared with previous schemes (Islam et al 2015;Hung et al 2015), the computation cost of the encryption operation in the proposed CLAMRE scheme is linear with the receivers' number and no bilinear paring operation or HTP operation is needed when the sender generates a ciphertext.…”

Section: Introductionmentioning

confidence: 96%

“…In the CLC, the user's private key contains two parts: a partial private key and a secure value, which are generated by the KGC and the user, separately. Based on Al-Riyami et al's work, Islam et al (2015) introduced the concept of certificateless anonymous multi-receiver encryption (CLAMRE) and proposed the first CLAMRE scheme using the elliptic curve cryptography (ECC). Hung et al (2015) pointed out that Islam et al's CLAMRE scheme is not suitable for mobile devices since the computation cost of the encryption operation is quadric with the receivers' number.…”

Section: Introductionmentioning

confidence: 99%

Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices

Wang

et al. 2016

Soft Comput

View full text Add to dashboard Cite

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 priCommunicated by vacy. 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.

show abstract

“…In the CLC, the users' private key contains two parts: KGC and the user generate a partial private key and a secret value, respectively. Based on Al-Riyami et al 's work, most certificateless signature (encryption) schemes [25][26][27][28][29] are proposed. In the existing research literature, certificateless multi-receiver encryption (CLMRE) scheme did not get more attention; Islam et al [27] presented the concept of certificateless anonymous multi-receiver encryption (CLAMRE) and proposed the first CLAMRE scheme using the elliptic curve cryptography (ECC).…”

Section: Introductionmentioning

confidence: 99%

“…Based on Al-Riyami et al 's work, most certificateless signature (encryption) schemes [25][26][27][28][29] are proposed. In the existing research literature, certificateless multi-receiver encryption (CLMRE) scheme did not get more attention; Islam et al [27] presented the concept of certificateless anonymous multi-receiver encryption (CLAMRE) and proposed the first CLAMRE scheme using the elliptic curve cryptography (ECC). Hung et al [28] pointed out that scheme of [27] is less efficient and is not suitable in mobile devices environment, because the cost of encryption calculation is square of number of recipients, and proposed a new CLAMRE using the bilinear pairing.…”

Section: Introductionmentioning

confidence: 99%

Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings

Rong-hai

Zeng

Deng

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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 hashto-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 DiffieHellman problem and against the adversaries defined in CL-PKC system.

show abstract

Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing

Cited by 55 publications

References 41 publications

Efficient Anonymous Multireceiver Certificateless Encryption

Efficient Anonymous Multireceiver Certificateless Encryption

Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices

Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings

Contact Info

Product

Resources

About