Message Integration Authentication in the Internet-of-Things via Lattice-Based Batch Signatures
Open Access
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China (61502044, 61402015, 61702212)
This publication has 29 references indexed in Scilit:
- Internet of Things (IoT): A vision, architectural elements, and future directionsFuture Generation Computer Systems, 2013
- Generating Shorter Bases for Hard Random LatticesTheory of Computing Systems, 2010
- Efficient Flexible Batch Signing Techniques for Imbalanced Communication ApplicationsIEICE Transactions on Information and Systems, 2008
- Batch RSA2001
- Effient Electronic Cash Using Batch Signatures1999
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Collision-Resistant hashing: Towards making UOWHFs practical1997
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1983
- New directions in cryptographyIEEE Transactions on Information Theory, 1976