A Dynamic Attribute-Based Group Signature Scheme and its Application in an Anonymous Survey for the Collection of Attribute Statistics

Emura, Keita; Miyaji, Atsuko; Omote, Kazumasa

doi:10.1109/ares.2009.145

Cited by 17 publications

(29 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An attribute tree [12,13] is a tree structure where leaves are attributes and interior nodes are threshold gates and they are used to express logical relations between attributes. For an interior node x, let l x and k x be the numbers of children and the threshold respectively.…”

Section: Down-to-top Attribute Tree Constructionmentioning

confidence: 99%

“…Each node x is indexed with a random number ind(x), and each interior node x is binded to a polynomial q i (x) (i = ind(x)) (Refer to [8,13] for more details.). The degree of q i (x) is l x − 1.…”

Section: Down-to-top Attribute Tree Constructionmentioning

confidence: 99%

“…In this paper, we propose an ABA scheme based on down-to-top built attribute trees as described in [13]. We modify the group signature protocol proposed in [14] in the way that it can be combined with the down-to-top attribute trees to construct an attribute based authentication scheme.…”

Section: Introductionmentioning

confidence: 99%

“…As a result, the system has to build a new attribute tree each time the attribute requirements change. To our best knowledge, there is only one paper [13] in which the attribute tree is built from down to top and it allows dynamic attribute tree construction. In [13], the authors propose an attribute-based group signature based on this down-to-top built attribute trees.…”

Section: Introductionmentioning

confidence: 99%

“…To our best knowledge, there is only one paper [13] in which the attribute tree is built from down to top and it allows dynamic attribute tree construction. In [13], the authors propose an attribute-based group signature based on this down-to-top built attribute trees. In this approach, a central attribute tree is built first and then different attribute trees can be obtained by simplifying the central attribute tree.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Dynamic Attribute-Based Authentication Scheme

Yang

Oleshchuk

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Attribute-based authentication (ABA) is an approach to authenticate users by their attributes, so that users can get authenticated anonymously and their privacy can be protected. In ABA schemes, required attributes are represented by attribute trees, which can be combined with signature schemes to construct ABA schemes. Most attribute trees are built from top to down and can not change with attribute requirement changes. In this paper, we propose an ABA scheme based on down-to-top built attribute trees or dynamic attribute trees, which can change when attribute requirements change. Therefore, the proposed dynamic ABA scheme is more efficient in a dynamic environment by avoiding regenerating the whole attribute tree each time attribute requirements change.

show abstract

Section: Down-to-top Attribute Tree Constructionmentioning

confidence: 99%

Section: Down-to-top Attribute Tree Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Dynamic Attribute-Based Authentication Scheme

Yang

Oleshchuk

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

An efficient KP design framework of attribute‐based searchable encryption for user level revocation in cloud

Mamta

Gupta

2019

Concurrency and Computation

View full text Add to dashboard Cite

Summary Attribute‐based searchable encryption (ABSE) is the combination of attribute‐based encryption (ABE) and searchable encryption with the inherent benefits of fine‐grained access control and expressive searching capabilities in multiuser setting. In this paper, we have used the key‐policy (KP) design framework of ABE and named the scheme KP‐ABSE. The proposed KP‐ABSE scheme efficiently supports user revocation where the computationally intensive tasks are delegated to the cloud server. Furthermore, the proposed scheme generates constant‐size user secret keys and trapdoors and has constant number of pairing operations, which in other schemes typically varies with the number of attributes associated with them. Thus, the proposed scheme reduces computational and storage costs and supports fast searching. Finally, the proposed scheme can be proven secure under a decision linear assumption in a selective security model.

show abstract