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

Information Conservational Security with "Black Hole" Keypad Compression and Scalable One-Time Pad - A Quantum Intelligence Approach to Pre- and Post-Quantum Cryptography.

Wen-Ran Zhang

Published Jan 1, 2019• 0 citations
OpenAlex

Related papers

Scalable One-Time Pad - From Information Theoretic Security to Information Conservational Security.

Wen-Ran Zhang

•Jan 1, 2018•2 citations

Information Conservational Security with “Black Hole” Keypad Compression and Scalable One-Time Pad—An Analytical Quantum Intelligence Approach to Pre-and Post-Quantum Cryptography

Wen-Ran Zhang

Although it is widely deemed impossible to overcome the information theoretic optimality of the one-time pad (OTP) cipher in pre-and post-quantum cryptography, this work shows that the optimality of information theoretic security (ITS) of OTP is paradoxical from the perspective of information conservational computing and cryptography. To prove this point, ITS of OTP is extended to information conservational security (ICS) of scalable OTP (S-OTP) with percentage-based key extension where total key length can be reduced to a condensed tiny minimum through “black hole” keypad compression coupled with “big bang” data recov-ery. The cost is a limited 25%+ increase in total data length and network traffic; the gain is to makes the transmission of long messages possible without weakening ITS/OTP. It is proven that if ITS/OTP were optimal, ICS/S-OTP would be impossible; on the other hand, if ICS/S-OTP were not information theoretically secure, ITS/OTP would not be secure either. Thus, we have a proof by contradiction on the paradoxical nature of OTP optimality. It is further proven that a summation with percentage distribution is a special case of equilibrium-based bipolar quantum cellular automata. This proof bridges a classical world with a quantum world and makes it possible to combine the advantages of both approaches for pre-and post-quantum cryptography. It is suggested that the findings of this work form an analytical paradigm of quantum intelligence machinery toward perfect information conservational security. Some mysteries in nature and science are identified. In particular, the question is posted: Could modern science have been like a well-founded building with a floor of observable beings and truths but missing its roof for equilibrium, harmony, information conservation, and logically definable causality?.

IEEE Access•Sep 23, 2019•62 citations

Post-Quantum Cryptography - Securing the Future of Cryptographic Systems

Khanim Avsuvarova

•Jan 1, 2025•0 citations

CCA2-Secure Unidirectional Proxy Re-encryption from Cryptographic Group Actions

Hyungrok Jo, Shingo Sato, Junji Shikata

Proxy re-encryption (PRE) allows a semi-trusted party (called a proxy) to transform ciphertexts under one user's public key into ciphertexts under another user's public key, without revealing any information about the underlying messages or the secret keys. On the other hand, post-quantum cryptography (PQC) is one of the most active areas, and in particular, many lattice-based PRE schemes have been proposed so far in the area of PQC. However, there is no post-quantum PRE satisfying security against adaptive chosen ciphertext attacks ( C C A 2 security), while C C A 2 security is one of the most desirable security notions for PRE. In this paper, we propose a group-action-based PRE scheme that achieves C C A 2 security for the first time. We give security proofs for our PRE in the random oracle model (ROM) and the quantum random oracle model (QROM). In particular, we can obtain the CSIDH-instantiation of this PRE scheme as the first post-quantum PRE. Our result contributes to the developments of post-quantum cryptography, and shows further potential of isogeny-based cryptography.

IACR Communications in Cryptology•Aug 3, 2026•0 citations

Quantum Cryptography for Information-Theoretic Security

Barry C. Sanders

NATO science for peace and security series. A, Chemistry and biology•Nov 25, 2011•2 citations

Quantum cryptography (quantum key distribution)

Shinil Cho

Institute of Physics eBooks•Jul 1, 2022•2 citations
Although it is widely deemed impossible to overcome the information theoretic optimality of the one-time pad (OTP) cipher in pre-and post-quantum cryptography, this work shows that the optimality of information theoretic security (ITS) of OTP is paradoxical from the perspective of information conservational computing and cryptography. To prove this point, ITS of OTP is extended to information conservational security (ICS) of scalable OTP (S-OTP) with percentage-based key extension where total key length can be reduced to a condensed tiny minimum through “black hole” keypad compression coupled with “big bang” data recov-ery. The cost is a limited 25%+ increase in total data length and network traffic; the gain is to makes the transmission of long messages possible without weakening ITS/OTP. It is proven that if ITS/OTP were optimal, ICS/S-OTP would be impossible; on the other hand, if ICS/S-OTP were not information theoretically secure, ITS/OTP would not be secure either. Thus, we have a proof by contradiction on the paradoxical nature of OTP optimality. It is further proven that a summation with percentage distribution is a special case of equilibrium-based bipolar quantum cellular automata. This proof bridges a classical world with a quantum world and makes it possible to combine the advantages of both approaches for pre-and post-quantum cryptography. It is suggested that the findings of this work form an analytical paradigm of quantum intelligence machinery toward perfect information conservational security. Some mysteries in nature and science are identified. In particular, the question is posted: Could modern science have been like a well-founded building with a floor of observable beings and truths but missing its roof for equilibrium, harmony, information conservation, and logically definable causality?.
Proxy re-encryption (PRE) allows a semi-trusted party (called a proxy) to transform ciphertexts under one user's public key into ciphertexts under another user's public key, without revealing any information about the underlying messages or the secret keys. On the other hand, post-quantum cryptography (PQC) is one of the most active areas, and in particular, many lattice-based PRE schemes have been proposed so far in the area of PQC. However, there is no post-quantum PRE satisfying security against adaptive chosen ciphertext attacks ( C C A 2 security), while C C A 2 security is one of the most desirable security notions for PRE. In this paper, we propose a group-action-based PRE scheme that achieves C C A 2 security for the first time. We give security proofs for our PRE in the random oracle model (ROM) and the quantum random oracle model (QROM). In particular, we can obtain the CSIDH-instantiation of this PRE scheme as the first post-quantum PRE. Our result contributes to the developments of post-quantum cryptography, and shows further potential of isogeny-based cryptography.