(Enter summary)
Abstract: We propose a formal framework for the security analysis of on-demand source routing protocols
for wireless ad hoc networks. Our approach is based on the well-known simulation paradigm
that has been proposed to prove the security of cryptographic protocols. Our main contribution
is the application of the simulation approach in the context of ad hoc routing. This involves a
precise definition of a real-world model, which describes the real operation of the protocol, and
an ideal-world model, ... (Update)
Similar documents based on text: More All
0.4: A Game Based Analysis of the Client Puzzle Approach to.. - Bencsath, Vajda, Buttyan (2003)
(Correct)
0.4: Lightweight Authentication Protocols for Low-Cost RFID Tags - Vajda, Buttyán (2003)
(Correct)
0.4: Protection against DDoS Attacks Based on Traffic Level.. - Bencsath, Vajda (2004)
(Correct)
BibTeX entry: (Update)
L. Buttyan and I. Vajda. Towards provable security for ad hoc routing protocols. In Proceedings of the ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN), October 2004. http://citeseer.ist.psu.edu/buttyan04towards.html More
@misc{ buttyan04towards,
author = "L. Buttyan and I. Vajda",
title = "Towards provable security for ad hoc routing protocols",
text = "L. Buttyan and I. Vajda. Towards provable security for ad hoc routing protocols.
In Proceedings of the ACM Workshop on Security in Ad Hoc and Sensor Networks
(SASN), October 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/buttyan04towards.html" }
Citations (may not include all citations):
723
Dynamic source routing in ad hoc wireless networks
- Johnson, Maltz - 1996
188
Entity authentication and key distribution (context) - Bellare, Rogaway - 1993
164
ACM Transactions on Computer Systems (context) - Burrows, Abadi et al. - 1990
130
Provably secure session key distribution -- the three party ..
- Bellare, Rogaway - 1995
120
A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
120
Secure computation (context) - Micali, Rogaway - 1991
82
On formal models for secure key exchange
- Shoup - 1999
80
Studies in Secure Multiparty Computation and Applications
- Canetti - 1995
79
Secure routing for mobile ad hoc networks
- Papadimitratos, Haas - 2002
78
Foundations of secure interactive computing (context) - Beaver - 1991
76
the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2000
74
A model for asynchronous reactive systems and its applicatio..
- Pfitzmann, Waidner - 2001
47
Efficient authentication and signing of multicast streams ov..
- Perrig, Canetti et al. - 2000
46
Probabilistic polynomial-time equivalence and security analy..
- Lincoln, Mitchell et al. - 1999
45
SEAD: Secure efficient distance-vector routing for mobile wi..
- Hu, Johnson et al. - 2002
[Article contains additional citations not shown here]
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001)
(Correct)
On the Complexity of Matsui's Attack - Junod (2001)
(Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC