Lattice-based undeniable signature scheme

被引：6
作者：
Rawal, Swati [1 ]
Padhye, Sahadeo [1 ]
He, Debiao [2 ]
机构：
[1] Motilal Nehru Natl Inst Technol Allahabad, Dept Math, Prayagraj 211004, India
[2] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan, Peoples R China
来源：
ANNALS OF TELECOMMUNICATIONS | 2022年 / 77卷 / 3-4期
关键词：
Lattice-based cryptography; Digital signature; Undeniable signature; ISIS problem; SECURE;
D O I：
10.1007/s12243-021-00843-1
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
In this paper, we propose a lattice-based undeniable signature where security is based on the hardness of the ISIS problem. The security requirements for an undeniable signature scheme are clearly described, and the proposed scheme is proved to enjoy completeness, soundness, unforgeability, and invisibility properties.
引用
收藏
页码：119 / 126
页数：8
相关论文
共 34 条
  • [1] Aboud SJ, 2014, INT J ADV COMPUT SC, V5, P63
  • [2] Aguilar-Melchor C, 2013, CRYPTOGRAPHY CODING, V8308
  • [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] [Anonymous], 1994, Advances in Cryptology CRYPTO 93, DOI DOI 10.1007/3-540-48329-22
  • [6] BOYAR J, 1991, LECT NOTES COMPUT SC, V537, P189
  • [7] CHAUM D, 1990, LECT NOTES COMPUT SC, V435, P212
  • [8] CHAUM D, 1992, LECT NOTES COMPUT SC, V576, P470
  • [9] Damgard I, 1996, LECT NOTES COMPUT SC, V1070, P372
  • [10] Galbraith S. D., 2002, Topics in Cryptology - CT-RSA 2002. Cryptographers' Track at the RSA Conference 2002. Proceedings (Lecture Notes in Computer Science Vol.2271), P200
1234