Efficient hierarchical identity-based signatures from lattices

被引:2
作者
Tian, Miaomiao [1 ]
Huang, Liusheng [1 ]
Yang, Wei [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei 230026, Peoples R China
基金
中国国家自然科学基金;
关键词
identity-based cryptography; digital signature; lattices; efficiency;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Lattice-based hierarchical identity-based signature (HIBS) schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution (SIS) assumption.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 19 条
[1]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[2]  
Barreto PSLM, 2005, LECT NOTES COMPUT SC, V3788, P515
[3]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[4]  
Boneh D, 2011, LECT NOTES COMPUT SC, V6632, P149, DOI 10.1007/978-3-642-20465-4_10
[5]  
Cash D, 2010, LECT NOTES COMPUT SC, V6110, P523
[6]  
Chow SSM, 2004, LECT NOTES COMPUT SC, V3269, P480
[7]  
Cocks Clifford, 2001, CRYPTOGRAPHY CODING, V2260, P360, DOI DOI 10.1007/3-540-45325-3
[8]   Hierarchical ID-based cryptography [J].
Gentry, C ;
Silverberg, A .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2002, PROCEEDINGS, 2002, 2501 :548-566
[9]  
Gentry C, 2008, ACM S THEORY COMPUT, P197
[10]  
Gordon SD, 2010, LECT NOTES COMPUT SC, V6477, P395, DOI 10.1007/978-3-642-17373-8_23