1058 search results - page 70 / 212 » Secure Group Communications Using Key Graphs |
102
Voted
ARSCOM
2006
15 years 21 days ago
2006
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
107
Voted
ASIACRYPT
2004
Springer
15 years 6 months ago
2004
Springer
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
112
click to vote
PIMRC
2010
IEEE
14 years 10 months ago
2010
IEEE
In this work, we investigate secret key generation from channel states. We point out, by means of a packet-delaybased attack, that observing its own channel states is not the only ...
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
98
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...