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

arXiv:1801.03656 · Designs Codes and Cryptography

Quantum encryption and generalized Shannon impossibility

Ching–Yi Lai, Kai-Min Chung

Published Jan 2, 2019• 12 citations
arXivHTMLPDF
DOI
10.1007/s10623-018-00597-3

Related papers

General Impossibility of Group Homomorphic Encryption in the Quantum World

Frederik Armknecht, Tommaso Gagliardoni, Stefan Katzenbeisser +1 more

Lecture notes in computer science•Jan 1, 2014•18 citations

Generalized Quantum Shannon Impossibility for Quantum Encryption

Ching–Yi Lai, Kai-Min Chung

The famous Shannon impossibility result says that any encryption scheme with perfect secrecy requires a secret key at least as long as the message. In this paper we prove its quantum analogue with imperfect secrecy and imperfect correctness. We also provide a systematic study of information-theoretically secure quantum encryption with two secrecy definitions.

•Jan 11, 2018•1 citation

Quantum Encryption

Luis Antonio Guisso Lopes luis.guisso

•Jan 17, 2026•0 citations

Quantum encryption design overcomes Shannon's theorem to achieve perfect secrecy with reusable keys

Zixuan Hu, Zhenyu Li

Shannon's perfect-secrecy theorem states that a perfect encryption system that yields zero information to the adversary must be a one-time pad (OTP) with the keys randomly generated and never reused. In this work we design the first encryption method (classical or quantum) that overcomes Shannon's theorem to achieve perfect secrecy with reusable keys. Because the mechanisms used are fundamentally quantum, Shannon's theorem remains true in the classical regime. Consequently, the quantum encryption design demonstrates decisive quantum advantage by achieving a goal impossible for classical systems. Finally, the design has major practical advantages by not requiring authentication and having silent tampering detection.

arXiv:2408.09088•Aug 17, 2024•0 citations

Quantum Cryptography Revisited

Network Security•Aug 1, 2002•1 citation

About encryption and quantum cryptography

Чулкова Галина Меркурьевна

Physics in School•Jan 1, 2021•0 citations
Shannon's perfect-secrecy theorem states that a perfect encryption system that yields zero information to the adversary must be a one-time pad (OTP) with the keys randomly generated and never reused. In this work we design the first encryption method (classical or quantum) that overcomes Shannon's theorem to achieve perfect secrecy with reusable keys. Because the mechanisms used are fundamentally quantum, Shannon's theorem remains true in the classical regime. Consequently, the quantum encryption design demonstrates decisive quantum advantage by achieving a goal impossible for classical systems. Finally, the design has major practical advantages by not requiring authentication and having silent tampering detection.