Lattice-based verifiable timed signature and application

CHEN Huiyan; WANG Qingnan; WANG Ke; TAN Shuncong; XIN Hongcai

doi:10.11959/j.issn.1000-436x.2024185

您当前的位置：

首页 >

文章列表页 >

Lattice-based verifiable timed signature and application

Papers | 更新时间：2024-11-14

- Lattice-based verifiable timed signature and application
- Journal on Communications Vol. 45, Issue 10, Pages: 142-152(2024)
- 作者机构：
  
  北京电子科技学院密码科学与技术系，北京 100070
- 作者简介：
- 基金信息：
  
  The Fundamental Research Funds for the Central Universities(3282024048)
- DOI：10.11959/j.issn.1000-436x.2024185
  CLC： TP309.7
- Received：11 July 2024，
  
  Revised：2024-10-08，
  
  Published：25 October 2024
- 稿件说明：
移动端阅览
陈辉焱,王庆楠,王克等.基于格的可验证定时签名与应用[J].通信学报,2024,45(10):142-152.

CHEN Huiyan,WANG Qingnan,WANG Ke,et al.Lattice-based verifiable timed signature and application[J].Journal on Communications,2024,45(10):142-152.
陈辉焱,王庆楠,王克等.基于格的可验证定时签名与应用[J].通信学报,2024,45(10):142-152. DOI： 10.11959/j.issn.1000-436x.2024185.

CHEN Huiyan,WANG Qingnan,WANG Ke,et al.Lattice-based verifiable timed signature and application[J].Journal on Communications,2024,45(10):142-152. DOI： 10.11959/j.issn.1000-436x.2024185.

摘要

针对目前的可验证定时签名（VTS）方案无法有效抵抗量子计算攻击的威胁问题，基于格上困难问题，提出了一种基于格的可验证定时签名（LVTS）方案。该方案不仅符合可验证定时签名不可伪造性和隐私性的基本要求，同时能够在随机预言机模型下实现高度的强不可伪造性，以及在混合实验环境中保障隐私性的有效实施，从而展现出卓越的安全性能。此外，LVTS可被应用在电子拍卖协议（LVTS-EA）中，实现拍卖过程的高效性、安全性以及公平性，为电子拍卖领域提供了一种创新且实用的解决方案。

Abstract

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.

关键词

Keywords

references

RIVEST R L , SHAMIR A , WAGNER D A . Time-lock puzzles and timed-release crypto [R ] . 1996 .

MALAVOLTA G , THYAGARAJAN S A K . Homomorphic time-lock puzzles and applications [C ] // Annual International Cryptology Conference . Berlin : Springer , 2019 : 620 - 649 .

LIU Y , WANG Q , YIU S M . Towards practical homomorphic time-lock puzzles: applicability and verifiability [C ] // European Symposium on Research in Computer Security . Berlin : Springer , 2022 : 424 - 443 .

CHVOJKA P , JAGER T , SLAMANIG D , et al . Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) [C ] // European Symposium on Research in Computer Security . Berlin : Springer , 2021 : 64 - 85 .

LOE A , MEDLEY L , O’CONNELL C , et al . Applications of timed-release encryption with implicit authentication [C ] // International Conference on Cryptology in Africa . Berlin : Springer , 2023 : 490 - 515 .

BONEH D , NAOR M . Timed commitments [C ] // Annual International Cryptology Conference . Berlin : Springer , 2000 : 236 - 254 .

KATZ J , LOSS J , XU J Y . On the security of time-lock puzzles and timed commitments [C ] // Theory of Cryptography . Berlin : Springer , 2020 : 390 - 413 .

