21520 search results - page 11 / 4304 » Symmetric network computation |
116
click to vote
ICPPW
2003
IEEE
15 years 8 months ago
2003
IEEE
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
139
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
119
click to vote
ICA3PP
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scal...
136
click to vote
DCC
2010
IEEE
15 years 3 months ago
2010
IEEE
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this level of anonymity. A new schem...
126
Voted
MOBISYS
2008
ACM
16 years 2 months ago
2008
ACM
We present the design and evaluation of an 802.11-like wireless link layer protocol that obfuscates all transmitted bits to increase privacy. This includes explicit identifiers su...