Traceable-then-revocable ciphertext-policy attribute-based encryption scheme

Liu, Zhenhua; Duan, Shuhong; Zhou, Peilin; Wang, Baocang

doi:10.1016/j.future.2017.09.045

Cited by 64 publications

(77 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In Table 1, the revocable ABE schemes [5,17,32] and our R-CP-ABOOE scheme support user revocation. However, the real (online) encryption algorithms in the schemes [5,17,32] must perform many exponentiation operations, which is unsuitable for mobile devices with limited-computation power. Fortunately, in our scheme, first the offline-encryption phase can be executed by high performance computer in a trusted environment.…”

Section: Performance Analysismentioning

confidence: 99%

“…Modular operation is much faster than the exponentiation operation. Thus, our real encryption algorithm is the fastest among these schemes [5,17,32].…”

Section: Performance Analysismentioning

confidence: 99%

“…In addition, compared with the indirectly revocable ABE [5], our scheme may significantly reduce the key-update cost and the size of update key from O( log( / ) to O( ), which is important since the update keys should be periodically broadcasted to all nonrevoked users. Compared with the directly revocable ABE [17,32] that cannot be integrated with the online/offline technology, our encryption algorithm and ciphertext size are not related to the number of revoked users. Therefore, our scheme has less encryption overhead and shorter ciphertext length than the directly revocable ABE [17,32], which is suitable for data owners with resourcelimited devices.…”

Section: Performance Analysismentioning

confidence: 99%

“…ABE is a useful cryptographic technology to protect private data and achieve fine-grained access control simultaneously [12,13], many variants of ABE were proposed to realize promising properties, e. g., efficient large universe ABE [4], ABE with verifiable outsourced decryption [14][15][16], traceable-then-revocable ABE [17,18], CP-ABE against key-delegation abuse [19], the fully-secure ABE [11], ABE resilience against continuous auxiliary-inputs leakage [20,21].…”

Section: Introductionmentioning

confidence: 99%

“…To reduce the encryption cost of ABE, a few works [9][10][11][12] presented the online/offline ABE by the online/offline cryptography [22][23][24][25], but their schemes cannot revoke users. To satisfy the practical requirement that users' access rights can be revoked dynamically, many revocable ABE schemes have been proposed [10][11][12][13][14][15][16][17][18][19][20]. The core idea of the works [5,7,[26][27][28][29][30][31] utilizes the complete subtree scheme of NNL [8] to revoke user's private key.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with User Revocation

Zhan-jun

Guan

2019

Security and Communication Networks

View full text Add to dashboard Cite

Attribute-Based Encryption (ABE) must provide an efficient revocation mechanism since a user’s private key can be compromised or expired over time. The existing revocable ABE schemes have the drawbacks of heavy computational costs on key updates and encryption operations, which make the entities for performing these operations a possible bottleneck in practice applications. In this paper, we propose an efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with user Revocation (R-CP-ABOOE). We integrate the subset difference method with ciphertext-policy ABE to significantly improve key-update efficiency on the side of the trusted party from O(rlog⁡(N/r)) to O(r), where N is the number of users and r is the number of revoked users. To reduce the encryption burden for mobile devices, we use the online/offline technology to shift the majority of encryption work to the offline phase, and then mobile devices only need to execute a few simple computations to create a ciphertext. In addition, we exploit a novel trick to prove its selective security under the q-type assumption. Performance analysis shows that our scheme greatly improves the key-update efficiency for the trusted party and the encryption efficiency for mobile devices.

show abstract

Section: Performance Analysismentioning

confidence: 99%

“…Modular operation is much faster than the exponentiation operation. Thus, our real encryption algorithm is the fastest among these schemes [5,17,32].…”

Section: Performance Analysismentioning

confidence: 99%

Section: Performance Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with User Revocation

Zhan-jun

Guan

2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

ERSChain: Towards secure and flexible educational resource sharing using consortium blockchain and revocable ciphertext‐policy attribute‐based encryption

Zhao,

He,

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummarySharing high‐quality educational resources has become an effective way to promote educational equity. The traditional educational resource sharing platforms using centralized storage architecture have security issues. Recently, many studies use blockchain to achieve secure sharing of educational resources. However, the existing blockchain‐based educational resource sharing schemes only use blockchain as a storage tool, and have issues such as low sharing efficiency, without considering copyright security, and lack of a trusted sharing environment, which prevents the large‐scale sharing of educational resources. In response, we propose ERSChain, a novel blockchain‐based educational resources sharing solution. First, we put forward a hybrid storage method that keeps the hash value of resource in the blockchain and stores the encrypted resource in the off‐chain, which can alleviate the storage and computing pressure brought by massive educational resources while ensuring the integrity of resources. Second, we construct an efficient revocable ciphertext‐policy attribute‐based encryption algorithm to implement flexible access control and an outsourced decryption algorithm to achieve greater efficiency. Obtaining access to educational resources is possible when user's attributes meet the access policy and the user's identity does not exist in the revocation list. Third, we put forward a credit mechanism to adjust the user's credibility and a credit‐based consensus mechanism to maintain the trusted sharing environment. Finally, security analysis and plentiful of experiments demonstrate that our proposed ERSChain achieves security assurance, has better applicability than similar works, and enables large‐scale sharing of educational resources.

show abstract

Dynamic traceable CP‐ABE with revocation for outsourced big data in cloud storage

Premkamal

Pasupuleti

Alphonse

2020

Int J Communication

View full text Add to dashboard Cite

Summary Ciphertext‐policy attribute‐based encryption (CP‐ABE) is the recommended best practice for outsourced big data access control in the cloud environment. However, most of the existing CP‐ABE schemes do not address the issue of tracing and revoking the malicious user who leaks the secret key for profit, which in turn reduces the security of the CP‐ABE schemes. In this paper, we propose a dynamic traceable CP‐ABE with revocation (DTCP‐ABE) for outsourced big data in cloud storage. DTCP‐ABE scheme dynamically traces who decrypts the ciphertext during the outsourced decryption process, which helps to find the malicious user who leaks the secret key. Our scheme also automatically revokes the malicious users once they are identified. We prove that our scheme is secure against chosen‐plaintext, secret key forging, user collision, and proxy attacks. Furthermore, our scheme also achieves backward revocation security. Performance evaluation proves that our DTCP‐ABE scheme is efficient than other existing schemes.

show abstract

Traceable-then-revocable ciphertext-policy attribute-based encryption scheme

Cited by 64 publications

References 11 publications

Efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with User Revocation

Efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with User Revocation

ERSChain: Towards secure and flexible educational resource sharing using consortium blockchain and revocable ciphertext‐policy attribute‐based encryption

Dynamic traceable CP‐ABE with revocation for outsourced big data in cloud storage

Contact Info

Product

Resources

About