Sommaire

Bibliographie
Rapport final
    +  Introduction
    +  S-TGDH
    +  Réputation

Liste des références de la bibliographie 

[1]

Xiaoyun XUE et Jean Leneutre, DRAFT : ad hoc network security state of the art, 14 avril 2005

[2]

C. Perkins, E. Belding-Royer et S. Das, ad hoc On-Demand Distance Vector (AODV) Routing, juillet 2003

[3]

Seila Nuon, «Analyse de la disponibilité dans les réseaux ad hoc», Rapport de master de recherche, ENST Bretagne, juin 2006

[4]

G. kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J-M. Longitier et J. Irwin, «Aspect-Oriented Programming», European Conference on Object Oriented Programming, 6-13 juin 1997

[5]

Stanislaw Jarecki et Anna Lysyanskaya, «Adaptively secure threshold cryptosystems without erasures», Lecture Notes in Computer Science, vol 1807, 2000, p221

[6]

Frederic Cuppens, Nora Cuppens-Boulahia et Tony Ramard, «Availability Enforcement by Obligations and Aspects Identification», First International Conference on Availability, Reliability and Security (ARES'06), 20 avril 2006, pp. 229-239

[7]

M. Jiang, J. Li et Y. C. Tay, «Cluster Based Routing Protocol (CBRP)», IETF Internet-Draft, août 1999

[8]

Jungmin So et Nitin H. Vaidya, A Distributed Self Stabilizing Time Synchronization Protocol for Multi-hop Wireless Networks, rapport technique, UIUC, janvier 2004

[9]

Jinshan Liu et Valérie Issarny, «Enhanced Reputation Mechanism for Mobile ad hoc Networks», Second International Conference on Trust Management (iTrust'2004), 1 avril 2004

[10]

Mario Gerla, UCLA, Xiaoyan Hong, UCLA et Guangyu Pei, «Fisheye State Routing Protocol (FSR) for ad hoc Networks», IETF Internet- Draft,17 decembre 2001

[11]

IETF Secretariat, Mobile Ad-hoc Networks (manet)

[12]

Carlos H. Rentel et Thomas Kunz, Network Synchronization in Wire- Less ad hoc Networks, Department of Systems and Computer Engineering, Thèse de doctorat, Carleton University, Canada, juillet 2004,

[13]

T. Clausen et P. Jacquet, Optimized Link State Routing Protocol (OLSR), RFC 3626, IETF, Project Hipercom, INRIA, octobre 2003,

[14]

J. Moy, OSPF Version 2, RFC 2328, IETF, avril 1998.

[15]

Frederic Cuppens, Nora Cuppens-Boulahia et Thierry Sans, «Nomad : A Security Model with Non Atomic Actions and Deadlines», CSFW '05 : Proceedings of the 18th IEEE Computer Security Foundations Workshop, 20 juin 2005, pp. 186-196

[16]

Frederic Cuppens, Nora Cuppens-Boulahia et Tony Ramard, «Property Based Intrusion Detection to Secure OLSR», The Third International Conference on Wireless and Mobile Communications (ICWMC 2007), Guadeloupe, French Caribbean, 4-9 mars 2007, GET/ENST Bretagne

[17]

Jean-Pierre Hubaux, Levente Butty et Srdan Capkun, «The Quest for Security in Mobile Ad Hoc Networks», MobiHoc '01 : Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing, 2001, pp. 146-155

[18]

Lin Chen et Jean Leneutre, «Security of Routing Protocols in ad hoc Networks», rapport technique interne, Université de Pierre et Marie Curie, Août 2006,

[19]

Daniele Raffo, Security Schemes for the OLSR Protocol for ad hoc Networks, Thèse de doctorat de l'Université de Paris 6 - Pierre et Marie Curie, 15 Septembre 2005, http ://perso.crans.org/ raffo/papers/phdthesis/thesisap1.html

[20]

Ghassan Oreiby, Spécification et vérification du protocole OLSR, ENST Bretagne et LaBRI, 22 juin 2006

[21]

Adam Stubble field, John Ioannidis et Aviel D. Rubin, «A key recovery attack on the 802.11b wired equivalent privacy protocol (WEP)», ACM Transactions on Information and System Security (TISSEC), Vol 7, num éro 2, Mai 2004, p 319-332

Liste des références du rapport de fin d'étude 

Introduction 

ACJ⁺03

C. Adjih, T. Clausen, P. Jacquet, A. Laouiti, P. Mühlethaler, and D. Raffo, Securing the olsr protocol , med-hoc-net 2003, mahdia, tunisia, June 2003.

aJL00

Stanis aw Jarecki and Anna Lysyanskaya, Adaptively secure threshold cryptography: Introducing concurrency, removing erasures, Lecture Notes in Computer Science 1807 (2000), 221-241.

BB02

Sonja Buchegger and Jean-Yves Le Boudec, Performance analysis of the CONFIDANT protocol: Cooperation of nodes -- fairness in dynamic ad-hoc networks, Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC) (Lausanne, CH), IEEE, June 2002.

CJ03

T. Clausen and P. Jacquet, Optimized link state routing protocol (olsr), 2003.

CL06

Lin Chen and Jean Leneutre, Security of routing protocols in ad hoc networks, Tech. report, Université de Pierre et Marie Curie, August 2006.

EF06

A. Festag E. Fonseca, A survey of existing approaches for secure ad hoc routing and their applicability to vanets, Tech. report, NEC Network Laboratories, March 2006.

GZ06

Manel Guerrero Zapata, Secure ad hoc on-demand distance vector (saodv) routing, September 2006.

HBC

Jean-Pierre Hubaux, Levente Butty, and Srdan Capkun, The quest for security in mobile ad hoc networks.

HJP02

Yih-Chun Hu, David B. Johnson, and Adrian Perrig, Sead: Secure efficient distance vector routing in mobile wireless ad hoc networks, 4th IEEE Workshop on Mobile Computing Systems and Applications, June 2002, pp. 3-13.

JLT99

M. Jiang, J. Li, and Y. C. Tay, Cluster based routing protocol (cbrp), 1999.

LI04

Jinshan Liu and Valérie Issarny, Enhanced reputation mechanism for mobile ad hoc networks., iTrust, 2004, pp. 48-62.

Per97

C. Perkins, Ad-hoc on-demand distance vector routing, 1997.

PGC00

Guangyu Pei, Mario Gerla, and Tsu-Wei Chen, Fisheye state routing in mobile ad hoc networks, ICDCS Workshop on Wireless Networks and Mobile Computing, 2000, pp. D71-D78.

SIR04

A. Stubblefield, J. Ioannidis, and A. Rubin, A key recovery attack on the 802.11b wired equivalent privacy protocol, ACM Trans 7 (2004), no. 2.

S-TGDH - protocoles de gestion de groupes 

[AG00]

N. Asokan and Philip Ginzboorg, Key-agreement in ad-hoc networks, Computer Communications 23 (2000), no. 17, 1627-1637.

[aJL00]

Stanis aw Jarecki and Anna Lysyanskaya, Adaptively secure threshold cryptography: In- troducing concurrency, removing erasures (extended abstract), Lecture Notes in Computer Science 1807 (2000), 221-241.

[AST00]

Giuseppe Ateniese, Michael Steiner, and Gene Tsudik, New multiparty authentication ser- vices and key agreement protocols, IEEE Journal on Selected Areas in Communications 18 (2000), no. 4, 628-639.

[BBB+06]

Elaine Barker, William Barker, William Burr, William Polk, and Miles Smid, FIPS 800-57: Recommendation for key management-part 1: General (revised), NIST, U.S. Department of Commerce, May 2006.

[CeA+03]

T. Clausen, P. Jacquet (editors), C. Adjih, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, and L.Viennot, Optimized link state routing protocol (olsr), RFC 3626, October 2003, Network Working Group.

[HBBC05]

H. Ragab Hassan, A. Bouabdallah, H. Bettahar, and Y. Challal, Hi-kd: Hash-based hierar- chical key distribution for group communication, IEEE INFOCOM '05, 2005.

[HPJ01]

Y. Hu, A. Perrig, and D. Johnson, Packet leashes: A defense against wormhole attacks in wireless ad hoc networks, Tech. report, Department of Computer Science, Rice University, December 2001.

[KPT00]

Yongdae Kim, Adrian Perrig, and Gene Tsudik, Simple and fault-tolerant key agreement for dynamic collaborative groups, CCS '00: Proceedings of the 7th ACM conference on Computer and communications security (New York, NY, USA), ACM Press, 2000, pp. 235-244.

[LI04]

Jinshan Liu and Valérie Issarny, Enhanced reputation mechanism for mobile ad hoc net- works., iTrust, 2004, pp. 48-62.

[Res99]

E. Rescorla, Diffie-hellman key agreement method, RFC 2631, June 1999.

[SB05]

G. Steel and A. Bundy, Attacking group protocols by refuting incorrect inductive conjectures, Journal of Automated Reasoning (2005), 1-28, Special Issue on Automated Reasoning for Security Protocol Analysis.

[SDLBR02]

K. Sanzgiri, B. Dahill, B. Levine, and E. Belding-Royer, A secure routing protocol for ad hoc networks, International Conference on Network Protocols (ICNP), Paris, France, November 2002.

[SM03]

Alan T. Sherman and David A. McGrew, Key establishment in large dynamic groups using one-way function trees, IEEE Transactions on Software Engineering 29 (2003), no. 5, 444- 458.

[TV05]

F. Theoleyre and F. Valois, About the self-stabilization of a virtual topology for self- organization in ad hoc networks, 7th International Symposium on Self-Stabilizing Systems (SSS 2005) (Barcelona, Spain), October 2005. 32

[WGL98]

Chung Kei Wong, Mohamed G. Gouda, and Simon S. Lam, Secure group communications using key graphs, Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, 1998, pp. 68-79.

[Wil01]

Lorraine C. Williams, A discussion of the importance of key length in symmetric and asym- metric cryptography, http://www.giac.org/practical/gsec/Lorraine_Williams_GSEC.pdf, January 2001.

DGRep - mécanisme de réputation 

[ACJ+03]

Cédric Adjih, Thomas Clausen, Philippe Jacquet, Anis Laouiti, Paul Mühlethaler, and Daniele Raffo, Securing the OLSR protocol, Proceedings of the 2nd IFIP Annual Mediterranean Ad Hoc Networking Workshop (Med-Hoc-Net 2003) (Mahdia, Tunisia), June 25-27 2003.

[AW07]

T. Anantyalee and J. Wu, Reputation-based system for encouraging the cooperation of nodes in mobile ad hoc networks, IEEE ICC, 2007, 24-28 June 2007.

[BB02]

Sonja Buchegger and Jean-Yves Le Boudec, Performance analysis of the CONFIDANT proto- col: Cooperation of nodes - fairness in dynamic ad-hoc networks, Proceedings of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC) (Lausanne, CH), IEEE, June 2002.

