2996 search results - page 170 / 600 » Numberings and Randomness |
147
Voted
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
143
click to vote
ICDT
1999
ACM
15 years 10 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
157
click to vote
CRYPTO
2006
Springer
15 years 9 months 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...
157
click to vote
STOC
1998
ACM
15 years 9 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
177
Voted
ISCAPDCS
2001
15 years 7 months ago
2001
In this paper we investigate the network performance of TCP hosts and gateways employing New Reno TCP using a parallel simulator. The gateway adopts the random early detection (RE...