Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Wiley eBooks

Post‐Quantum Confidential Transaction Protocols

R. Manjula Devi, P. Keerthika, Pragnya Suresh, R. Venkatesan, M. Sangeetha, C. Sagana, K. Devendran

Published Jul 15, 2022• 2 citations
Publisher

Abstract

In recent years, much extraordinary progress has been achieved in the advance- ment of Quantum computers due to tremendous speed up in processing. However, the threat of large-scale impact on society has led to widespread initia- tives to develop new cryptographic algorithms, standards, and migration paths, which are collectively referred to as “post-quantum cryptography”. The concept of a Zero-Knowledge Protocol (ZKP) along with its noninteractive variants has been surveyed and well explained. Providing the deep insight of the protocols adapted for confidential transaction in post-quantum cryptography by applying zero-knowledge proof is the major purpose of this chapter.

DOI
10.1002/9781119836728.ch8

Related papers

Illuminating the Path of Post-Quantum Cryptographic Protocols: A Survey of some Recent Literatures

Alvary Kefas Kwala, Alpna Mishra, Shri Kant

Abstract The imminent threat posed by quantum computers to modern public key cryptography has spurred the development of post-quantum cryptography (PQC) algorithms. Over the last two decades, the field of PQC research has thrived, yielding a diverse range of algorithms resilient against quantum attacks. These PQC algorithms are undergoing selection and standardization by prominent bodies ; such as National Institute of Standards and Technology (NIST). However, the challenge remains substantial, given the monumental task of migrating numerous new devices to PQC algorithms. This complex, multi-decade transition from classical cryptography to PQC, necessitates careful survey of research articles to consider the current post quantum cryptographic schemes, and key protective strategies against quantum threats, implementation feasibility, compliance and challenges of implementations. This will provide insight and future directions for new researchers and organizations. .

•Nov 6, 2023•0 citations

Post-Quantum Zero-Knowledge Proofs and Applications

Ron Steinfeld

Lattice-based cryptography is one of the most promising candidates for designing post-quantum cryptographic algorithms that resist emerging quantum computing attacks. The recent NIST PQC standardization process is nearing its completion, with practical lattice-based algorithms for basic cryptographic functionalities (namely digital signature and public-key encryption) selected for standardization in the near future. However, practical lattice-based solutions for more advanced privacy-preserving protocols, in particular, Zero-Knowledge Proofs (ZKPs), have only emerged recently and are an active area of research. We discuss some recent developments in design and analysis of practical lattice-based post-quantum ZKPs and their applications. In particular, we review some challenges that arise in designing ZKPs in the lattice setting and some recent progress on efficient lattice-based Schnorr-like proofs for important relations, such as binary/range proofs, one-out-of-many proofs and rounding proofs [1, 2, 4]. We discuss applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and balance proofs for privacy-preserving cryptocurrency payment protocols [2, 3]. We also discuss our recent work on succinct designated-verifier ZKPs (DV-ZKSNARKS) for verifying correctness of general delegated computations [5].

ACM ASIA Public-Key Cryptography Workshop (APKC)•Jun 20, 2023•5 citations

Post-Quantum Cryptography

Steven D. Galbraith⋆

Abstract Large-scale and error-tolerant quantum computers will break the currently used tools for enabling confidentiality and integrity on the internet and elsewhere. It has been recognized for the last 10 years that there is an urgent need to develop cryptosystems that can withstand an attacker in the future with a quantum computer. Post-quantum cryptography (PQC), also sometimes known as quantum-resistant cryptography or quantum safe cryptography, means cryptographic algorithms that can run on today’s computers and networks and yet be secure against attackers in the future who have large-scale and error-tolerant quantum computers. This chapter will argue that post-quantum cryptography is more practical and trusted for most real-world systems than quantum key distribution (QKD). The purpose of this chapter is to put cryptography into the broader context of cybersecurity, to briefly explain the threats and risks associated with quantum computing, and to give a nontechnical overview of the post-quantum cryptosystems that are available now.

Springer eBooks•Dec 1, 2025•3 citations

Security Models and Cryptographic Protocols in a Quantum World

Céline Chevalier, Paul Hermouet, Quoc-Huy Vu

The emergence of quantum computing has provided new paradigms for cryptography. On the one hand, it poses significant new threats to existing classically cryptographic systems, requiring the community to define new security models that capture what a quantum adversary can do. On the other hand, it gives us new tools to design cryptographic protocols, with weaker assumptions than in the classical world, or even protocols that are impossible classically. In this survey, we first give an overview of new security definitions for classical cryptography, considering quantum adversaries who can either only use local quantum computation (post-quantum security), or even send quantum messages and in particular have access to oracle in superposition (quantum security). We explore these new notions through the examples of commitments, zero-knowledge proofs, encryption, and signatures. Then, we present what is arguably the most famous application of quantum cryptography: quantum key distribution (QKD) protocols that take advantage of unique properties of quantum mechanics to provide secure communication unconditionally. We also explore cryptography beyond QKD, focusing on unclonable cryptography: a family of cryptographic functionalities, built with quantum states, and designed to be resistant to counterfeit by leveraging the “no-cloning” theorem. We examine in particular quantum money, but also the recent notions of unclonable encryption and copy-protection, including related variants. By presenting a comprehensive survey of these topics, this paper aims to provide a thorough understanding of the current landscape and future potential of quantum cryptography.

