2010 · 63 citations · 21 references
ComputingCommunicationComputer ScienceSecurity ProtocolsWireless CommunicationsWireless SecurityCryptographic Protocol DesignPhysical Layer SecuritySecure Wireless ProtocolsWireless Network SecurityWireless Security ProtocolsCommunications ProtocolsComputational Complexity Of AlgorithmsRetransmission MechanismsSecure Communication LinksSecurity Properties Of ProtocolsSecurity Protocols For Wireless NetworksWireless Communication ChannelsWireless Communication Systems
This paper introduces a set of low-complexity algorithms that when coupled with link layer retransmission mechanisms, strengthen wireless communication security. Our basic idea is to generate a series of secrets from inevitable transmission errors and other random factors in wireless communications. Because these secrets are constantly extracted from the communication process in realtime, we call them dynamic secrets. Dynamic secrets have interesting security properties. They offer a complementary mechanism to existing security protocols. Even if the adversary exploits a vulnerability and steals the underlying system secret, security can be automatically replenished. In many scenarios, it is also possible to bootstrap a secure communication with the dynamic secrets.
21
Universal classes of hash functions
J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 1979 · 2.6K citations
Generalized privacy amplification
C. H. Bennett, Gilles Brassard, Claude Crépeau et al. · IEEE Transactions on Information Theory · 1995 · 1.4K citations
Secrecy Capacity of Wireless Channels
João Barros, Miguel R. D. Rodrigues · 2006 · 846 citations