2012
DOI: 10.1007/978-3-642-33272-2_13
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Fully Secure Attribute-Based Encryption Schemes for General Access Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 25 publications
0
3
0
Order By: Relevance
“…Then, the algorithm can recover the message M from 1 by (7). We now argue that the above scheme is not hidden policy.…”
Section: Keygen(mentioning
confidence: 92%
See 1 more Smart Citation
“…Then, the algorithm can recover the message M from 1 by (7). We now argue that the above scheme is not hidden policy.…”
Section: Keygen(mentioning
confidence: 92%
“…There is a close relation between LSSS and MSP access structure, and Beimel et al [6] proved it. Pandit and Barua [7] used minimal sets to realize the smallest MSP for describing general access structure in ABE systems.…”
Section: Introductionmentioning
confidence: 99%
“…Theorem 1. [17] If there exists a linear secret sharing scheme (LSSS) for a concrete MAS, then there must be a smallest MSP for the same MAS.…”
Section: Definition 2(minimal Set Of a Mas)mentioning
confidence: 99%