2237 search results - page 110 / 448 » On the Security of Random Sources |
147
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
132
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
159
click to vote
IACR
2011
14 years 4 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
137
Voted
JSAC
2010
15 years 3 months ago
2010
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
147
click to vote
CHI
2005
ACM
16 years 5 months ago
2005
ACM
Growing threats to online banking security (e.g. phishing, personal identify fraud) and the personal nature of the data make the balance between security, trust and usability vita...