Towards a Game Theoretic View of Secure Computation

DOI10.1007/978-3-642-20465-4_24zbMath1290.94143OpenAlexW1496938880MaRDI QIDQ3003396

Ran Canetti, Gilad Asharov, Carmit Hazay

Publication date: 27 May 2011

Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_24

Mathematics Subject Classification ID

Applications of game theory (91A80) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

Incentive-driven attacker for corrupting two-party protocols ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Extending concurrent signature to multiple parties ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ 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 ⋮ Economically Optimal Variable Tag Length Message Authentication

This page was built for publication: Towards a Game Theoretic View of Secure Computation