Sciweavers

21520 search results - page 11 / 4304
» Symmetric network computation
Sort
View
ICPPW
2003
IEEE
14 years 1 months ago
Perfect Secrecy in Wireless Networks
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 ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
13 years 12 months ago
A coding theorem for distributed computation
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 ...
Sridhar Rajagopalan, Leonard J. Schulman
ICA3PP
2009
Springer
14 years 14 days ago
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation
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...
Yamin Li, Shietung Peng, Wanming Chu
DCC
2010
IEEE
13 years 8 months ago
Anonymity in shared symmetric key primitives
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...
Gregory M. Zaverucha, Douglas R. Stinson
MOBISYS
2008
ACM
14 years 7 months ago
Improving wireless privacy with an identifier-free link layer protocol
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...
Ben Greenstein, Damon McCoy, Jeffrey Pang, Tadayos...