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• 14 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

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

Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition.

Mihir Bellare, Adam O’Neill

This paper explains that SS1-secure functional encryption (FE) as defined by Boneh, Sahai and Waters implicitly incorporates security under key-revealing selective opening attacks (SOA-K). This connection helps intuitively explain their impossibility results and also allows us to prove stronger ones. To fill this gap and move us closer to the (laudable) goal of a general and achievable notion of FE security, we seek and provide two “sans SOA-K ” definitions of FE security that we call SS2 and SS3. We prove various possibility results about these definitions. We view our work as a first step towards the challenging goal of a general, meaningful and achievable notion of FE security. 1

•Jan 1, 2012•5 citations

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.
This paper explains that SS1-secure functional encryption (FE) as defined by Boneh, Sahai and Waters implicitly incorporates security under key-revealing selective opening attacks (SOA-K). This connection helps intuitively explain their impossibility results and also allows us to prove stronger ones. To fill this gap and move us closer to the (laudable) goal of a general and achievable notion of FE security, we seek and provide two “sans SOA-K ” definitions of FE security that we call SS2 and SS3. We prove various possibility results about these definitions. We view our work as a first step towards the challenging goal of a general, meaningful and achievable notion of FE security. 1