IACR News item: 19 March 2015
Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
ePrint ReportOur main contributions are: (a) a necessary and sufficient condition for achieving RMT in the partial knowledge model with a general adversary; in order to show sufficiency, we propose a protocol that solves RMT whenever this is possible, therefore the protocol is unique (cf.[14]), and (b) a study of efficiency in the special case of the ad hoc network model; we present a
unique protocol scheme that is fully polynomial for a class of instances, if there exists any fully polynomial protocol for RMT on the decomposition of this class to instances of a certain basic topology.
To obtain our results we employ, among others, an operation on adversary structures, an appropriate notion of separator in unreliable networks, and a self-reducibility property of the RMT problem.
Additional news items may be found on the IACR news page.