基于格的可验证定时签名与应用  

Lattice-based verifiable timed signature and application

作　　者：陈辉焱 王庆楠 王克 谭舜聪 辛红彩 CHEN Huiyan;WANG Qingnan;WANG Ke;TAN Shuncong;XIN Hongcai(Department of Cryptology Science and Technology,Beijing Electronic Science and Technology Institute,Beijing 100070,China)

机构地区：[1]北京电子科技学院密码科学与技术系,北京100070

出　　处：《通信学报》2024年第10期142-152,共11页Journal on Communications

基　　金：中央高校基本科研业务费资金资助项目(No.3282024048)。

摘　　要：针对目前的可验证定时签名(VTS)方案无法有效抵抗量子计算攻击的威胁问题,基于格上困难问题,提出了一种基于格的可验证定时签名(LVTS)方案。该方案不仅符合可验证定时签名不可伪造性和隐私性的基本要求,同时能够在随机预言机模型下实现高度的强不可伪造性,以及在混合实验环境中保障隐私性的有效实施,从而展现出卓越的安全性能。此外,LVTS可被应用在电子拍卖协议(LVTS-EA)中,实现拍卖过程的高效性、安全性以及公平性,为电子拍卖领域提供了一种创新且实用的解决方案。Aiming at the problem that current verifiable timed signature(VTS)schemes cannot effectively resist the threat of quantum computing attacks,a lattice-based verifiable timed signature(LVTS)scheme was proposed,founded on challenging problems over lattices.This scheme not only fulfilled the fundamental criteria of unforgeability and privacy for verifiable timed signatures but also attained a heightened level of existential unforgeability in the random oracle model while ensuring the effective enforcement of privacy in hybrid argument.As a result,it exhibited exemplary security performance.Moreover,LVTS could be seamlessly integrated into electronic auction protocols(LVTS-EA)to enhance efficiency,security,and fairness in auction proceedings,offering an innovative and pragmatic solution for the electronic auction domain.

关 键 词：可验证定时签名 格 电子拍卖 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]