Efficient and secure attribute-based signature for monotone predicates

被引:0
作者
Ke Gu
Weijia Jia
Guojun Wang
Sheng Wen
机构
[1] Changsha University of Science and Technology,School of Computer and Communication Engineering
[2] Central South University,School of Information Science and Engineering
[3] Deakin University,School of Information Technology
来源
Acta Informatica | 2017年 / 54卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Attribute-based signature (ABS) is a novel cryptographic primitive, which can make the signing party sign a message with fine-grained control over identifying information. ABS only reveals the fact that the verified message must be signed by a user with a set of attributes satisfying a predicate. Thus, ABS can hide any identifying information and make fine-grained control on signing. Presently, many attribute-based signature schemes have been proposed, but most of them are not very efficient. Maji et al. recently presented a complete definition and construction about ABS for monotone predicates and showed three instantiations under their framework for ABS. Although the most practical one of their instantiations is efficient, the instantiation is constructed in the generic group model and has been proved to be insecure. Then, Okamoto et al. proposed an attribute-based signature scheme in the standard model, which can support generalized non-monotone predicates over access structure. However, their scheme is not efficient in practice. In this paper, we present a framework for ABS and show a detailed security model for ABS. Under our framework, we present an attribute-based signature scheme for monotone predicates in the standard model, where we choose the Waters’ signature scheme as the prototype of our attribute-based signature scheme. Compared with the Maji’s scheme in the generic group model, the proposed scheme is constructed in the standard model. Furthermore, compared with the Okamoto’s scheme, the proposed scheme is more efficient by decreasing the computation cost.
引用
收藏
页码:521 / 541
页数:20
相关论文
共 3 条
[1]  
Bender A(2009)Ring signatures: stronger definitions, and constructions without random oracles J. Cryptol. 22 114-138
[2]  
Katz J(undefined)undefined undefined undefined undefined-undefined
[3]  
Morselli R(undefined)undefined undefined undefined undefined-undefined