### Skapa referens, olika format (klipp och klistra)

**Harvard**

Dolev, S., Liba, O. och Schiller, E. (2012) *Self-Stabilizing Byzantine Resilient Topology Discovery and Message Delivery*. Göteborg : Chalmers University of Technology (Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, nr: ).

** BibTeX **

@techreport{

Dolev2012,

author={Dolev, Shlomi and Liba, Omri and Schiller, Elad Michael},

title={Self-Stabilizing Byzantine Resilient Topology Discovery and Message Delivery},

abstract={Traditional Byzantine resilient algorithms use $2f + 1$ vertex disjoint paths to ensure message delivery in the presence of up to f Byzantine nodes. The question of how these paths are identified is related to the fundamental problem of topology discovery.
Distributed algorithms for topology discovery cope with a never ending task, dealing with frequent changes in the network topology and unpredictable transient faults. Therefore, algorithms for topology discovery should be self-stabilizing to ensure convergence of the topology information following any such unpredictable sequence of events. We present the first such algorithm that can cope with Byzantine nodes. Starting in an arbitrary global state, and in the presence of f Byzantine nodes, each node is eventually aware of all the other non-Byzantine nodes and their connecting communication links.
Using the topology information, nodes can, for example, route messages across the network and deliver messages from one end user to another. We present the first deterministic, cryptographic-assumptions-free, self-stabilizing, Byzantine-resilient algorithms for network topology discovery and end-to-end message delivery. We also consider the task of r-neighborhood discovery for the case in which $r$ and the degree of nodes are bounded by constants. The use of r-neighborhood discovery facilitates polynomial time, communication and space solutions for the above tasks.
The obtained algorithms can be used to authenticate parties, in particular during the establishment of private secrets, thus forming public key schemes that are resistant to man-in-the-middle attacks of the compromised Byzantine nodes. A polynomial and efficient end-to-end algorithm that is based on the established private secrets can be employed in between periodical re-establishments of the secrets.},

publisher={Chalmers University of Technology},

place={Göteborg},

year={2012},

series={Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, no: },

note={23},

}

** RefWorks **

RT Report

SR Electronic

ID 160897

A1 Dolev, Shlomi

A1 Liba, Omri

A1 Schiller, Elad Michael

T1 Self-Stabilizing Byzantine Resilient Topology Discovery and Message Delivery

T2 Technical Report 2012:01, Chalmers University of Technology, 2012. ISSN 1652-926X.

YR 2012

AB Traditional Byzantine resilient algorithms use $2f + 1$ vertex disjoint paths to ensure message delivery in the presence of up to f Byzantine nodes. The question of how these paths are identified is related to the fundamental problem of topology discovery.
Distributed algorithms for topology discovery cope with a never ending task, dealing with frequent changes in the network topology and unpredictable transient faults. Therefore, algorithms for topology discovery should be self-stabilizing to ensure convergence of the topology information following any such unpredictable sequence of events. We present the first such algorithm that can cope with Byzantine nodes. Starting in an arbitrary global state, and in the presence of f Byzantine nodes, each node is eventually aware of all the other non-Byzantine nodes and their connecting communication links.
Using the topology information, nodes can, for example, route messages across the network and deliver messages from one end user to another. We present the first deterministic, cryptographic-assumptions-free, self-stabilizing, Byzantine-resilient algorithms for network topology discovery and end-to-end message delivery. We also consider the task of r-neighborhood discovery for the case in which $r$ and the degree of nodes are bounded by constants. The use of r-neighborhood discovery facilitates polynomial time, communication and space solutions for the above tasks.
The obtained algorithms can be used to authenticate parties, in particular during the establishment of private secrets, thus forming public key schemes that are resistant to man-in-the-middle attacks of the compromised Byzantine nodes. A polynomial and efficient end-to-end algorithm that is based on the established private secrets can be employed in between periodical re-establishments of the secrets.

PB Chalmers University of Technology

T3 Technical report - Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, no:

LA eng

LK http://www.cse.chalmers.se/~elad/reprints/TR201201.pdf

OL 30