On the Significance of Quiescent Protocols for Asynchronous Perfectly Secure Message Transmission

05/16/2018
by   Anupriya Inumella, et al.
0

We consider the problem of perfect (information-theoretically) secure message transmission (PSMT) from a sender S to a receiver R in asynchronous directed networks tolerating dual adversary. The adversary can control at most t_p nodes in a passive fashion and at most t_f nodes in a fail-stop fashion. We achieve PSMT in this setting with a new class of message transmission protocols called the quiescent protocols. Quiescent protocols ensure that the players eventually stop sending messages but in contrast to the usual terminating protocols, these protocols do not require the players to go into the halt state, from which they cannot take any further action. To show the significance of quiescent protocols, we first identify conditions in which it is impossible for any terminating protocol to achieve PSMT. To circumvent this impossibility, we transform the existing synchronous PSMT protocol into a quiescent protocol which accomplishes PSMT. By focusing on designing quiescent protocols rather than terminating protocols, we show that asynchrony in the network does not demand any extra connectivity over its state-of-the-art synchronous counterpart. This shows that quiescent protocols are befitted to solve PSMT in asynchronous networks with fail-stop faults.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/12/2022

Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries

In this work, we study perfectly-secure multi-party computation (MPC) ag...
research
05/26/2022

Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries

In this paper, we design secure multi-party computation (MPC) protocols ...
research
05/19/2020

Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation

Propelled by the growth of large-scale blockchain deployments, much rece...
research
03/04/2021

Be Prepared When Network Goes Bad: An Asynchronous View-Change Protocol

The popularity of permissioned blockchain systems demands BFT SMR protoc...
research
11/19/2021

Non asymptotic bounds in asynchronous sum-weight gossip protocols

This paper focuses on non-asymptotic diffusion time in asynchronous goss...
research
07/08/2020

Power-saving Asynchronous Quorum-based Protocols for Maximal Neighbour Discovery

The discovery of neighbouring active nodes is one of the most challengin...
research
11/06/2017

Joining Local Knowledge to Communicate Reliably (Extended Abstract)

A fundamental primitive in distributed computing is Reliable Message Tra...

Please sign up or login with your details

Forgot password? Click here to reset