No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Secret Key Sharing in Networks Using Classical Cryptography Based Quantum Stratagem Approach
Abstract
The abstract should summarize the contents of the paper and should. A new approach for implementing BB84 protocol is proposed in this paper there by introducing a new technique for secret sharing of key in networks. BB84 protocol has practical weakness like single photon generation, lack of authentication and many real time implementation problems. This paper explains how the drawback of BB84 protocol is eliminated by combining classical cryptography and quantum techniques. The usage of dual channel technique and programmable polarizer are analyzed which ensure the way to remove the practical difficulties of quantum cryptography and their combination result in feasibility of authentication, entanglement and hacker identification there by introducing a novel method for key transmission.
... This scheme could effectively combine quantum keys with existing data encryption algorithms, through quantum encryption, and enhance the security of existing transmission of Internet data in the form of audio, image, video, etc. In this scheme, the BB84 protocol was selected as a test bed for QKD protocols and parameters such as the quantum bit error rate (QBER) [23,24] were used to dynamically adjust the renewal rate of quantum keys. One protocol involved in this scheme SQKR was designed based on a sliding window mechanism, which involves using the sliding window to control the rate of renewal of the quantum key. ...
... Most of the quantum key distribution protocols use the QBER (quantum bit error rate) parameter [24]. The QBER can be described in the following equation: ...
Quantum private communication is a technology for secure communication that uses the laws of quantum mechanics to distribute quantum keys for encryption. Currently it has been widely used in the classical network symmetric cryptography environments. When we perform encrypted transmission of Internet multimedia data by using quantum keys, it is important to make full use of the characteristics of the quantum key in its renewal and consumption management. Researchers have already proposed a number of solutions. In this article, a novel self-adjusting quantum key renewal management scheme is proposed. It uses the detected quantum network status information of the QBER, which is also related to the final quantum key generation rate in the quantum network. A sliding window mechanism is introduced to manage quantum key renewal rate. The quantum key is then used as the secret key for classic encryption algorithms such as AES to encrypt network traffic. A set of experiments were performed in a real QKD environments to show that, compared with current quantum key renewal management schemes, the proposed scheme allows the dynamic management of quantum key renewal rate and it can effectively enhance network security and improve the security of existing Internet multimedia data transmission.
Reverse auction is a revolutionary procurement technology, widely used in enterprises and governments, which can increase purchasing transparency and reduce purchasing costs. In this paper, we combine reverse auction with quantum theory and propose a novel protocol that guarantees security by adopting quantum teleportation, quantum key distribution and so on. This protocol also has the properties of anonymity of supplier, verifiability, disavowal impossibility and traceability, properties that ensure the fairness of transactions. The analysis results show that the protocol is simple, high performing and reliable. We hope that it will be applied in real life.
The study presents the brief review of protocols for quantum cryptography. Main principles of the quantum cryptography protocol development are illustrated by giving the example of BB84 protocol.
A crucial phase in performing the quantum cryptographic protocol is the error-correction phase which commences after the raw bit transmission and consists of publicly disclosing the parity of blocks of bits and discarding bits until almost all errors are removed. We develop a formal mathematical model for analyzing the procedure based on specific assumption about the length of the blocks. We further derive a simple analytical bound which can server as an estimate for the cot of performing the error-correction. At the end, we present a simulation model developed to test the analytical derivations and conclude that there is a very good agreement between the simulations and the bound for moderate error rates.
If a photon of definite polarization encounters an excited atom, there is typically some nonvanishing probability that the atom will emit a second photon by stimulated emission. Such a photon is guaranteed to have the same polarization as the original photon. But is it possible by this or any other process to amplify a quantum state, that is, to produce several copies of a quantum system (the polarized photon in the present case) each having the same state as the original? If it were, the amplifying process could be used to ascertain the exact state of a quantum system: in the case of a photon, one could determine its polarization by first producing a beam of identically polarized copies and then measuring the Stokes parameters1. We show here that the linearity of quantum mechanics forbids such replication and that this conclusion holds for all quantum systems.
Is the newly born quantum cryptography the ultimate solution for information security? A technique needs to be theoretically strong and also 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 resplendent capabilities in providing security.
Part I. Fundamental Concepts: 1. Introduction and overview; 2.
Introduction to quantum mechanics; 3. Introduction to computer science;
Part II. Quantum Computation: 4. Quantum circuits; 5. The quantum
Fourier transform and its application; 6. Quantum search algorithms; 7.
Quantum computers: physical realization; Part III. Quantum Information:
8. Quantum noise and quantum operations; 9. Distance measures for
quantum information; 10. Quantum error-correction; 11. Entropy and
information; 12. Quantum information theory; Appendices; References;
Index.
Protocols for quantum cryptography In: International conference and seminar of young specialists on micro/nanotechnologies and electron devices (EDM)
- Vl Kurochkin
Secure hash standard, draft FIPS PUB 180-2
- Us Nist