517 search results - page 86 / 104 » Bit Encryption Is Complete |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
CCA
2009
Springer
14 years 2 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
ACSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...