Securing ad hoc storage through probabilistic cooperation assessment

Oualha, Nouha;Roudier, Yves
WCAN 2007, 3rd Workshop on Cryptography for Ad hoc Networks, July 8th, 2007, Wroclaw, Poland / Also published in Electronic Notes in theoretical computer science, Volume 192, N°2, 26 May 2008

 

 

 

 

 

 

The trend towards self-organization of systems like peer-to-peer or ad hoc networks generates increasing needs for designing distributed storage schemes that should themselves be self-organized and cooperative. Unfortunately, in such systems, the data stored are exposed to new disruption attacks either because of the selfishness of participating nodes with respect to their resources or even because self-organization that leaves such systems much more subject to maliciousness. This setting, combined with the high churnout of nodes and with the high chances of network partition, particularly in mobile ad hoc systems, makes it quite uneasy to ensure the long-term availability of data stored in such fashion. This paper discusses a verification framework based on the probabilistic assessment of small cryptographic verifications in order to assess storage and to prevent data destruction. A protocol for determining the availability of data stored in an ad hoc fashion is detailed. The design of a reputation system based on this protocol and inciting nodes to cooperate towards storage is then discussed.


DOI
Type:
Conference
City:
Wroclaw
Date:
2008-05-26
Department:
Digital Security
Eurecom Ref:
2563
Copyright:
© Elsevier. Personal use of this material is permitted. The definitive version of this paper was published in WCAN 2007, 3rd Workshop on Cryptography for Ad hoc Networks, July 8th, 2007, Wroclaw, Poland / Also published in Electronic Notes in theoretical computer science, Volume 192, N°2, 26 May 2008 and is available at : http://dx.doi.org/10.1016/j.entcs.2008.05.003
See also:

PERMALINK : https://www.eurecom.fr/publication/2563