Cybersecurity

A survey on lattice-based digital signature

Fengxia Liu, Zhiyong Zheng, Zixian Gong, Kun Tian, Yi Zhang, Zhe Hu, Jia Zhao Li, Qun Jie Xu

Published Apr 1, 2024• 34 citations

Abstract

Abstract Lattice-based digital signature has become one of the widely recognized post-quantum algorithms because of its simple algebraic operation, rich mathematical foundation and worst-case security, and also an important tool for constructing cryptography. This survey explores lattice-based digital signatures, a promising post-quantum resistant alternative to traditional schemes relying on factoring or discrete logarithm problems, which face increasing risks from quantum computing. The study covers conventional paradigms like Hash-and-Sign and Fiat-Shamir, as well as specialized applications including group, ring, blind, and proxy signatures. It analyzes the versatility and security strengths of lattice-based schemes, providing practical insights. Each chapter summarizes advancements in schemes, identifying emerging trends. We also pinpoint future directions to deploy lattice-based digital signatures including quantum cryptography.

DOI: 10.1186/s42400-023-00198-1

Related papers

Practical Lattice-Based Digital Signature Schemes

James Howe, Thomas Pöppelmann, Maire P. O'Neill +2 more

Digital signatures are an important primitive for building secure systems and are used in most real-world security protocols. However, almost all popular signature schemes are either based on the factoring assumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case of classical cryptanalytic advances or progress on the development of quantum computers, the hardness of these closely related problems might be seriously weakened. A potential alternative approach is the construction of signature schemes based on the hardness of certain lattice problems that are assumed to be intractable by quantum computers. Due to significant research advancements in recent years, lattice-based schemes have now become practical and appear to be a very viable alternative to number-theoretic cryptography. In this article, we focus on recent developments and the current state of the art in lattice-based digital signatures and provide a comprehensive survey discussing signature schemes with respect to practicality. Additionally, we discuss future research areas that are essential for the continued development of lattice-based cryptography.

ACM Transactions on Embedded Computing SystemsApr 21, 201557 citations

Progress in Lattice-Based Digital Signature

Pooja Bhatt, Rachna Navalakhe

Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.

CRC Press eBooksJun 2, 20260 citations

Development of a Lattice Based Blind Signature Scheme: Post-quantum Cryptography

Frank Nauheimer

Digital signatures are used to ensure authentication. Blind signature schemes are a special form of digital signatures and important in scenarios which depend on anonymous and secure authentication. (e.g. e-voting) The common digital blind signature schemes are based on asymmetric cryptography with underlying hard problems like integer factorization or discrete logarithm. These hard problems will become weak with the development of quantum computers. To avoid the uselessness of classic cryptography in the post quantum era, it will be important to find alternative methods based on other hard problems. This book deals with the attempt of developing a new blind signature scheme based on lattice signature schemes.

Nov 19, 20081 citation

Post-Quantum Cryptography Using Lattices

Patchigulla Pooja, Jakka Ramya, Paras Nath Singh +4 more

The need and emergence of quantum computing under National Quantum Mission threatens the cyber-security of existing cryptographic protocols, especially public-key schemes built on integer factorization and discrete logarithms. Lattice-based cryptography has gained prominence as a robust candidate for post-quantum cryptography—offering security against quantum attacks while enabling efficient operations, parallelization, and novel functionalities. This paper analyzes the mathematical foundations of lattices, explores hardness assumptions underlying widely studied lattice problems, highlights prominent cryptographic constructions, analyzes performance trade-offs, and reviews standardization efforts. This paper concludes by identifying ongoing issues and future directions for lattice-based cryptographic systems in a quantum-secure digital world. The algorithm has been implemented in Python.

IEEE Global Conference for Advancement in Technology (GCAT)Oct 24, 20250 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

The Impact of Quantum Computing on Digital Signature

Nuzhat Atiqua Nafis

Quantum computing represents one of the most disruptive technological advancements of the 21st century, with profound implications for modern cryptographic systems. Traditional digital signature algorithms—such as RSA, DSA, and Elliptic Curve Cryptography (ECC)—derive their security from mathematical problems like integer factorization and discrete logarithms, which are computationally infeasible for classical computers. However, the advent of quantum algorithms, particularly Shor’s and Grover’s algorithms, poses a direct threat to these cryptographic assumptions by drastically reducing the time required to solve such problems. This development renders existing Digital Signature infrastructures potentially obsolete once large-scale quantum computers become operational. To counter this threat, researchers have proposed a range of post-quantum cryptographic (PQC) algorithms, including lattice-based, hash-based, and multivariate polynomial-based signature schemes, which are designed to resist quantum attacks. This paper critically examines the extent of quantum vulnerability in current Digital Signature systems and evaluates the comparative performance, efficiency, and security trade-offs of post-quantum alternatives. The study aims to provide a structured understanding of the ongoing transition toward quantum-resistant digital authentication and to propose a roadmap for secure implementation in future cryptographic environments.

Jan 10, 20260 citations