1/p-secure multiparty computation without an honest majority and the best of both worlds
From MaRDI portal
Publication:2210437
Recommendations
Cites work
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- A full characterization of functions that imply fair coin tossing and ramifications to fairness
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- An Optimally Fair Coin Toss
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Characterization of secure multiparty computation without broadcast
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Enhancements of trapdoor permutations
- Fair coin flipping: tighter analysis and the many-party case
- Foundations of Cryptography
- Foundations of Cryptography
- How to share a secret
- scientific article; zbMATH DE number 4191105 (Why is no real title available?)
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- On achieving the ``best of both worlds in secure multiparty computation
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- On complete primitives for fairness
- On the classification of finite Boolean functions up to fairness
- Partial fairness in secure two-party computation
- Practical and provably secure release of a secret and exchange of signatures
- Protocols for multiparty coin toss with a dishonest majority
- Protocols for multiparty coin toss with dishonest majority
- Resource fairness and composability of cryptographic protocols
- Secure multi-party computation with identifiable abort
- Secure multi-party computation without agreement
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Security and composition of multiparty cryptographic protocols
- Towards characterizing complete fairness in secure two-party computation
Cited in
(12)- Towards round-optimal secure multiparty computations: multikey FHE without a CRS
- MPC with friends and foes
- Revisiting fairness in MPC: polynomial number of parties and general adversarial structures
- On fully secure MPC with solitary output
- On achieving the ``best of both worlds in secure multiparty computation
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Fully-secure MPC with minimal trust
- Best of both worlds. Revisiting the spymasters double agent problem
- Optimally-fair multi-party exchange without trusted parties
- Three party secure computation with friends and foes
- Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
This page was built for publication: \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210437)
