You are looking at a specific version 20110507:221247 of this paper. See the latest version.

Paper 2011/220

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

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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. cryptanalysis
Contact author(s)
vajda @ hit bme hu
History
2011-05-07: received
Short URL
https://ia.cr/2011/220
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.