Distributed attribute-based encryption

Sascha Müller; Stefan Katzenbeisser; Claudia Eckert

doi:10.1007/978-3-642-00730-9_2

Distributed attribute-based encryption

Sascha Müller
, Stefan Katzenbeisser
, Claudia Eckert

Technische Universität Darmstadt

Research output: Contribution to journal › Conference article › peer-review

181 Scopus citations

Abstract

Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows to encrypt data under an access policy, specified as a logical combination of attributes. Such ciphertexts can be decrypted by anyone with a set of attributes that fits the policy. In this paper, we introduce the concept of Distributed Attribute-Based Encryption (DABE), where an arbitrary number of parties can be present to maintain attributes and their corresponding secret keys. This is in stark contrast to the classic CP-ABE schemes, where all secret keys are distributed by one central trusted party. We provide the first construction of a DABE scheme; the construction is very efficient, as it requires only a constant number of pairing operations during encryption and decryption.

Original language	English
Pages (from-to)	20-36
Number of pages	17
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5461
DOIs	https://doi.org/10.1007/978-3-642-00730-9_2
State	Published - 2009
Externally published	Yes
Event	11th International Conference on Information Security and Cryptology, ICISC 2008 - Seoul, Korea, Republic of Duration: 3 Dec 2008 → 5 Dec 2008

Access to Document

10.1007/978-3-642-00730-9_2

Cite this

@article{9d1b736ec0d2427b88b95c581b8edee3,

title = "Distributed attribute-based encryption",

abstract = "Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows to encrypt data under an access policy, specified as a logical combination of attributes. Such ciphertexts can be decrypted by anyone with a set of attributes that fits the policy. In this paper, we introduce the concept of Distributed Attribute-Based Encryption (DABE), where an arbitrary number of parties can be present to maintain attributes and their corresponding secret keys. This is in stark contrast to the classic CP-ABE schemes, where all secret keys are distributed by one central trusted party. We provide the first construction of a DABE scheme; the construction is very efficient, as it requires only a constant number of pairing operations during encryption and decryption.",

author = "Sascha M{\"u}ller and Stefan Katzenbeisser and Claudia Eckert",

year = "2009",

doi = "10.1007/978-3-642-00730-9\_2",

language = "English",

volume = "5461",

pages = "20--36",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "11th International Conference on Information Security and Cryptology, ICISC 2008 ; Conference date: 03-12-2008 Through 05-12-2008",

}

TY - JOUR

T1 - Distributed attribute-based encryption

AU - Müller, Sascha

AU - Katzenbeisser, Stefan

AU - Eckert, Claudia

PY - 2009

Y1 - 2009

N2 - Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows to encrypt data under an access policy, specified as a logical combination of attributes. Such ciphertexts can be decrypted by anyone with a set of attributes that fits the policy. In this paper, we introduce the concept of Distributed Attribute-Based Encryption (DABE), where an arbitrary number of parties can be present to maintain attributes and their corresponding secret keys. This is in stark contrast to the classic CP-ABE schemes, where all secret keys are distributed by one central trusted party. We provide the first construction of a DABE scheme; the construction is very efficient, as it requires only a constant number of pairing operations during encryption and decryption.

AB - Ciphertext-Policy Attribute-Based Encryption (CP-ABE) allows to encrypt data under an access policy, specified as a logical combination of attributes. Such ciphertexts can be decrypted by anyone with a set of attributes that fits the policy. In this paper, we introduce the concept of Distributed Attribute-Based Encryption (DABE), where an arbitrary number of parties can be present to maintain attributes and their corresponding secret keys. This is in stark contrast to the classic CP-ABE schemes, where all secret keys are distributed by one central trusted party. We provide the first construction of a DABE scheme; the construction is very efficient, as it requires only a constant number of pairing operations during encryption and decryption.

UR - https://www.scopus.com/pages/publications/67049156803

U2 - 10.1007/978-3-642-00730-9_2

DO - 10.1007/978-3-642-00730-9_2

M3 - Conference article

AN - SCOPUS:67049156803

SN - 0302-9743

VL - 5461

SP - 20

EP - 36

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 11th International Conference on Information Security and Cryptology, ICISC 2008

Y2 - 3 December 2008 through 5 December 2008

ER -

Distributed attribute-based encryption

Abstract

Access to Document

Other files and links

Fingerprint

Cite this