Zero-knowledge proofs on secret-shared data via fully linear PCPs

DOI10.1007/978-3-030-26954-8_3zbMath1436.94043OpenAlexW2969140724MaRDI QIDQ2304915

Dan Boneh, Yuval Ishai, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26954-8_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Unconditional communication-efficient MPC via Hall's marriage theorem ⋮ Sublinear GMW-style compiler for MPC with preprocessing ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions ⋮ MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK) ⋮ Secure multiparty computation with sublinear preprocessing ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Prio+: privacy preserving aggregate statistics via Boolean shares ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Arithmetic sketching ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation ⋮ Transparent SNARKs from DARK compilers ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Banquet: short and fast signatures from AES ⋮ On succinct arguments and witness encryption from groups ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Spartan: efficient and general-purpose zkSNARKs without trusted setup ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures

This page was built for publication: Zero-knowledge proofs on secret-shared data via fully linear PCPs