Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
From MaRDI portal
Publication:6155260
Recommendations
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Two-round MPC: information-theoretic and black-box
- Low cost constant round MPC combining BMR and oblivious transfer
- Two-round multiparty secure computation from minimal assumptions
- Round-optimal secure multiparty computation with honest majority
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- A minimal model for secure computation (extended abstract)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Advances in Cryptology - CRYPTO 2003
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Degree 2 is complete for the round-complexity of malicious MPC
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Foundations of homomorphic secret sharing
- Founding Cryptography on Oblivious Transfer – Efficiently
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Lattice-based fully dynamic multi-key FHE with short ciphertexts
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Multi-key fully-homomorphic encryption in the plain model
- Multiparty Computation from Somewhat Homomorphic Encryption
- Multiparty computation with low communication, computation and interaction via threshold FHE
- On the round complexity of black-box secure MPC
- Perfect secure computation in two rounds
- Reusable non-interactive secure computation
- Reusable two-round MPC from DDH
- Secure computation with minimal interaction, revisited
- Secure multiparty computation with minimal interaction
- Succinct non-interactive arguments via linear interactive proofs
- Two round multiparty computation via multi-key FHE
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Two-round MPC: information-theoretic and black-box
- Two-round adaptively secure multiparty computation from standard assumptions
- Two-round multiparty secure computation from minimal assumptions
- Two-round secure MPC from indistinguishability obfuscation
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Cited in
(1)
This page was built for publication: Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155260)
