Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols /

Publication Info: cryptanalysis

Date: received 6 May 2011

Contact author: vajda at hit bme hu

Available format(s): PDF | BibTeX Citation

Version: 20110507:221247 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]