2017
DOI: 10.1007/978-3-319-66402-6_5
|View full text |Cite
|
Sign up to set email alerts
|

Tree-Based Cryptographic Access Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…In this way, only the authorised Subs can recover the content of the publications (R1: ). Note that other well-established techniques that can ensure fine-grained access control, such as [35] and [36], could also be utilised to achieve R1 in our system. Tags and interests are encrypted using an SE scheme.…”
Section: Our Approachmentioning
confidence: 99%
“…In this way, only the authorised Subs can recover the content of the publications (R1: ). Note that other well-established techniques that can ensure fine-grained access control, such as [35] and [36], could also be utilised to achieve R1 in our system. Tags and interests are encrypted using an SE scheme.…”
Section: Our Approachmentioning
confidence: 99%
“…As a fundamental security service, the authorization mechanism becomes increasingly important in modern smart system. The hierarchical key assignment techniques [43,44,45,46] were presented, which can provide fine-grained authentication and access control for the user. In order to mitigate the potential vulnerabilities and protect the user’s privacy, Tang et al [24] integrated the fine-grained authorization mechanism into PKE-ET.…”
Section: Related Workmentioning
confidence: 99%
“…According to the security and privacy of outsourced data, a large number of users must create, share, update and delete it dynamically, Castiglione [ 27 ] provided some new results on Akl and Taylor’s scheme [ 24 ], for flexible and fine-grained access control to support dynamic updates in cloud environments. Alderman [ 28 ] designed a space-efficient KAS based on a binary tree, which eliminates public information as well as imposes logarithmic bounds on the number of derivatives required. This scheme performs better than the existing scheme, reduces the storage requirement of user equipment and logarithmically limits the derivation cost.…”
Section: Related Workmentioning
confidence: 99%