Skip to Main content Skip to Navigation
Conference papers

Verification of a Quasi certification Protocol over a DHT

Fabrice Kordon 1 Xavier Bonnaire 2 Rudyar Cortes 2 Olivier Marin 3 
1 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
3 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : Building a certification authority that is both decentralized and fully reliable is impossible. However, the limitation thus imposed on scalability is unacceptable for many types of information systems, such as e-government services. We propose a solution to build an highly reliable certification authority, based on a distributed hash table and a dedicated protocol ensuring a very low probability of arbitrary failure. Thus, in practice, false positives should never occur. This talk briefly presents the protocol and shows its verification in two steps: (1) a formal model to assess that the protocol behaves as expected in an "ideal world" where communications are reliable, and, (2) a probabilistic analysis to evaluate the probability of failure of the certification.
Document type :
Conference papers
Complete list of metadata
Contributor : Olivier Marin Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 12:45:15 PM
Last modification on : Friday, January 21, 2022 - 3:17:41 AM


  • HAL Id : hal-00931415, version 1


Fabrice Kordon, Xavier Bonnaire, Rudyar Cortes, Olivier Marin. Verification of a Quasi certification Protocol over a DHT. Dagstuhl Seminar "Formal Verification of Distributed Algorithms", Apr 2013, Dagstuhl, Germany. ⟨hal-00931415⟩



Record views