On Unconditionally Secure Robust Distributed Key Distribution Centers

D’Arco, Paolo; Stinson, Douglas R.

doi:10.1007/3-540-36178-2_22

Cited by 23 publications

(40 citation statements)

References 16 publications

Supporting

Mentioning

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: 68%

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

164

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: 68%

Using quantum key distribution for cryptographic purposes: A survey

Alléaume

Branciard

Bouda

et al. 2014

Theoretical Computer Science

164

105

View full text Add to dashboard Cite

show abstract

“…In subsequent papers [3,4,8] the notion of the DKDC has been studied from an information theoretic point of view. Recently in [11,10] a robust verifiable DKDC based on unconditionally secure proactive threshold VSS was proposed.…”

Section: Introductionmentioning

confidence: 99%

“…A generalization of the scheme has subsequently been given in [20]. Recently D'Arco and Stinson [11,10] showed that some existing proactive schemes [20,23] can be broken. They proposed two new variations of the schemes to add proactive security to VSS, based on two different approaches, one using symmetric polynomials and another one using non-symmetric polynomials.…”

Section: Introductionmentioning

confidence: 99%

“…The basic building block will be an unconditionally secure proactive VSS based on a general access structure. We will use the scheme proposed by D'Arco and Stinson [11,10], whose round complexity has been improved by applying the technique described by Gennaro et. al.…”

Section: Introductionmentioning

confidence: 99%

“…We consider a general access structure for the set of servers and for the adversary access structure. We also revise the unconditionally secure Verifiable Secret Sharing Schemes from [11, 10,20,23] proposing a modified version which is proactively secure. …”

mentioning

confidence: 99%

See 2 more Smart Citations

On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

Nikov

Nikova

Preneel

et al. 2002

Progress in Cryptology — INDOCRYPT 2002

View full text Add to dashboard Cite

Changes S. Fehr [14] pointed out that denoting the complement Γ A = ∆ c A [20,13] as honest (or good) players structure appears to be a misleading term. Actually its dual access structure Γ ⊥ A should be called the honest (or good) players structure, since for any set G of good players the complement G c is the set of corrupted players from ∆ A . This reflects in some changes of the notations in Theorem 2 and Theorem 4 from [20] as well as in changes of the notations for good players structure in some protocols.Abstract. A Key Distribution Center of a network is a server enabling private communications within groups of users. A Distributed Key Distribution Center is a set of servers that jointly realizes a Key Distribution Center. In this paper we build a robust Distributed Key Distribution Center Scheme secure against active and mobile adversary. We consider a general access structure for the set of servers and for the adversary access structure. We also revise the unconditionally secure Verifiable Secret Sharing Schemes from [11, 10,20,23] proposing a modified version which is proactively secure.

show abstract

A CRT‐based verifiable secret sharing scheme secure against unbounded adversaries

Ersoy

Pedersen

Kaya

et al. 2016

Security Comm Networks

View full text Add to dashboard Cite

For commitments on secrets, statistical hiding is a must when we are dealing with a long‐term secret or when the secret domain is small enough for a brute‐force attack by a powerful adversary. Unfortunately, all the Chinese Remainder Theorem‐based verifiable secret sharing schemes in the literature are either insecure or suffer from the vulnerability of computationally hiding commitments. To the best of our knowledge, there exist five such studies where two of them were already proven to be insecure. In this work, we first show that two of the remaining schemes are also insecure, that is, the schemes reveal information on the secret even when the adversary is passive. In addition, the remaining one is only secure against a computationally bounded adversary which can be a problem for secret sharing schemes requiring long‐term secret obscurity or using small secret domain. We propose a modification for the latter scheme and prove that the modified scheme is a secure verifiable secret sharing scheme against an unbounded adversary. Lastly, as an application, we show how to use the new scheme for joint random secret sharing and analyze the practicality and efficiency of the proposed schemes. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

On Unconditionally Secure Robust Distributed Key Distribution Centers

Cited by 23 publications

References 16 publications

Using quantum key distribution for cryptographic purposes: A survey

Using quantum key distribution for cryptographic purposes: A survey

On Distributed Key Distribution Centers and Unconditionally Secure Proactive Verifiable Secret Sharing Schemes Based on General Access Structure

A CRT‐based verifiable secret sharing scheme secure against unbounded adversaries

Contact Info

Product

Resources

About