\textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK

DOI10.1007/978-981-96-0935-2_12MaRDI QIDQ6965212zbMATH OpenFDO

Authors Carmit Hazay, David G. Heath, Vladimir Kolesnikov, Muthuramakrishnan Venkitasubramaniam, Yibin Yang

Publication date 3 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-0935-2_12

zbMATH Keywords

disjunctionsVOLE-based ZKzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• A new approach to practical active-secure two-party computation
• A probabilistic remark on algebraic program testing
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1030984 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• scientific article; zbMATH DE number 7706037 (Why is no real title available?)
• More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
• Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
• Semi-homomorphic encryption and multiparty computation
• Snarks for C: verifying program executions succinctly and in zero knowledge
• Sok: vector OLE-based zero-knowledge protocols
• Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
• Stacked garbling for disjunctive zero-knowledge proofs
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• The knowledge complexity of interactive proof-systems
• Toward malicious constant-rate 2PC via arithmetic garbling
• Universally composable two-party and multi-party secure computation

Cited in

(1)

• \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication

This page was built for publication: \textsf{LogRobin++}: optimizing proofs of disjunctive statements in VOLE-based ZK

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965212)