Fairness versus guaranteed output delivery in secure multiparty computation
From MaRDI portal
Recommendations
- Fairness versus guaranteed output delivery in secure multiparty computation
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Complete fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
Cites work
- Authenticated Algorithms for Byzantine Agreement
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Detectable Byzantine agreement secure against faulty majorities
- Fairness versus guaranteed output delivery in secure multiparty computation
- Foundations of Cryptography
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 2086726 (Why is no real title available?)
- Reaching Agreement in the Presence of Faults
- Secure multi-party computation without agreement
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Security and composition of multiparty cryptographic protocols
- The Byzantine Generals Problem
- Towards characterizing complete fairness in secure two-party computation
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
Cited in
(22)- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Broadcast-optimal two-round MPC
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- On fully secure MPC with solitary output
- Fairness versus guaranteed output delivery in secure multiparty computation
- On achieving the ``best of both worlds in secure multiparty computation
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
- Multiparty generation of an RSA modulus
- Adaptively secure MPC with sublinear communication complexity
- Multiparty generation of an RSA modulus
- On the power of an honest majority in three-party computation without broadcast
- Must the communication graph of MPC protocols be an expander?
- Network-agnostic security comes (almost) for free in DKG and MPC
- Fair delivery of decentralised randomness beacon
- Synchronizable fair exchange
- On secure computation of solitary output functionalities with and without broadcast
- Just how fair is an unreactive world?
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Can Alice and Bob guarantee output to Carol?
- Secure multiparty computation with identifiable abort via vindicating release
- Multi-Holder anonymous credentials from BBS signatures
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
This page was built for publication: Fairness versus guaranteed output delivery in secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698398)
