Partial fairness in secure two-party computation
From MaRDI portal
Recommendations
- Partial fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Complete fairness in secure two-party computation
- Towards characterizing complete fairness in secure two-party computation
- Designing fully secure protocols for secure two-party computation of constant-domain functions
Cites work
- 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 176562 (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 1759773 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- An Optimally Fair Coin Toss
- Complete Fairness in Multi-party Computation without an Honest Majority
- Complete fairness in secure two-party computation
- Completely fair SFE and coalition-safe cheap talk
- Concurrent zero-knowledge
- Foundations of Cryptography
- 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 dishonest majority
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Security and composition of multiparty cryptographic protocols
- Session-key generation using human passwords only
- Theory of Cryptography
Cited in
(33)- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On complete primitives for fairness
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1759773 (Why is no real title available?)
- Partial fairness in secure two-party computation
- Incentive-driven attacker for corrupting two-party protocols
- Game theoretic notions of fairness in multi-party coin toss
- Secure two-party computation with fairness -- a necessary design principle
- Protocols for multiparty coin toss with a dishonest majority
- How fair is your protocol? A utility-based approach to protocol optimality
- An optimally fair coin toss
- Fast optimistically fair cut-and-choose 2PC
- Toward a game theoretic view of secure computation
- Theory of Cryptography
- Complete fairness in secure two-party computation
- An Efficient Protocol for Fair Secure Two-Party Computation
- Legally-Enforceable Fairness in Secure Two-Party Computation
- Optimal fair computation
- Legally enforceable fairness in secure two-party communication
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Financial Cryptography and Data Security
- Fully-secure MPC with minimal trust
- Designing fully secure protocols for secure two-party computation of constant-domain functions
- Complete fairness in secure two-party computation
- Secure multiparty computation with identifiable abort via vindicating release
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- Efficient rational secret sharing in standard communication networks
- Efficiently making secure two-party computation fair
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On the classification of finite Boolean functions up to fairness
This page was built for publication: Partial fairness in secure two-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421046)
