Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not hav...
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles ...
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...
Privacy is an important issue in data publishing. Many organizations distribute non-aggregate personal data for research, and they must take steps to ensure that an adversary cann...
Bee-Chung Chen, Raghu Ramakrishnan, Kristen LeFevr...
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...