Zero-knowledge proofs from secure multiparty computation

DOI10.1137/080725398zbMATH Open1192.68239OpenAlexW2069535412MaRDI QIDQ3575162FDOQ3575162

Authors: Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai

Publication date: 7 July 2010

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9c9dc6e15bedebf021415fa28e1c4571b6ac0083

Recommendations

scientific article; zbMATH DE number 1559559
scientific article; zbMATH DE number 1302863
Efficient fully secure computation via distributed zero-knowledge proofs
Constant-round adaptive zero-knowledge proofs for NP
On the amortized complexity of zero knowledge protocols for multiplicative relations

zbMATH Keywords

cryptography secure computation zero-knowledge black-box reductions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Cited In (87)

On Efficient Zero-Knowledge PCPs
Title not available (Why is that?)
On the Composition of Zero-Knowledge Proof Systems
New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
On the Portability of Generalized Schnorr Proofs
Efficient proofs of knowledge for threshold relations
Secure multi-party quantum computation with a dishonest majority
Title not available (Why is that?)
On the Amortized Complexity of Zero-Knowledge Protocols
Zero-knowledge proofs for committed symmetric Boolean functions
Zero-communication reductions
An Equivalence Between Zero Knowledge and Commitments
Zero-knowledge proofs of proximity
From weak to strong zero-knowledge and applications
Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
Post-quantum verifiable random function from symmetric primitives in PoS blockchain
Title not available (Why is that?)
Title not available (Why is that?)
What security can we achieve within 4 rounds?
Compact zero-knowledge proofs of small Hamming weight
LegRoast: efficient post-quantum signatures from the Legendre PRF
Round-optimal fully black-box zero-knowledge arguments from one-way permutations
Theory of Cryptography
On the amortized complexity of zero knowledge protocols for multiplicative relations
An intermediate secret-guessing attack on hash-based signatures
Implicit zero-knowledge arguments and applications to the malicious setting
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Executable proofs, input-size hiding secure computation and a new ideal world
Round-optimal black-box commit-and-prove with succinct communication
Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
ZK-PCPs from leakage-resilient secret sharing
Zero knowledge LTCs and their applications
Strictly-black-box zero-knowledge and efficient validation of financial transactions
On the amortized complexity of zero-knowledge protocols
Zero-Knowledge Proofs with Witness Elimination
On the Power of Secure Two-Party Computation
Quasi-linear size zero knowledge from linear-algebraic PCPs
Traceable ring signatures: general framework and post-quantum security
3-message zero knowledge against human ignorance
Computational integrity with a public random string from quasi-linear PCPs
Zero-Knowledge Proofs
Practical relativistic zero-knowledge for NP
Asymptotically quasi-optimal cryptography
Compact designated verifier NIZKs from the CDH assumption without pairings
Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
Privacy-free garbled circuits with applications to efficient zero-knowledge
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Zero-knowledge proofs on secret-shared data via fully linear PCPs
Non-interactive zero-knowledge proofs to multiple verifiers
Lightweight zero-knowledge proofs for crypto-computing protocols
Efficient zero-knowledge proofs. (Abstract)
Isolated Proofs of Knowledge and Isolated Zero Knowledge
Efficient fully secure computation via distributed zero-knowledge proofs
Cluster computing in zero knowledge
On the power of secure two-party computation
On zero-knowledge proofs (extended abstract)
Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
Zero‐Knowledge Proofs
Constant-round adaptive zero-knowledge proofs for NP
Succinct interactive oracle proofs: applications and limitations
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
From private simultaneous messages to zero-information Arthur-Merlin protocols and back
Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
Zero-knowledge proofs via polynomial representations
Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
Your reputation's safe with me: framing-free distributed zero-knowledge proofs
Title not available (Why is that?)
PERK: compact signature scheme based on a new variant of the permuted kernel problem
Zero-knowledge systems from MPC-in-the-head and oblivious transfer
Ligero: lightweight sublinear arguments without a trusted setup
Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
Arithmetic sketching
Faster sounder succinct arguments and \textsf{IOP}s
MR-DSS -- smaller MinRank-based (ring-)signatures
Efficient isogeny proofs using generic techniques
Multi-theorem preprocessing NIZKs from lattices
On sigma-protocols and (packed) black-box secret sharing schemes
New proof systems and an OPRF from CSIDH
More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings
Sometimes you can't distribute random-oracle-based proofs
Stochastic secret sharing with 1-bit shares and applications to MPC
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Commitments with efficient zero-knowledge arguments from subset sum problems
Actively secure garbled circuits with constant communication overhead in the plain model

This page was built for publication: Zero-knowledge proofs from secure multiparty computation

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