DUPLEX: Scalable Zero-Knowledge Lookup Arguments over RSA Group

Abstract

Lookup arguments enable a prover to convince a verifier that a committed vector of lookup elements f→ ∈ Fm is contained within a predefined table T ∈ FN. These arguments are particularly beneficial for enhancing the performance of SNARKs in handling non-arithmetic operations, such as batched range checks or bitwise operations. While existing works have achieved efficient and succinct lookup arguments, challenges remain, particularly when dealing with large vectors of lookup elements in privacy-sensitive applications. In this paper, we introduce, a scalable zero-knowledge lookup argument scheme that offers significant improvements over previous approaches. Notably, we present the first lookup argument designed to operate over the RSA group. Our core technique allows for the transformation of elements into prime numbers to ensure compatibility with the RSA group, all without imposing substantial computational costs on the prover. Given m lookup elements, achieves an asymptotic proving time of O(mlog m), with constant-sized proofs, and constant-time verification. Additionally, ensures the privacy of lookup elements and is robust against dynamic table updates, making it highly suitable for scalable verifiable computation in real-world applications. We implemented and empirically evaluated, comparing it with the state-of-the-art zero-knowledge lookup argument Caulk [CCS'22]. Our experimental results demonstrate that significantly outperforms Caulk in proving time for both single and batched lookup arguments, while maintaining practical proof size and verification time.