Promise zero knowledge and its applications to round optimal MPC
From MaRDI portal
Recommendations
- Round-optimal perfect zero-knowledge proofs
- Private polynomial commitments and applications to MPC
- Round-optimal zero-knowledge proofs of knowledge for NP
- scientific article; zbMATH DE number 1107670
- Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
- On Efficient Zero-Knowledge PCPs
- On round optimal statistical zero knowledge arguments
- Constant-round perfect zero-knowledge computationally convincing protocols
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Round optimal secure multiparty computation from minimal assumptions
Cited in
(39)- Two-message statistically sender-private OT from LWE
- What security can we achieve within 4 rounds?
- Towards accountability in CRS generation
- On the round complexity of secure quantum computation
- On the round complexity of black-box secure MPC
- Round-optimal and communication-efficient multiparty computation
- Round-optimal multi-party computation with identifiable abort
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- From FE combiners to secure MPC and back
- On the exact round complexity of best-of-both-worlds multi-party computation
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Two-round maliciously secure computation with super-polynomial simulation
- Blockchains enable non-interactive MPC
- An Algebraic Approach to Nonmalleability
- On the exact round complexity of secure three-party computation
- Round-optimal secure multi-party computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Statistical security in two-party computation revisited
- Four-round black-box non-malleable schemes from one-way permutations
- Round-optimal black-box secure computation from two-round malicious OT
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- On non-uniform security for black-box non-interactive CCA commitments
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Statistically sender-private OT from LPN and derandomization
- A new approach to efficient non-malleable zero-knowledge
- A new framework for quantum oblivious transfer
- Round-optimal black-box MPC in the plain model
- Reusable secure computation in the plain model
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- The round complexity of statistical MPC with optimal resiliency
- Broadcast-optimal four-round MPC in the plain model
- Two-round concurrent 2PC from sub-exponential LWE
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Towards accountability in CRS generation
- Broadcast-optimal secure computation from black-box oblivious transfer
- Almost-total puzzles and their applications
This page was built for publication: Promise zero knowledge and its applications to round optimal MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784103)
