Improved Anonymous Multi-receiver Identity-Based Encryption

Chien, Hung‐Yu

doi:10.1093/comjnl/bxr086

Cited by 45 publications

(66 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Chien [9] proposed an improved scheme which can achieve the receiver's anonymity and enhance the security of the message. However, in encryption phase, this scheme requires a number of bilinear pairing operations which is proportional to the number of receivers.…”

Section: Wireless Communications and Mobile Computingmentioning

confidence: 99%

“…In Section 4, we first give the correctness analysis of our scheme, and then we compare security and computational cost with the previous literatures [5,6,8,9].…”

Section: Security and Performance Analysismentioning

confidence: 99%

“…The efficiency comparison is summarized in Tables 3 and 4. The computational cost in our scheme is compared to literature [5,6,8,9]. In addition, the mentioned five schemes contain encryption and decryption computational cost.…”

Section: Performance Analysismentioning

confidence: 99%

See 2 more Smart Citations

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

Wang

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

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.

show abstract

Section: Wireless Communications and Mobile Computingmentioning

confidence: 99%

“…In Section 4, we first give the correctness analysis of our scheme, and then we compare security and computational cost with the previous literatures [5,6,8,9].…”

Section: Security and Performance Analysismentioning

confidence: 99%

See 1 more Smart Citation

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

Wang

2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…To achieve preserving privacy of receivers, in 2010, Fan et al [20] presented a new ID-based MRE scheme and claimed that it can protect receiver anonymity; the scheme is highly efficient for each receiver as it requires only two pairing operations. In 2012, Chien [21] found that the scheme of Fan et al [20] failed to protect receiver anonymity and proposed an improved scheme which proves that the scheme enhances security and protects the anonymity of recipients. It is very unfortunate that Wang [22] pointed out the fact that Chien's scheme does not satisfy the indiscernibility of encryption under selective multi-identity, chosen ciphertext attacks.…”

Section: Introductionmentioning

confidence: 99%

“…It is very unfortunate that Wang [22] pointed out the fact that Chien's scheme does not satisfy the indiscernibility of encryption under selective multi-identity, chosen ciphertext attacks. In 2015, Zhang [23] proposed the most efficient anonymous MRIBE scheme in terms of computational cost and communication overhead, compared with schemes of [20][21][22].…”

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

Privacy‐preserving multireceiver ID‐based encryption with provable security

Tseng

Huang

Hui-ju

2012

Int J Communication

View full text Add to dashboard Cite

Multireceiver identity (ID) based encryption and ID-based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. It can be used for many practical applications such as digital content distribution, pay-per-view and multicast communication. For protecting the privacy of receivers or providing receiver anonymity, several privacy-preserving (or anonymous) multireceiver ID-based encryption and ID-based broadcast encryption schemes were recently proposed, in which receiver anonymity means that nobody (including any selected receiver), except the sender, knows who the other selected receivers are. However, security incompleteness or flaws were found in these schemes. In this paper, we propose a new privacy-preserving multireceiver ID-based encryption scheme with provable security. We formally prove that the proposed scheme is semantically secure for confidentiality and receiver anonymity. Compared with the previously proposed anonymous multireceiver ID-based encryption and ID-based broadcast encryption schemes, the proposed scheme has better performance and robust security.In the following, we redefine the security notions of receiver anonymity including ANON-IND-sID-CPA and ANON-IND-sID-CCA security games in [11] that take into consideration a multireceiver setting.

show abstract

Improved Anonymous Multi-receiver Identity-Based Encryption

Cited by 45 publications

References 18 publications

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

An Anonymous Multireceiver with Online/Offline Identity‐Based Encryption

Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings

Privacy‐preserving multireceiver ID‐based encryption with provable security

Contact Info

Product

Resources

About