87 search results - page 14 / 18 » Random Selection with an Adversarial Majority |
112
click to vote
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
101
click to vote
FOCS
2008
IEEE
15 years 21 days ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
112
click to vote
CCS
2010
ACM
14 years 11 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
100
click to vote
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback ...
ICCV
2005
IEEE
15 years 5 months ago
2005
IEEE
We present a novel categorical object detection scheme that uses only local contour-based features. A two-stage, partially supervised learning architecture is proposed: a rudiment...