Pages that link to "Item:Q2894402"
From MaRDI portal
The following pages link to Fair Computation with Rational Players (Q2894402):
Displaying 14 items.
- 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)
- Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
- Game theoretic security of quantum bit commitment (Q2004756) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Server-aided private set intersection based on reputation (Q2293036) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- Fair play for machines (Q3451543) (← links)
- Economically Optimal Variable Tag Length Message Authentication (Q5854434) (← links)
- \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC (Q6581796) (← links)
