8810 search results - page 1717 / 1762 » Openness |
RFIDSEC
2010
14 years 10 months ago
2010
Abstract. In this paper, we classify the RFID distance bounding protocols having bitwise fast phases and no final signature. We also give the theoretical security bounds for two s...
118
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
103
click to vote
SCN
2010
Springer
14 years 10 months ago
2010
Springer
Exposure of a secret key is a significant threat in practice. As a notion of security against key exposure, Dodis et al. advocated key-insulated security, and proposed concrete k...
144
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
121
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...