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