Sciweavers

56 search results - page 7 / 12
» Communicating intimacy one bit at a time
Sort
View
CASES
2010
ACM
13 years 5 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman
INFOCOM
2010
IEEE
13 years 5 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
PODC
2009
ACM
14 years 2 months ago
Fast scalable deterministic consensus for crash failures
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
INFOCOM
2002
IEEE
14 years 9 days ago
Exploiting OTDM technology in WDM networks
— Wavelength routed optical networks allow to design a logical topology, comprising lightpaths and routers, which is overlayed on the physical topology, comprising optical fiber...
Marco Mellia, Emilio Leonardi, Marco Feletig, Robe...
CRYPTO
2005
Springer
107views Cryptology» more  CRYPTO 2005»
14 years 27 days ago
A Quantum Cipher with Near Optimal Key-Recycling
Abstract. Assuming an insecure quantum channel and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared ...
Ivan Damgård, Thomas Brochmann Pedersen 0002...