Fair Computation with Rational Players
From MaRDI portal
Publication:2894402
DOI10.1007/978-3-642-29011-4_7zbMath1290.94150OpenAlexW2111556950MaRDI QIDQ2894402
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_7
Applications of game theory (91A80) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (12)
Incentive-driven attacker for corrupting two-party protocols ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ Toward a game theoretic view of secure computation ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ Game theoretic security of quantum bit commitment ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Server-aided private set intersection based on reputation ⋮ Economically Optimal Variable Tag Length Message Authentication
This page was built for publication: Fair Computation with Rational Players
