Secure attribute-based systems

Pirretti, Matthew; Traynor, Patrick; McDaniel, Patrick; Waters, Brent

doi:10.3233/jcs-2009-0383

Cited by 185 publications

(131 citation statements)

References 29 publications

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…Recently, several attribute revocable ABE schemes have been announced [2,3,4]. Undoubtedly, these approaches have two main problems, which consists of security degradation in terms of the backward and forward security [1,5].…”

Section: Related Workmentioning

confidence: 99%

New Ciphertext-Policy Attribute-Based Access Control with Efficient Revocation

Xie

Jin

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Attribute-Based Encryption (ABE) is one of the promising cryptographic primitives for fine-grained access control of shared outsourced data in cloud computing. However, before ABE can be deployed in data outsourcing systems, it has to provide efficient enforcement of authorization policies and policy updates. However, in order to tackle this issue, efficient and secure attribute and user revocation should be supported in original ABE scheme, which is still a challenge in existing work. In this paper, we propose a new ciphertext-policy ABE (CP-ABE) construction with efficient attribute and user revocation. Besides, an efficient access control mechanism is given based on the CP-ABE construction with an outsourcing computation service provider.

show abstract

Section: Related Workmentioning

confidence: 99%

New Ciphertext-Policy Attribute-Based Access Control with Efficient Revocation

Xie

Jin

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Another approach to evaluate the CHECK function is attribute based encryption see Goyal et al [8], Pirretti et al [13], Sahai and Waters [15]. The idea is to associate each attribute a i in the system with some secret component of some private key sk.…”

Section: Related Workmentioning

confidence: 99%

T-Match: Privacy-Preserving Item Matching for Storage-Only RFID Tags

Elkhiyaoui

Blaß

Molva

2013

Radio Frequency Identification. Security and Privacy Issues

View full text Add to dashboard Cite

Abstract. RFID-based tag matching allows a reader R k to determine whether two tags Ti and Tj store some attributes that jointly fulfill a boolean constraint. The challenge in designing a matching mechanism is tag privacy. While cheap tags are unable to perform any computation, matching has to be achieved without revealing the tags' attributes. In this paper, we present T-MATCH, a protocol for secure and privacy preserving RFID tag matching. T-MATCH involves a pair of tags Ti and Tj, a reader R k , and a backend server S. To ensure tag privacy against R k and S, T-MATCH employs a new technique based on secure two-party computation that prevents R k and S from disclosing tag attributes. For tag privacy against eavesdroppers, each tag Ti in T-MATCH stores an IND-CPA encryption of its attribute. Such an encryption allows R k to update the state of Ti by merely re-encrypting Ti's ciphertext. T-MATCH targets cheap tags that cannot perform any computation, but are only required to store 150 bytes.

show abstract

“…It is used as a building-block in applications that demand complex access control to encrypted data [PTMW06], in designing protocols for verifiably outsourcing computations [PRV12], and for single-use functional encryption [GKP + 13b]. Here we focus on key-policy ABE where the access policy is embedded in the secret key.…”

Section: Introductionmentioning

confidence: 99%

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

Boneh

Gentry

Gorbunov

et al. 2014

Lecture Notes in Computer Science

320

142

View full text Add to dashboard Cite

Abstract. We construct the first (key-policy) attribute-based encryption (ABE) system with short secret keys: the size of keys in our system depends only on the depth of the policy circuit, not its size. Our constructions extend naturally to arithmetic circuits with arbitrary fan-in gates thereby further reducing the circuit depth. Building on this ABE system we obtain the first reusable circuit garbling scheme that produces garbled circuits whose size is the same as the original circuit plus an additive poly(λ, d) bits, where λ is the security parameter and d is the circuit depth. All previous constructions incurred a multiplicative poly(λ) blowup.We construct our ABE using a new mechanism we call fully keyhomomorphic encryption, a public-key system that lets anyone translate a ciphertext encrypted under a public-key x into a ciphertext encrypted under the public-key (f (x), f) of the same plaintext, for any efficiently computable f . We show that this mechanism gives an ABE with short keys. Security of our construction relies on the subexponential hardness of the learning with errors problem.We also present a second (key-policy) ABE, using multilinear maps, with short ciphertexts: an encryption to an attribute vector x is the size of x plus poly(λ, d) additional bits. This gives a reusable circuit garbling scheme where the garbled input is short. This paper is the result of merging two works [GGH + ] and [BNS].

show abstract

Secure attribute-based systems

Cited by 185 publications

References 29 publications

New Ciphertext-Policy Attribute-Based Access Control with Efficient Revocation

New Ciphertext-Policy Attribute-Based Access Control with Efficient Revocation

T-Match: Privacy-Preserving Item Matching for Storage-Only RFID Tags

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

Contact Info

Product

Resources

About