In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Networked virtual environments (NVE) refer to the category of distributed applications that allow a large number of distributed users to interact with one or more central servers i...