1199 search results - page 165 / 240 » Parameterized Proof Complexity |
CRYPTO
2006
Springer
14 years 18 days ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
EUROCRYPT
1997
Springer
14 years 13 days ago
1997
Springer
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
COLT
2008
Springer
13 years 10 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
FMICS
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior mode...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...