A Secure Threshold Signature Scheme from Lattices

被引:2
作者
Wang, Kerui [1 ]
Xu, Qiuliang [1 ]
Zhang, Guoyan [1 ]
机构
[1] Shandong Univ, Sch Comp Sci & Technol, Jinan, Shandong, Peoples R China
来源
2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS) | 2013年
关键词
threshold; signature; lattice; cryptography;
D O I
10.1109/CIS.2013.105
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Lattices are the most fascinating mathematical tool used in modern cryptography. Cryptographic schemes based on lattices have got rapid development in almost all areas, like public key encryption, group and ring signature, identity-based encryption, attribute-based encryption, and even fully homomorphic encryption, except that there barely are not threshold schemes. In this work, we give a direct construction of a threshold signature scheme from lattices, which is proved to be non-adaptive existential unforgeable in the random oracles. Our scheme do not need any interactions between the players. The dealer holds the system public key. Each player holds its own public-secret pair. Each player gets verified signature share separately and combines all individual signature shares into a final signature. Furthermore, the dealer can not imitate the signature shares.
引用
收藏
页码:469 / 473
页数:5
相关论文
共 13 条
[1]  
Agrawal S., 2011, FUZZY IDENTITY BASED
[2]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[3]  
Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
[4]  
Ajtai M., 1999, Automata, Languages and Programming. 26th International Colloquium, ICALP'99. Proceedings (Lecture Notes in Computer Science Vol.1644), P1
[5]  
Alwen J., 2009, Proceedings of STACS, V09001, P75
[6]  
[Anonymous], 2013, ACNS LECT NOTES COMP
[7]  
Gentry C, 2008, ACM S THEORY COMPUT, P197
[8]  
Gordon SD, 2010, LECT NOTES COMPUT SC, V6477, P395, DOI 10.1007/978-3-642-17373-8_23
[9]   GROUP-ORIENTED (T,N) THRESHOLD DIGITAL SIGNATURE SCHEME AND DIGITAL MULTISIGNATURE [J].
HARN, L .
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 1994, 141 (05) :307-313
[10]   Worst-case to average-case reductions based on Gaussian measures [J].
Micciancio, Daniele ;
Regev, Oded .
SIAM JOURNAL ON COMPUTING, 2007, 37 (01) :267-302