Foundations and Trends® in Theoretical Computer Science•Jan 15, 2025•1 citation

Post-quantum Cryptography and Quantum Proofs

Zero-knowledge proofs are just the basic concept in proof technology. Many other sophisticated formulations of proofs and related quantum-secure technology are proposed. Earlier forms of zero-knowledge proof technology are not quantum-resistant. Proofs based on generic hash functions as opposed to classical PKI cryptography are thought to be post-quantum secure because the cryptography can be upgraded, whereas classical PKI cryptography is known not to be quantum-secure. STARKs are a new form of zero-knowledge proofs for blockchains with a sophisticated architecture based on error correction codes, random queries, and inconsistency checks. The two main approaches to post-quantum cryptography are lattice-based cryptography and hash function-based cryptography. Lattice-based cryptography is currently the main method being promulgated in next-generation US NIST algorithm development. Keeping public digital infrastructure safe is a key concern. Post-quantum cryptography suggests various approaches to prepare cryptographic infrastructure for a potential future of quantum computing.

Between science and economics•Apr 1, 2020•0 citations

The Future of Cryptocurrency: Quantum-Secure Blockchain Protocols

Rajat Verma

Quantum computing's development poses a significant threat to the cryptographic security of current blockchain technologies, potentially undermining the integrity of digital transactions. Quantum computers can break the complex mathematical problems that algorithms like RSA and ECC rely on, which could lead to vulnerabilities such as double-spending and fraud. To address these risks, the blockchain community is exploring quantum-resistant protocols that employ post-quantum cryptographic algorithms, which are designed to withstand quantum computing attacks. Quantum-secure blockchain protocols integrate quantum key distribution (QKD) and post-quantum cryptography (PQC) to enhance security. QKD uses quantum mechanics principles to secure communication channels, ensuring that any attempt to intercept the key introduces detectable anomalies. PQC involves algorithms like lattice-based, hash-based, or multivariate polynomial-based algorithms that are believed to be secure against quantum attacks. These protocols aim to maintain the confidentiality, integrity, and security of data transmitted over the blockchain, ensuring the longevity and reliability of blockchain systems in the face of evolving computational advancements. A quantum-secure blockchain scheme (QSB) utilizes a consensus mechanism, QPoA, and IQS. The QPoA is leveraged for block generation while the IQS is deployed in transaction verification1. Furthermore, the integration of quantum computing with blockchain can address current limitations, such as slow transaction speeds and lack of scalability, by optimizing calculations and enabling smarter, more sophisticated smart contracts. The development and implementation of quantum-resistant blockchains are essential for future-proofing digital transactions and maintaining trust in decentralized systems

