On Multi-Authority Ciphertext-Policy Attribute-Based Encryption

Muller, S. Raschid; Katzenbeisser, Stefan; Eckert, Claudia

doi:10.4134/bkms.2009.46.4.803

Cited by 83 publications

(47 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the keys need some storage space it would make sense to have only one key per sensor node and the different companies just issue new properties to be used on a node, which they can then use with their scopes and tasks. There are publications in this direction, like [88], but they impose much more computational load than the architecture described here and therefore are currently not feasible. Therefore, here a single trusted authority is assumed with a common set of properties that can be issued to the sensor nodes.…”

Section: Revocation Algorithmmentioning

confidence: 99%

Secure Multipurpose Wireless Sensor Networks

Jacobi¹,

Fischlin²,

Buchmann³

2014

Security for Multihop Wireless Networks

View full text Add to dashboard Cite

Section: Revocation Algorithmmentioning

confidence: 99%

Secure Multipurpose Wireless Sensor Networks

Jacobi¹,

Fischlin²,

Buchmann³

2014

Security for Multihop Wireless Networks

View full text Add to dashboard Cite

“…For a good, though somewhat dated, survey see [3]. There are several CP-ABE schemes [10,13,23,2], but only [14], which we modify in this paper, and [24] support policy hiding.…”

Section: Related Workmentioning

confidence: 99%

Hiding the Policy in Cryptographic Access Control

Muller

Katzenbeisser

2012

Security and Trust Management

Self Cite

View full text Add to dashboard Cite

Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows to get rid of a trusted reference monitor by enforcing access rules in a cryptographic way. However, ABE has a privacy problem: The access policies are sent in clear along with the ciphertexts. Further generalizing the idea of policy-hiding in cryptographic access control, we introduce policy anonymity where -similar to the well-understood concept of k-anonymity -the attacker can only see a large set of possible policies that might have been used to encrypt, but is not able to identify the one that was actually used. We show that using a concept from graph theory we can extend a known ABE construction to achieve the desired privacy property.

show abstract

“…several attribute based encoding schemes having multiple authorities have been projected later [7]- [10], however they either additionally use a threshold-based ABE [7], or have a semi-honest central authority [8]- [10] haphazardly several users' collusion attack [7]. The work by Lewko et al [11] and Muller et al [12] square measure the most similar ones to in this they additionally tried to alter the central authority within the CP-ABE into multiple ones. Lewko et al use a LSSS matrix as AN access structure, but their scheme solely converts the AND, OR gates to the LSSS matrix, which limits their encoding policy to Boolean formula, while we inherit the flexibleness of the access tree having threshold gates.…”

Section: IImentioning

confidence: 99%

Achieving Anonymity with Fully Anonymous Attribute-Based Encryption and Controlling Access Privilege in Cloud

Patil¹

2017

IJRASET

View full text Add to dashboard Cite

Cloud computing could be a revolutionary computing paradigm, that allows versatile, on-demand, and inexpensive usage of computing resources, however the info is outsourced to some cloud servers, and varied privacy considerations emerge from it. Various schemes Supported the attribute-based coding have been projected to secure the cloud storage. However, most work focuses on the info contents privacy and therefore the access management, while less attention is paid to the privilege management and therefore the identity privacy. During this paper, a semi anonymous privilege management theme AnonyControl is proposed to handle not solely the data privacy, however conjointly the user identity privacy in existing access control schemes. Anony Control decentralizes the central authority to limit the identity run and therefore achieves semi anonymity. Besides, it conjointly generalizes the file access management to the privilege control, by that privileges of all operations on the cloud knowledge can be managed in an exceedingly fine-grained manner. Afterwards, the Anony Control-F is presented, that totally prevents the identity leakage and succeed the complete namelessness. The security analysis shows that each Anony Control and Anony Control-F square measure secure under the decisional linear Diffie-Hellman assumption, and new performance analysis exhibits the practicableness of new schemes.

show abstract

On Multi-Authority Ciphertext-Policy Attribute-Based Encryption

Cited by 83 publications

References 14 publications

Secure Multipurpose Wireless Sensor Networks

Secure Multipurpose Wireless Sensor Networks

Hiding the Policy in Cryptographic Access Control

Achieving Anonymity with Fully Anonymous Attribute-Based Encryption and Controlling Access Privilege in Cloud

Contact Info

Product

Resources

About