|
MoneroResearch.info |
 |
 |
 |
|
Wang, N., Chau, S. C.-K., & Liu, D. 2024, SwiftRange: a short and efficient zero-knowledge range argument for confidential transactions and more. Paper presented at 2024 IEEE Symposium on Security and Privacy (SP). Added by: Jack (04/11/2025, 16:03) Last edited by: Jack (04/11/2025, 16:04) |
 |
| Resource type: Proceedings Article BibTeX citation key: Wang2024 View all bibliographic details  |
Categories: Monero-focused Creators: Chau, Liu, Wang Publisher: IEEE Collection: 2024 IEEE Symposium on Security and Privacy (SP) |
Views: 69/69
|
Attachments
2023-1185.pdf  [23/23]
|
URLs https://eprint.iacr.org/2023/1185.pdf |
| Abstract |
|
Zero-knowledge range proofs play a critical role in confidential transactions (CT) on blockchain systems. They are used to prove the non-negativity of committed transaction payments without disclosing the exact values. Logarithmicsized range proofs with transparent setups, e.g., Bulletproofs, which aim to prove a committed value lies in the range [0, 2 𝑁 − 1] where 𝑁 is the bit length of the range, have gained growing popularity for communication-critical blockchain systems as they increase scalability by allowing a block to accommodate more transactions. In this paper, we propose SwiftRange, a new type of logarithmic-sized zero-knowledge range argument with a transparent setup in the discrete logarithm setting. Our argument can be a drop-in replacement for range proofs in blockchain-based confidential transactions. Compared with Bulletproofs, our argument has higher computational efficiency and lower round complexity while incurring comparable communication overheads for CT-friendly ranges, where 𝑁 ∈ {32, 64}. Specifically, a single SwiftRange achieves 1.73× and 1.37× proving efficiency with no more than 1.1× communication costs for both ranges, respectively. More importantly, our argument is doubly efficient in verification efficiency. Furthermore, our argument has a smaller size when 𝑁 ≤ 16, making it competitive for many other communicationcritical applications. Our argument supports the aggregation of multiple single arguments for greater efficiency in communication and verification. Finally, we benchmarked our argument against the state-of-the-art range proofs to demonstrate its practicality.
|