Sciweavers

688 search results - page 28 / 138
» Network Coding Protocols for Secret Key Distribution
Sort
View
157
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 6 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
ICC
2007
IEEE
144views Communications» more  ICC 2007»
15 years 8 months ago
Binary Repetition Codes and SPC Product Codes for Coded and Cooperative Diversity Systems
— A three stage network protocol that can achieve coded and cooperative diversity to improve network coverage is investigated. In Stage 1, a cyclic redundancy check code is used ...
Pavel Loskot, Norman C. Beaulieu
128
Voted
PODC
2004
ACM
15 years 8 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
112
Voted
HOST
2009
IEEE
15 years 9 months ago
Secure IP-Block Distribution for Hardware Devices
—EDA vendors have proposed a standard for the sharing of IP among vendors to be used in the design and development of IP for FPGAs. Although, we do not propose any attacks, we sh...
Jorge Guajardo, Tim Güneysu, Sandeep S. Kumar...
GLOBECOM
2009
IEEE
15 years 9 months ago
Robust Cooperative Relaying in a Wireless LAN: Cross-Layer Design and Performance Analysis
—A key technology in cooperative communications is distributed space-time coding (DSTC) which achieves spatial diversity gain from multiple relays. A novel DSTC, called randomize...
Pei Liu, Chun Nie, Elza Erkip, Shivendra S. Panwar