MPC with friends and foes
From MaRDI portal
Publication:2096545
DOI10.1007/978-3-030-56880-1_24zbMath1504.94091OpenAlexW3037076805MaRDI QIDQ2096545
Eran Omri, Bar Alon, Anat Paskin-Cherniavsky
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_24
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Two-round adaptively secure multiparty computation from standard assumptions
- Best possible information-theoretic MPC
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Security and composition of multiparty cryptographic protocols
- MPC with friends and foes
- Universally Composable Security with Local Adversaries
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- Collusion-Preserving Computation
- On the Classification of Finite Boolean Functions up to Fairness
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
- How to share a secret
- Collusion-Free Multiparty Computation in the Mediated Model
- Secure Multiparty Computation with Minimal Interaction
- Collusion-Free Protocols in the Mediated Model
- MPC vs. SFE : Unconditional and Computational Security
- Complete Fairness in Multi-party Computation without an Honest Majority
- Realistic Failures in Secure Multi-party Computation
- Nonmalleable Cryptography
- Foundations of Cryptography
- Equivocating Yao
- The round complexity of verifiable secret sharing and secure multicast
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Theory of Cryptography
- Theory of Cryptography
