Two-round adaptively secure multiparty computation from standard assumptions

DOI10.1007/978-3-030-03807-6_7MaRDI QIDQ1629408zbMATH OpenOpenAlexFDO

Authors Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam

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

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

Recommendations

• Two-round multiparty secure computation from minimal assumptions
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• On Adaptively Secure Multiparty Computation with a Short CRS
• Better two-round adaptive multi-party computation
• Two-round adaptively secure MPC from isogenies, LPN, or CDH

Cites work

• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
• A Framework for Efficient and Composable Oblivious Transfer
• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively secure, universally composable, multiparty computation in constant rounds
• Better two-round adaptive multi-party computation
• Constant-Round MPC with Fairness and Guarantee of Output Delivery
• Efficient oblivious transfer protocols
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
• Foundations of homomorphic secret sharing
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Hash proof systems over lattices revisited
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Improved non-committing encryption with applications to adaptively secure protocols
• 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
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Probabilistic encryption
• Removing erasures with explainable hash proof systems
• Smooth projective hashing and two-message oblivious transfer
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• The Group of Signed Quadratic Residues and Applications
• Two round multiparty computation via multi-key FHE
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Two-round multiparty secure computation from minimal assumptions
• Two-round secure MPC from indistinguishability obfuscation
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation

Cited in

(23)

• Two-round multiparty secure computation from minimal assumptions
• MPC with friends and foes
• Broadcast-optimal two-round MPC
• Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
• Adaptively secure computation for RAM programs
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Adaptive security of multi-party protocols, revisited
• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• On Adaptively Secure Multiparty Computation with a Short CRS
• Secure computation against adaptive auxiliary information
• Adaptively Secure Two-Party Computation with Erasures
• scientific article; zbMATH DE number 1256784 (Why is no real title available?)
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Better two-round adaptive multi-party computation
• One-Sided Adaptively Secure Two-Party Computation
• Two-round Multiparty Secure Computation from Minimal Assumptions
• Adaptively secure MPC with sublinear communication complexity
• Adaptively secure MPC with sublinear communication complexity
• 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

This page was built for publication: Two-round adaptively secure multiparty computation from standard assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1629408)