Identity-Based Chameleon Signature Schemes over Lattices

被引:1
作者
Zhang, Yanhua [1 ]
Chen, Yan [1 ]
Liu, Ximeng [2 ]
Yin, Yifeng [1 ]
Hu, Yupu [3 ]
机构
[1] Zhengzhou Univ Light Ind, Coll Comp & Commun Engn, Zhengzhou 450001, Peoples R China
[2] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350108, Peoples R China
[3] Xidian Univ, Sch Telecommun Engn, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Chameleon Signature (CS); Lattice; Identity-based cryptography; Non-transferability; Exposure-freeness; HASH;
D O I
10.11999/JEIT230155
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Chameleon Signature (CS) is an ideal designated verifier signature, it realizes non-transferability using chameleon hash function, makes any third party distrust the content disclosed by a designated verifier, and avoids the shortcoming of online interactive verification of undeniable signature. In addition to non transferability, CS also should satisfy unforgeability, deniability, non-repudiation for the signer, and so on. solve the problems that cryptosystems based on the number theory problems such as integer factorization discrete logarithm cannot resist quantum computing attacks and users rely on digital certificates, an Identity Based Chameleon Signature (IBCS) over lattices is proposed, the new scheme avoids the security vulnerability that the signer cannot reject the forged signature of the designated verifier in the existing schemes, and reduces the transmission cost of the final signature from square to linear; Furthermore, to solve the failure problem non-transferability in the arbitration phase, an IBCS scheme with exposure-freeness over lattices is proposed, the new scheme enables the signer to reject a forged signature of any adversary without exposing the real message. Particularly, based on the hardness of the small integer solution problem, both schemes can be proved secure in the random oracle model.
引用
收藏
页码:757 / 764
页数:8
相关论文
共 20 条
[1]  
Agrawal S, 2010, LECT NOTES COMPUT SC, V6223, P98, DOI 10.1007/978-3-642-14623-7_6
[2]  
Ajtai M., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P99, DOI 10.1145/237814.237838
[3]   Generating Shorter Bases for Hard Random Lattices [J].
Alwen, Joel ;
Peikert, Chris .
THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) :535-553
[4]  
Ateniese G, 2004, LECT NOTES COMPUT SC, V3110, P164
[5]  
Cash D, 2010, LECT NOTES COMPUT SC, V6110, P523
[6]  
CHAUM D, 1990, LECT NOTES COMPUT SC, V435, P212
[7]  
Gentry C, 2008, ACM S THEORY COMPUT, P197
[8]  
Jakobsson M, 1996, LECT NOTES COMPUT SC, V1070, P143
[9]   Transitioning organizations to post-quantum cryptography [J].
Joseph, David ;
Misoczki, Rafael ;
Manzano, Marc ;
Tricot, Joe ;
Pinuaga, Fernando Dominguez ;
Lacombe, Olivier ;
Leichenauer, Stefan ;
Hidary, Jack ;
Venables, Phil ;
Hansen, Royal .
NATURE, 2022, 605 (7909) :237-243
[10]  
KRAWCZYK H, Chameleon hashing and signaturesOL