Signature from the Exponential Hard Lattices

摘要：

We extend the lattice problem to the exponential lattice problem and construct signature schemes in the random oracle model and in the standard model based on the exponential hard lattice. Our signature schemes are strongly unforgeable under chosen message attacks if any one of factoring integer problem, computing discrete logarithm problem, and approximating standard worst-case lattice problems is hard.

关键词： Signature schemes Lattice-based Cryptography Factoring Integers Computing Discrete Logarithms

作者: GU Chunsheng GU Jixing Jing Zhengjun YU Zhiming

作者单位: School of Computer Engineering Jiangsu Teachers University of Technology Changzhou, China, 213001 Inst. of Image Communication & Information Processing Shanghai Jiaotong University Shanghai,China, 2

会议类型: 国际会议

会议名称: 2010 Third International Symposium on Intelligent Ubiquitous and Education(2010年第三届智能普适计算与教育国际研讨会 IUCE 2010)

会议地点: 北京

会议语种:英文

页码: 533-536

在线出版日期: 2010-09-18（万方平台首次上网日期，不代表论文的发表时间）