769 search results - page 61 / 154 » Where Is the Proof |
102
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We give a surprisingly short proof that in any planar arrangement of Ò curves where each pair intersects at most a fixed number (×) of times, the -level has subquadratic (Ç´...
142
click to vote
SP
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper presents a variety of plaintext-recovering attacks against SSH. We implemented a proof of concept of our attacks against OpenSSH, where we can verifiably recover 14 bi...
146
click to vote
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
In trying to provide formal evidence that composition has security increasing properties, we ask if the composition of non-adaptively secure permutation generators necessarily pro...
132
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
133
click to vote
CPC
2006
15 years 5 months ago
2006
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...