IEEE Access

A Lattice-Based Unordered Aggregate Signature Scheme Based on the Intersection Method

Xiuhua Lu, Wei Yin, Qiaoyan Wen, Zhengping Jin, Wenmin Li

Published Jan 1, 2018• 25 citations

Abstract

An aggregate signature turns multi-message multi-authentication into multi-message single-authentication, reducing the required storage space, transmission cost, and number of verification calculations, and is suitable for fast message authentication in the big data era, particularly in wireless sensor networks and secure email systems. Many aggregate signature schemes have been proposed, including lattice-based ones, which have good resistance to quantum machine attacks. However, the existing lattice-based aggregate signature schemes, which either have strict requirements on the signing order or encounter security risks, are not suitable for the unordered polymerization environment. In this paper, we accordingly propose a lattice-based unordered aggregate signature scheme. The proposed scheme makes use of the intersection method and solves the unordered aggregate problem of lattice signatures with different public keys. Therefore, it avoids both the signing order limitation and the risk of single signature forgery. Furthermore, the scheme follows the improved security model; hence, it is robust against collusion attacks. In addition, the scheme's security depends on the small integer solution problem, which enables the scheme to resist quantum algorithm attacks.

DOI: 10.1109/access.2018.2847411

Related papers

Blockchain-Aware secure lattice aggregate signature scheme

Motashim Rasool, Arun Khatri, Renato Racelis Maaliw III +3 more

In the Forward Secure Ordered Aggregation (FssAgg) signature system, the signer gradually and orderly aggregates the signatures under different keys in different periods into one signature in a hierarchical “onion-like” manner. Among them, the innermost signature is the first signature. In addition, compared with ordinarily ordered aggregate signatures, forward secure requested aggregate signatures are the aggregation of different signatures of the same signer rather than the signatures of additional signers so that the signature verifier can use public key complete verification of all aggregation processes. The forward-safe ordered aggregate signature has the advantages of both forward-secure signature and aggregate signature. It has been widely used in many application scenarios, such as log systems and blockchains. Several existing forward-safe ordered aggregate signatures are based on traditional number theory problems, which will no longer be problematic in the post-quantum era. Therefore, finding a forward-safe requested aggregate signature in the quantum computing environment is imminent. Based on the small integer solution problem on the lattice, a forward-secure lattice-based rated aggregate signature scheme under the standard model is constructed. To achieve high efficiency, the system uses fixed-dimensional lattice-based delegation technology to realize critical updates and achieve forward security; then, the message to be signed and the difficulty problem on the lattice are respectively embedded into the signature using message addition technology and preimage sampling algorithm, making the signature unforgeable under the standard model.

CRC Press eBooksNov 14, 20230 citations

Forward Secure Lattice-Based Sequential Aggregate Signature Schemes in Stan-dard Model

HU Yupu XIE Jia

In the forward secure sequential aggregate (FssAgg) signature scheme, the signer combines signatures generated in different intervals under different secret keys incrementally and sequentially in a layered “onion-like” fashion with the first signature innermost in the aggregate. In contrast with general (not forward-secure) aggregate signature schemes which aggregate signatures from multiple signers, a FssAgg signature scheme aggregates signatures of a single signer not the signatures of different signers, so the verifier uses a single public key to verify the entire aggregate. With the advantages of forward secure signature and the aggregate signature at the same time, the FssAgg signature scheme has been widely applied in logging systems and blockchain since it was proposed in 2007. Although there have been several FssAgg signature schemes, all of them are based on the classic number theory problem, which are no longer secure in the quantum era. So looking for the quantum-immune FssAgg signature is much urgent. Based on the small integer solution over lattice, a FssAgg signature in the standard model is proposed. In order to improve the efficiency, this paper uses the fixed-dimensional lattice basis delegation technique to update the keys, and the forward security is achieved. This paper uses the message addition technique and the pre-image sampling technique to embed the message and the small integer solution into the signature process, and the existentially unforgeability of the scheme is also guranteed in the standard model.

Oct 1, 20210 citations

An Investigation of Lattice-Based Digital Signatures and Their Aggregate Variants for Post-Quantum Security

Yiming Tong

