English
Related papers

Related papers: Shared Secret Key Generation via Carrier Frequency…

200 papers

Cryptanalysis is an important branch in the study of cryptography, including both the classical cryptography and the quantum one. In this paper we analyze the security of two three-party quantum key distribution protocols (QKDPs) proposed…

Quantum Physics · Physics 2011-04-21 Fei Gao , Su-Juan Qin , Fen-Zhuo Guo , Qiao-Yan Wen

We study eavesdropping in quantum key distribution with the six state protocol,when the signal states are mixed with white noise. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her…

Quantum Physics · Physics 2009-06-08 Z. Shadman , H. Kampermann , T. Meyer , D. Bruss

Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…

Quantum Physics · Physics 2007-05-23 Pablo Arrighi

In the Conditional Disclosure of Secrets (CDS) problem, Alice and Bob hold inputs $x\in \mathcal{X}$ and $y\in \mathcal{Y}$ and share a secret. Let $f:\mathcal{X}\times\mathcal{Y}\to\{0,1\}$ be a function such that the secret is revealed to…

Information Theory · Computer Science 2025-12-19 Zhou Li , Siyan Qin , Xiang Zhang , Jihao Fan , Haiqiang Chen , Giuseppe Caire

In quantum key distribution, one conservatively assumes that the eavesdropper Eve is restricted only by physical laws, whereas the legitimate parties, namely the sender Alice and receiver Bob, are subject to realistic constraints, such as…

Quantum Physics · Physics 2018-07-18 Vishal Sharma , U. Shrikant , R. Srikanth , Subhashish Banerjee

Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel. Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure…

Quantum Physics · Physics 2026-02-03 Alex B. Grilo , Giulio Malavolta , Michael Walter , Tianwei Zhang

It is well known that physical-layer Group Secret-Key (GSK) generation techniques allow multiple nodes of a wireless network to synthesize a common secret-key, which can be subsequently used to keep their group messages confidential. As one…

Information Theory · Computer Science 2020-05-06 J. Harshan , Rohit Joshi , Manish Rao

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

We present a scheme for direct and confidential communication between Alice and Bob, where there is no need for establishing a shared secret key first, and where the key used by Alice even will become known publicly. The communication is…

Quantum Physics · Physics 2007-05-23 Almut Beige , Berthold-Georg Englert , Christian Kurtsiefer , Harald Weinfurter

We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key…

Information Theory · Computer Science 2016-11-17 Tzu-Han Chou , Stark C. Draper , Akbar M. Sayeed

As an essential application of quantum mechanics in classical cryptography, quantum secret sharing has become an indispensable component of quantum internet. Recently, a differential phase shift quantum secret sharing protocol using a twin…

Quantum Physics · Physics 2021-07-23 Zhao-Ying Jia , Jie Gu , Bing-Hong Li , Hua-Lei Yin , Zeng-Bing Chen

In continuous-variable quantum key distribution, information reconciliation is required to extract a shared secret key from correlated random variables obtained through the quantum channel. Reverse reconciliation (RR) is generally…

Information Theory · Computer Science 2026-05-13 Marco Origlia , Emanuele Parente , Marco Secondini

Information theoretic secret key agreement is impossible without making initial assumptions. One type of initial assumption is correlated random variables that are generated by using a noisy channel that connects the terminals. Terminals…

Information Theory · Computer Science 2020-08-10 Alireza Poostindouz , Reihaneh Safavi-Naini

This paper demonstrates the vulnerability of the Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchanger to compromised random number generator(s) even if these random numbers are used solely to generate the noises emulating the Johnson…

Cryptography and Security · Computer Science 2021-07-20 Christiana Chamon , Shahriar Ferdous , Laszlo Kish

The goal of any cryptographic system is the exchange of information among the intended users without any leakage of information to others who may have unauthorized access to it. A common secret key could be created over a public channel…

Cryptography and Security · Computer Science 2011-02-03 Sahana S. Bisalapur

This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The…

Information Theory · Computer Science 2008-10-09 Mohamed Abdel Ghany , Ahmed Sultan , Hesham El Gamal

The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…

Information Theory · Computer Science 2013-11-11 Joffrey Villard , Pablo Piantanida

We suggest that the randomness of the choices of measurement basis by Alice and Bob provides an additional important resource for quantum cryptography. As a specific application, we present a novel protocol for quantum key distribution…

Quantum Physics · Physics 2016-08-16 Hannes R. Böhm , Paul S. Böhm , Markus Aspelmeyer , Časlav Brukner , Anton Zeilinger

We consider secure computation of randomized functions between two users, where both the users (Alice and Bob) have inputs, Alice sends a message to Bob over a rate-limited, noise-free link, and then Bob produces the output. We study two…

Information Theory · Computer Science 2017-05-22 Deepesh Data , Vinod M. Prabhakaran

We propose a new adversarial attack on frequency-hopping based wireless communication between two users, namely Alice and Bob. In this attack, the adversary, referred to as Eve, instantaneously modifies the transmitted signal by Alice…

Information Theory · Computer Science 2019-03-28 J. Harshan , Yih-Chun Hu