{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:37Z","timestamp":1740142777411,"version":"3.37.3"},"reference-count":44,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T00:00:00Z","timestamp":1689984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972391"],"award-info":[{"award-number":["61972391"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Project Program of State Key Laboratory of Cryptology","award":["MMKFKT201810"],"award-info":[{"award-number":["MMKFKT201810"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>We present eBiBa (enhanced BiBa), a hash-based signature scheme with the smallest possible signature size, while ensuring high feasibility and security in a specific application model. Our scheme is tailored to address the communication requirement of a large-scale public data stream continuously disseminated between two participants while ensuring data source and data integrity authentication. To achieve these goals, firstly, we optimized the classical hash tree mode into a hybrid mode to efficiently perform public key authentication and eliminate the need for an authenticated channel to transmit large amounts of data, unlike the initial BiBa-based broadcast authentication protocol. Secondly, we employed a specific tweakable hash chain function to digest a batch of messages, reducing the required conditions for post-quantum existential unforgeability under adaptive chosen message attack (EUCMA) of eBiBa to a second-pre-image-resistance-like property instead of collision resistance. This results in reduced pre-computation in both key and signature generations. Thirdly, we utilized a forward-secure pseudorandom function to achieve forward-secure of the proposed scheme. Finally, we minimize the signature size through a series of procedures. Firstly, we select BiBa few-time signature as the underlying signature scheme since it is currently the few-time hash-based signature with the smallest signature size that we are aware of; in addition, the hybrid approach we employed can also significantly reduce the signature size compared to using a hash tree solely; for the hash tree structure, we design a specific authentication path in combination with the related communication model to further minimize the signature size; finally, we optimize the authentication approach to achieve the minimum signature size in a single transmission. Our construction minimizes the signature size in the aforementioned model, achieving a compression rate of 0.017 to 0.828 based on distinct values of parameters, as compared to XMSS-256. We also demonstrated that eBiBa can achieve post-quantum forward-secure and EUCMA security.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad068","type":"journal-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:27:49Z","timestamp":1690219669000},"page":"1405-1424","source":"Crossref","is-referenced-by-count":1,"title":["eBiBa: A Post-Quantum Hash-Based Signature With Small Signature Size in the Continuous Communication of Large-Scale Data"],"prefix":"10.1093","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1125-7437","authenticated-orcid":false,"given":"Lingyun","family":"Li","sequence":"first","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, University of Chinese Academy of Sciences , No. 89 Minzhuang Road, Haidian District, 100093 Beijing , China"},{"name":"School of Computer Science , Liaocheng University, No. 1, Hunan Road, Dongchangfu District, 252059 Liaocheng , China"},{"name":"School of Cyber Security, University of Chinese Academy of Sciences , No. 19 Yuquan Road, Shijingshan District, 100049 Beijing , China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7091-5810","authenticated-orcid":false,"given":"Xianhui","family":"Lu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, University of Chinese Academy of Sciences , No. 89 Minzhuang Road, Haidian District, 100093 Beijing , China"},{"name":"School of Cyber Security, University of Chinese Academy of Sciences , No. 19 Yuquan Road, Shijingshan District, 100049 Beijing , China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3848-6419","authenticated-orcid":false,"given":"Kunpeng","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, University of Chinese Academy of Sciences , No. 89 Minzhuang Road, Haidian District, 100093 Beijing , China"},{"name":"School of Cyber Security, University of Chinese Academy of Sciences , No. 19 Yuquan Road, Shijingshan District, 100049 Beijing , China"}]}],"member":"286","published-online":{"date-parts":[[2023,7,22]]},"reference":[{"key":"2024042316182621900_ref1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1103\/RevModPhys.74.145","article-title":"Quantum cryptography","volume":"74","author":"Gisin","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"2024042316182621900_ref2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00191318","article-title":"Experimental quantum cryptography","volume":"5","author":"Bennett","year":"1992","journal-title":"J. Cryptol."},{"key":"2024042316182621900_ref3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-quantum Cryptography","author":"Bernstein","year":"2009"},{"key":"2024042316182621900_ref4","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1103\/PhysRevLett.85.1330","article-title":"Limitations on practical quantum cryptography","volume":"85","author":"Brassard","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"2024042316182621900_ref5","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/978-1-4615-3386-3_34","article-title":"Quantum cryptography and Bell\u2019s theorem","volume":"282","author":"Ekert","year":"1992","journal-title":"Quantum Measurements Opt."},{"key":"2024042316182621900_ref6","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1103\/PhysRevLett.68.3121","article-title":"Quantum cryptography using any two nonorthogonal states","volume":"68","author":"Bennett","year":"1992","journal-title":"Phys. Rev. Lett."},{"key":"2024042316182621900_ref7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1088\/1367-2630\/8\/5\/075","article-title":"Experimental quantum cryptography with qutrits","volume":"8","author":"Gr\u00f6blacher","year":"2006","journal-title":"New J. Phys."},{"key":"2024042316182621900_ref8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"2024042316182621900_ref9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"2024042316182621900_ref10","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"ElGamal","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2024042316182621900_ref11","first-page":"35","article-title":"Hash-based digital signature schemes","volume":"1","author":"Buchmann","year":"2009","journal-title":"PQC"},{"key":"2024042316182621900_ref12","first-page":"109","volume-title":"Proceedings of International Workshop on PQCrypto 2008","author":"Dahmen","year":"2008"},{"volume-title":"Large Provably Fast and Secure Digital Signature Schemes Based on Secure Hash Functions","year":"1995","author":"US Patent. 5432852","key":"2024042316182621900_ref13"},{"key":"2024042316182621900_ref14","first-page":"261","volume-title":"Proceedings of SSR 2016","author":"Katz","year":"2016"},{"key":"2024042316182621900_ref15","first-page":"117","volume-title":"Proceedings of PQCrypto 2011","author":"Buchmann","year":"2011"},{"volume-title":"RFC8391\u2014XMSS: eXtended Hash-based Signatures","year":"2018","author":"RFC 8391","key":"2024042316182621900_ref16"},{"key":"2024042316182621900_ref17","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-030-51938-4_13","volume-title":"Proceedings of AFRICACRYPT 2020","author":"Campos","year":"2020"},{"volume-title":"Leighton-Micali Hash-based Signatures","year":"2019","author":"RFC 8554","key":"2024042316182621900_ref18"},{"key":"2024042316182621900_ref19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/11941378_25","volume-title":"Proceedings of INDOCRYPT 2006","author":"Buchmann","year":"2006"},{"key":"2024042316182621900_ref20","first-page":"31","volume-title":"Proceedings of ACNS 2007","author":"Buchmann","year":"2007"},{"key":"2024042316182621900_ref21","first-page":"194","volume-title":"Proceedings of CD-ARES 2013, MoCrySEn and SeCIHD","author":"H\u00fclsing","year":"2013"},{"key":"2024042316182621900_ref22","first-page":"368","volume-title":"Proceedings of EUROCRYPT 2015","author":"Bernstein","year":"2015"},{"key":"2024042316182621900_ref23","first-page":"2129","volume-title":"Proceedings of ACM-SIGSAC 2019","author":"Bernstein","year":"2019"},{"key":"2024042316182621900_ref24","first-page":"219","volume-title":"Proceedings of CT-RSA 2018","author":"Aumasson","year":"2018"},{"key":"2024042316182621900_ref25","first-page":"244","volume-title":"Proceedings of SSR 2016","author":"McGrew","year":"2016"},{"key":"2024042316182621900_ref26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-36178-2_24","volume-title":"Proceedings of ASIACRYPT 2002","author":"Hevia","year":"2002"},{"key":"2024042316182621900_ref27","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/978-3-642-21969-6_23","volume-title":"Proceedings of AFRICACRYPT 2011","author":"Buchmann","year":"2011"},{"key":"2024042316182621900_ref28","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-38553-7_10","volume-title":"Proceedings of AFRICACRYPT 2013","author":"H\u00fclsing","year":"2013"},{"key":"2024042316182621900_ref29","first-page":"28","volume-title":"Proceedings of CCS 2001","author":"Perrig","year":"2001"},{"key":"2024042316182621900_ref30","first-page":"144","volume-title":"Proceedings of ACISP 2002","author":"Reyzin","year":"2002"},{"key":"2024042316182621900_ref31","first-page":"218","volume-title":"Proceedings of CRYPTO 1989","author":"Merkle","year":"1989"},{"key":"2024042316182621900_ref32","doi-asserted-by":"crossref","first-page":"2860","DOI":"10.1093\/comjnl\/bxac060","article-title":"Privacy-enhanced federated generative adversarial networks for internet of things","volume":"65","author":"Zeng","year":"2022","journal-title":"Comput. J."},{"key":"2024042316182621900_ref33","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1093\/comjnl\/bxab100","article-title":"A collaborative learning-based algorithm for task offloading in UAV-aided wireless sensor networks","volume":"64","author":"Al-Share","year":"2021","journal-title":"Comput. J."},{"key":"2024042316182621900_ref34","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1093\/comjnl\/bxaa196","article-title":"Efficient algorithms for storage load balancing of outsourced data in blockchain network","volume":"65","author":"Liu","year":"2022","journal-title":"Comput. J."},{"key":"2024042316182621900_ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s42400-022-00117-w","article-title":"Hash-based signature revisited","volume":"5","author":"Li","year":"2022","journal-title":"Cybersecurity"},{"key":"2024042316182621900_ref36","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.ins.2020.12.011","article-title":"A hypergrid based adaptive learning method for detecting data faults in wireless sensor networks","volume":"553","author":"Chen","year":"2021","journal-title":"Inform. Sci."},{"key":"2024042316182621900_ref37","doi-asserted-by":"crossref","first-page":"101874","DOI":"10.1016\/j.adhoc.2019.101874","article-title":"Detection of jamming attack using timestamp for WSN","volume":"91","author":"Rose","year":"2019","journal-title":"Ad Hoc Netw."},{"key":"2024042316182621900_ref38","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1007\/s10586-017-1622-9","article-title":"Detection and prevention of black hole and selective forwarding attack in clustered WSN with active trust","volume":"22","author":"Mehetre","year":"2019","journal-title":"Clust. Comput."},{"key":"2024042316182621900_ref39","doi-asserted-by":"crossref","first-page":"2894","DOI":"10.1093\/comjnl\/bxac094","article-title":"Efficient robustness verification of the deep neural networks for smart IoT devices","volume":"65","author":"Zhang","year":"2022","journal-title":"Comput. J."},{"key":"2024042316182621900_ref40","first-page":"75","volume-title":"Proceedings of CRYPTO 1994","author":"Bleichenbacher","year":"1994"},{"key":"2024042316182621900_ref41","first-page":"470","volume-title":"Proceedings of CRYPTO 1997","author":"Bellare","year":"1997"},{"key":"2024042316182621900_ref42","first-page":"387","volume-title":"Proceedings of PKC 2016","author":"H\u00fclsing","year":"2016"},{"key":"2024042316182621900_ref43","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/11818175_3","volume-title":"Proceedings of CRYPTO 2006","author":"Halevi","year":"2006"},{"key":"2024042316182621900_ref44","first-page":"108","volume-title":"Proceedings of CCS 2000","author":"Krawczyk","year":"2000"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/4\/1405\/57295766\/bxad068.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/4\/1405\/57295766\/bxad068.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T16:54:37Z","timestamp":1713891277000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/4\/1405\/7229173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,22]]},"references-count":44,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,7,22]]},"published-print":{"date-parts":[[2024,4,21]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad068","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2024,4]]},"published":{"date-parts":[[2023,7,22]]}}}