123 search results - page 23 / 25 » Cryptanalysis of 2R- Schemes |
140
Voted
ASIACRYPT
2001
Springer
15 years 6 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
127
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2k balls of raThis concept for abstract metrics has been proposed as a na...
135
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
120
Voted
IFIP
2003
Springer
15 years 7 months ago
2003
Springer
Sensor networks are being used for implementation of a large number of applications involving distributed and collaborative computation. Extensive research has focused upon design ...