83 search results - page 4 / 17 » Consensus in byzantine asynchronous systems |
STOC
2007
ACM
14 years 7 months ago
2007
ACM
A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs. Wait-free consensus, in which a process always terminates wi...
OPODIS
2007
13 years 9 months ago
2007
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
AC
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is o...
DSN
2006
IEEE
14 years 1 months ago
2006
IEEE
We study consensus in a message-passing system where only some of the Ò¾ links exhibit some synchrony. This problem was previously studied for systems with process crashes; we n...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...