Pages that link to "Item:Q421046"
From MaRDI portal
The following pages link to Partial fairness in secure two-party computation (Q421046):
Displaying 9 items.
- An optimally fair coin toss (Q315542) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious (Q3179362) (← links)
- Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
