State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China.
Faculty of Mathematics and Information Science, Langfang Normal University, Langfang 065000, China.
Sensors (Basel). 2018 Nov 20;18(11):4056. doi: 10.3390/s18114056.
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.
物联网（IoT）将大量信息感应设备连接到互联网上，以实时收集各种所需信息。大量访问信息源的可靠性检验着签名的处理速度。批量签名允许签名者一次性对一组消息进行签名，并且可以单独、独立地完成签名验证。因此，批量签名适用于物联网中的数据集成认证。批量签名的一个突出优点是签名者可以在一次处理尽可能多的消息，而不必担心签名消息的大小。为了减少多次消息签名带来的复杂性，通常在批量签名的构造中使用二叉树。然而，这种结构需要一个批量残差，使得批量签名的大小（对于一组消息）甚至比单个签名的总和还要长。在本文中，我们利用格中的交方法提出了一种新的批量签名通用方法。我们进一步将我们的方法与哈希签名范式和 Fiat-Shamir 变换相结合，提出了新的批量签名方案。在我们的构造中，批量签名不需要批量残差，因此签名的大小相对较小。我们的方案在小整数解问题下被证明是针对适应性选择消息攻击的存在性不可伪造性，这表明它们具有很大的抵抗量子计算机攻击的潜力。
