Efficient and strongly unforgeable identity-based signature scheme from lattices in the standard model

被引：32

作者：

Liu, Zhenhua ^{[1
,2
]}

Hu, Yupu ^{[3
]}

Zhang, Xiangsong ^{[4
]}

Li, Fagen ^{[2
]}

机构：

[1] Xidian Univ, Dept Math, Xian 710071, Shaanxi, Peoples R China

[2] Univ Elect Sci & Technol China, Network & Data Secur Key Lab Sichuan Prov, Chengdu 611731, Sichuan, Peoples R China

[3] Xidian Univ, Minist Educ, Key Lab Comp Networks & Informat Secur, Xian 710071, Shaanxi, Peoples R China

[4] Xian Technol Univ, Sch Sci, Xian 710032, Shaanxi, Peoples R China

来源：

SECURITY AND COMMUNICATION NETWORKS | 2013年 / 6卷 / 01期

基金：

中国国家自然科学基金;

关键词：

digital signature; lattice cryptography; identity-based cryptography; provable security; standard model; ID-BASED SIGNATURES; SECURE;

D O I：

10.1002/sec.531

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An identity-based signature scheme from lattices is constructed. The scheme is obtained from a modification of Agrawal, Boneh, and Boyen's lattice identity-based encryption scheme. In this construction, we use two distinct trapdoors for finding short bases. One trapdoor enables the real implementation to generate short bases for all lattices. The other trapdoor enables the simulator to generate short bases for all lattices. Furthermore, the generating short bases are used to sample short vectors as signatures. Our scheme is computationally efficient. The scheme's strong unforgeability is proven in the standard model and rests on the hardness of the small integer solution problem. Finally, we extend the basic construction to obtain a hierarchical identity-based signature scheme. Copyright (c) 2012 John Wiley & Sons, Ltd.

引用

页码：69 / 77

页数：9

共 36 条

[1]

Agrawal S, 2010, LECT NOTES COMPUT SC, V6110, P553

[2]

Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1

[3] Generating Shorter Bases for Hard Random Lattices [J].

Alwen, Joel ;

Peikert, Chris .

THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553

[4]

An JH, 2002, LECT NOTES COMPUT SC, V2332, P83

[5]

[Anonymous], 2009, 2009359 CRYPT EPRINT

[6]

[Anonymous], 2009, INT ASS CRYPTOL RES

[7]

Au MH, 2006, LECT NOTES COMPUT SC, V4266, P1

[8]

Barreto PSLM, 2005, LECT NOTES COMPUT SC, V3788, P515

[9] Identity-based encryption from the Weil pairing [J].

Boneh, D ;

Franklin, M .

SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615

[10]

Boneh D, 2006, LECT NOTES COMPUT SC, V3958, P229

← 1 2 3 4 →