193 search results - page 13 / 39 » Key Derivation for Squared-Friendly Applications: Lower Boun... |
109
click to vote
WDAG
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
IACR
2011
13 years 9 months ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
81
Voted
PERVASIVE
2008
Springer
14 years 9 months ago
2008
Springer
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Relative neighborhood graph (RNG) has been widely used in topology control and geographic routing in wireless ad hoc networks. Its maximum edge length is the minimum requiremen...
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...