Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures

Sensors

Kaitai Liang¹  Liqun Chen¹  Jiageng Chen²  Xiuhua Lu³  Wei Yin³  Qiaoyan Wen³ 

[1] Department of Computer Science, University of Surrey, Guildford GU2 7XH, UK;School of Computer Science, Central China Normal University, Wuhan 430079, China;State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;

关键词: IoT;    message integration authentication;    batch signature;    tree structure;    intersection method;    lattice;   

DOI  :  10.3390/s18114056

来源: DOAJ

【 摘 要 】

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’ 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–Shamir 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.

【 授权许可】

Unknown