Succinct Hash-Based Arbitrary-Range Proofs
Zero-knowledge range proof (ZKRP) asserts that a committed integer <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</i> lies in a given range like <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$[{0, 2^{n}-1}]$ </tex-math></inline-formula> without other leakages of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">V</i>. It is vital in various privacy-preserving systems. Moving forward, the quest for post-quantum security is still in its infancy; the proof size of state-of-the-art lattice-based ZKRP (Lyubashevsky et al., CCS 20 and Couteau et al., Eurocrypt 21) remains linear in <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>, directly impacting the long-term sustainability in applications such as immutable ledgers. Confronting this unresolved impasse, we propose SHARP-PQ, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i.e.</i>, succinct hash-based arbitrary-range proof with post-quantum security. SHARP-PQ offers proof size poly-logarithmic to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i>, optimized batch proofs, and versatile (new) capabilities. Its success stems from the improved inner product argument and exploitation of homomorphism. Empirically, SHARP-PQ features at least <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$10\times $ </tex-math></inline-formula> smaller proof size for multiple ranges over lattice-based ZKRPs while maintaining competitive prover and verifier times. SHARP-PQ also outperforms ZKRPs directly constructed from hash-based generic zero-knowledge proofs at most <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$10 \times $ </tex-math></inline-formula>.
Authors
- Zongyang Zhang (ORCID: https://orcid.org/0000-0003-1358-4933)
- Weihan Li (ORCID: https://orcid.org/0000-0002-2846-593X)
- Zhiguo Wan (ORCID: https://orcid.org/0000-0003-1319-1224)
- Sherman S. M. Chow (ORCID: https://orcid.org/0000-0001-7306-453X)
- Yanpei Guo (ORCID: https://orcid.org/0000-0001-7724-0473)
Institutions
- Chinese University of Hong Kong (HK)
- Zhejiang Lab (CN)
- Beihang University (CN)
Publication Details
- Journal
- IEEE Transactions on Information Forensics and Security
- Published
- 2024-11-13
- DOI
- https://doi.org/10.1109/tifs.2024.3497806
- Citations
- 1
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.21
Funders
- National Natural Science Foundation of China
- Beijing Municipal Natural Science Foundation
- National Key Research and Development Program of China