Privacy-preserving identity-based broadcast encryption

Hur, Junbeom; Park, Chan-Il; Hwang, Seong Oun

doi:10.1016/j.inffus.2011.03.003

Cited by 52 publications

(48 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The random oracle is derived from Gap-BDH difficulty hypothesis，and we formally prove that the proposed scheme satisfies confidentiality and anonymity. Compared with the program based on identity of the anonymous broadcast that Hur et al [11] proposed we show the high efficiency and better security of the scheme in this paper.…”

Section: Introductionmentioning

confidence: 72%

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

Shen¹,

Yang²,

Chuan-sheng³

2017

Proceedings of the 2017 2nd International Conference on Education, Sports, Arts and Management Engineering (ICESAME 2017)

View full text Add to dashboard Cite

With the advancement of cloud computing application and research, there is a lot of data interaction between the users and the cloud computing platforms where exists a threat to the transmission and storage of users' data. Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user's credential (or private key) can be expired or revealed. For the current identity-based encryption program is not anonymous. We construct a new identity-based anonymous encryption scheme (AIBKE) based on the character of bilinear group and the bilinear DH. The new scheme not only solves the problem that the existing scheme can not protect the privacy of the receiver, but also ensures anonymous that both sender and receiver of the signcryption program. The scheme can satisfy both semantic security, unforgeability, and anonymity.

show abstract

Section: Introductionmentioning

confidence: 72%

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

Shen¹,

Yang²,

Chuan-sheng³

2017

Proceedings of the 2017 2nd International Conference on Education, Sports, Arts and Management Engineering (ICESAME 2017)

View full text Add to dashboard Cite

show abstract

“…The other works [11,12,14,16,[18][19][20]29] either have the CPA (chosen plaintext attacks) security only or have not provided the proof for the security. The security of all of the above schemes has been summarized in Section 6 Table 3.…”

Section: Related Workmentioning

confidence: 99%

“…In this section, we compare the proposed scheme to [10,11,14,16,[18][19][20][21]23,[25][26][27][28][29] and [31] in performance and security. According to [39][40][41] and [42], we can obtain that T p ≈ 5T e , T s ≈ 29T m , T e ≈ 240T m , T h ≈ 23T m and T a ≈ 0.12T m , shown in Table 2, which summarizes the comparison in the computation cost of encryption/decryption and the ciphertext length for multiple receivers.…”

Section: Comparisonsmentioning

confidence: 99%

“…The scheme [19] did not provide the proof for anonymity, but it is CPA secure in confidentiality. The schemes [14,16,18] and [20] are CPA secure in both confidentiality and anonymity, where the proof of [20] is under a standard model. The scheme [10] is CCA secure in confidentiality, but it is not with anonymity, which has been indicated in [11,13,25].…”

Section: Comparisonsmentioning

confidence: 99%

“…This research will aim at anonymous multi-receiver ID-based encryption, which can be regarded as anonymous dynamic broadcast ID-based encryption. In this manuscript, we will discuss dynamic and ID-based schemes [10,11,14,16,[18][19][20][21]23,[25][26][27][28][29]31] and compare them to our work.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Anonymous Multi-Receiver Identity-Based Authenticated Encryption with CCA Security

Fan

Tseng

2015

Symmetry

View full text Add to dashboard Cite

In a multi-receiver encryption system, a sender chooses a set of authorized receivers and sends them a message securely and efficiently, as the message is well encrypted and only one ciphertext corresponding to the message is generated no matter how many receivers the sender has chosen. It can be applied to video conferencing systems, pay-per-view channels, remote education, and so forth. Due to privacy considerations, an authorized receiver may not expect that his identity is revealed. In 2010, anonymous multi-receiver identity-based (ID-based) encryption was first discussed, and furthermore, many works on the topic have been presented so far. Unfortunately, we find that all of those schemes fail to prove the chosen ciphertext attacks (CCA) security in either confidentiality or anonymity. In this manuscript, we propose the first anonymous multi-receiver ID-based authenticated encryption scheme with CCA security in both confidentiality and anonymity. In the proposed scheme, the identity of the sender of a ciphertext can be authenticated by the receivers after a successful decryption. In addition, the proposed scheme also is the first CCA-secure one against insider attacks. Moreover, only one pairing computation is required in decryption.

show abstract

Enabling efficient and secure data sharing in cloud computing

Liu

et al. 2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWith the rapid development of cloud computing, more and more data are being centralized into remote cloud server for sharing, which raises a challenge on how to keep them both private and accessible. Although searchable encryption provides an efficient solution to support keyword‐based search directly on encrypted data, considering its application in file sharing, existing work depends on key sharing among authorized users, which inevitably causes the risks of key exposure and abuse. In this paper, aiming at enabling efficient and secure data sharing in cloud computing, we provide a generic construction for this purpose. The proposed construction is full‐featured: (i) It enables authorized users to perform keyword‐based search directly on encrypted data without sharing the unique secret key; and (ii) it provides two‐layered access control to limit unauthorized user's access to the shared data. On the basis of the proposed generic construction, we utilize the existing techniques on identity‐based broadcast encryption and public key searchable encryption to instantiate a concrete construction. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Privacy-preserving identity-based broadcast encryption

Cited by 52 publications

References 22 publications

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

Anonymous Identity-Based Key Scheme in Application of Privacy Protection

Anonymous Multi-Receiver Identity-Based Authenticated Encryption with CCA Security

Enabling efficient and secure data sharing in cloud computing

Contact Info

Product

Resources

About