13214 search results - page 37 / 2643 » Pseudorandomness for network algorithms |
172
Voted
EUROCRYPT
2010
Springer
15 years 9 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
149
Voted
COLT
2010
Springer
15 years 3 months ago
2010
Springer
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
156
Voted
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
As high-speed networks have proliferated across the globe, their topologies have become sparser due to the increased capacity of communication media and cost considerations. Relia...
140
click to vote
KES
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Currently, the major focus on the network security is securing individual components as well as preventing unauthorized access to network service. In this paper, we propo...
140
Voted
IPSN
2004
Springer
15 years 11 months ago
2004
Springer
