English
Related papers

Related papers: Physical Layer Secret Key Generation in Static Env…

200 papers

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is without limiting the computational power of the eavesdropper. The usual security proofs suppose that the…

Quantum Physics · Physics 2009-11-13 Valerio Scarani , Nicolas Gisin , Nicolas Brunner , Lluis Masanes , Sergi Pino , Antonio Acin

Secret key generation at the physical layer is expected to be a fundamental enabler for next-generation networks. We consider a network where the user equipment is a drone and propose a novel secret key generation solution when the…

Signal Processing · Electrical Eng. & Systems 2025-12-05 Mattia Piana , Stefano Tomasin

We obtain estimates for Eve's forgery probability, namely the probability that she is able to forge a message which Alice or Bob mistakenly accept over a noisy Quantum channel for generating a shared Quantum secret key. This probability is…

Quantum Physics · Physics 2026-03-10 Pete Rigas

We propose a two-way secure-communication protocol in which Alice uses an amplified spontaneous emission source while Bob employs binary phase-shift keying and an optical amplifier. Against an eavesdropper who captures all the light lost in…

Quantum Physics · Physics 2015-10-27 Quntao Zhuang , Zheshen Zhang , Justin Dove , Franco N. C. Wong , Jeffrey H. Shapiro

We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice,…

Information Theory · Computer Science 2025-04-09 Yingxin Zhang , Lin Zhou , Qiaosheng Zhang

Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical…

Quantum Physics · Physics 2007-05-23 Matthias Christandl , Renato Renner , Artur Ekert

We introduce a constructive method to calculate the achievable secret key rate for a generic class of quantum key distribution protocols, when only a finite number n of signals is given. Our approach is applicable to all scenarios in which…

Quantum Physics · Physics 2007-05-23 Tim Meyer , Hermann Kampermann , Matthias Kleinmann , Dagmar Bruss

In this paper, we consider the problem of secret key generation for multiple parties. Multi-user networks usually require a trusted party to efficiently distribute keys to the legitimate users and this process is a weakness against…

Cryptography and Security · Computer Science 2022-08-30 Ufuk Altun , Semiha T. Basaran , Gunes K. Kurt , Enver Ozdemir

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the…

Information Theory · Computer Science 2016-11-15 Tzu-Han Chou , Vincent Y. F. Tan , Stark C. Draper

We present a novel approach to secret key establishment that appears to be resistant to currently known quantum cryptanalytic algorithms. This quantum resistance arises because the security of our method does not rely on the difficulty of…

Information Theory · Computer Science 2024-09-05 Luis Adrián Lizama-Pérez

We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…

Quantum Physics · Physics 2009-11-11 Tobias Moroder , Marcos Curty , Norbert Lütkenhaus

We have developed a method to calculate a secret key rate of a continuous-variable quantum-key-distribution scheme using four coherent states and postselection for a general model of Gaussian attacks. We assume that the transmission line…

Quantum Physics · Physics 2018-10-30 Ryo Namiki , Akira Kitagawa , Takuya Hirano

We study the problem of privacy amplification with an active adversary in the information theoretic setting. In this setting, two parties Alice and Bob start out with a shared $n$-bit weak random string $W$, and try to agree on a secret…

Computational Complexity · Computer Science 2010-11-12 Xin Li

We study and solve the problem of distilling secret key from quantum states representing correlation between two parties (Alice and Bob) and an eavesdropper (Eve) via one-way public discussion: we prove a coding theorem to achieve the…

Quantum Physics · Physics 2007-05-23 Igor Devetak , Andreas Winter

This study investigates secret-key generation for device authentication using physical identifiers, such as responses from physical unclonable functions (PUFs). The system includes two legitimate terminals (encoder and decoder) and an…

Cryptography and Security · Computer Science 2025-11-11 Vamoua Yachongka , Rémi A. Chou

We analyze the performance of continuous-variable quantum key distribution protocols where the entangled source originates not from one of the trusted parties, Alice or Bob, but from the malicious eavesdropper in the middle. This is in…

Quantum Physics · Physics 2013-02-20 Christian Weedbrook

We analyse a central broadcast continuous variable quantum key distribution protocol in which a beam produced by a thermal source is used to create a secret key between two parties, Alice and Bob. A beam splitter divides the initial beam…

Quantum Physics · Physics 2021-10-12 Adam Walton , Anne Ghesquière , George Brumpton , David Jennings , Ben Varcoe

In time entanglement-based quantum key distribution (QKD), Alice and Bob extract the raw key bits from the (identical) arrival times of entangled photon pairs by time-binning. Each of them individually discretizes time into bins and groups…

Information Theory · Computer Science 2023-01-03 Joseph J. Boutros , Emina Soljanin

In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice,…

Cryptography and Security · Computer Science 2013-07-30 Eva C. Song , Paul Cuff , H. Vincent Poor

We consider a group of $m$ trusted and authenticated nodes that aim to create a shared secret key $K$ over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel…

Cryptography and Security · Computer Science 2016-04-11 Mahdi Jafari Siavoshani , Shaunak Mishra , Christina Fragouli , Suhas N. Diggavi