On fully secure MPC with solitary output
From MaRDI portal
Publication:2175916
DOI10.1007/978-3-030-36030-6_13zbMath1455.94163OpenAlexW2989946494MaRDI QIDQ2175916
Shai Halevi, Nikolaos Makriyannis, Tal Rabin, Yuval Ishai, Eyal Kushilevitz
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36030-6_13
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Related Items
On fully secure MPC with solitary output, On the power of an honest majority in three-party computation without broadcast
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure two-party computation with fairness -- a necessary design principle
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Fairness versus guaranteed output delivery in secure multiparty computation
- Towards characterizing securely computable two-party randomized functions
- Minimal complete primitives for secure multi-party computation
- Security and composition of multiparty cryptographic protocols
- On fully secure MPC with solitary output
- Uncovering algebraic structures in the MPC landscape
- Secure multi-party computation without agreement
- A minimal model for secure computation (extended abstract)
- Non-Interactive Secure Multiparty Computation
- On the Classification of Finite Boolean Functions up to Fairness
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
- Complete Fairness in Multi-party Computation without an Honest Majority
- Foundations of Cryptography
- Privacy and Communication Complexity
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Secure Two-Party Computation
- Towards Characterizing Complete Fairness in Secure Two-Party Computation
- A Zero-One Law for Boolean Privacy
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
