31
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

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

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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.

          Related collections

          Most cited references8

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Trading correctness for privacy in unconditional multi-party computation

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality

                Bookmark

                Author and article information

                Journal
                16 May 2018
                Article
                1805.06227
                ae8e53c8-5213-4bb3-8350-37a4a161d5cb

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                cs.CR

                Security & Cryptology
                Security & Cryptology

                Comments

                Comment on this article