Zero-Knowledge Proofs from Secure Multiparty Computation
From MaRDI portal
Publication:3575162
DOI10.1137/080725398zbMath1192.68239OpenAlexW2069535412MaRDI QIDQ3575162
Eyal Kushilevitz, Yuval Ishai, 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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items (29)
LegRoast: Efficient Post-quantum Signatures from the Legendre PRF ⋮ An intermediate secret-guessing attack on hash-based signatures ⋮ Round-optimal fully black-box zero-knowledge arguments from one-way permutations ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Asymptotically quasi-optimal cryptography ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Faster sounder succinct arguments and \textsf{IOP}s ⋮ Succinct interactive oracle proofs: applications and limitations ⋮ Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures ⋮ Post-quantum verifiable random function from symmetric primitives in PoS blockchain ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Zero-Knowledge Proofs of Proximity ⋮ Actively secure garbled circuits with constant communication overhead in the plain model ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ What security can we achieve within 4 rounds? ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ On the amortized complexity of zero-knowledge protocols ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ On the power of secure two-party computation ⋮ Secure multi-party quantum computation with a dishonest majority ⋮ On the Power of Secure Two-Party Computation ⋮ Round-optimal black-box commit-and-prove with succinct communication ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs
This page was built for publication: Zero-Knowledge Proofs from Secure Multiparty Computation
