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

Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy

Giovanni Di Crescenzo, R. Menendez, Shahab Etemad, J. Jackel

Published Jan 1, 2009• 2 citations
Publisher
DOI
10.1007/978-3-642-03745-0_18

Related papers

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

Cryptanalysis of optical encryption: a heuristic approach

Unnikrishnan Gopinathan, David S. Monaghan, Thomas J. Naughton +1 more

AIP conference proceedings•Jan 1, 2006•0 citations

Foundations of Optical Encryption: A Candidate Short-Key Scheme

Giovanni Di Crescenzo, Ronald C. Menendez, Shahab Etemad

Lecture notes in computer science•Jan 1, 2015•0 citations

Security Formalizations and Their Relationships for Encryption and Key Agreement in Information-Theoretic Cryptography

Mitsugu Iwamoto, Kazuo Ohta, Junji Shikata

This paper analyzes the formalizations of information-theoretic security for the fundamental primitives in cryptography: symmetric-key encryption and key agreement. Revisiting the previous results, we can formalize information-theoretic security using different methods, by extending Shannon's perfect secrecy, by information-theoretic analogues of indistinguishability and semantic security, and by the frameworks for composability of protocols. We show the relationships among the security formalizations and obtain the following results. First, in the case of encryption, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy or a variant of information-theoretic indistinguishability is the strongest notion. Second, in the case of key agreement, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy is the strongest notion. In particular, in both encryption and key agreement, the formalization of composable security is not stronger than any other formalizations. Furthermore, as an application of the relationships in encryption and key agreement, we simultaneously derive a family of lower bounds on the size of secret keys and security quantities required under the above formalizations, which also implies the importance and usefulness of the relationships.

arXiv:1410.1120•IEEE Transactions on Information Theory•Aug 28, 2017•29 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

Optical Encryption for Information Security

吴克难 Wu Kenan, 胡家升 Hu Jiasheng, 乌旭 Wu Xu

Laser & Optoelectronics Progress•Jan 1, 2008•5 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 analyzes the formalizations of information-theoretic security for the fundamental primitives in cryptography: symmetric-key encryption and key agreement. Revisiting the previous results, we can formalize information-theoretic security using different methods, by extending Shannon's perfect secrecy, by information-theoretic analogues of indistinguishability and semantic security, and by the frameworks for composability of protocols. We show the relationships among the security formalizations and obtain the following results. First, in the case of encryption, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy or a variant of information-theoretic indistinguishability is the strongest notion. Second, in the case of key agreement, there are significant gaps among the formalizations, and a certain type of relaxed perfect secrecy is the strongest notion. In particular, in both encryption and key agreement, the formalization of composable security is not stronger than any other formalizations. Furthermore, as an application of the relationships in encryption and key agreement, we simultaneously derive a family of lower bounds on the size of secret keys and security quantities required under the above formalizations, which also implies the importance and usefulness of the relationships.