2996 search results - page 160 / 600 » Numberings and Randomness |
133
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...
155
click to vote
TIT
2011
15 years 14 days ago
2011
—This paper introduces a new method to blindly estimate the transmit power of multiple signal sources in multiantenna fading channels, when the number of sensing devices and the ...
188
click to vote
EUC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor network...
126
click to vote
IJISEC
2002
15 years 5 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
156
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...