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 Theoretic and Quantum Cryptography

隆太郎 松本, Ryutaroh Matsumoto

Published Jan 1, 2011• 0 citations
OpenAlex

Related papers

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

Contemporary Cryptography and Arguments for Classical Cryptography's Endurance alongside the Propitious Quantum Cryptography

R. Sakthi Vignesh, S. Sudharssun, K. J. Jegadish Kumar

Is the newly born quantum cryptography the ultimate solution for information security?A technique needs to be both theoretically strong and practically viable.But quantum cryptography comes to naught in the latter.We present here some of the quantum"s theoretical weaknesses like lack of digital signatures (or any algorithm) along with its many real time implementation problems.We further pursue with the discussion about the potency of classical cryptography and its splendid capabilities in providing security.

International Journal of Computer Applications•Feb 25, 2010•0 citations

Information-Theoretic Cryptography

Ueli M. Maurer

Lecture notes in computer science•Jan 1, 1999•70 citations

Quantum cryptography -- an information theoretic security

Nadeem, Muhammad

Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.

arXiv:1507.07918•Jul 28, 2015•3 citations

Shannon unicity distance, ε -secrecy criterion and Holevo information in quantum cryptography

Igor M. Arbekov, S. N. Molotkov

Abstract In this paper, we consider the relationship between C Shannon’s unicity distance, which is determined by the number of symbols of the encrypted message required to uniquely find the encryption key of the cryptosystem in information-theoretical sense, ε -secrecy criterion in quantum cryptography and Holevo information. A lower bound for the unicity distance for ε -secret keys in quantum cryptography is obtained. The relationship between unicity distance, ε -secrecy criterion in quantum cryptography and Holevo information is demonstrated.

Laser Physics Letters•Dec 21, 2020•0 citations

Information-theoretic cryptography

Ueli M. Maurer

•Jan 1, 1999•0 citations
Is the newly born quantum cryptography the ultimate solution for information security?A technique needs to be both theoretically strong and practically viable.But quantum cryptography comes to naught in the latter.We present here some of the quantum"s theoretical weaknesses like lack of digital signatures (or any algorithm) along with its many real time implementation problems.We further pursue with the discussion about the potency of classical cryptography and its splendid capabilities in providing security.
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure computations and ideal coin tossing in quantum regime leaves an obvious question on the completeness of quantum cryptography. Instead of using wide range of rules and techniques for a variety of cryptographic applications, we demonstrate here a unified structure for quantum cryptography based on quantum non-local correlations. The unified framework achieves same goals in information-theoretic way as classical cryptography does with computational hardness. To cover the broad range of cryptographic applications, we show that the framework (i) assures secrecy by providing encryption completely unintelligible to eavesdroppers, (ii) guarantees that input from distant parties is concealed unless they are willing to reveal, (iii) assures binding, (iv) allows splitting information between several parties securely and more generally, (v) evades both quantum and classical attacks from internal as well as external eavesdropping.
Abstract In this paper, we consider the relationship between C Shannon’s unicity distance, which is determined by the number of symbols of the encrypted message required to uniquely find the encryption key of the cryptosystem in information-theoretical sense, ε -secrecy criterion in quantum cryptography and Holevo information. A lower bound for the unicity distance for ε -secret keys in quantum cryptography is obtained. The relationship between unicity distance, ε -secrecy criterion in quantum cryptography and Holevo information is demonstrated.