A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.
Nadia: We're looking at the paper: "A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions".
Elias: Here's the gist of the paper. The paper proposes PQ-TaDL (Post-Quantum Table based Distributed Ledger) as a novel, post-quantum, lattice-based transaction scheme designed to meet the stringent confidentiality and auditability requirements of financial institutions.
Nadia: The construction leverages advanced zero-knowledge proof techniques and introduces a new method for equating two commitment messages without revealing the random value of the original commitment during re-commitment.
Elias: Furthermore, it introduces PQ-TaDLCompact, a compact multi-asset transaction scheme that scales with the polynomial degree.
Nadia: The main contributions are: 1.
Title and authors: Nadia: So we're looking at this paper called "A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions," and it’s trying to solve a real problem in finance: how do you keep transaction data private while still being able to audit everything?
Elias: Exactly. Traditional ledger technology has these privacy headaches because the transaction data can be public, which isn't good for banks. This paper proposes moving away from those old Ring-CT models and using a lattice-based scheme that's designed specifically for financial needs like confidentiality and auditability.
Priya: So, what does this actually mean in practice? Is it just another complicated way to hide money trails? I need to know if this is something that actually works for institutions.
Nadia: It’s not just hiding things; they’re building a system where you can do multi-asset transactions and still get verifiable spendable tokens. This is about making sure the ledger can handle complex financial movements while keeping the data secure from prying eyes >
Elias: And the core of their method involves using zero-knowledge proofs to assert relations between different commitments, which is a new technique they introduced for equating two commitment messages without revealing the random value of the original commitment during re-commitment >
Priya: That sounds clever, but how do we know that this zero-knowledge part actually holds up when you’re dealing with real financial balances? What are the numbers looking like here?
Nadia: They’ve built several proofs for transaction relations, like Proof of Balance, Proof of Consistency, and Proof of Equivalence. These are constructed using lattice-based techniques and approximate range proofs to verify that everything adds up correctly across the ledger state >
Elias: And they specifically show a new way to assert that two commitments share the same committed value in a zero-knowledge manner without revealing the original commitment's random value, which is essential for getting a publicly verifiable transaction protocol in this encrypted table-based ledger setting >
Priya: So if we think about the practical side, they also propose something called PQ-TaDLCompact, which they call a compact multiasset transaction scheme that scales with the polynomial degree. What does that actually give us?
Nadia: That means you can handle multiple assets in one transaction efficiently, and it gets smaller as you add more assets because it scales with the polynomial degree >
Elias: It’s essentially extending this concept by encoding asset values into the coefficients of a polynomial ring element message, and PQ-TaDLCompact extends that by performing a range check on the committed message value across different coefficients >
Priya: That sounds like it tackles the multi-asset problem head-on. But what about security? They mention analyzing it under Quantum Random Oracle Model settings, which is important for post-quantum cryptography.
Nadia: The security analysis in the QROM setting shows that PQ-TaDL is balanced and private under certain assumptions, meaning they prove that these zero-knowledge proof sigma protocols are weakly collapsing >
Title and authors: Elias: Which leads them to conclude that PQ-TaDL is a non interactive zero knowledge proof of knowledge in the QROM setting, which is a pretty strong result for this kind of construction >
Priya: Okay, so we know it's theoretically secure under those assumptions. But what about the real-world speed and size? How does this compare to existing solutions like Ring-CT schemes?
Nadia: They did analyze the performance and communication metrics. They found that proof of consistency and proof of equivalence are dominating the runtime costs for PQ-TaDL, with generating a transaction per participant in a new transaction taking around five hundred milliseconds >
Elias: And for PQ-TaDLCompact, it takes around nine hundred milliseconds to do the same thing because of those extra checks they added >
Priya: What about the size of the data being sent? Because in finance, transaction size matters a lot. What are these total transaction sizes per participant per asset looking like here?
Nadia: Communication analysis shows that for PQ-TaDL, the total transaction size is around one thousand seventy-eight kilobytes per participant per asset >
Elias: But with PQ-TaDLCompact, that size drops significantly to around six point one kilobytes per participant per asset >
Priya: That drop sounds important. It’s much smaller than what some other schemes like MatRiCT+ do, which scale linearly with the number of input and output accounts >
Nadia: Right, so they suggest that this ETL scheme is better for financial institutions because it achieves k-anonymity through masking, supports customizable audit keys, and natively supports multi-asset transactions compactly >
Elias: The limitation they point out is that their transaction size still grows linearly per participant and per asset >
Priya: So the limitations are that while they get better efficiency for multi-asset use, the data size still grows somewhat predictably with the number of assets >
Nadia: It’s a trade-off between complexity, privacy guarantees, and how much data you need to move through this protocol >
Elias: And we also have to remember that they're building on these complex zero-knowledge proof structures for things like Proof of Balance and Proof of Asset Prime, which are all checked using specific Zero Knowledge Succinct Non Interactive Argument protocols >
Priya: So, looking at the overall picture, this paper provides a concrete path towards making distributed ledgers usable in finance by addressing the quantum threat while maintaining strong privacy guarantees >
Nadia: It certainly gives us a framework for thinking about how to build these systems to handle multi-asset transactions and provide efficient auditing >
Elias: And it shows that the combination of lattice-based commitments and these novel zero-knowledge proofs can yield a robust system, even when you consider quantum adversaries >
Priya: It’s a lot of detail about the performance trade-offs, but for someone just listening, this paper really highlights how much work goes into making these things practical for real financial institutions >
Nadia: Right. So we've talked about the PQ-TaDL and PQ-TaDLCompact schemes, their security under QROM, and the performance trade-offs they found in this paper on "A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions" >
The paper's summary: Nadia: So we've been talking about how they built this new scheme, PQ-TaDL, and now we need to talk about what they actually claimed it could do for a real bank, which is what this summary lays out.
Elias: It’s basically saying that they made a post-quantum ledger protocol that works with lattice math instead of the old stuff, and the goal is to give financial institutions something they can trust for long term.
Nadia: Exactly. They are proposing PQ-TaDL as a novel way to do encrypted table based ledgers, which is different from those Ring-CT schemes we've been talking about before.
Elias: The paper claims this scheme supports multi asset transactions and verifiable spendable tokens, which means you can move more than just one thing at a time in the ledger.
Nadia: Right. And they do this by using these advanced zero knowledge proof techniques to ensure that the transaction data stays private while still being auditable for regulators.
Elias: One of their big technical claims is a new method for equating two commitment messages without revealing the original random value when you re-commit them, which is a neat trick to keep things hidden.
Nadia: It’s about asserting relations like Proof of Balance and Proof of Consistency in this encrypted table setting using those lattice-based techniques they developed.
Elias: They also introduce something called PQ-TaDLCompact, which is supposed to be a much more compact way to handle multi asset transactions by scaling with the polynomial degree.
Nadia: So, for the listener, it means they’ve managed to make these complex financial proofs work in a way that scales better as you add more assets and keeps the transaction size under control.
Elias: The security analysis is pretty solid because they show it holds up under a Quantum Random Oracle Model setting, which is important since we're talking post-quantum safety here.
Nadia: It’s showing that these zero knowledge proof protocols are weakly collapsing, meaning the system has a non interactive zero knowledge proof of knowledge in that quantum model.
Elias: But Priya needs to weigh this claim. She’s looking at how much data this really shows and if the auditability is practical for someone running a real bank's systems.
Nadia: That’s fair, Priya. The paper does give some performance numbers, showing that proof of consistency and proof of equivalence are the main things slowing down the runtime for PQ-TaDL itself.
Elias: And those runtime costs are around five hundred milliseconds to generate a transaction per participant in a new one.
Nadia: For PQ-TaDLCompact, it’s pushing nine hundred milliseconds because they added those extra range checks on different coefficients.
Elias: The communication part is where things get interesting for the listener. They show that the total transaction size per participant per asset is around one thousand seventy-eight kilobytes for PQ-TaDL.
Nadia: But with PQ-TaDLCompact, that size drops down to around six point one kilobytes per participant per asset. That’s a big difference in terms of bandwidth usage and data storage needed.
Elias: It suggests that this ETL scheme might be better suited for financial institutions because it supports multi asset transactions compactly and helps achieve k anonymity through masking.
Nadia: The authors do flag that the limitation is that the transaction size still grows linearly per participant and per asset, which is something they have to manage in practice.
Elias: So, to wrap up this part, they’ve proposed a scheme that tries to balance strong post-quantum security with practical efficiency for complex multi-asset financial ledgers.
Nadia: It really gives us a clear path forward for how we can think about building distributed systems that need both high privacy and solid audit trails.
The paper's improvements: Tom: So we’re shifting gears now to what the authors actually suggest they could improve about this PQ-TaDL protocol, which is basically their roadmap for making it better for real use cases.
Nadia: They’re pushing a few things here, starting with how they handle multi asset transactions. They say that the scheme can natively support up to d assets in a single ring element committed in one transaction.
Elias: That’s significant because it means you can pack more financial data into one cryptographic message without making the math explode or requiring a massive number of separate entries.
Nadia: Right. And they also talk about efficient zero knowledge auditing, moving away from those older Ring-CT schemes that might require scanning every single transaction history to verify something.
Elias: They mention using table like structures and verifiable extraction for commitment, which is supposed to make the auditing process much more practical for institutions.
Nadia: Plus, they support verifiable spendable tokens through a proof of commitment extractability. That’s crucial because in banking, you need to make sure the token key is actually well formed and can be spent by the receiver.
Elias: It ties back into the security side too, showing that they can provide security analysis under the Quantum Random Oracle Model settings, which proves it's safe against quantum computers.
Nadia: So, they’re basically claiming this combination of features—multi asset support and better auditing—makes PQ-TaDL a much more viable option than what we saw in the previous literature.
Elias: The main implication is that for institutions, this moves beyond just theoretical security and gives them a scheme that actually handles the complexity of modern financial products, like multi asset trading.
Nadia: It’s about making sure that when you're building these systems, you have a protocol that scales with the actual complexity of your assets rather than just growing linearly in a way that becomes too slow.
Elias: They’re trying to provide a practical version of this lattice-based idea, showing how it can be implemented without making the proof generation take an unreasonably long time.
Nadia: The main thing we see here is that they’ve moved from just proving something is secure to providing a usable tool for building actual financial ledger technology.
Elias: It’s about bridging that gap between the high-level cryptography and what an engineer can actually deploy in a production environment.
Nadia: So, if you're listening, this paper shows how to take these complex proofs and package them into a structure that is both more efficient for multi asset use and easier to audit than previous attempts.
Conclusion: Nadia: So we’re wrapping up our look at "A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions." Basically, this paper shows how to build a ledger that is both post-quantum secure and practical for banks, moving away from older Ring-CT methods.
Elias: It really focuses on making the proofs work in a way that's usable, especially when you’re dealing with multi asset transactions and needing verifiable tokens.
Nadia: The main point is that they’ve built a framework where you can enforce things like Proof of Balance and Consistency using lattice math while keeping the data private through zero knowledge proofs.
Elias: It shows that this approach can be balanced and private under the Quantum Random Oracle Model setting, which is a big step for post-quantum safety.
Priya: From a privacy angle, I’m still focused on how much actual data this scheme reveals during the auditing process before we can trust those results.
Nadia: Right. And they did give us some metrics showing that the communication size for PQ-TaDLCompact drops to around six point one kilobytes per participant per asset, which is a real win over some other schemes like MatRiCT+.
Elias: The performance trade-offs are clear too. Proof of consistency and proof of equivalence are the main things slowing down the runtime for both protocols.
Priya: I mean, getting those proofs done in nine hundred milliseconds for PQ-TaDLCompact is not instantaneous, so we have to consider if that’s fast enough for high frequency trading or something similar.
Nadia: That’s the caveat. It's not about being lightning fast right now, but it's about proving you can do what you need securely and privately in a post-quantum world.
Elias: The implication is that we have a concrete direction for building secure financial ledgers using lattice-based cryptography instead of relying on older schemes.
Nadia: So, this paper gives us the blueprint for how to handle complex asset movements with strong privacy guarantees in a quantum-resistant way.
Priya: It’s a solid foundation because it tackles the real-world need for auditability while keeping the data masked effectively through k anonymity masking.
Elias: And we’ve seen how important it is to get those ZK sigma protocols right, and this work provides a very strong model for that.
Nadia: So, that’s our take on "A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions." It’s a solid piece of research showing the path forward.
Elias: Next week, we’ll be looking at papers dealing with how to predict and mitigate jailbreak attacks on large language models, which is a totally different kind of security challenge.
Global Technology Applied Research, JPMorganChase
cs.CR
Submitted: 2026-03-05
Updated: 2026-11-06
Comments: ACM Conference on Post-Quantum and Quantum-based Security 2026
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 82/100
The gist: The paper proposes PQ-TaDL (Post-Quantum Table based Distributed Ledger) as a novel, post-quantum, lattice-based transaction scheme designed to meet the stringent confidentiality and auditability…
Key concepts
- PQ-TaDL
- A novel lattice-based transaction scheme designed for encrypted table-based ledgers. It supports multi-asset transactions and verifiable spendable tokens, providing efficient zero-knowledge auditing over account history.
- Zero-Knowledge Proofs (ZKPs)
- Mathematical proofs that allow one party to prove a statement is true without revealing the underlying data. These are used in PQ-TaDL to ensure transaction validity and privacy during auditing.
- PQ-TaDLCompact
- A compact version of the scheme optimized for multi-asset transactions. It scales with the polynomial degree, allowing up to several assets to be represented efficiently within a single commitment message.
- QROM Security Analysis
- A rigorous security analysis performed under the Quantum Random Oracle Model. This demonstrates that PQ-TaDL is balanced and private, showing its robustness against quantum adversaries.
Terminology
Summary
The paper proposes PQ-TaDL (Post-Quantum Table based Distributed Ledger) as a novel, post-quantum, lattice-based transaction scheme designed to meet the stringent confidentiality and auditability requirements of financial institutions. p. 0 The construction leverages advanced zero-knowledge proof techniques and introduces a new method for equating two commitment messages without revealing the random value of the original commitment during re-commitment. p. 0 Furthermore, it introduces PQ-TaDLCompact, a compact multi-asset transaction scheme that scales with the polynomial degree. p. 1
The main contributions are:
-
PQ−TaDL is presented as a new lattice-based transaction scheme for encrypted table-based ledgers (ETL), supporting multi-asset transactions, verifiable spendable tokens, and efficient zero-knowledge auditing over account state history.
-
The authors construct various zero-knowledge proofs for transaction relations, notably demonstrating a new technique to assert that two commitments share the same committed value in a zero-knowledge manner without revealing the original commitment's random value.
-
PQ−TaDLCompact is proposed as a compact multi-asset transaction scheme in the ETL setting that scales with the polynomial degree.
-
A comprehensive security analysis is provided for the proposed scheme, including analysis under Quantum Random Oracle Model (QROM) settings. p. 1
-
Performance and communication metrics are analyzed in detail. p. 1
The protocol enforces several relations, including Proof of Balance (PoB), Proof of Consistency (PoC), Proof of Equivalence (PoE), and Proof of Asset (PoA). p. 4 These proofs are constructed using lattice-based techniques such as homomorphic lattice-based commitment schemes, zero-knowledge proofs, and approximate range proofs. p. 0 Multi-asset transactions are supported by encoding asset values into the coefficients of a polynomial ring element message, with PQ−TaDLCompact extending this by performing a range check on the committed message value across different coefficients. p. 5
The security analysis under QROM demonstrates that PQ-TaDL is balanced and private under certain assumptions, showing that the zero-knowledge ZKP sigma protocols are weakly collapsing, leading to PQ-TaDL being NIZKPoK in the QROM setting. p. 5 Correctness is formally defined based on system parameters, valid value lists V, and secret key lists SK. p. 0
The protocol enforces relations such as Proof of Balance (PoB), Proof of Consistency (PoC), Proof of Equivalence (PoE), Proof of Asset/Proof of Asset Prime (PoA/PoA'), and Key Well-formness (PoKW). The verification process involves checking these proofs using specific Zero-Knowledge Succinct Non-Interactive Argument (NIZK) protocols. p. 6
The scheme supports multi-asset transactions by encoding asset values into the coefficients of a polynomial ring element message. p. 0 A compact version, PQ−TaDLCompact, extends this by performing a range check on the committed message value encoded in different coefficients. p. 5
The security analysis is provided under the quantum random oracle model (QROM), showing that PQ-TaDL is balanced and private under certain assumptions. p. 1 Performance analysis indicates that proof of consistency and proof of equivalence are dominating runtime costs, with generating a transaction per participant in a new transaction taking around 500ms for PQ-TaDL and 900ms for PQ-TaDLCompact. p. 0 Communication analysis shows the total transaction size per participant per asset is around 1078 KB for PQ-TaDL and around 6. p. 71 KB per participant per asset for PQ-TaDLCompact. p. 7
The comparison with Ring-CT schemes suggests that ETL (PQ−TaDL) is better suited for financial institutions because it achieves k-anonymity through masking, supports customizable audit keys, and natively supports multi-asset transactions compactly. p. 0 The limitations of ETL are that its transaction size grows linearly per participant and per asset. p. 7
The relations enforced by the NIZK proof include:
(1) RPPoB by pi B: Given a list of commitments, the opening to their summed message is zero.
(2) RPPoC by pi C: Given a commitment, the random value r used in the commitment is short and the message is of the form v, sqrt v, v. p. 4
(3) RPPoE by pi E: Given two commitments and a public key, when the corresponding secret key is used to decrypt the commitment message difference, the decrypted message norm with error term is short. p. 0 Note that if the error term is also short, then value/message equivalence will hold by Lemma 4. p. 94.
(4) RPPoE2 by Fig. p. 2 12: Given two commitments, their messages are the same. p. 4
(5) RPPoA/PoA' by pi A: Given a commitment, the message is a 64-bit integer. For the PoA', it is asserted that given a commitment, all the assets’ coefficients are 64-bit (positive) integers.
(6) RPPoKW by Appendix D. p. 53: Given a public key and a commitment key matrix A, the prover knows a short secret and error term that constitute the public key with respect to A T. p. 9
The construction of PQ−TaDL as an instance of ETL (Definition 5. p. 11) is given in Fig. p. 6 9 and setup algorithms are given in Fig. p. 6 10. The transaction scheme flow is illustrated in Fig. p. 2 2 and discussed in details in Section 2. p. 61, with verification steps detailed for bPoB, bPoC, bPoE, bPoE2, and bPoA using the respective ZKVerifyRPoB/RPoC/RPoE/RPoE2/RPoA protocols.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Post-quantum security analysis in QROM model: The system can provide security analysis in Quantum Random Oracle Model settings, which is a step further beyond existing lattice-based constructions by showing that zero-knowledge proof protocols used are quantum proof-of-knowledge protocols.
-
Multi-asset transaction support: The improved system can natively support multi-asset transactions through the PQ - TaDL scheme, allowing for the compact representation of up to d assets into a single ring element committed in a transaction.
-
Efficient zero-knowledge auditing: The system enables efficient zero-knowledge auditing of account state history by leveraging table-like structures and verifiable extraction for commitment, which is more practical than RingCT schemes that require scanning entire transaction histories.
-
Verifiable spendable tokens: The improved system supports verifiable spendable tokens through a proof of commitment extractability, which is crucial for institutional use cases where the token key needs to be well-formed and spent by the receiver.
-
Compact transaction size: For PQ - TaDL Compact, the system can achieve a total transaction size per participant per asset around 6.1 KB, significantly smaller than other schemes like MatRiCT+ which scale linearly with N (input/output accounts).
Sources
- Private, Auditable, and Distributed Ledger for Financial Institutes
- On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Related papers
- From Strategy Search to Policy Learning: MCTS-Guided Adversarial Co-Evolution for LLM Safety Alignment
- Privacy Leakage from Recurrent State in LLM Inference
- Incrementally Verifiable Oracle Aided Computation
- Privilege and confidentiality in generative AI workflows
- BadMoE: Backdooring Mixture-of-Experts LLMs via Routing-Aware Triggers and Task-Underutilized Experts
- CoVault: Secure, Scalable Analytics of Personal Data