{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:29Z","timestamp":1759638869813,"version":"3.37.3"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"State Key Program of National Natural Science Foundation of China","award":["61632020"],"award-info":[{"award-number":["61632020"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071280"],"award-info":[{"award-number":["62071280"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Innovation Bases Special Project of Key Laboratory of Shandong Province for Software Engineering","award":["11480004042015"],"award-info":[{"award-number":["11480004042015"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,16]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Lattice-based online\/offline signature is attractive for the merit of resisting quantum attacks besides the short online response time. Prior to this work, the hash-sign-switch paradigm lattice-based online\/offline signatures usually increase the length of each signature, and the Fiat\u2013Shamir candidates are highly inefficient due to multiple aborts in online signing phase. In this work we mainly address its efficient issue and propose a new paradigm of its construction in the perspective of abort. In this paradigm, one tries to remove one or more aborts from online to offline signing phase by $\\Gamma $-transformation. Specifically, this work proposes an efficient lattice-based online\/offline signature scheme with fewer online aborts and thus allows the signer to obtain a valid signature by fewer online repetitions. Through this way, the resulting scheme can reduce much online signing time with the same signature size. The performance evaluation shows that our scheme is efficient and practical.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab074","type":"journal-article","created":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T11:24:18Z","timestamp":1620473058000},"page":"2400-2410","source":"Crossref","is-referenced-by-count":1,"title":["A New and Efficient Lattice-Based Online\/Offline Signature From Perspective of Abort"],"prefix":"10.1093","volume":"65","author":[{"given":"Pingyuan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering , Zhengzhou University of Light Industry, Zhengzhou 450002, China"}]},{"given":"Han","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Software , Shandong University, Jinan 250101, China"}]},{"given":"Zhihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering , Shandong Normal University, Jinan 250358, China"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering , Shandong Normal University, Jinan 250358, China"}]},{"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Software , Shandong University, Jinan 250101, China"}]}],"member":"286","published-online":{"date-parts":[[2021,5,31]]},"reference":[{"key":"2022091610474331200_ref1","first-page":"263","article-title":"On-line\/Off-line Digital Signatures","volume-title":"Advance in Cryptography\u2013CRYPTO 1989","author":"Even","year":"1989"},{"key":"2022091610474331200_ref2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/11745853_22","article-title":"New Online\/Offline Signature Schemes Without Random Oracles","volume-title":"Public Key Cryptography\u2013PKC 2006","author":"Kurosawa","year":"2006"},{"key":"2022091610474331200_ref3","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-540-72738-5_2","article-title":"Efficient Generic On-line\/Off-line Signatures Without Key Exposure","volume-title":"Applied Cryptography and Network Security","author":"Chen","year":"2007"},{"key":"2022091610474331200_ref4","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-642-21518-6_32","article-title":"Efficient Online\/Offline Signatures With Computational Leakage Resilience in Online Phase","volume-title":"Int. Conf. Information Security and Cryptology","author":"Guo","year":"2011"},{"key":"2022091610474331200_ref5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-44647-8_21","article-title":"Improved Online\/Offline Signature Schemes","volume-title":"Advance in Cryptography\u2013CRYPTO 2001","author":"Shamir","year":"2001"},{"key":"2022091610474331200_ref6","first-page":"186","article-title":"How to Prove Yourself: Practical Solutions to Identification and Signature Problems","volume-title":"Advance in Cryptography\u2013CRYPTO 1986","author":"Fiat","year":"1986"},{"key":"2022091610474331200_ref7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00196725","article-title":"Efficient signature generation for smart cards","volume":"4","author":"Schnorr","year":"1991","journal-title":"J. Cryptol."},{"key":"2022091610474331200_ref8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-319-99807-7_12","article-title":"A New Design of Online\/Offline Signatures Based on Lattice","volume-title":"Information Security Practice and Experience\u20132018","author":"Zheng","year":"2018"},{"key":"2022091610474331200_ref9","first-page":"143","article-title":"Revisiting TESLA in the Quantum Random Oracle Model","volume-title":"Post-Quantum Cryptography\u2013PQCrypto 2017","author":"Alkim","year":"2017"},{"key":"2022091610474331200_ref10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-319-04852-9_2","article-title":"An Improved Compression Technique for Signatures Based on Learning With Errors","volume-title":"Cryptographers Track at the RSA Conf.\u2013CT-RSA 2014","author":"Bai","year":"2014"},{"key":"2022091610474331200_ref11","article-title":"Lattice-Based Digital Signature Scheme qTESLA","volume-title":"Submission to NIST\u2019s Post-Quantum Project, 2018","author":"Bindel","year":"2018"},{"key":"2022091610474331200_ref12","first-page":"238","article-title":"CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme","volume-title":"Cryptographic Hardware and Embedded Systems\u2013CHES 2018","author":"Ducas","year":"2018"},{"key":"2022091610474331200_ref13","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/978-3-642-29011-4_43","article-title":"Lattice Signatures Without Trapdoors","volume-title":"Advance in Cryptography\u2013EUROCRYPT 2012","author":"Lyubashevsky","year":"2012"},{"key":"2022091610474331200_ref14","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-40041-4_3","article-title":"Lattice Signatures and Bimodal Gaussians","volume-title":"Advance in Cryptography\u2013CRYPTO 2013","author":"Ducas","year":"2013"},{"key":"2022091610474331200_ref15","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1007\/978-3-642-10366-7_35","article-title":"Fiat\u2013Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures","volume-title":"Advance in Cryptography\u2013ASIACRYPT 2009","author":"Lyubashevsky","year":"2009"},{"key":"2022091610474331200_ref16","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1109\/TIFS.2012.2232653","article-title":"Online\/offline signatures for low-power devices","volume":"8","author":"Yao","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"2022091610474331200_ref17","first-page":"529","article-title":"Practical Aggregate Signature From General Elliptic Curves, and Applications to Blockchain","volume-title":"Asia Conf. Computer and Communications Security\u2013AsiaCCS 2019","author":"Zhao","year":"2019"},{"key":"2022091610474331200_ref18","first-page":"164","article-title":"Identity-Based Chameleon Hash and Applications","volume-title":"Finacial Cryptography\u2013FC 2004","author":"Ateniese","year":"2004"},{"key":"2022091610474331200_ref19","first-page":"98","article-title":"Optimal Online\/Offline Signature: How to Sign a Message Without Online Computation","volume-title":"Int. Conf. Provable Security\u2013ProvSec 2008","author":"Guo","year":"2008"},{"key":"2022091610474331200_ref20","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/978-3-319-49151-6_7","article-title":"Practical Signature Scheme From T Protocol","volume-title":"Information Security Practice and Experience\u2013ISPEC 2016","author":"Ma","year":"2016"},{"key":"2022091610474331200_ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","article-title":"On Ideal Lattices and Learning With Errors Over Rings","volume-title":"Advance in Cryptography\u2013EUROCRYPT 2010","author":"Lyubashevsky","year":"2010"},{"key":"2022091610474331200_ref22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-642-38348-9_3","article-title":"A Toolkit for Ring-LWE Cryptography","volume-title":"Advance in Cryptography\u2013EUROCRYPT 2013","author":"Lyubashevsky","year":"2013"},{"key":"2022091610474331200_ref23","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-642-30057-8_3","article-title":"Ring-LWE in Polynomial Rings","volume-title":"Public Key Cryptography\u2013PKC 2012","author":"Ducas","year":"2012"},{"key":"2022091610474331200_ref24","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","article-title":"Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems","volume-title":"Advance in Cryptography\u2013CRYPTO 2009","author":"Applebaum","year":"2009"},{"key":"2022091610474331200_ref25","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/978-3-642-17373-8_24","article-title":"Lattice-Based Blind Signatures","volume-title":"Advance in Cryptography\u2013ASIACRYPT 2010","author":"Ruckert","year":"2010"},{"key":"2022091610474331200_ref26","first-page":"327","article-title":"Post-Quantum Key Exchange\u2014A New Hope","volume-title":"USENIX Security Symposium 2016","author":"Alkim","year":"2016"},{"key":"2022091610474331200_ref27","first-page":"390","article-title":"Multi-Signatures in the Plain Public-Key Model and a General Forking Lemma","volume-title":"Conf. Computer and Communications Security 2006","author":"Bellare","year":"2006"},{"key":"2022091610474331200_ref28","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1007\/978-3-319-78372-7_18","article-title":"A Concrete Treatment of Fiat\u2013Shamir Signatures in the Quantum Random-Oracle Model","volume-title":"Advance in Cryptography\u2013EUROCRYPT 2018","author":"Kiltz","year":"2018"},{"key":"2022091610474331200_ref29","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00145-015-9203-7","article-title":"Tightly secure signatures from lossy identification schemes","volume":"29","author":"Abdalla","year":"2016","journal-title":"J. Cryptol."},{"volume-title":"Code of qtesla\/qTesla scheme","author":"Longa","key":"2022091610474331200_ref30"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/9\/2400\/45882097\/bxab074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/9\/2400\/45882097\/bxab074.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T10:48:41Z","timestamp":1663325321000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/9\/2400\/6289888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":30,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,5,31]]},"published-print":{"date-parts":[[2022,9,16]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab074","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2022,9]]},"published":{"date-parts":[[2021,5,31]]}}}