{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T13:15:55Z","timestamp":1769346955573,"version":"3.49.0"},"reference-count":34,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T00:00:00Z","timestamp":1542672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502044, 61402015, 61702212"],"award-info":[{"award-number":["61502044, 61402015, 61702212"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>The internet-of-things (also known as IoT) connects a large number of information-sensing devices to the Internet to collect all kinds of information needed in real time. The reliability of the source of a large number of accessed information tests the processing speed of signatures. Batch signature allows a signer to sign a group of messages at one time, and signatures\u2019 verification can be completed individually and independently. Therefore, batch signature is suitable for data integration authentication in IoT. An outstanding advantage of batch signature is that a signer is able to sign as many messages as possible at one time without worrying about the size of signed messages. To reduce complexity yielded by multiple message signing, a binary tree is usually leveraged in the construction of batch signature. However, this structure requires a batch residue, making the size of a batch signature (for a group of messages) even longer than the sum of single signatures. In this paper, we make use of the intersection method from lattice to propose a novel generic method for batch signature. We further combine our method with hash-and-sign paradigm and Fiat\u2013Shamir transformation to propose new batch signature schemes. In our constructions, a batch signature does not need a batch residue, so that the size of the signature is relatively smaller. Our schemes are securely proved to be existential unforgeability against adaptive chosen message attacks under the small integer solution problem, which shows great potential resisting quantum computer attacks.<\/jats:p>","DOI":"10.3390\/s18114056","type":"journal-article","created":{"date-parts":[[2018,11,22]],"date-time":"2018-11-22T09:18:25Z","timestamp":1542878305000},"page":"4056","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6300-1313","authenticated-orcid":false,"given":"Xiuhua","family":"Lu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"},{"name":"Faculty of Mathematics and Information Science, Langfang Normal University, Langfang 065000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yin","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiaoyan","family":"Wen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaitai","family":"Liang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Surrey, Guildford GU2 7XH, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Surrey, Guildford GU2 7XH, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiageng","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, Central China Normal University, Wuhan 430079, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1016\/j.future.2013.01.010","article-title":"Internet of Things (IoT): A vision, architectural elements, and future directions","volume":"29","author":"Gubbi","year":"2013","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Bennett, T.R., Savaglio, C., Lu, D., Massey, H., Wang, X., Wu, J., and Jafari, R. (2014, January 11). MotionSynthesis Toolset (MoST): A Toolset for Human Motion Data Synthesis and Validation. Proceedings of the 4th ACM MobiHoc Workshop on Pervasive Wireless Healthcare (MobileHealth \u201914), Philadelphia, PA, USA.","DOI":"10.1145\/2633651.2637472"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10796-014-9492-7","article-title":"The internet of things: A survey","volume":"17","author":"Li","year":"2015","journal-title":"Inf. Syst. Front."},{"key":"ref_4","unstructured":"Fortino, G., Russo, W., Savaglio, C., Viroli, M., and Zhou, M. (2017, January 15\u201316). Modeling Opportunistic IoT Services in Open IoT Ecosystems. Proceedings of the 18th Workshop \u201cFrom Objects to Agents\u201d (WOA 2017), Scilla (RC), Italy."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New directions in cryptography","volume":"22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","unstructured":"Chaum, D., Rivest, R.L., and Sherman, A.T. (1982). On Signatures and Authentication. Advances in Cryptology: Proceedings of CRYPTO \u201982, Santa Barbara, CA, USA, 23\u201325 August 1982, Plenum Press."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/357980.358017","article-title":"A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint)","volume":"26","author":"Rivest","year":"1983","journal-title":"Commun. ACM"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1109\/TC.2014.2315619","article-title":"Cost-Effective Authentic and Anonymous Data Sharing with Forward Security","volume":"64","author":"Huang","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.tcs.2014.04.027","article-title":"Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts","volume":"539","author":"Liang","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1109\/TIFS.2017.2738601","article-title":"Auditable \u03c3-Time Outsourced Attribute-Based Encryption for Access Control in Cloud Computing","volume":"13","author":"Ning","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1093\/comjnl\/bxx017","article-title":"Securing Outsourced Data in the Multi-Authority Cloud with Fine-Grained Access Control and Efficient Attribute Revocation","volume":"60","author":"Zhou","year":"2017","journal-title":"Comput. J."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.pmcj.2015.06.016","article-title":"Secure bidirectional proxy re-encryption for cryptographic cloud storage","volume":"28","author":"Shao","year":"2016","journal-title":"Pervasive Mob. Comput."},{"key":"ref_13","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":"Gamal","year":"1985","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","unstructured":"Fiat, A. (1989, January 20\u201324). Batch RSA. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201989, 9th Annual International Cryptology Conference, Santa Barbara, CA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"M\u2019Ra\u00efhi, D., and Naccache, D. (1996, January 14\u201316). Batch Exponentiation: A Fast DLP-Based Signature Generation Strategy. Proceedings of the 3rd ACM Conference on Computer and Communications Security (CCS \u201996), New Delhi, India.","DOI":"10.1145\/238168.238187"},{"key":"ref_16","unstructured":"Pavlovski, C., and Boyd, C. (1999, January 5\u20138). Efficient batch signature generation using tree structures. Proceedings of the International Workshop on Cryptographic Techniques and E-Commerce (CrypTEC), Hong Kong, China."},{"key":"ref_17","unstructured":"Cheng, W.C., Chou, C., and Golubchik, L. (2002, January 11\u201316). Performance of Batch-Based Digital Signatures. Proceedings of the 10th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2002), Fort Worth, TX, USA."},{"key":"ref_18","first-page":"70","article-title":"Analyzing Response Time of Batch Signing","volume":"1","author":"Korkmaz","year":"2011","journal-title":"J. Internet Serv. Inf. Secur."},{"key":"ref_19","unstructured":"Boyd, C., Foo, E., and Pavlovski, C. (1999, January 7\u20139). Efficient Electronic Cash Using Batch Signatures. Proceedings of the Information Security and Privacy, 4th Australasian Conference, ACISP\u201999, Wollongong, NSW, Australia."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1093\/ietisy\/e91-d.5.1481","article-title":"Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications","volume":"91-D","author":"Youn","year":"2008","journal-title":"IEICE Trans."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ajtai, M. (1996, January 22\u201324). Generating Hard Instances of Lattice Problems (Extended Abstract). Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237838"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., and Vaikuntanathan, V. (2008, January 17\u201320). Trapdoors for hard lattices and new cryptographic constructions. Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, Canada.","DOI":"10.1145\/1374376.1374407"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/s00224-010-9278-3","article-title":"Generating Shorter Bases for Hard Random Lattices","volume":"48","author":"Alwen","year":"2011","journal-title":"Theory Comput. Syst."},{"key":"ref_25","first-page":"700","article-title":"Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller","volume":"Volume 7237","author":"Pointcheval","year":"2012","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2012\u201431st Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref_26","first-page":"738","article-title":"Lattice Signatures without Trapdoors","volume":"Volume 7237","author":"Pointcheval","year":"2012","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2012\u201431st Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref_27","first-page":"149","article-title":"Homomorphic Signatures for Polynomial Functions","volume":"Volume 6632","author":"Paterson","year":"2011","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2011\u201430th Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Bellare, M., and Rogaway, P. (1997, January 17\u201321). Collision-Resistant Hashing: Towards Making UOWHFs Practical. Proceedings of the Advances in Cryptology\u2014CRYPTO \u201997, 17th Annual International Cryptology Conference, Santa Barbara, CA, USA.","DOI":"10.1007\/BFb0052256"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2633600","article-title":"(Leveled) Fully Homomorphic Encryption without Bootstrapping","volume":"6","author":"Brakerski","year":"2014","journal-title":"TOCT"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/2724713","article-title":"Practical Lattice-Based Digital Signature Schemes","volume":"14","author":"Howe","year":"2015","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"ref_31","unstructured":"Alkadri, N.A., Buchmann, J., Bansarkhani, R., and Kr\u00e4mer, J. (2017, June 26). Available online: https:\/\/eprint.iacr.org\/2017\/615."},{"key":"ref_32","first-page":"309","article-title":"Portable implementation of lattice-based cryptography using JavaScript","volume":"6","author":"Yuan","year":"2016","journal-title":"Int. J. Netw. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Longa, P., and Naehrig, M. (2016, January 14\u201316). Speeding up the number theoretic transform for faster ideal lattice-based cryptography. Proceedings of the International Conference on Cryptology and Network Security, Milan, Italy.","DOI":"10.1007\/978-3-319-48965-0_8"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10916-007-9086-8","article-title":"Wireless Body Sensor Network Using Medical Implant Band","volume":"31","author":"Yuce","year":"2007","journal-title":"J. Med. Syst."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/11\/4056\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:30:59Z","timestamp":1760196659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/11\/4056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,20]]},"references-count":34,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["s18114056"],"URL":"https:\/\/doi.org\/10.3390\/s18114056","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,20]]}}}