Related papers: Key Generation Using External Source Excitation: C…
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…
Quantum key distribution---exchanging a random secret key relying on a quantum mechanical resource---is the core feature of secure quantum networks. Entanglement-based protocols offer additional layers of security and scale favorably with…
Quantum secret sharing (QSS) enables a dealer to securely distribute keys to multiple players. Device-independent (DI) QSS can resist all possible attacks from practical imperfect devices and provide QSS the highest level of security in…
Motivated by the desirability of universal composability, we analyze in terms of L_1 distinguishability the task of secret key generation from a joint random variable. Under this secrecy criterion, using the Renyi entropy of order 1+s for s…
A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive…
We consider the problem of identification and authentication based on secret key generation from some user-generated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as…
Direct-sequence spread spectrum (DSSS) has been recognized as an effective jamming resilient technique. However, the effectiveness of DSSS relies on the use of either pre-shared unique secret keys or a bank of public codes, which can be…
We consider problems of authentication using secret key generation under a privacy constraint on the enrolled source data. An adversary who has access to the stored description and correlated side information tries to deceive the…
The broadcast nature of the wireless medium allows unintended users to eavesdrop the confidential information transmission. In this regard, we investigate the problem of secure communication between a source and a destination via a wireless…
We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission…
We present a mechanism to manifest unobtainable secrets using a nested Shamir secret sharing scheme to create public/private key pairs for elliptic curves. A threshold secret sharing scheme can be used as a decentralised trust mechanism…
The use of multiple source nodes with wireless backhaul is considered for secrecy enhancement through source node selection in future wireless networks. The ergodic secrecy rate (ESR) of {optimal source node selection in the presence of…
Physical layer security (PLS) is superior to classical cryptography techniques due to its notion of perfect secrecy and independence to an eavesdropper's computational power. One form of PLS arises when Alice and Bob (the legitimate users)…
Physical layer key generation from the wireless channel is an emerging area of interest to provide confidentiality and authentication. One of the main challenges in this domain is to increase the length of the secret key while maintaining…
Conventionally, unconditional information security has been studied by quantum cryptography although the assumption of an omnipotent eavesdropper is too strict for some realistic implementations. In this paper, we study the realistic secret…
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing…
Effective Capacity defines the maximum communication rate subject to a specific delay constraint, while effective energy efficiency (EEE) indicates the ratio between effective capacity and power consumption. We analyze the EEE of…
We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…
The security of any cryptosystem relies on the secrecy of the system's secret keys. Yet, recent experimental work demonstrates that tens of thousands of devices on the Internet use RSA and DSA secrets drawn from a small pool of candidate…
We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one,…