Succinct non-subsequence arguments

Abstract

Lookup arguments have recently attracted a lot of developments due to their applications in the constructions of succinct non-interactive arguments of knowledge (SNARKs). A closely related topic is subsequence arguments in which one can prove that string s is a subsequence of another string t, i.e., deleting some characters in t can achieve s. A dual notion, namely, non-subsequence arguments, is to prove that s is not a subsequence of t. These problems have a lot of important applications in DNA sequence analysis, internet of things, blockchains, natural language processing, speech recognition, etc. However, despite their applications, they are not well-studied in cryptography, especially succinct arguments for non-subsequences with efficient proving time and sublinear verification time. In this work, we propose the first succinct non-subsequence argument. Our solution applies the sumcheck protocol and is instantiable by any multivariate polynomial commitment schemes (PCSs). We achieve an efficient prover whose running time is linear in the size of sequences s, t and their respective alphabet Σ. Our proof is succinct and the verifier time is sublinear assuming the employed PCS has succinct commitments and sublinear verification time. When instantiating with Sona PCS (EUROCRYPT’24), we achieve proof size O(log2|s|+log2|t|+log2|Σ|), prover time O(|s|+|t|+|Σ|) and verifier time O(|s|+|t|+|Σ|). Extending our technique, we can achieve a batch subsequence argument for proving in batch k interleaving subsequence and non-subsequence arguments without proof size suffering a linear blow-up in k.