Rational Broadcast Protocols against Timid Adversaries

ePrint Report: Rational Broadcast Protocols against Timid Adversaries

Keigo Yamashita, Kenji Yasunaga

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 …

actions adversaries adversary attack broadcast eprint report game protocol protocols report undetected