Adversarial Level Agreements for Two-Party Protocols
Marilyn George, Seny Kamara · Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security · 2022
Adversaries in cryptography have traditionally been modeled as either semi-honest or malicious. Over the years, however, several works have investigated the design of cryptographic protocols against rational adversaries. The most well-known example are covert adversaries in secure computation (Aumann & Lindell, TCC '07) which are adversaries that wish to deviate from the protocol but without being detected. Protocols secure against such covert adversaries guarantee that deviations are detected with probability at least - which is known as the deterrence factor.