Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2019, Computers, Materials & Continua
To ensure the security during the communication, we often adopt different ways to encrypt the messages to resist various attacks. However, with the computing power improving, the existing encryption and authentication schemes are being faced with big challenges. We take the message authentication as an example into a careful consideration. Then, we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function. Firstly, the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values, which ensures that the initial message can resist eavesdropping attack. Secondly, utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties, such as one-wayness, resisting different collisions and easy implementation. Based on these two points, the message authentication scheme can be much more secure than previous ones. Finally, it is a new way to design the message authentication scheme, which provides a new thought for other researchers in the future. Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.
Physical Review A, 2001
Although key distribution is arguably the most studied context on which to apply quantum cryptographic techniques, message authentication, i.e., certifying the identity of the message originator and the integrity of the message sent, can also benefit from the use of quantum resources. Classically, message authentication can be performed by techniques based on hash functions. However, the security of the resulting protocols depends on the selection of appropriate hash functions, and on the use of long authentication keys. In this paper we propose a quantum authentication procedure that, making use of just one qubit as the authentication key, allows the authentication of binary classical messages in a secure manner.
GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005
When it became known that quantum computers could break the RSA (named for its creators-Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
2017 2nd International Conference on Anti-Cyber Crimes (ICACC)
Internet has become a global means of communication, turned our reality upside down. It has transformed communications, to the level that it is now our chosen standard of communication. Although there are many ways to protect information from undesired access, Quantum cryptography can be used to unconditionally secure data communications by applying the laws of quantum physics which overcomes the drawbacks of traditional classical cryptography, which depends on mathematical methods to limit attacks such as eavesdroppers. Quantum cryptography is considered to be a future replica of classical cryptography. In this survey paper, we will discuss about various protocols of cryptography. Also discussing about their vulnerabilities
Eprint Arxiv 0806 1231, 2008
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.
2015
Quantum cryptography uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages. An important and unique property of quantum cryptography is the ability of the two communicating users to detect the presence of any third party trying to gain knowledge of the key. The security of quantum cryptography relies on the foundations of quantum mechanics, in contrast to traditional public key cryptography which relies on the computational difficulty of certain mathematical functions, and cannot provide any indication of eavesdropping or guarantee of key security. In this paper we are discussing about various protocol introduced, possible attacks on them and prevention of those attacks.
2013
Maths-based cryptography has prevailed for years in the world of information security. Although this approach has succeeded till now, but it still has its drawbacks such as loopholes and life expectancy problem. Researchers found that Quantum Cryptography, which is based on the laws of physics, might be a good alternative. Therefore, we were motivated to analyze a number of research papers in the field. This paper studies both approaches, their advantages, disadvantages, and their expected future.
Quantum cryptography uses quantum mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages. An important and unique property of quantum cryptography is the ability of the two communicating users to detect the presence of any third party trying to gain knowledge of the key. This results from a fundamental part of quantum mechanics: the process of measuring a quantum system in general disturbs the system. A third party trying to eavesdrop on the key must in some way measure it, thus introducing detectable anomalies. By using quantum superposition or quantum entanglement and transmitting information in quantum states, a communication system can be implemented which detects eavesdropping. If the level of eavesdropping is below a certain threshold a key can be produced which is guaranteed as secure, otherwise no secure key is possible and communication is aborted. The security of quantum cryptography relies on the foundations of quantum mechanics, in contrast to traditional public key cryptography which relies on the computational difficulty of certain mathematical functions, and cannot provide any indication of eavesdropping or guarantee of key security.
International Journal of …, 2009
When it became known that quantum computers could break the RSA (named for its creators-Rivest, Shamir, and Adleman) encryption algorithm within a polynomialtime, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.
The University of Edinburgh - Master Dissertation, 2019
One of the fundamental elements of secure communication is authentication of messages, which guarantees that the message has not been modified during the transmission. Since the classical authentication methods cannot authenticate quantum information, some quantum authentication protocols are developed. This project provides a critical review of the three main authentication protocols: purity test-based, Clifford code-based and trap code-based quantum authentication protocols. Their advantages and disadvantages are investigated and spotted. The processes of the protocols are explained stage by stage, using the template from Quantum Protocol Zoo. Further, as the template is written in a generic way and with a language, which can be understood by both computer scientists and physicists, it creates a common language to provide better and easier understanding. Moreover, a comprehensive comparison is made, and this comprehensive comparison allows researchers to evaluate protocol better and decide which protocol is more suitable for a specific system and settings. Since the quantum authentication protocols are not investigated and compared well enough until now, this project could make a major contribution. The project implements and simulates the trap code-based authentication protocol in a quantum internet simulator, called SimulaQron. The simulation is used for examining effects of the error rates, employed error correction code and message length on the robustness of the protocol. As the project provides practical test results, and there are not yet any concrete quantum authentication protocols, which are implemented in a real system, this study can have a significant role in quantum authentication.
2015 Wireless Telecommunications Symposium (WTS), 2015
the reported research in literature for message transformation by a third party does not provide the necessary efficiency and security against different attacks. The data transmitted through the computer network must be confidential and authenticated in advance. In this paper, we develop and improve security of the braided single stage quantum cryptography. This improvement is based on a novel authentication algorithm by using signature verification without using the three stages protocol to share the secret key between the sender and receiver. This approach will work against attacks such as replay and man-in-the-middle by increasing the security as well as the over efficiency, reducing the overhead through using three stages and increasing the speed of the communication between two parties.
International Journal of Advanced Networking and Applications
Present cryptography algorithms are based on mathematical problem such as factoring two large prime numbers and N vs NP problem. But computing power and evolution in mathematics increases day by day so it’s easy to reverse one way function to quickly such as that of factoring large integers. So the solution is to build a cryptosystem which secure our communication even the computing power is to high so we introduce quantum physics in cryptography which lead to evaluation of quantum cryptography. Quantum cryptography one of the emerging topics in field of computer industry. This paper is an attempt to review fundamentals of quantum cryptography and also analyses few application areas of quantum cryptography and it’s limitation.
2017
In recent years Quantum Cryptography gets more attention as well as becomes most promising cryptographic field for faster, effective and more secure communications. Quantum Cryptography is an art of science which overlap quantum properties of light under quantum mechanics on cryptographic task instead of current state of algorithms based on mathematical computing technology. Major algorithms for public key encryption and some digital signature scheme such as RSA, El Gamal cryptosystem, hash function are vulnerable at quantum adversaries. Most of the factoring problem can be broken by Shore's algorithm and quantum computer threatens other hand discrete logarithm problem. Our paper describes why modern cryptography contributes quantum cryptography, security issues and future goals of modern cryptography.
Advances in Intelligent Systems and Computing, 2019
This paper represents the overview of Quantum Cryptography. Cryptography is the art of secrecy and it is the use of quantum mechanical properties to perform cryptographic tasks. It is a way of securing the channel using quantum mechanics properties. There are so many examples of quantum cryptography but the most important example is Quantum Key Distribution, which provides a solution to the breaking of various popular public key encryption and signature schemes (e.g. RSA and ElGamal). This helps to solve the security problems and also makes the communication channel is more secure. There are so many advantages of quantum cryptography, one thing is that the quantum computer gives the quadratic speed up on the general problems and second thing is that the quantum cryptography lies in the fact it allows the completion of various cryptographic tasks. That is proven to be impossible using classical communication.
2008
We propose a quantum-enhanced protocol to authenticate classical messages, with improved security with respect to the classical scheme introduced by Brassard in 1983. In that protocol, the shared key is the seed of a pseudo-random generator (PRG) and a hash function is used to create the authentication tag of a public message. We show that a quantum encoding of secret bits offers more security than the classical XOR function introduced by Brassard. Furthermore, we establish the relationship between the bias of a PRG and the amount of information about the key that the attacker can retrieve from a block of authenticated messages. Finally, we prove that quantum resources can improve both the secrecy of the key generated by the PRG and the secrecy of the tag obtained with a hidden hash function.
Proceedings of the 6th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2011
This article presents proposition of using quantum cryptography protocols in authentication process. Model is based on BB84 protocol. It is certain that protocol needs a little modification but most fundamental features are kept. Article presents an example model of authentication process.
Journal of Discrete Mathematical Sciences and Cryptography, 2019
Quantum Cryptography is revolutionary discovery in the field of network security. Quantum cryptography promises to provide sophisticated functionality for security issues but it also leads to unbelievable increment in computational parallelism which is helpful for potential cryptanalytic attacks. Some of the associated properties of Quantum Key Distribution protocol that provide security that is deficient for the shared key to be transmitted securely. The identity verification process attempts to maximize success in interpreting the EPR protocol for distribution of Quantum.
2012
Now a day’s Security of network transmission became a vital aspect, because the major security risks occur while conducting business on the Net; the following are some of the security risks occur: Unauthorized-Access, Eavesdropping, Password Sniffing, Denial of Service, Data modification, Repudiation. One of the methods to secure the information is Cryptography. It Protects data transmitted over the network lines, is mainly through appropriate Encryption techniques. The subject Cryptography deals with the encryption and decryption procedures. Encryption is the process of scrambling information so that it becomes unintelligible and can be unscrambled only by using keys. Encryption is the achieved using a Symmetric (or) Asymmetric Encryption. In Symmetric Encryption, a single key is used encrypt as well as to decrypt. In Asymmetric Encryption, two keys namely public and private key are used for encryption and decryption. The paper presentation is on the Authenticated Transmission usin...
Information Security Management Handbook, Fifth Edition, Volume 3, 2006
† Potentially solves significant keydistribution and management problems † Offers ahighly secure cryptographysolution † Is not meant to replace, nor will it replace, existing cryptographyt echnologies † Is anew hybrid model that combines quantum cryptographyand traditional encryption to create amuch moresecure system † Although not really readyf or widespread commercial use, is developing very fast.
Dr.Anil Lamba, 2018
Rapid development of supercomputers and the prospect of quantum computers are posing increasingly serious threats to the security of communication. Using the principles of quantum cryptography, quantum communication offers provable security of communication and is a promising solution to counter such threats. Quantum cryptography that does not depend on the computer capacity of the adversary but is absolutely guaranteed by the laws of quantum physics, although it is in an initial stage, it is necessary to motivate the work for research purposes in the academic world, industry and society in general is taken as a solid alternative of security.
Journal of Discrete Mathematical Sciences and Cryptography, 2019
Quantum Cryptography is revolutionary discovery in the field of network security. Quantum cryptography promises to provide sophisticated functionality for security issues but it also leads to unbelievable increment in computational parallelism which is helpful for potential cryptanalytic attacks. Some of the associated properties of Quantum Key Distribution protocol that provide security that is deficient for the shared key to be transmitted securely. The identity verification process attempts to maximize success in interpreting the EPR protocol for distribution of Quantum.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.