Bounded Ciphertext Policy Attribute Based Encryption

Goyal, Vipul; Jain, Abhishek; Pandey, Omkant; Sahai, Amit

doi:10.1007/978-3-540-70583-3_47

Cited by 388 publications

(232 citation statements)

References 11 publications

Supporting

Mentioning

226

Contrasting

Unclassified

Order By: Relevance

“…To overcome this weakness, Cheung and Newport [3] presented another construction that is proved to be secure under the standard model. Then, Goyal et al [4] presented another construction for more advanced access structures based on number theoretic assumption. Katz, Sahai, and Waters [10] proposed a novel predicate encryption scheme supporting inner product predicates.…”

Section: Related Workmentioning

confidence: 99%

Ciphertext-Policy Attribute-Based Encryption with Key-Delegation Abuse Resistance

Jiang

Susilo

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is a promising cryptographic primitive that allows one-to-many encryption. In such a system, users' private keys are linked to their access rights. We note that if a user can generate a new private key for a portion of his/her access right, this could potentially lead to some undesirable situations, which violate the access control policy. Interestingly, to date, there is no work that looks into this matter in detail nor addresses it. We point out that this is a "property" that exists in ABE systems, which we refer to "key-delegation abuse". ABE systems that suffer from key-delegation abuse will hinder the adoption of these systems in practice. In this work, for the first time in the literature, we address the "key-delegation abuse" problem in Ciphertext-policy Attribute-based Encryption (CP-ABE) systems. We introduce a new mechanism to enhance CP-ABE schemes that provide protections against this key-delegation abuse issue. We formalize the security requirements for such a property, and subsequently construct a CP-ABE scheme that satisfies the new security requirements. We also present an application of our scheme to a traceable CP-ABE, where the "traitors", i.e. the users who have leaked their keys, can be traced. address the "key-delegation abuse" problem in Ciphertext-policy Attribute-based Encryption (CP-ABE) systems. We introduce a new mechanism to enhance CPABE schemes that provide protections against this key-delegation abuse issue. We formalize the security requirements for such a property, and subsequently construct a CP-ABE scheme that satisfies the new security requirements.We also present an application of our scheme to a traceable CP-ABE, where the "traitors", i.e. the users who have leaked their keys, can be traced. Abstract. Attribute-based encryption (ABE) is a promising cryptographic primitive that allows one-to-many encryption. In such a system, users' private keys are linked to their access rights. We note that if a user can generate a new private key for a portion of his/her access right, this could potentially lead to some undesirable situations, which violate the access control policy. Interestingly, to date, there is no work that looks into this matter in detail nor addresses it. We point out that this is a "property" that exists in ABE systems, which we refer to "key-delegation abuse". ABE systems that suffer from key-delegation abuse will hinder the adoption of these systems in practice. In this work, for the first time in the literature, we address the "key-delegation abuse" problem in Ciphertext-policy Attribute-based Encryption (CP-ABE) systems. We introduce a new mechanism to enhance CP-ABE schemes that provide protections against this key-delegation abuse issue. We formalize the security requirements for such a property, and subsequently construct a CP-ABE scheme that satisfies the new security requirements. We also present an application of our scheme to a traceable CP-ABE, where the "traitors", i.e. the users who have leaked their keys, can...

show abstract

Section: Related Workmentioning

confidence: 99%

Ciphertext-Policy Attribute-Based Encryption with Key-Delegation Abuse Resistance

Jiang

Susilo

et al. 2016

Information Security and Privacy

View full text Add to dashboard Cite

show abstract

“…The ciphertext can be decrypted with the decryption key if and only if the attribute set of ciphertext satisfies the access structure of decryption key. [12], [27] CP-ABE: In a CP-ABE scheme, on the contrary, the ciphertext encrypts a message with an access structure while a decryption key is associated with a set of attributes. The decryption condition is similar: if and only if the attribute set fulfils the access structure [14].…”

Section: Kp-abementioning

confidence: 99%

A Novel Constant size Cipher-text Scheme for Security in Real-time Systems

Dhivya¹,

Venkatraman²,

Miranda³

2015

IJCATR

View full text Add to dashboard Cite

Abstract:In this paper, we consider 'secure attribute based system with short ciphertext' is a tool for implementing fine-grained access control over encrypted data, and is conceptually similar to traditional access control methods such as Role-Based Access Control. However, current 'secure attribute based system with short ciphertext' schemes suffer from the issue of having long decryption keys, in which the size is linear to and dependent on the number of attributes.Ciphertext-Policy ABE (CP-ABE) provides a scalable way of encrypting data such that the encryptor defines the attribute set that the decryptor needs to possess in order to decrypt the ciphertext. We propose a novel 'secure attribute based system with short ciphertext' scheme with constantsize decryption keys independent of the number of attributes. We found that the size can be as small as 672 bits.

show abstract

“…Selective security is weaker than adaptive security, requiring the adversary to commit ahead of time to the challenge point a, which is analogous to the selective security notion often adopted in IdentityBased Encryption (IBE) [7], Attribute-Based Encryption (ABE) [22], Functional Encryption (FE) [35] and Predicate Encryption (PE) [8]. The detailed selective security definition is described in Definition 6 in the Appendix.…”

Section: Bilinear Groups and Computational Assumptionmentioning

confidence: 99%

Signatures of Correct Computation

Papamanthou

Shi

Tamassia

2013

Lecture Notes in Computer Science

131

View full text Add to dashboard Cite

We introduce Signatures of Correct Computation (SCC), a new model for verifying dynamic computations in cloud settings. In the SCC model, a trusted source outsources a function f to an untrusted server, along with a public key for that function (to be used during verification). The server can then produce a succinct signature σ vouching for the correctness of the computation of f , i.e., that some result v is indeed the correct outcome of the function f evaluated on some point a. There are two crucial performance properties that we want to guarantee in an SCC construction: (1) verifying the signature should take asymptotically less time than evaluating the function f ; and (2) the public key should be efficiently updated whenever the function changes.We construct SCC schemes (satisfying the above two properties) supporting expressive manipulations over multivariate polynomials, such as polynomial evaluation and differentiation. Our constructions are adaptively secure in the random oracle model and achieve optimal updates, i.e., the function's public key can be updated in time proportional to the number of updated coefficients, without performing a linear-time computation (in the size of the polynomial).We also show that signatures of correct computation imply Publicly Verifiable Computation (PVC), a model recently introduced in several concurrent and independent works. Roughly speaking, in the SCC model, any client can verify the signature σ and be convinced of some computation result, whereas in the PVC model only the client that issued a query (or anyone who trusts this client) can verify that the server returned a valid signature (proof) for the answer to the query. Our techniques can be readily adapted to construct PVC schemes with adaptive security, efficient updates and without the random oracle model.

show abstract

Bounded Ciphertext Policy Attribute Based Encryption

Cited by 388 publications

References 11 publications

Ciphertext-Policy Attribute-Based Encryption with Key-Delegation Abuse Resistance

Ciphertext-Policy Attribute-Based Encryption with Key-Delegation Abuse Resistance

A Novel Constant size Cipher-text Scheme for Security in Real-time Systems

Signatures of Correct Computation

Contact Info

Product

Resources

About