Broadcast-optimal two-round MPC
From MaRDI portal
Publication:2119034
DOI10.1007/978-3-030-45724-2_28zbMath1492.94083OpenAlexW2970724878MaRDI QIDQ2119034
Vassilis Zikas, Juan A. Garay, Ran Cohen
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_28
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items
Broadcast-optimal two round MPC with an honest majority, White box traitor tracing, Round-optimal multi-party computation with identifiable abort, Minimizing setup in broadcast-optimal two round MPC, On the exact round complexity of best-of-both-worlds multi-party computation, On communication models and best-achievable security in two-round MPC, Beyond honest majority: the round complexity of fair and robust multi-party computation, From fairness to full security in multiparty computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-round multiparty secure computation minimizing public key operations
- A lower bound for the time to assure interactive consistency
- 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
- Fairness versus guaranteed output delivery in secure multiparty computation
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Characterization of secure multiparty computation without broadcast
- Round-optimal secure multiparty computation with honest majority
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Degree 2 is complete for the round-complexity of malicious MPC
- Two round information-theoretic MPC with malicious security
- Probabilistic termination and composability of cryptographic protocols
- Secure multi-party computation without agreement
- Secure computation with honest-looking parties (extended abstract)
- Spooky Encryption and Its Applications
- Secure Multi-Party Computation with Identifiable Abort
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Authenticated Algorithms for Byzantine Agreement
- More Efficient Constant-Round Multi-party Computation from BMR and SHE
- 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
- Secure Multiparty Computation with Minimal Interaction
- Foundations of Cryptography
- Simple constant-time consensus protocols in realistic failure models
- Unconditional Byzantine agreement for any number of faulty processors
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Resilient-optimal interactive consistency in constant time
- Detectable byzantine agreement secure against faulty majorities
- Sequential composition of protocols without simultaneous termination
- The round complexity of verifiable secret sharing and secure multicast
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Better Two-Round Adaptive Multi-party Computation
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On Expected Constant-Round Protocols for Byzantine Agreement
- On the exact round complexity of secure three-party computation
- Adaptively secure MPC with sublinear communication complexity
- Low cost constant round MPC combining BMR and oblivious transfer
