Revocable hierarchical identity-based broadcast encryption

Li, Dawei; Liu, Jianwei; Zhang, Zongyang; Wu, Qianhong; Liu, Weiran

doi:10.26599/tst.2018.9010023

Cited by 12 publications

(11 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We analyzed the functional differences between our scheme and the other six broadcast encryption schemes. From Table 2, the schemes in [10,12,15] are consistent with the schemes in this paper, all of which are identity-based broadcast encryption. Combined with the changes in user privileges in smart cities, the user revocation property is used to adjust authorization identities dynamically.…”

Section: Performance Evaluation 61 Comparison Of Functionssupporting

confidence: 71%

“…To improve efficiency, Zhu et al [14] constructed a mechanism to support designation and revocation and introduced dual-modes. In [15], Li et al present a new broadcast encryption scheme for prime-order bilinear groups which achieves revocation. However, these works are not aimed at solving receiver anonymity.…”

Section: Related Workmentioning

confidence: 99%

“…Combined with the changes in user privileges in smart cities, the user revocation property is used to adjust authorization identities dynamically. The schemes in [14,15,16] achieve the user revocation property. The schemes in [10,11,16] achieve receiver anonymity.…”

Section: Performance Evaluation 61 Comparison Of Functionsmentioning

confidence: 99%

See 2 more Smart Citations

An ID-based Broadcast Encryption Scheme for Cloud-network Integration in Smart Grid

2021

KSII TIIS

View full text Add to dashboard Cite

The rapid growth of data has successfully promoted the development of modern information and communication technologies, which are used to process data generated by public urban departments and citizens in modern cities. In specific application areas where the ciphertext of messages generated by different users' needs to be transmitted, the concept of broadcast encryption is important. It can not only improve the transmission efficiency but also reduce the cost. However, the existing schemes cannot entirely ensure the privacy of receivers and dynamically adjust the user authorization. To mitigate these deficiencies, we propose an efficient, secure identity-based broadcast encryption scheme that achieves direct revocation and receiver anonymity, along with the analysis of smart grid solutions. Moreover, we constructed a security model to ensure wireless data transmission under cloud computing and internet of things integrated devices. The achieved results reveal that the proposed scheme is semantically secure in the random oracle model. The performance of the proposed scheme is evaluated through theoretical analysis and numerical experiments.

show abstract

Section: Performance Evaluation 61 Comparison Of Functionssupporting

confidence: 71%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An ID-based Broadcast Encryption Scheme for Cloud-network Integration in Smart Grid

2021

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…Based on CS method, we realize the revocation in this paper. The binary tree of CS method is described as the Figure 1 shows [43].…”

Section: Subset-cover Revocation Frameworkmentioning

confidence: 99%

Efficient CCA2 Secure Flexible and Publicly-Verifiable Fine-Grained Access Control in Fog Computing

Liu

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

Fog computing enables computation, storage, applications, and network services between the Internet of Things and the cloud servers by extending the Cloud Computing paradigm to the edge of the network. When protecting information security in Fog computing, advanced security with low latency, widespread geographical distribution support, and high flexibility should be taken in to considertion first, because of its huge number of nodes. In this paper, we propose a new cryptographic primitive, named CCA2 secure publicly-verifiable revocable large-universe multi-authority attribute-based encryption (CCA2-PV-R-LU-MA-ABE), to achieve flexible fine-grained access control in Fog computing. In this primitive, end nodes in fogs generate private keys from multiple authorities that might be differentiated by their geographical locations or functions, and their attributes can be denoted by any strings in the large universe, which meets diverse needs in practical Fog applications. In addition, the accessibility of nodes can be revoked efficiently even by resource-limited devices. To ensure the validity of ciphertext, this primitive supports public verification and only valid ciphertext can be stored or transmitted. Based on the primitive and the feature of Fog computing, we construct a concrete CCA2-PV-R-LU-MA-ABE scheme. We define the security model of this primitive, which is much more secure than the CPA-secure scheme. Finally, we compare the efficiency of the proposed concrete scheme with that of the existing CPA-secure scheme by both theoretical and experimental analysis, and the results show that the extra consumption of efficiency to improving CPA to CCA2 is considerably low. The proposed scheme is highly secure, flexible, and efficient enough to be deployed in practical Fog computing. INDEX TERMS Fog computing, attribute-based encryption, distributed access control, multi-authority, large-universe. I. INTRODUCTION Cloud Computing seems to provide an ideal solution for the processing of large amounts of data in Internet of Things (IoT), in which end users upload request and download result from a cloud center. And with the rapid development of Information-Centric IoT (IC-IoT), Device-to-Device (D2D) communication makes it more convenient to be deployed [1]. However, this paradigm is not suitable in some circumstances, like latency-sensitive applications in wireless access sensor network or in mobile equipment. To fill this gap, Fog Computing extends Cloud Computing to the edge of the network to provide low latency and location awareness for streaming and realtime applications in IoT. Source-limited end-user devices like wireless sensors are implemented in Fogs to achieve realtime smart computation in connected vehicles, smart grid, wireless sensors and actuators networks, etc. Fog Computing has a wide range of application scenarios, but the problem of information security follows. However, to protect information security in Fogs, existing cryptography schemes in Cloud Computing cannot be 11688

show abstract

“…Among the three types of MKFHE schemes, the NTRU-type MKFHE scheme is the fastest in encryption and decryption, and has the simplest form, and uses the least ciphertexts and keys. The underlying scheme of the NTRU encryption has been used to design various cryptographic primitives, including the digital signatures [15] , identity-based encryption [16,17] , and multilinear maps [18,19] .…”

Section: Introductionmentioning

confidence: 99%

Modified multi-key fully homomorphic encryption based on NTRU cryptosystem without key-switching

Che

Zhou

et al. 2020

Tinshhua Sci. Technol.

View full text Add to dashboard Cite

The Multi-Key Fully Homomorphic Encryption (MKFHE) based on the NTRU cryptosystem is an important alternative to the post-quantum cryptography due to its simple scheme form, high efficiency, and fewer ciphertexts and keys. In 2012, López-Alt et al. proposed the first NTRU-type MKFHE scheme, the LTV12 scheme, using the key-switching and modulus-reduction techniques, whose security relies on two assumptions: the Ring Learning With Error (RLWE) assumption and the Decisional Small Polynomial Ratio (DSPR) assumption. However, the LTV12 and subsequent NTRU-type schemes are restricted to the family of power-of-2 cyclotomic rings, which may affect the security in the case of subfield attacks. Moreover, the key-switching technique of the LTV12 scheme requires a circular application of evaluation keys, which causes rapid growth of the error and thus affects the circuit depth. In this paper, an NTRU-type MKFHE scheme over prime cyclotomic rings without key-switching is proposed, which has the potential to resist the subfield attack and decrease the error exponentially during the homomorphic evaluating process. First, based on the RLWE and DSPR assumptions over the prime cyclotomic rings, a detailed analysis of the factors affecting the error during the homomorphic evaluations in the LTV12 scheme is provided. Next, a Low Bit Discarded & Dimension Expansion of Ciphertexts (LBD&DEC) technique is proposed, and the inherent homomorphic multiplication decryption structure of the NTRU is proposed, which can eliminate the key-switching operation in the LTV12 scheme. Finally, a leveled NTRU-type MKFHE scheme is developed using the LBD&DEC and modulus-reduction techniques. The analysis shows that the proposed scheme compared to the LTV12 scheme can decrease the magnitude of the error exponentially and minimize the dimension of ciphertexts.

show abstract

Revocable hierarchical identity-based broadcast encryption

Cited by 12 publications

References 33 publications

An ID-based Broadcast Encryption Scheme for Cloud-network Integration in Smart Grid

An ID-based Broadcast Encryption Scheme for Cloud-network Integration in Smart Grid

Efficient CCA2 Secure Flexible and Publicly-Verifiable Fine-Grained Access Control in Fog Computing

Modified multi-key fully homomorphic encryption based on NTRU cryptosystem without key-switching

Contact Info

Product

Resources

About