Resource-based corruptions and the combinatorics of hidden diversity
Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti M. Yung · 2013
In the setting of cryptographic protocols, the corruption of a party has traditionally been viewed as a simple, uniform and atomic operation, where the adversary decides to get control over a party and this party immediately gets corrupted. In this paper, motivated by the fact that different players may require different resources to get corrupted, we put forth the notion of resource-based corruptions, where the adversary must invest some resources in order to corrupt a player.