TY - CONF
TI - Brief Announcement: Reliable Message Transmission under Partial
Knowledge and General Adversaries
AU - Pagourtzis, Aris
AU - Panagiotakos, Giorgos
AU - Sakavalas, Dimitris
PY - 2016
SP - 203-205
PB - ASSOCIATION FOR COMPUTING MACHINERY
T2 - PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED
COMPUTING (PODC'16)
TODO - 10.1145/2933057.2933080
TODO - null
TODO - We address the problem of Reliable Message Transmission (RMT), in the
general adversary model of Hirt and Maurer [2], which subsumes earlier
models such as the global or local threshold adversaries. We employ the
recently introduced Partial Knowledge Model [8], which captures any
case of initial players’ topology knowledge. Our main contribution is
the determination of a necessary and sufficient condition for achieving
RMT in the partial knowledge model with a general adversary. We propose
the RMT-Partial Knowledge Algorithm (RMT-PKA), which solves RMT whenever
this is possible, therefore it is a unique algorithm, as defined in
[10]. To the best of our knowledge, this is the first unique protocol
for RMT against general adversaries in the partial knowledge model.
ER -