Two-round adaptively secure multiparty computation from standard assumptions

DOI10.1007/978-3-030-03807-6_7zbMath1443.94046OpenAlexW2899423027MaRDI QIDQ1629408

Antigoni Polychroniadou, Huijia Lin, Muthuramakrishnan Venkitasubramaniam, Fabrice Benhamouda

Publication date: 11 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_7

Mathematics Subject Classification ID

Cryptography (94A60) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (10)

Adaptively secure computation for RAM programs ⋮ Concurrently composable non-interactive secure computation ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ Efficient and round-optimal oblivious transfer and commitment with adaptive security ⋮ Adaptive security of multi-party protocols, revisited ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ MPC with friends and foes ⋮ Broadcast-optimal two-round MPC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Probabilistic encryption
• Two-round multiparty secure computation from minimal assumptions
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• Hash proof systems over lattices revisited
• Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
• Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Multi-key FHE from LWE, Revisited
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• The Group of Signed Quadratic Residues and Applications
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Multi-identity and Multi-key Leveled FHE from Learning with Errors
• Universally composable two-party and multi-party secure computation
• Universally Composable Security with Global Setup
• A Framework for Efficient and Composable Oblivious Transfer
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• Equivocating Yao
• 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
• Better Two-Round Adaptive Multi-party Computation
• Removing Erasures with Explainable Hash Proof Systems
• 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 adaptively secure multiparty computation from standard assumptions