ARUN A , BONNEAU J , CLARK J . Short-lived zero-knowledge proofs and signatures [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Berlin : Springer , 2022 : 487 - 516 .

THYAGARAJAN S A K , BHAT A , MALAVOLTA G , et al . Verifiable timed signatures made practical [C ] // Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM Press , 2020 : 1733 - 1750 .

MALAVOLTA G , MORENO-SANCHEZ P , KATE A , et al . Concurrency and privacy with payment-channel networks [C ] // Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM Press , 2017 : 455 - 471 .

BONEH D , DRIJVERS M , NEVEN G . Compact multi-signatures for smaller blockchains [C ] // International Conference on the Theory and Application of Cryptology and Information Securit . Berlin : Springer , 2018 : 435 - 464 .

BENTOV I , KUMARESAN R . How to use bitcoin to design fair protocols [C ] // Annual International Cryptology Conference . Berlin : Springer , 2014 : 421 - 439 .

THYAGARAJAN S A , MALAVOLTA G , SCHMID F , et al . Verifiable timed linkable ring signatures for scalable payments for monero [C ] // European Symposium on Research in Computer Security . Berlin : Springer , 2022 : 467 - 486 .

ZHOU X T , HE D B , NING J T , et al . Efficient construction of verifiable timed signatures and its application in scalable payments [J ] . IEEE Transactions on Information Forensics and Security , 2023 , 18 : 5345 - 5358 .

侯慧莹 , 宁建廷 , 黄欣沂 , 等 . 可验证的属性基定时签名方案及其应用 [J ] . 软件学报 , 2023 , 34 ( 5 ): 2465 - 2481 .

HOU H Y , NING J T , HUANG X Y , et al . Verifiable attribute-based timed signatures and its applications [J ] . Journal of Software , 2023 , 34 ( 5 ): 2465 - 2481 .

BAO Z J , HE D B , FENG Q , et al . Constant-size verifiable timed signatures from RSA group for bitcoin-based voting protocols [J ] . IEEE Transactions on Services Computing , 2024 , 17 ( 4 ): 1414 - 1425 .

NIELSEN M A , CHUANG I L . Quantum computation and quantum information: 10th anniversary edition [M ] . Cambridge : Cambridge University Press , 2010 .

SHOR P W . Algorithms for quantum computation: discrete logarithms and factoring [C ] // Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS) . Piscataway : IEEE Press , 1994 : 124 - 134 .

ARUTE F , ARYA K , BABBUSH R , et al . Quantum supremacy using a programmable superconducting processor [J ] . Nature , 2019 , 574 ( 7779 ): 505 - 510 .

REGEV O . On lattices, learning with errors, random linear codes, and cryptography [C ] // Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing . New York : ACM Press , 2009 : 84 - 93 .

GOLDREICH O , GOLDWASSER S , HALEVI S . Public-key cryptosystems from lattice reduction problems [C ] // Annual International Cryptology Conference . Berlin : Springer , 1997 : 112 - 131 .

MICCIANCIO D , PEIKERT C . Trapdoors for lattices: simpler, tighter, faster, smaller [C ] // European Cryptology Conference . Berlin : Springer , 2012 : 700 - 718 .

NIST . NIST announces first four quantum-resistant cryptographic algorithms [R ] . 2022 .

LYUBASHEVSKY V , MICCIANCIO D . Generalized compact knapsacks are collision resistant [C ] // International Colloquium on Automata, Languages, and Programmin . Berlin : Springer , 2006 : 144 - 155 .

PEIKERT C , ROSEN A . Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices [C ] // Theory of Cryptography . Berlin : Springer , 2006 : 145 - 166 .

LAI R W F , CHEUNG H K F , CHOW S S M . Trapdoors for ideal lattices with applications [C ] // International Conference on Information Security and Cryptology . Berlin : Springer , 2015 : 239 - 256 .

RAJABI B , ESLAMI Z . A verifiable threshold secret sharing scheme based on lattices [J ] . Information Sciences , 2019 , 501 : 655 - 661 .

AFSHAR A , CHUNG K M , HSIEH Y C , et al . On the (Im)possibility of time-lock puzzles in the quantum random oracle model [C ] // International Conference on the Theory and Application of Cryptology and Information Security . Berlin : Springer , 2023 : 339 - 368 .

ISHAI Y , SU H , WU D J . Shorter and faster post-quantum designated-verifier zkSNARKs from lattices [C ] // Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security . New York : ACM Press , 2021 : 212 - 234 .

XIONG J , WANG Q . Anonymous auction protocol based on time-released encryption atop consortium blockchain [J ] . International Journal of Advanced Information Technology , 2019 , 9 ( 1 ): 1 - 16 .

Views

727

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Lattice-based lightweight post quantum access authentication scheme for satellite network

CDBS: blind signature scheme based on CRYSTALS-Dilithium algorithm

Research on password-authenticated key exchange protocol over lattices

Post-quantum verifier-based three-party password authenticated key exchange protocol

Identity-based incremental signature scheme from lattices

Related Author

HAN Zhenzhen

XU Chuan

ZHAO Guofeng

WANG Shanshan

WANG Ke

WANG Wei

SHI Haopeng

CHANG Xin

Related Institution

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

School of Cyber Security and Information Law, Chongqing University of Posts and Telecommunications

Department of Electronic and Communication Engineering, Beijing Electronic Science and Technology Institute

School of Telecommunication Engineering, Xidian University

Department of Cryptogram Engineering, Information Engineering University

AI问答

⁰