Name
Abstract | ||
|---|---|---|
Attribute-based encryption (ABE) enables fine-grained access control of encrypted data. This technique has been carefully scrutinised by the research community for over a decade, and it has wide theoretical interests as well as practical potentials. Thus, any efficiency improvement of it is highly desirable but non-trivial. In this paper, we demonstrate that the computational costs in ABE can be slightly reduced using Blakley secret sharing. The main reason that contributes to this improvement is a unique feature enjoyed by Blakley secret sharing, i.e. it is more efficient to handle (n, n)-threshold secret sharing compared with Shamir secret sharing. Due to the space limitation, we only describe how to improve key-policy attribute-based encryption (KP-ABE), but our method is very general and it can be used to improve some of its variants similarly, e.g. cipher-policy attribute-based encryption (CP-ABE). This work may also inspire further investigations on Blakley secret sharing, both applying this unique feature to other cryptographic primitives and exploring more undiscovered features. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-55304-3_33 | ACISP |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhe Xia | 1 | 19 | 8.17 |
| Bo Yang | 2 | 0 | 0.34 |
| Yanwei Zhou | 3 | 22 | 11.90 |
| Mingwu Zhang | 4 | 1 | 3.74 |
| Yi Mu | 5 | 2884 | 239.05 |