With quantum computing now widely treated as a credible adversary to conventional public-key assumptions—most notably discrete logarithms and integer factorization—post-quantum cryptography has moved from a speculative research topic to an active engineering agenda. Within that broader landscape, lattice-based cryptography is routinely singled out as the leading candidate for next-generation digital signatures, largely because its security can be reduced to well-studied lattice problems believed resistant to quantum attacks. Aggregate signatures compress multiple individual signatures into a single compact object, translating into improved batch-verification throughput in settings such as blockchain and IoT. Against this backdrop, the present investigation offers a detailed analysis of lattice-based aggregate signature constructions. Core lattice notions are reviewed alongside security models, followed by an examination of two aggregation paradigms: unordered and ordered. Representative schemes are analyzed with respect to their construction logic and structural bottlenecks. A cross-scheme comparison is then used to motivate future research directions. By pulling together recent progress while isolating persistent obstacles, this investigation characterizes an ongoing shift from feasibility-oriented prototypes toward deployment-minded designs, offering a focused reference for standardization efforts targeting post-quantum-secure aggregate signatures.

Applied and Computational EngineeringJun 23, 20260 citations

A Quantum Secure and Noninteractive Identity-Based Aggregate Signature Protocol From Lattices

Quanrun Li, Min Luo, Ching-Fang Hsu +2 more

The aggregate signature is a special signature mode widely used in the wireless medical sensor network. The aggregate signature can reduce bandwidth and storage space in this sensor network by aggregating multiple signatures from different signers into a short signature. Traditional aggregate signature protocols based on the discrete logarithm problem and the great integer factorization problem cannot resist quantum attacks. In this article, we propose a new noninteractive identity-based aggregate signature protocol from lattices. We prove that the proposed protocol is secure in the quantum random oracle model. Additionally, the performance of the proposed protocol is much better than most previous protocols according to our experiment. Meanwhile, the size of the aggregate signature in our protocol is a logarithmic function of the number of signatures being aggregated.

IEEE Systems JournalOct 11, 202135 citations

A Non-Interactive Identity-Based Multi-Signature Scheme on Lattices With Public Key Aggregation

Xinjian Chen, Jianye Huang, Kaifeng Xiao +2 more

Due to limited computational and storage capabilities, wireless medical sensor networks (WMSN) encounter considerable overhead in processing the storage and verification of numerous signatures. Multi-signatures allow a group of signers to produce a single, compact signature on the same message, significantly reducing storage requirements and communication bandwidth in WMSN. However, conventional multi-signature schemes are not quantum resistant, as their security assumptions will be compromised with the quick advancement in quantum computing. Alternatively, lattice-based cryptography is widely considered capable of withstanding quantum computing attacks. In this article, we introduce a quantum-resistant and non-interactive identity-based multi-signature scheme from lattices with public key aggregation (IBMS-pka). By leveraging the small integer solution (SIS) assumption, our scheme is proven secure within the random oracle model. Besides, our scheme enables users to choose their system identities (e.g., physical IP address or email address) as public keys compared to PKI-based schemes, and avoids the extra communication costs in contrast to interactive schemes. Meanwhile, our scheme outperforms other related works according to our experiments. Specifically, the multi-signature generation has a slightly higher efficiency compared to other related schemes, while the multi-signature verification has a larger enhancement. Moreover, the performance improvement becomes more evident as the number of signers grows.

IEEE Transactions on Dependable and Secure ComputingFeb 19, 20259 citations

Efficient post-quantum cryptographic signature aggregation for low-latency distributed networks

Pallati Narsimhulu, Premkumar Chithaluru, Rajanikanth Aluvalu

Distributed systems are widely used in modern environments such as cloud platforms, Internet of Things (IoT) networks, smart grids, and blockchain-based systems. These platforms often require digital signatures to maintain trust between devices or users. When many signatures are shared at once, the size of the communication grows, and processing takes more time. This becomes a problem in applications where quick message verification is important. Classical digital signature schemes, such as Rivest-Shamir-Adleman (RSA) and Elliptic Curve Digital Signature Algorithm (ECDSA), are not safe against quantum attacks. Post-quantum cryptography offers better protection, but it often increases communication size and computation cost. This paper introduces a quantum-resistant model that supports signature aggregation and constant-time verification. The method is based on lattice-based techniques, using structures similar to CRYSTALS-Dilithium. By combining several signatures into a single aggregated form, the model reduces the time needed for verification and the overall communication overhead. The design is suitable for real-time applications, offering strong accuracy and faster message handling. Simulation results show that the proposed method performs better than recent approaches in multiple areas. The model achieves a low authentication time, high verification accuracy, reduced message size, and improved throughput. These benefits help meet the needs of distributed systems where speed, accuracy, and security must work together. The architecture is designed to be flexible for use in real-world deployments. Future directions include support for multi-party signing, adaptive quantum-safe policies, and integration with quantum co-processors. This research supports the development of secure and efficient communication frameworks that remain effective even in the presence of future quantum threats.

Journal on Information SecurityFeb 25, 20260 citations