Efficient ciphertext-policy attribute-based encryption with blackbox traceability
@article{Xu2020EfficientCA, title={Efficient ciphertext-policy attribute-based encryption with blackbox traceability}, author={Shengmin Xu and Jiaming Yuan and Guowen Xu and Yingjiu Li and Ximeng Liu and Yinghui Zhang and Zuobin Ying}, journal={Inf. Sci.}, year={2020}, volume={538}, pages={19-38} }
6 Citations
Ciphertext Policy Attribute Based Encryption for Arithmetic circuits
- Computer Science, MathematicsIACR Cryptol. ePrint Arch.
- 2021
A new hardness assumption is defined, called (k − 1)-Distance Decisional Diffie-Hellman assumption, which is at least as hard as the k-multilinear decisionaldiffie- Hellman assumption and it is proved that the proposed schemes have adaptive security.
Cryptanalysis on Two Pairing-Free Ciphertext-Policy Attribute-Based Encryption Schemes
- Computer Science, Mathematics2020 International Computer Symposium (ICS)
- 2020
Two pairing-free CP-ABE schemes are independently proposed, using only elliptic curve cryptography, and it is found that their schemes are insecure.
Multi-level on-demand access control for flexible data sharing in cloud
- Computer ScienceClust. Comput.
- 2021
This paper investigates an on-demand access control for flexible sharing of secure data among randomly selected users and tackles user revocation and attribute revocation problems so that, it allows the data owner to revoke a specific user or a group of users.
A revocable and outsourced multi-authority attribute-based encryption scheme in fog computing
- Computer ScienceComput. Networks
- 2021
A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access
- Computer ScienceSecur. Commun. Networks
- 2020
School of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710119, China School of Computer Science and Technology, Xidian University, Jinping 710071, China Network Communication Research Centre, Peng Cheng Laboratory of Trusted Software.
Quantum-resistant anonymous identity-based encryption with trable identities
- Computer ScienceIET Inf. Secur.
- 2022
References
SHOWING 1-10 OF 25 REFERENCES
Efficient Attribute-Based Encryption with Blackbox Traceability
- Computer Science, MathematicsProvSec
- 2018
This paper revisits blackbox ABTT and introduces a new primitive called attribute-based set encryption (ABSE) based on key-policy ABE and identity-basedSet encryption (IBSE), which allows aggregation of multiple related policies and reduce the decryption key size in ABTT to be irrelevant to the number of system users.
White-Box Traceable Ciphertext-Policy Attribute-Based Encryption Supporting Any Monotone Access Structures
- Computer ScienceIEEE Transactions on Information Forensics and Security
- 2013
This work adds traceability to an existing expressive, efficient, and secure CP-ABE scheme without weakening its security or setting any particular trade-off on its performance.
Traceable CP-ABE: How to Trace Decryption Devices Found in the Wild
- Computer Science, MathematicsIEEE Transactions on Information Forensics and Security
- 2015
A general statement is proved that if a CP-ABE scheme is (selectively) traceable against policy-specific decryption blackbox, it is also ( selectively) Traceable against key-like decryptionblackbox, which implies that the authors now only need to focus on building CP- ABE schemes which are traceableAgainst policy- specific decryptionBlackbox traceability.
Attribute-based encryption schemes with constant-size ciphertexts
- Computer Science, MathematicsTheor. Comput. Sci.
- 2012
White-Box Traceable Ciphertext-Policy Attribute-Based Encryption Supporting Flexible Attributes
- Computer ScienceIEEE Transactions on Information Forensics and Security
- 2015
Two practical large universe CP-ABE systems supporting white-box traceability are proposed and have two advantages: 1) the number of attributes is not polynomially bounded and 2) malicious users who leak their decryption keys could be traced.
Practical Attribute-Based Encryption: Traitor Tracing, Revocation and Large Universe
- Computer ScienceComput. J.
- 2014
This paper formalizes the definitions and security models, and proposes constructions of both Ciphertext-Policy ABE and Key-Policy Abe that support public and fully collusion-resistant blackbox traceability, revocation, large universe and any monotonic access structures as policies (i.e. high expressivity).
Blackbox traceable CP-ABE: how to catch people leaking their keys by selling decryption devices on ebay
- Computer Science, MathematicsCCS
- 2013
This paper extends the notion of CP-ABE to support Blackbox Traceability and proposes a concrete scheme which is able to identify a user whose key has been used in building a decryption device from multiple users whose keys associated with the attribute sets which are all the supersets of S_D.
Revocable attribute-based encryption with decryption key exposure resistance and ciphertext delegation
- Computer Science, MathematicsInf. Sci.
- 2019
Ensuring attribute privacy protection and fast decryption for outsourced data security in mobile cloud computing
- Computer ScienceInf. Sci.
- 2017
Attribute-based encryption for fine-grained access control of encrypted data
- Computer ScienceCCS '06
- 2006
This work develops a new cryptosystem for fine-grained sharing of encrypted data that is compatible with Hierarchical Identity-Based Encryption (HIBE), and demonstrates the applicability of the construction to sharing of audit-log information and broadcast encryption.