440,144 research outputs found
Daylight operation of a free space, entanglement-based quantum key distribution system
Many quantum key distribution (QKD) implementations using a free space
transmission path are restricted to operation at night time in order to
distinguish the signal photons used for a secure key establishment from
background light. Here, we present a lean entanglement-based QKD system
overcoming that imitation. By implementing spectral, spatial and temporal
filtering techniques, we were able to establish a secure key continuously over
several days under varying light and weather conditions.Comment: 13 pages, 6 figure
Denial-of-Service Resistance in Key Establishment
Denial of Service (DoS) attacks are an increasing problem for network connected systems. Key establishment protocols are applications that are particularly vulnerable to DoS attack as they are typically required to perform computationally expensive cryptographic operations in order to authenticate the protocol initiator and to generate the cryptographic keying material that will subsequently be used to secure the communications between initiator and responder. The goal of DoS resistance in key establishment protocols is to ensure that attackers cannot prevent a legitimate initiator and responder deriving cryptographic keys without expending resources beyond a responder-determined threshold. In this work we review the strategies and techniques used to improve resistance to DoS attacks. Three key establishment protocols implementing DoS resistance techniques are critically reviewed and the impact of misapplication of the techniques on DoS resistance is discussed. Recommendations on effectively applying resistance techniques to key establishment protocols are made
Complexity of increasing the secure connectivity in wireless ad hoc networks
We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. This problem can be formulated as the optimal key establishment problem with interference constraints with bi-objectives: (i) maximizing the concurrent key establishment flow, (ii) minimizing the cost. We prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem
Quantum cryptography: a practical information security perspective
Quantum Key Exchange (QKE, also known as Quantum Key Distribution or QKD)
allows communicating parties to securely establish cryptographic keys. It is a
well-established fact that all QKE protocols require that the parties have
access to an authentic channel. Without this authenticated link, QKE is
vulnerable to man-in-the-middle attacks. Overlooking this fact results in
exaggerated claims and/or false expectations about the potential impact of QKE.
In this paper we present a systematic comparison of QKE with traditional key
establishment protocols in realistic secure communication systems.Comment: 5 pages, new title, published version, minor changes onl
(Password) authenticated key establishment: From 2-party to group
Proceedings of: TCC 2007: Fourth IACR Theory of Cryptography Conference, 21-24 February 2007, Amsterdam, The Netherlands.A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment with 2 more rounds of communication. The compiler introduces neither idealizing assumptions nor high-entropy secrets, e.g., for signing. In particular, applying the compiler to a password-authenticated 2-party key establishment without random oracle assumption, yields a password-authenticated group key establishment without random oracle assumption. Our main technical tools are non-interactive and non-malleable commitment schemes that can be implemented in the common reference string (CRS) model.The first author was supported in part by the European Commission through the IST Program under Contract IST-2002-507932 ECRYPT and by France Telecom R&D as part of the contract CIDRE, between France Telecom R&D and École normale supérieure
- …