Lether: Practical Post-Quantum Account-Based Private Blockchain Payments
Hongxiao Wang, Muhammed F. Esgin, Ron Steinfeld, Siu-Ming Yiu
摘要
We introduce Lether, the first practical account-based private blockchain payment protocol based on post-quantum lattice assumptions, following the paradigm of Anonymous Zether (FC '19, IEEE S&P '21). The main challenge in building such a protocol from lattices lies in the absence of core building blocks: unbounded-level additivelyhomomorphic multi-message multi-recipient public key encryption (mmPKE), and event-oriented linkable ring signatures with support for multiple tags (events). To address these issues, we propose a verifiable refreshable additively-homomorphic mmPKE scheme and a plug-and-play event-oriented linkable tag scheme from lattices. We believe both to be of independent interest. To achieve unbounded-level homomorphic evaluation in the lattice-based setting without relying on heavy techniques such as bootstrapping or large moduli (e.g., over 60 bits) in fully homomorphic encryption (FHE), we introduce a simple yet blockchainfriendly mechanism called refresh. Namely, each user is required to verifiably refresh their account after a certain number of transactions. With our tailored parameter settings, the amortized perrefresh costs of communication and computation are only about 1.3% and 1.5%, respectively, of the cost of a transaction. We also optimize the implementations of LNP22 lattice-based zero-knowledge proof system (Crypto '22) in the LaZer library (CCS '24), to support efficient batching of various proof components. Overall, for a typical transaction, the total communication cost becomes about 68 KB, with the associated zero-knowledge proof accounting for about 51 KB of this total. Each of proof generation and verification take a fraction of a second on a standard PC. As an additional contribution, we formalize new definitions for Anonymous Zether-like protocols that more accurately capture real-world blockchain settings. These definitions are generic and are expected to benefit the broader development of account-based private blockchain payment protocols, beyond just lattice settings.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper16
- Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More GeneralVadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime PlançonCRYPTO 2022 · 被引用 125 次
- MatRiCT: Efficient, Scalable and Post-Quantum Blockchain Confidential Transactions ProtocolMuhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu 等CCS 2019 · 被引用 104 次
- DualRing: Generic Construction of Ring Signatures with Efficient InstantiationsTsz Hon Yuen, Muhammed F. Esgin, Joseph K. Liu, Man Ho Au 等CRYPTO 2021 · 被引用 83 次
- MatRiCT+: More Efficient Post-Quantum Private Blockchain PaymentsMuhammed F. Esgin, Ron Steinfeld, Raymond K. ZhaoS&P 2022 · 被引用 59 次
- A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor SamplingRafaël del Pino, Shuichi KatsumataCRYPTO 2022 · 被引用 50 次
相关 Paper
- PriDe CT: Towards Public Consensus, Private Transactions, and Forward Secrecy in Decentralized PaymentsYue Guo, Harish Karthikeyan, Antigoni Polychroniadou, Chaddy HuussinS&P 2024 · 被引用 7 次
- k-out-of-n Proofs and Applications to Privacy-Preserving CryptocurrenciesMin Zhang, Yu Chen, Xiyuan FuEUROCRYPT 2026
- Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-HeadJames Hsin-yu Chiang, Ivan Damgård, William R. Duro, Sunniva Engan 等CCS 2025
- Many-out-of-Many Proofs and Applications to Anonymous ZetherBenjamin E. DiamondS&P 2021 · 被引用 38 次
- A Toolkit for Succinct Lattice-Based Zero Knowledge ProofsBeatrice Biasioli, Madalina Bolboceanu, Vadim Lyubashevsky, Antonio Merino-Gallardo 等CCS 2026 · 被引用 1 次
