Related papers: Computational Analysis of Modified Blom's Scheme
A new protocol for quantum key distribution based on entanglement swapping is presented. In this protocol, both certain key and random key can be generated without any loss of security. It is this property differs our protocol from the…
We construct general schemes for multi-partite quantum secret sharing using multi-level systems, and find that the consistent conditions for valid measurements can be summarized in two simple algebraic conditions. The scheme using the very…
We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping…
We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information…
The problem of attacks on new generation network infrastructures is becoming increasingly relevant, given the widening of the attack surface of these networks resulting from the greater number of devices that will access them in the future…
Nowadays security in communication is increasingly important to the network communication because many categories of data are required restriction on authorization of access, modify, delete and insert. Quantum cryptography is one of the…
Secret sharing, in which a dealer wants to split a secret in such a way that any unauthorized subset of parties is unable to reconstruct it, plays a key role in cryptography. The security of quantum protocols for the task is guaranteed by…
We propose a framework for the derivation and evaluation of distributed iterative algorithms for receiver cooperation in interference-limited wireless systems. Our approach views the processing within and collaboration between receivers as…
We discuss a quantum key distribution scheme in which small phase and amplitude modulations of quantum limited, CW light beams carry the key information. We identify universal constraints on the level of shared information between the…
In this paper, we investigate the secure connectivity of wireless sensor networks utilizing the heterogeneous random key predistribution scheme, where each sensor node is classified as class-$i$ with probability $\mu_i$ for $i=1,\ldots,r$…
Despite much research on probabilistic key predistribution schemes for wireless sensor networks over the past decade, few formal analyses exist that define schemes' resilience to node-capture attacks precisely and under realistic…
In this paper, a clustered wireless sensor network is considered that is modeled as a set of coupled Gaussian multiple-access channels. The objective of the network is not to reconstruct individual sensor readings at designated fusion…
Encryption has increasingly been used in all applications for various purposes, but it also brings big challenges to network security. In this paper, we take first steps towards addressing some of these chal- lenges by introducing a novel…
We propose a simple yet efficient scheme for a set of energy-harvesting sensors to establish secure communication with a common destination (a master node). An eavesdropper attempts to decode the data sent from the sensors to their common…
Security proofs of quantum key distribution (QKD) often require post-processing schemes to simplify the data structure, and hence the security proof. We show a generic method to improve resulting secure key rates by partially reversing the…
A novel transmission scheme is introduced for efficient data transmission by conveying additional information bits through jointly changing the index and number of active subcarriers within each orthogonal frequency division multiplexing…
The growing complexity of Internet of Things (IoT) environments, particularly in cross-domain data sharing, presents significant security challenges. Existing data-sharing schemes often rely on computationally expensive cryptographic…
We present a method that uses a Bloom filter transform to preprocess data for machine learning. Each sample is encoded into a compact bit-array representation using hash-based encoding, producing a fixed-length feature space that reduces…
Small cell enchantment is emerging as the key technique for wireless network evolution. One challenging problem for small cell enhancement is how to achieve high data rate with as-low-as-possible control and computation overheads. As a…
A distributed adaptive algorithm to estimate a time-varying signal, measured by a wireless sensor network, is designed and analyzed. One of the major features of the algorithm is that no central coordination among the nodes needs to be…