[Resource Topic] 2011/220: Framework for Security Proofs for On-demand Routing Protocols in Multi-Hop Wireless Networks

Welcome to the resource topic for 2011/220

Title:
Framework for Security Proofs for On-demand Routing Protocols in Multi-Hop Wireless Networks

Authors: István Vajda

Abstract:

We present a framework for security proofs for on-demand routing protocols. The framework relies on the composable cryptographic library by Backes, Pfitzmann and Waidner (BPW). The idea is to break down the security requirement against the system (the protocol) into security requirement against the elements of the system, the honest protocol machines in the BPW symbolic model. The practical income of this approach is simplified, structured and cryptographically sound security proof as well as it provides guidelines for designing provably secure protocols.

ePrint: https://eprint.iacr.org/2011/220

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .