نتایج جستجو برای: random key pre distribution
تعداد نتایج: 1636984 فیلتر نتایج به سال:
abstract the present study deals with a comparison between reactive and pre-emptive focus-on-form in terms of application and efficiency. it was conducted in an intermediate english class in shahroud. 15 male learners participated in this research and their age ranged from 18 to 25. a course book, new interchange 3, and a complementary book were used. every session the learners gave lectures o...
As a countermeasure for eavesdroppers in wireless communications, a secret key agreement scheme using a variable directional antenna called ESPAR antenna was developed. In this scheme, the process of information reconciliation is necessary to correct the discrepancies between the legitimate users’ keys. In this paper, we propose a new information reconciliation protocol using the reliability of...
Cascade is an information reconciliation protocol proposed in the context of secret key agreement in quantum cryptography. This protocol allows removing discrepancies in two partially correlated sequences that belong to distant parties, connected through a public noiseless channel. It is highly interactive, thus requiring a large number of channel communications between the parties to proceed a...
We present a security analysis against collective attacks for a time-energy entanglement-based quantum key distribution protocol, given the practical constraints of single photon detector efficiency, channel loss, and finite-key considerations. We find a positive secure-key capacity when the key length increases beyond 104 for eight-dimensional systems. The minimum key length required is reduce...
We consider quantum key distribution in the device-independent scenario, i.e., where the legitimate parties do not know (or trust) the exact specification of their apparatus. We show how secure key distribution can be realized against the most general attacks by a quantum adversary under the condition that measurements on different subsystems by the honest parties commute.
We present two new schemes that, in the absence of a centralized support, allow a pair of nodes of a mobile ad hoc network to compute a shared key without communicating. Such a service is important to secure routing protocols [1–3]. The schemes are built using the well-known technique of threshold secret sharing and are secure against a collusion of up to a certain number of nodes. We evaluate ...
Wireless sensor networks are used in various applications now-a-days. As they are deployed in open area, there is a need for key management in order to protect the information stored in sensor nodes. To address this problem, we use key pre-distribution scheme. In this paper, we propose a new scheme based on symmetric matrix and maximum rank distance (MRD) codes where the size of the symmetric m...
In this paper, we present three generalized quantum key distribution protocols between two groups, which consist of k and l members respectively. In these protocols two groups retrieve the secure key string, only if all members should cooperate with one another in each group. We show that if there is an eavesdropper between two groups then their cheating or eavesdropping cannot be accomplished.
In a typical optical implementation of the Bennett-Brassard 1984 (so-called BB84) quantum key distribution protocol, the sender uses an active source to produce the required signal states. While active state preparation of BB84 signals is a simple and elegant solution in principle, in practice passive state preparation might be desirable in some scenarios, for instance, in those experimental se...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید