Perfectly secure message transmission

Dolev, Danny; Dwork, Cynthia; Waarts, Orli; Yung, Moti

doi:10.1109/fscs.1990.89522

Cited by 71 publications

(116 citation statements)

References 7 publications

Supporting

Mentioning

116

Contrasting

Order By: Relevance

“…Important work has already been done on that topic (totally independently from QKD networks considerations) [122,123,124,125]. This work strikingly fits with the unconditional security offered by QKD networks, and powerful information-theoretic tools have been developed to guarantee the security of such networks even when some fraction of the network nodes are corrupted.…”

Section: Classical Cryptographic Primitives Built On Top Of Qkd Networkmentioning

confidence: 88%

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

160

105

View full text Add to dashboard Cite

The appealing feature of quantum key distribution (QKD), from a cryptographic viewpoint, is the ability to prove the information-theoretic security (ITS) of the established keys. As a key establishment primitive, QKD however does not provide a standalone security service in its own: the secret keys established by QKD are in general then used by a subsequent cryptographic applications for which the requirements, the context of use and the security properties can vary. It is therefore important, in the perspective of integrating QKD in security infrastructures, to analyze how QKD can be combined with other cryptographic primitives.The purpose of this survey article, which is mostly centered on European research results, is to contribute to such an analysis. We first review and compare the properties of the existing key establishment techniques, QKD being one of them. We then study more specifically two generic scenarios related to the practical use of QKD in cryptographic infrastructures: 1) using QKD as a key renewal technique for a symmetric cipher over a point-to-point link ; 2) using QKD in a network containing many users with the objective of offering any-to-any key establishment service. We discuss the constraints as well as the potential interest of using QKD in these contexts. We finally give an overview of challenges relative to the development of QKD technology that also constitute potential avenues for cryptographic research.

show abstract

Section: Classical Cryptographic Primitives Built On Top Of Qkd Networkmentioning

confidence: 88%

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

160

105

View full text Add to dashboard Cite

show abstract

“…Over the last three decades, active research has been carried out in this area and many interesting and significant results have been obtained dealing with high efficiency, security against general adversaries, security against mixed type of corruptions, long-term security, provable security, etc (see [18,24,9,17,41,20,10,16,42,26,28,32,35,4,6] and their references). However, almost all these solutions are for the synchronous model, where it is assumed that every message in the network is delayed by a given constant.…”

Section: Verifiable Secret Sharing (Vss)mentioning

confidence: 99%

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Patra

Choudhury

Rangan

2010

Progress in Cryptology – AFRICACRYPT 2010

View full text Add to dashboard Cite

Secure Multi-Party Computation (MPC) providing information theoretic security allows a set of n parties to securely compute an agreed function F over a finite field F, even if t parties are under the control of a computationally unbounded active adversary. Asynchronous MPC (AMPC) is an important variant of MPC, which works over an asynchronous network. It is well known that perfect AMPC is possible if and only if n ≥ 4t + 1, while statistical AMPC is possible if and only if n ≥ 3t + 1. In this paper, we study the communication complexity of AMPC protocols (both statistical and perfect) designed with exactly n = 4t + 1 parties. Our major contributions in this paper are as follows:1. Asynchronous Verifiable Secret Sharing (AVSS) is one of the main building blocks for AMPC.In this paper, we design two AVSS protocols with 4t + 1 parties: the first one is statistically secure and has non-optimal resilience, while the second one is perfectly secure and has optimal resilience. Both these schemes achieve a common interesting property, which was not achieved by the previous schemes. Specifically, our AVSS schemes allow to share a secret through a polynomial of degree at most d, where t ≤ d ≤ 2t. In contrast, the existing AVSS schemes can share a secret only through a polynomial of degree at most t. The new property of our AVSS simplifies the degree reduction step for the evaluation of multiplication gates in an AMPC protocol.2. Using our statistical AVSS, we design a statistical AMPC protocol with n = 4t + 1 which communicates O(n 2 ) field elements per multiplication gate. Though this protocol has non-optimal resilience, it significantly improves the communication complexity of the existing statistical AMPC protocols.3. We then present a perfect AMPC protocol with n = 4t + 1 (using our perfect AVSS scheme), which also communicates O(n 2 ) field elements per multiplication gate. This protocol improves on our statistical AMPC protocol as it has optimal resilience. To the best of our knowledge, this is the most communication efficient perfect AMPC protocol in the information theoretic setting. * A preliminary version of this paper appeared in [39].

show abstract

“…In [6], Dolev et al initiate the study of message transmission protocols which provide both perfect secrecy and perfect resiliency by abstracting the network as a collection of n channels (corresponding to vertex-disjoint paths) between two synchronized non-faulty processors S and R. Franklin et al [8] show that the connectivity requirements for Dolev et al's problem stay the same even when privacy is not required and there is a fairly large probability of failure of reliability (this is the general problem of URMT we have described above). Adopting Dolev et al's network abstraction, Ashish et al [4] study several variants of message transmission in asynchronous networks.…”

Section: Related Workmentioning

confidence: 99%

Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission

Mehta

Agrawal

Srinathan

2012

Distributed Computing and Networking

View full text Add to dashboard Cite

Abstract. We consider the distributed setting where a subset of nodes are under the control of a malicious adversary with unbounded computational power. The problem of simulating a directed reliable channel from a sender S to a receiver R in the absence of a true physical point to point channel is fundamental to the area of Distributed Computing and is popularly known as 'Unconditionally Reliable Message Transmission' (URMT). In this work, we distinguish between two variants of URMT -Monte Carlo and Las Vegas. The former allows R to output an incorrect message with negligibly small probability, whereas the latter only allows R to abort the protocol with a small probability, but never to output an incorrect message. We establish a novel hierarchy with respect to the connectivity requirements for URMT protocols to be possible over directed networks, under two extremes w.r.t. timing model: synchronous and asynchronous. We show that the minimum connectivity requirements for the existence of Las Vegas URMT protocols over synchronous networks is same as that of Monte Carlo URMT protocols over asynchronous networks -a surprising equivalence between two very different models. Furthermore, the higher connectivity requirements for Las Vegas URMT over asynchronous networks match exactly with that of zero-error (perfect) protocols over (a)synchronous networks. We also show that for the 'easier' randomized variant (ones having less minimum connectivity requirements than perfect ones) the number of critical edges are higher than that of the perfect protocols, in the worst case. Hence, establishing an interesting interplay for the case of URMT.

show abstract

Perfectly secure message transmission

Cited by 71 publications

References 7 publications

Using quantum key distribution for cryptographic purposes: A survey

Using quantum key distribution for cryptographic purposes: A survey

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience

Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission

Contact Info

Product

Resources

About