Attribute-Based Signature on Lattices

被引：1

作者：

毛贤平 ^{[1
]}

陈克非 ^{[2
]}

龙宇 ^{[1
]}

王亮亮 ^{[1
]}

机构：

[1] School of Electronic Information and Electrical Engineering,Shanghai Jiaotong University

[2] School of Science,Hangzhou Normal University

来源：

Journal of Shanghai Jiaotong University(Science) | 2014年 / 19卷 / 04期

基金：

中国国家自然科学基金;

关键词：

attribute-based signature; lattice; small integer solution problem;

D O I：

暂无

中图分类号：

TN918.91 [通信安全技术];

学科分类号：

0839 ; 1402 ;

摘要：

Attribute-based signature is a versatile class of digital signatures. In attribute-based signature, a signer obtains his private key corresponding to the set of his attributes from a trusted authority, and then he can sign a message with any predicate that is satisfied by his attributes set. Unfortunately, there does not exist an attributebased signature which is resistance to the quantum attacks. This means we do not have secure attribute-based signature schemes in a post-quantum world. Based on this consideration, an attribute-based signature on lattices,which could resist quantum attacks, is proposed. This scheme employs "bonsai tree" techniques, and could be proved secure under the hardness assumption of small integer solution problem.

引用

页码：406 / 411

页数：6

共 17 条

[1] Attribute-based signature and its applications. Li J,LMan H A. Proceedings of the 5th ACM Symposium on Information,Computer and Communications Security . 2010
[2] Trapdoors for hard lattices and new cryptographic constructions. Gentry C,Peikert C,Vaikuntanathan V. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, (STOC’’08) . 2008
[3] Efficient attribute-based signatures for non-monotone predicates in the standard model. Okamoto T,Takashima K. Proceedings of Public Key Cryptography (PKC 2011) . 2011
[4] Attribute-based functional encryption on lattices. Boyen X. Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography . 2013
[5] A lattice-based threshold ring signature scheme. Cayrel P L,Lindner R,R¨uckert M,et al. Progress in Cryptology—LATINCRYPT 2010 . 2010
[6] Lattice-based blind signatures. R¨uckert M. Proceedings of Advances in Cryptology (ASIACRYPT2010) . 2010
[7] Decentralized attributeBased signatures. Okamoto T,Takashima K. Proceedings of Public-Key Cryptography (PKC 2013) . 2013
[8] Bonsai Trees,or How to Delegate a Lattice Basis. D.Cash,et al. Advances in Cryptology Eurocrypt2010 . 2010
[9] On lattices, learning with errors, random linear codes, and cryptography. Regev,O. Pro-ceedings of the thirty-seventh annual ACM symposium on Theory of computing, STOC 2005 . 2005
[10] Generating hard instances of lattice problems (extended abstract). M.AJTAI. STOC’’96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing . 1996

← 1 2 →