Verification of a Quasi certification Protocol over a DHT - Sorbonne Université Access content directly
Conference Papers Year : 2013

Verification of a Quasi certification Protocol over a DHT

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.
No file

Dates and versions

hal-00931415 , version 1 (15-01-2014)

Identifiers

  • HAL Id : hal-00931415 , version 1

Cite

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⟩
150 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More