International Journal of Artificial Intelligence Data Science and Machine Learning•Jan 1, 2021•0 citations
In recent years, much extraordinary progress has been achieved in the advance- ment of Quantum computers due to tremendous speed up in processing. However, the threat of large-scale impact on society has led to widespread initia- tives to develop new cryptographic algorithms, standards, and migration paths, which are collectively referred to as “post-quantum cryptography”. The concept of a Zero-Knowledge Protocol (ZKP) along with its noninteractive variants has been surveyed and well explained. Providing the deep insight of the protocols adapted for confidential transaction in post-quantum cryptography by applying zero-knowledge proof is the major purpose of this chapter.
Abstract The imminent threat posed by quantum computers to modern public key cryptography has spurred the development of post-quantum cryptography (PQC) algorithms. Over the last two decades, the field of PQC research has thrived, yielding a diverse range of algorithms resilient against quantum attacks. These PQC algorithms are undergoing selection and standardization by prominent bodies ; such as National Institute of Standards and Technology (NIST). However, the challenge remains substantial, given the monumental task of migrating numerous new devices to PQC algorithms. This complex, multi-decade transition from classical cryptography to PQC, necessitates careful survey of research articles to consider the current post quantum cryptographic schemes, and key protective strategies against quantum threats, implementation feasibility, compliance and challenges of implementations. This will provide insight and future directions for new researchers and organizations. .
Lattice-based cryptography is one of the most promising candidates for designing post-quantum cryptographic algorithms that resist emerging quantum computing attacks. The recent NIST PQC standardization process is nearing its completion, with practical lattice-based algorithms for basic cryptographic functionalities (namely digital signature and public-key encryption) selected for standardization in the near future. However, practical lattice-based solutions for more advanced privacy-preserving protocols, in particular, Zero-Knowledge Proofs (ZKPs), have only emerged recently and are an active area of research. We discuss some recent developments in design and analysis of practical lattice-based post-quantum ZKPs and their applications. In particular, we review some challenges that arise in designing ZKPs in the lattice setting and some recent progress on efficient lattice-based Schnorr-like proofs for important relations, such as binary/range proofs, one-out-of-many proofs and rounding proofs [1, 2, 4]. We discuss applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and balance proofs for privacy-preserving cryptocurrency payment protocols [2, 3]. We also discuss our recent work on succinct designated-verifier ZKPs (DV-ZKSNARKS) for verifying correctness of general delegated computations [5].
Abstract Large-scale and error-tolerant quantum computers will break the currently used tools for enabling confidentiality and integrity on the internet and elsewhere. It has been recognized for the last 10 years that there is an urgent need to develop cryptosystems that can withstand an attacker in the future with a quantum computer. Post-quantum cryptography (PQC), also sometimes known as quantum-resistant cryptography or quantum safe cryptography, means cryptographic algorithms that can run on today’s computers and networks and yet be secure against attackers in the future who have large-scale and error-tolerant quantum computers. This chapter will argue that post-quantum cryptography is more practical and trusted for most real-world systems than quantum key distribution (QKD). The purpose of this chapter is to put cryptography into the broader context of cybersecurity, to briefly explain the threats and risks associated with quantum computing, and to give a nontechnical overview of the post-quantum cryptosystems that are available now.
The emergence of quantum computing has provided new paradigms for cryptography. On the one hand, it poses significant new threats to existing classically cryptographic systems, requiring the community to define new security models that capture what a quantum adversary can do. On the other hand, it gives us new tools to design cryptographic protocols, with weaker assumptions than in the classical world, or even protocols that are impossible classically. In this survey, we first give an overview of new security definitions for classical cryptography, considering quantum adversaries who can either only use local quantum computation (post-quantum security), or even send quantum messages and in particular have access to oracle in superposition (quantum security). We explore these new notions through the examples of commitments, zero-knowledge proofs, encryption, and signatures. Then, we present what is arguably the most famous application of quantum cryptography: quantum key distribution (QKD) protocols that take advantage of unique properties of quantum mechanics to provide secure communication unconditionally. We also explore cryptography beyond QKD, focusing on unclonable cryptography: a family of cryptographic functionalities, built with quantum states, and designed to be resistant to counterfeit by leveraging the “no-cloning” theorem. We examine in particular quantum money, but also the recent notions of unclonable encryption and copy-protection, including related variants. By presenting a comprehensive survey of these topics, this paper aims to provide a thorough understanding of the current landscape and future potential of quantum cryptography.
Zero-knowledge proofs are just the basic concept in proof technology. Many other sophisticated formulations of proofs and related quantum-secure technology are proposed. Earlier forms of zero-knowledge proof technology are not quantum-resistant. Proofs based on generic hash functions as opposed to classical PKI cryptography are thought to be post-quantum secure because the cryptography can be upgraded, whereas classical PKI cryptography is known not to be quantum-secure. STARKs are a new form of zero-knowledge proofs for blockchains with a sophisticated architecture based on error correction codes, random queries, and inconsistency checks. The two main approaches to post-quantum cryptography are lattice-based cryptography and hash function-based cryptography. Lattice-based cryptography is currently the main method being promulgated in next-generation US NIST algorithm development. Keeping public digital infrastructure safe is a key concern. Post-quantum cryptography suggests various approaches to prepare cryptographic infrastructure for a potential future of quantum computing.
Quantum computing's development poses a significant threat to the cryptographic security of current blockchain technologies, potentially undermining the integrity of digital transactions. Quantum computers can break the complex mathematical problems that algorithms like RSA and ECC rely on, which could lead to vulnerabilities such as double-spending and fraud. To address these risks, the blockchain community is exploring quantum-resistant protocols that employ post-quantum cryptographic algorithms, which are designed to withstand quantum computing attacks. Quantum-secure blockchain protocols integrate quantum key distribution (QKD) and post-quantum cryptography (PQC) to enhance security. QKD uses quantum mechanics principles to secure communication channels, ensuring that any attempt to intercept the key introduces detectable anomalies. PQC involves algorithms like lattice-based, hash-based, or multivariate polynomial-based algorithms that are believed to be secure against quantum attacks. These protocols aim to maintain the confidentiality, integrity, and security of data transmitted over the blockchain, ensuring the longevity and reliability of blockchain systems in the face of evolving computational advancements. A quantum-secure blockchain scheme (QSB) utilizes a consensus mechanism, QPoA, and IQS. The QPoA is leveraged for block generation while the IQS is deployed in transaction verification1. Furthermore, the integration of quantum computing with blockchain can address current limitations, such as slow transaction speeds and lack of scalability, by optimizing calculations and enabling smarter, more sophisticated smart contracts. The development and implementation of quantum-resistant blockchains are essential for future-proofing digital transactions and maintaining trust in decentralized systems