Two-round MPC without round collapsing revisited -- towards efficient malicious protocols

DOI10.1007/978-3-031-15802-5_13zbMath1516.94041MaRDI QIDQ6155260

Huijia Lin, Tianren Liu

Publication date: 12 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

zbMATH Keywords

dishonest majoritymalicious security

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-round MPC: information-theoretic and black-box
• Perfect secure computation in two rounds
• Two-round adaptively secure multiparty computation from standard assumptions
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Multi-key fully-homomorphic encryption in the plain model
• Efficient pseudorandom correlation generators from ring-LPN
• Reusable two-round MPC from DDH
• Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
• On the round complexity of black-box secure MPC
• Degree 2 is complete for the round-complexity of malicious MPC
• Reusable non-interactive secure computation
• Efficient pseudorandom correlation generators: silent OT extension and more
• A minimal model for secure computation (extended abstract)
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multi-key FHE from LWE, Revisited
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
• Secure Computation with Minimal Interaction, Revisited
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Secure Multiparty Computation with Minimal Interaction
• Founding Cryptography on Oblivious Transfer – Efficiently
• Succinct Non-interactive Arguments via Linear Interactive Proofs
• Foundations of Homomorphic Secret Sharing
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Advances in Cryptology - CRYPTO 2003
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Two Round Multiparty Computation via Multi-key FHE
• Two-Round Secure MPC from Indistinguishability Obfuscation

This page was built for publication: Two-round MPC without round collapsing revisited -- towards efficient malicious protocols