[BP02]

Sulin Ba and Paul A. Pavlou, Evidence of the effect of trust building technology in electronic markets: Price premiums and buyer behavior, MIS Quarterly 26 (2002), no. 3.

[CFHM06]

Marc Conrad, Tim French, Wei Huang, and Carsten Maple, A lightweight model of trust propagation in a multi-client network environment: To what extent does experience matter?, ARES '06: Proceedings of the First International Conference on Availability, Reliability and Security (ARES'06) (Washington, DC, USA), IEEE Computer Society, 2006, pp. 482-487.

[CNS03]

M. Carbone, M. Nielsen, and V. Sassone, A formal model for trust in dynamic networks, Proceedings of Int. Conf. on Software Engineering and Formal Methods, SEFM 2003 (A. Cerone and P. Lindsay, eds.), IEEE Computer Society, 2003, pp. 54-61.

[FF06]

Emanuel Fonseca and Andreas Festag, A survey of existing approaches for secure ad hoc rout- ing and their applicability to vanets, Tech. report, NEC Deutschland GmbH, NEC Network Laboratories, June 2 2006.

[JML+01]

Philippe Jacquet, Pascale Minet, Anis Laouiti, Laurent Viennot, Thomas Clausen, and Cédric Adjih, Multicast Optimized Link State Routing, November 2001, Internet-Draft, draft-ietf-manet-olsr-molsr-01.txt, work in progress.

[LI04]

Jinshan Liu and Valérie Issarny, Enhanced reputation mechanism for mobile ad hoc networks., iTrust, 2004, pp. 48-62.

[MGLB00]

Sergio Marti, T. J. Giuli, Kevin Lai, and Mary Baker, Mitigating routing misbehavior in mobile ad hoc networks, MobiCom '00: Proceedings of the 6th annual international conference on Mobile computing and networking (New York, NY, USA), ACM Press, 2000, pp. 255-265.

[RP00]

E. Royer and C. Perkins, Multicast ad hoc on- demand distance vector (maodv) routing, 2000, IETF, Intemet Draft.

[Sch95]

Bruce Schneier, Applied cryptography: Protocols, algorithms, and source code in c, 2 ed., Wiley, October 1995.

[Wee01]

Stephen Weeks, Understanding trust management systems, SP '01: Proceedings of the 2001 IEEE Symposium on Security and Privacy (Washington, DC, USA), IEEE Computer Society, 2001, p. 94.