Paper 2023/1479
Rational Broadcast Protocols against Timid Adversaries
Abstract
We present a constant-round deterministic broadcast protocol against timid adversaries in the synchronous authenticated setting. A timid adversary is a game-theoretically rational adversary who tries to attack the protocol but prefers the actions to be undetected. Our protocol is secure against such an adversary corrupting t out of n parties for any t < n. The round complexity is 5 for timid adversaries and is at most t + 5 for general malicious adversaries. Our results demonstrate that game-theoretic rationality enables us to circumvent the impossibility of constructing constant-round deterministic broadcast protocols for t = ω(1).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. GameSec 2023
- Keywords
- broadcast protocolgame theorytimid adversary
- Contact author(s)
-
keigo elric yamashita @ gmail com
yasunaga @ c titech ac jp - History
- 2023-09-27: approved
- 2023-09-27: received
- See all versions
- Short URL
- https://ia.cr/2023/1479
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1479,
author = {Keigo Yamashita and Kenji Yasunaga},
title = {Rational Broadcast Protocols against Timid Adversaries},
howpublished = {Cryptology ePrint Archive, Paper 2023/1479},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1479}},
url = {https://eprint.iacr.org/2023/1479}
}
