Practical Direct Chosen Ciphertext Secure Key-Policy Attribute-Based Encryption with Public Ciphertext Test

Author(s):  
Weiran Liu ◽  
Jianwei Liu ◽  
Qianhong Wu ◽  
Bo Qin ◽  
Yunya Zhou
2019 ◽  
Vol 470 ◽  
pp. 175-188 ◽  
Author(s):  
Jiguo Li ◽  
Qihong Yu ◽  
Yichen Zhang ◽  
Jian Shen

2020 ◽  
Author(s):  
yunxiu ye ◽  
Zhenfu Cao ◽  
Jiachen Shen

Abstract Attribute-based encryption received widespread attention as soon as it proposes. However, due to its specific characteristics, the attribute-based access control method is not flexible enough in actual operation. In addition, since access authorities are determined according to users' attributes, users sharing the same attributes are difficult to distinguish. Once a malicious user makes illicit gains by their decryption authorities, it is difficult to trace specific users. This paper follows the practical demand to propose a more flexible key-policy attribute-based encryption scheme with black-box traceability. The scheme has a constant number of constant parameters which can be utilized to construct attribute-related parameters flexibly, and the method of traitor tracing in broadcast encryption is introduced to achieve effective malicious user tracing. In addition, the security and feasibility can be proved by the security proofs and performance evaluation in this paper.


2016 ◽  
Vol 18 (05) ◽  
pp. 64-71 ◽  
Author(s):  
Prof. Dipa Dharmadhikari ◽  
Sonali Deshpande

2018 ◽  
Vol 7 (4.10) ◽  
pp. 396
Author(s):  
K. Senthil Kumar ◽  
D. Malathi

Important and sensitivity data of users in a third party managed internet or cloud always pose various security as well as privacy issues. Attribute-based encryption (ABE) is a pleasant trend in the literature which addresses above problem in an efficient way, and provides data security and fine-grained access control in a decentralized manner,. Key-policy attribute-based encryption (KP-ABE) is an important type of ABE, in which user can decrypt his message with a set of attributes and private keys are embedded with a access control structure which defines which cipher text  an user can be allowed to decrypt. In this paper we use a probabilistic context free grammar with an And-Or structure to represent access control structure. And-Or graph has high expressive power hence access control structure can be represented in an efficient manner.  


Sign in / Sign up

Export Citation Format

Share Document