Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Revisiting Deniability in Quantum Key Exchange: via Covert Communication and Entanglement Distillation

Arash Atashpendar, Guru-Vamsi Policharla, Peter Browne Rønne, Peter Y. A. Ryan

Published Jan 1, 2018• 3 citations
Publisher
DOI
10.1007/978-3-030-03638-6_7

Related papers

On Deniability in Quantum Key Exchange

Donald Beaver

Lecture notes in computer science•Jan 1, 2002•10 citations

Revisiting Deniability in Quantum Key Exchange via Covert Communication and Entanglement Distillation

Arash Atashpendar, Guru-Vamsi Policharla, Peter Browne Rønne +1 more

We revisit the notion of deniability in quantum key exchange (QKE), a topic that remains largely unexplored. In the only work on this subject by Donald Beaver, it is argued that QKE is not necessarily deniable due to an eavesdropping attack that limits key equivocation. We provide more insight into the nature of this attack and how it extends to other constructions such as QKE obtained from uncloneable encryption. We then adopt the framework for quantum authenticated key exchange, developed by Mosca et al., and extend it to introduce the notion of coercer-deniable QKE, formalized in terms of the indistinguishability of real and fake coercer views. Next, we apply results from a recent work by Arrazola and Scarani on covert quantum communication to establish a connection between covert QKE and deniability. We propose DC-QKE, a simple deniable covert QKE protocol, and prove its deniability via a reduction to the security of covert QKE. Finally, we consider how entanglement distillation can be used to enable information-theoretically deniable protocols for QKE and tasks beyond key exchange.

arXiv:1812.02245•Dec 5, 2018•2 citations

Key distillation in quantum cryptography

Boris A. Slutsky

•Nov 1, 1998•0 citations

From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography

Arash Atashpendar

From the output produced by a memoryless deletion channel with a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the uniform prior measures the amount of information about the channel input which is conveyed by the output of length $m$. We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings $\texttt{000}\ldots$, $\texttt{111}\ldots$ and maximized by the alternating strings $\texttt{0101}\ldots$, $\texttt{1010}\ldots$. We present related combinatorial theorems involving binary (sub/super)-sequences and prove the minimal entropy conjecture for single and double deletions using clustering techniques. We then prove the minimization conjecture in the asymptotic limit using results from hidden word statistics by showing how the analytic-combinatorial methods of Flajolet, Szpankowski and Vallée, relying on generating functions, can be applied to resolve the case of fixed output length and $n\rightarrow\infty$. Next, we revisit the notion of deniability in quantum key exchange (QKE). We introduce and formalize the notion of coercer-deniable QKE. We then establish a connection between covert communication and deniability to propose DC-QKE, a simple and provably secure construction for coercer-deniable QKE. We relate deniability to fundamental concepts in quantum information theory and suggest a generic approach based on entanglement distillation for achieving information-theoretic deniability, followed by an analysis of other closely related results such as the relation between the impossibility of unconditionally secure quantum bit commitment and deniability. Finally, we present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.

arXiv:2003.11663•Mar 25, 2020•2 citations

Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic Channels

Shiyuan Wang, Shang-Jen Su, Matthieu R. Bloch

We revisit the problem of entanglement-assisted covert communication over bosonic channels and show that the$\text{benefits}$of entanglement can be achieved with fewer entanglement resources than previously identified. Specifically, we show that$\mathcal{O}(\sqrt{n}\log n)$covert and reliable bits can be exchanged using$\omega(\sqrt{n})\cap o(n)$Two-Mode Squeezed-Vacuum (TMSV) pairs and$\omega(1)\cap o(\sqrt{n})$secret-key bits. The conceptual approach behind the result is to combine 1) soft-covering and secret-key resources as a coordination mechanism and 2) superposition coding in the form of a two-layer On-Off Keying (OOK) and Phase Shift Keying (PSK) to index channel uses in which TMSV pairs are encoded. This approach is related to the idea of quantum trade-off coding, specialized and extended to the covert communication setting. Our technical contribution is to develop one-shot bounds then specialized to bosonic channels.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•11 citations

Secure Communication Through Quantum Channels: A Study of Quantum Cryptography

Seema Ukidve, Ramsagar Yadav, Mukhdeep Singh Manshahia +1 more

Lecture notes in networks and systems•Jan 1, 2023•6 citations
We revisit the notion of deniability in quantum key exchange (QKE), a topic that remains largely unexplored. In the only work on this subject by Donald Beaver, it is argued that QKE is not necessarily deniable due to an eavesdropping attack that limits key equivocation. We provide more insight into the nature of this attack and how it extends to other constructions such as QKE obtained from uncloneable encryption. We then adopt the framework for quantum authenticated key exchange, developed by Mosca et al., and extend it to introduce the notion of coercer-deniable QKE, formalized in terms of the indistinguishability of real and fake coercer views. Next, we apply results from a recent work by Arrazola and Scarani on covert quantum communication to establish a connection between covert QKE and deniability. We propose DC-QKE, a simple deniable covert QKE protocol, and prove its deniability via a reduction to the security of covert QKE. Finally, we consider how entanglement distillation can be used to enable information-theoretically deniable protocols for QKE and tasks beyond key exchange.
From the output produced by a memoryless deletion channel with a uniformly random input of known length nnn, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that of the uniform prior measures the amount of information about the channel input which is conveyed by the output of length mmm. We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings 000…\texttt{000}\ldots000…, 111…\texttt{111}\ldots111… and maximized by the alternating strings 0101…\texttt{0101}\ldots0101…, 1010…\texttt{1010}\ldots1010…. We present related combinatorial theorems involving binary (sub/super)-sequences and prove the minimal entropy conjecture for single and double deletions using clustering techniques. We then prove the minimization conjecture in the asymptotic limit using results from hidden word statistics by showing how the analytic-combinatorial methods of Flajolet, Szpankowski and Vallée, relying on generating functions, can be applied to resolve the case of fixed output length and n→∞n\rightarrow\inftyn→∞. Next, we revisit the notion of deniability in quantum key exchange (QKE). We introduce and formalize the notion of coercer-deniable QKE. We then establish a connection between covert communication and deniability to propose DC-QKE, a simple and provably secure construction for coercer-deniable QKE. We relate deniability to fundamental concepts in quantum information theory and suggest a generic approach based on entanglement distillation for achieving information-theoretic deniability, followed by an analysis of other closely related results such as the relation between the impossibility of unconditionally secure quantum bit commitment and deniability. Finally, we present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.
We revisit the problem of entanglement-assisted covert communication over bosonic channels and show that thebenefits\text{benefits}benefitsof entanglement can be achieved with fewer entanglement resources than previously identified. Specifically, we show thatO(nlog⁡n)\mathcal{O}(\sqrt{n}\log n)O(n​logn)covert and reliable bits can be exchanged usingω(n)∩o(n)\omega(\sqrt{n})\cap o(n)ω(n​)∩o(n)Two-Mode Squeezed-Vacuum (TMSV) pairs andω(1)∩o(n)\omega(1)\cap o(\sqrt{n})ω(1)∩o(n​)secret-key bits. The conceptual approach behind the result is to combine 1) soft-covering and secret-key resources as a coordination mechanism and 2) superposition coding in the form of a two-layer On-Off Keying (OOK) and Phase Shift Keying (PSK) to index channel uses in which TMSV pairs are encoded. This approach is related to the idea of quantum trade-off coding, specialized and extended to the covert communication setting. Our technical contribution is to develop one-shot bounds then specialized to bosonic channels.