Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Efficient Key Exchange for Wireless Multi-hop Networks
 
report

Efficient Key Exchange for Wireless Multi-hop Networks

Safaka, Iris  
•
Czap, Laszlo
•
Argyraki, Katerina  
Show more
2015

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protocol works over arbitrary multi-hop networks, unlike previously proposed protocols that only work when nodes are restricted to be within the same broadcast domain. Multi-hop networks enable to support a wider range of applications; we are inspired in this paper by a traffic-anonymization application. Multi-hop networks are also more interesting technically, as they offer a much richer palette of opportunities for secrecy, that include the inherently noisy nature of wireless, the existence of multiple paths between the network nodes, and interference from concurrent transmissions. We propose a protocol that leverages these opportunities, and show that it can create keys at a rate of tens of Kbps.

  • Files
  • Details
  • Metrics
Type
report
Author(s)
Safaka, Iris  
Czap, Laszlo
Argyraki, Katerina  
Fragouli, Christina  
Date Issued

2015

Written at

EPFL

EPFL units
ARNI  
NAL  
Available on Infoscience
May 13, 2015
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/113907
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés