#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2007

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Achour Mostéfaoui, Moumen Hamouma, Michel Raynal
- PODC
- 2014

This paper presents a new round-based asynchronous consensus algorithm that copes with up to t<n/3 Byzantine processes, where n is the total number of processes. In addition of not using signature, not assuming a computationally-limited adversary, while being optimal with respect to the value of t, this algorithm has several noteworthy properties: the… (More)

- Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan
- OPODIS
- 2007

This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assumptions (deterministic solution). In the context of crash failures (at most t processes may crash), the weakest partially synchronous system model assumes at least one correct… (More)

- Achour Mostéfaoui, Moumen Hamouma, Michel Raynal
- J. ACM
- 2015

This article is on broadcast and agreement in asynchronous message-passing systems made up of <i>n</i> processes, and where up to <i>t</i> processes may have a Byzantine Behavior. Its first contribution is a powerful, yet simple, all-to-all broadcast communication abstraction suited to binary values. This abstraction, which copes with up to <i>t</i>… (More)

- Achour Mostéfaoui, Moumen Hamouma, Michel Raynal
- ICDCN
- 2016

<i>k</i>-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of <i>n</i> processes, where up to <i>t</i> may commit failures, let us assume that each process proposes a value. The problem consists in defining an algorithm such that each non-faulty process decides a value, at most <i>k</i> different values are… (More)

- Moumen Hamouma, Achour Mostéfaoui
- 2010 Ninth IEEE International Symposium on…
- 2010

This paper presents a simple protocol that solves the authenticated Byzantine Consensus problem in asynchronous distributed systems. To circumvent the FLP impossibility result in a deterministic way, synchrony assumptions should be added. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior and where… (More)

- Moumen Hamouma
- ArXiv
- 2015

To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated to solve the consensus… (More)

- ‹
- 1
- ›