332 search results - page 21 / 67 » An Aristotelian notion of size |
127
click to vote
ASIACRYPT
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. In this work, we take a closer look at anonymity and robustness in encryption schemes. Roughly speaking, an anonymous encryption scheme hides the identity of the secret-k...
122
click to vote
AAAI
1997
15 years 3 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
116
click to vote
AAAI
2008
15 years 4 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
130
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
104
click to vote
EUROCRYPT
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. We construct the first O(1)-size designated confirmer signatures (DCS) with security in the state-of-the-art model of Camenisch and Michels, Eurocrypt 2000, without rando...