Defending against Key Abuse Attacks in KP-ABE Enabled Broadcast Systems
Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications EngineeringPublished 1 January 2009
Shucheng Yu, Kui Ren, Wenjing Lou, Jin Li
Citations70
SJR quartileQ4
SJR score0.16
SNIP0.16
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes a novel KP-ABE scheme which is able to disclose any illegal key distributor’s ID when key abuse is detected and is provably secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption and the decisional Linear (DL) assumption.
Abstract
Key-Policy Attribute-Based Encryption (KP-ABE) is a promising cryptographic primitive which enables fine-grained access control over sensitive data. However, key abuse attacks in KP-ABE may impede its wide application especially in copyright-sensitive systems. To defend against this kind of attacks, this paper proposes a novel KP-ABE scheme which is able to disclose any illegal key distributor's ID when key abuse is detected. In our scheme, each bit of user ID is defined as an attribute and the user secret key is associated with his unique ID. The tracing algorithm fulfills its task by tricking the pirate device into decrypting the ciphertext associated with the corresponding bits of his ID. Our proposed scheme has the salient property of black box tracing, i.e., it traces back to the illegal key distributor's ID only by observing the pirate device's outputs on certain inputs. In addition, it does not require the pirate device's secret keys to be well-formed as compared to some previous work. Our proposed scheme is provably secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption and the Decisional Linear (DL) assumption.
Keywords
Computer Science
Lecture notes in computer scienceIdentity-Based Encryption from the Weil Pairing
6,986 Citations2001Dan Boneh, Matthew Franklin
This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
Attribute-based encryption for fine-grained access control of encrypted data
4,941 Citations2006Vipul Goyal, Omkant Pandey +2 more
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.
Ciphertext-Policy Attribute-Based Encryption
4,870 Citations2007John Bethencourt, Amit Sahai +1 more
A system for realizing complex access control on encrypted data that is conceptually closer to traditional access control methods such as role-based access control (RBAC) and secure against collusion attacks is presented.
Lecture notes in computer scienceFuzzy Identity-Based Encryption
4,384 Citations2005Amit Sahai, Brent Waters
Two constructions of Fuzzy IBE schemes can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity and are both error-tolerant and secure against collusion attacks.
Lecture notes in computer scienceShort Group Signatures
2,037 Citations2004Dan Boneh, Xavier Boyen +1 more
This work constructs a short group signature scheme based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption, and proves security of the system, in the random oracle model, using a variant of the security definition for group signatures recently given.
Lecture notes in computer sciencePredicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
1,079 Citations2008Jonathan Katz, Amit Sahai +1 more
Provably secure ciphertext policy ABE
815 Citations2007Ling Cheung, Calvin Newport
The basic scheme is proven to be chosen plaintext (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption and the Canetti-Halevi-Katz technique is applied to obtain a chosen ciphertext (CCA) secure extension using one-time signatures.
Lecture notes in computer scienceTraitor Tracing with Constant Transmission Rate
674 Citations2002Aggelos Kiayias, Moti Yung
This work presents a general methodology and two protocol constructions that result in the first two public-key traitor tracing schemes with constant transmission rate in settings where plaintexts can be calibrated to be sufficientlylarge.
Lecture notes in computer scienceAttribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
392 Citations2008Takashi Nishide, Kazuki Yoneyama +1 more
This work proposes attribute-based encryption schemes where encryptor-specified access structures (also called ciphertext policies) are hidden and proves security of the construction based on the Decisional Bilinear Diffie-Hellman assumption and the Decision Linear assumption.
Lecture notes in computer scienceAn Efficient Public Key Traitor Tracing Scheme
285 Citations1999Dan Boneh, Matthew Franklin
A public key encryption scheme in which there is one public encryption key, but many private decryption keys is constructed, which provides a simple and effcient solution to the "traitor tracing problem".
Lecture notes in computer scienceFully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
251 Citations2006Dan Boneh, Amit Sahai +1 more
This work constructs a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys and introduces a simpler primitive called private linear broadcast encryption (PLBE), showing that any PLBE gives a tracing traitor system with the same parameters.
Lecture notes in computer sciencePrivacy-Aware Attribute-Based Encryption with User Accountability
193 Citations2009Jin Li, Kui Ren +2 more
This paper proposes the notion of accountable, anonymous, and ciphertext-policy ABE (CP-A3BE, in short) and gives out a concrete construction, which can be achieved in black-box model by embedding additional user-specific information into the attribute private key issued to that user, while still maintaining hidden access policy.
Attribute-Based Publishing with Hidden Credentials and Hidden Policies.
121 Citations2007Apu Kapadia, Patrick P. Tsang +1 more
A system called PEAPOD (PrivacyEnhanced Attribute-based Publishing Of Data) that provides the following properties: users can securely publish data protected by attribute-based policies to multiple possible recipients without requiring interaction between senders and receivers.
IACR Cryptology ePrint ArchiveA2BE: Accountable Attribute-Based Encryption for Abuse Free Access Control.
95 Citations2009Jin Li, Kui Ren +1 more
Attribute-based content distribution with hidden policy
77 Citations2008Shucheng Yu, Kui Ren +1 more
A novel distributed access control approach for CDNs is proposed by exploiting a new cryptographic primitive called ciphertext policy attributed-based encryption (CP-ABE), which provides flexible yet fine-grained access control (per file level) so that the contents are available only to the authorized users.
FDAC: Toward Fine-Grained Distributed Data Access Control in Wireless Sensor Networks
47 Citations2009Shucheng Yu, Kui Ren +1 more
This paper proposes a distributed data access control scheme that is able to fulfill fine-grained access control over sensor data and is resilient against strong attacks such as sensor compromise and user colluding and is the first to realize distributed fine-grained data access control for WSNs.
Attribute-based on-demand multicast group setup with membership anonymity
32 Citations2008Shucheng Yu, Kui Ren +1 more
This paper proposes a highly scalable solution for dynamical multicast group setup and yet protecting group membership anonymity simultaneously, via a novel design that integrates both ciphertextpolicy attribute-based encryption (CP-ABE) and centralized flat table (CFT) techniques.