Publication

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

Jean-Pierre Hubaux, Srdan Capkun
2003
Conference Papers

Abstract

We investigate secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes. We focus on source routing protocols. We show that to establish secure routes, it is in general not necessary that security associations exist between all pairs of nodes

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

BISS: Building Secure Routing out of an Incomplete Set of Security Associations

Chat with Graph Search

Monostatic Wi-Fi Sensing: Self-Interference Cancellation and Channel Splicing for Robust Vital-Sign Monitoring

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol (Technical Report)

A Measurement-Based Algorithm to Maximize the Utility of Wireless Networks