Rational Protocol Design: Cryptography against Incentive-Driven Adversaries
@article{Garay2013RationalPD, title={Rational Protocol Design: Cryptography against Incentive-Driven Adversaries}, author={J. Garay and Jonathan Katz and U. Maurer and Bj{\"o}rn Tackmann and Vassilis Zikas}, journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, year={2013}, pages={648-657} }
Existing work on "rational cryptographic protocols" treats each party (or coalition of parties) running the protocol as a selfish agent trying to maximize its utility. In this work we propose a fundamentally different approach that is better suited to modeling a protocol under attack from an external entity. Specifically, we consider a two-party game between an protocol designer and an external attacker. The goal of the attacker is to break security properties such as correctness or privacy… CONTINUE READING
Topics from this paper
61 Citations
Rational adversary with flexible utility in secure two-party computation
- Computer Science
- J. Ambient Intell. Humaniz. Comput.
- 2019
- 1
Distributed Cryptography Based on the Proofs of Work
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2014
- 23
- PDF
Perfectly Secure Message Transmission Against Rational Timid Adversaries
- Computer Science
- GameSec
- 2018
- 2
Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations
- Computer Science
- CCS
- 2019
- 2
- PDF
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality
- Computer Science
- PODC
- 2015
- 15
- PDF
Perfectly Secure Message Transmission Against Independent Rational Adversaries
- Computer Science
- GameSec
- 2019
- 1
References
SHOWING 1-10 OF 74 REFERENCES
Sequential Rationality in Cryptographic Protocols
- Computer Science, Mathematics
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010
- 22
- PDF
Rationality and Adversarial Behavior in Multi-party Computation
- Computer Science, Mathematics
- CRYPTO
- 2006
- 143
- PDF
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
- Mathematics, Computer Science
- CRYPTO
- 2011
- 45
- PDF
Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Mathematics, Computer Science
- TCC
- 2008
- 184
- PDF
Resource-based corruptions and the combinatorics of hidden diversity
- Computer Science, Mathematics
- ITCS '13
- 2013
- 15
- PDF
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Computer Science
- Journal of Cryptology
- 2009
- 169
- PDF