Unconditionally secure commitment in position-based quantum cryptography.
Nadeem, Muhammad
2014-10-27
A new commitment scheme based on position-verification and non-local quantum correlations is presented here for the first time in literature. The only credential for unconditional security is the position of committer and non-local correlations generated; neither receiver has any pre-shared data with the committer nor does receiver require trusted and authenticated quantum/classical channels between him and the committer. In the proposed scheme, receiver trusts the commitment only if the scheme itself verifies position of the committer and validates her commitment through non-local quantum correlations in a single round. The position-based commitment scheme bounds committer to reveal valid commitment within allocated time and guarantees that the receiver will not be able to get information about commitment unless committer reveals. The scheme works for the commitment of both bits and qubits and is equally secure against committer/receiver as well as against any third party who may have interests in destroying the commitment. Our proposed scheme is unconditionally secure in general and evades Mayers and Lo-Chau attacks in particular.
Unconditionally secure commitment in position-based quantum cryptography.
Nadeem, Muhammad
2014-01-01
A new commitment scheme based on position-verification and non-local quantum correlations is presented here for the first time in literature. The only credential for unconditional security is the position of committer and non-local correlations generated; neither receiver has any pre-shared data with the committer nor does receiver require trusted and authenticated quantum/classical channels between him and the committer. In the proposed scheme, receiver trusts the commitment only if the scheme itself verifies position of the committer and validates her commitment through non-local quantum correlations in a single round. The position-based commitment scheme bounds committer to reveal valid commitment within allocated time and guarantees that the receiver will not be able to get information about commitment unless committer reveals. The scheme works for the commitment of both bits and qubits and is equally secure against committer/receiver as well as against any third party who may have interests in destroying the commitment. Our proposed scheme is unconditionally secure in general and evades Mayers and Lo-Chau attacks in particular. PMID:25346509
Unconditionally secure commitment in position-based quantum cryptography
Nadeem, Muhammad
2014-01-01
A new commitment scheme based on position-verification and non-local quantum correlations is presented here for the first time in literature. The only credential for unconditional security is the position of committer and non-local correlations generated; neither receiver has any pre-shared data with the committer nor does receiver require trusted and authenticated quantum/classical channels between him and the committer. In the proposed scheme, receiver trusts the commitment only if the scheme itself verifies position of the committer and validates her commitment through non-local quantum correlations in a single round. The position-based commitment scheme bounds committer to reveal valid commitment within allocated time and guarantees that the receiver will not be able to get information about commitment unless committer reveals. The scheme works for the commitment of both bits and qubits and is equally secure against committer/receiver as well as against any third party who may have interests in destroying the commitment. Our proposed scheme is unconditionally secure in general and evades Mayers and Lo-Chau attacks in particular. PMID:25346509
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-15
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
Insecurity of position-based quantum-cryptography protocols against entanglement attacks
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan; Lo, Hoi-Kwong
2011-01-01
Recently, position-based quantum cryptography has been claimed to be unconditionally secure. On the contrary, here we show that the existing proposals for position-based quantum cryptography are, in fact, insecure if entanglement is shared among two adversaries. Specifically, we demonstrate how the adversaries can incorporate ideas of quantum teleportation and quantum secret sharing to compromise the security with certainty. The common flaw to all current protocols is that the Pauli operators always map a codeword to a codeword (up to an irrelevant overall phase). We propose a modified scheme lacking this property in which the same cheating strategy used to undermine the previous protocols can succeed with a rate of at most 85%. We prove the modified protocol is secure when the shared quantum resource between the adversaries is a two- or three-level system.
NASA Astrophysics Data System (ADS)
Fehr, Serge
2010-05-01
Quantum cryptography makes use of the quantum-mechanical behavior of nature for the design and analysis of cryptographic schemes. Optimally (but not always), quantum cryptography allows for the design of cryptographic schemes whose security is guaranteed solely by the laws of nature. This is in sharp contrast to standard cryptographic schemes, which can be broken in principle, i.e., when given sufficient computing power. From a theory point of view, quantum cryptography offers a beautiful interplay between the mathematics of adversarial behavior and quantum information theory. In this review article, we discuss the traditional application of quantum cryptography, quantum key distribution (QKD), from a modern perspective, and we discuss some recent developments in the context of quantum two-party cooperation (2PC). QKD allows two distant parties to communicate in a provably-secure way in the presence of an outside eavesdropper, whereas 2PC is concerned with protecting information against possibly malicious insiders. We show the basic idea of constructing quantum cryptographic schemes, but we also show some connections to quantum information theory as needed for the rigorous security analyses, and we discuss some of the relevant quantum-information-theoretic results.
Threshold quantum cryptography
Tokunaga, Yuuki; Okamoto, Tatsuaki; Imoto, Nobuyuki
2005-01-01
We present the concept of threshold collaborative unitary transformation or threshold quantum cryptography, which is a kind of quantum version of threshold cryptography. Threshold quantum cryptography states that classical shared secrets are distributed to several parties and a subset of them, whose number is greater than a threshold, collaborates to compute a quantum cryptographic function, while keeping each share secretly inside each party. The shared secrets are reusable if no cheating is detected. As a concrete example of this concept, we show a distributed protocol (with threshold) of conjugate coding.
Quantum cryptography in free space.
Jacobs, B C; Franson, J D
1996-11-15
The range of quantum cryptography systems using optical fibers is limited to roughly 30 km because amplifiers cannot be used. A fully operational system for quantum cryptography based on the transmission of single photons in free space under daylight conditions has been demonstrated. The feasibility of a global system for quantum cryptography based on a network of ground stations and satellites is discussed.
Counterfactual quantum cryptography.
Noh, Tae-Gon
2009-12-01
Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.
Counterfactual quantum cryptography.
Noh, Tae-Gon
2009-12-01
Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle. PMID:20366133
QUANTUM CRYPTOGRAPHY: Single Photons.
Benjamin, S
2000-12-22
Quantum cryptography offers the potential of totally secure transfer of information, but as Benjamin discusses in this Perspective, its practical implementation hinges on being able to generate single photons (rather than two or more) at a time. Michler et al. show how this condition can be met in a quantum dot microdisk structure. Single molecules were also recently shown to allow controlled single-photon emission.
Relativistic Quantum Cryptography
NASA Astrophysics Data System (ADS)
Jeffrey, Evan; Kwiat, Paul
2006-03-01
We present results from a relativistic quantum cryptography system which uses photon storage to avoid bit sifting, in principle doubling the useful key rate. Bob stores the photon he receives from Alice in an optical delay line until she sends him the classical basis information, allowing him to measure every photon in the correct basis. Accounting for loss in our 489-ns storage cavity, we achieve a 66% increase in the BB84 key rate. The same system could be used for even greater gains in either the six-state protocol or cryptography using a larger Hilbert space. We show that the security of this protocol is equivalent to standard BB84: assuming the quantum and classical signals are space-like separated, no eavesdropper bound by special relativity can access both simultaneously.
Introduction to optical quantum cryptography
NASA Astrophysics Data System (ADS)
Adamski, Tomasz
2008-01-01
In recent years very fast progress in the domain of Optical Quantum Cryptography is observed both in theoretical and practical aspects. The paper is a short tutorial review of basic concepts of Optical Quantum Cryptography (OQC) and Quantum Key Distribution (QKD).
Single photon quantum cryptography.
Beveratos, Alexios; Brouri, Rosa; Gacoin, Thierry; Villing, André; Poizat, Jean-Philippe; Grangier, Philippe
2002-10-28
We report the full implementation of a quantum cryptography protocol using a stream of single photon pulses generated by a stable and efficient source operating at room temperature. The single photon pulses are emitted on demand by a single nitrogen-vacancy color center in a diamond nanocrystal. The quantum bit error rate is less that 4.6% and the secure bit rate is 7700 bits/s. The overall performances of our system reaches a domain where single photons have a measurable advantage over an equivalent system based on attenuated light pulses.
Quantum cryptography using optical fibers.
Franson, J D; Lives, H
1994-05-10
Quantum cryptography permits the transmission of secret information whose security is guaranteed by the uncertainty principle. An experimental system for quantum crytography is implemented based on the linear polarization of single photons transmitted by an optical fiber. Polarization-preserving optical fiber and a feedback loop are employed to maintain the state of polarization. Error rates of less than 0.5% are obtained.
Multi-user quantum cryptography
NASA Astrophysics Data System (ADS)
Wang, Bing C.; Kumavor, Patrick; Yelin, Susanne F.; Beal, Alan C.
2005-10-01
Quantum cryptography applies the uncertainty principle and the no-cloning theorem of quantum mechanics to provide ultra-secure encryption key distribution between two parties. Present quantum cryptography technologies provide encryption key distribution between two parties. However, practical implementations encryption key distribution schemes require establishing secure quantum communications amongst multiple users. In this talk, we survey some of the state of the art quantum encryption deployment in communication networks. We will also discuss some common topologies that are being considered for multi-user quantum encryption networks. The performance of the multi-user quantum key distribution systems is then compared for four different optical network topologies: the Sagnac-based fiber ring, the wavelength routed, the passive star and the bus network. Their performances are compared and analyzed using quantum bit error rate analysis.
POVM Receivers for Quantum Cryptography
NASA Astrophysics Data System (ADS)
Brandt, H. E.
1997-04-01
Positive operator valued measures (POVMs) are finding increasing use in quantum cryptography.(A. Peres, Quantum Theory: Concepts and Methods, Kluwer Academic Publishers, Boston (1993).) I present quantum circuit analyses of two recently proposed (H. E. Brandt, J. M. Myers, and S. J. Lomonaco Jr., "New Results in Entangled Translucent Eavesdropping in Quantum Cryptography," in Photonic Quantum Computing, S. P. Hotaling and A. R. Pirich, Editors, Proc. SPIE 3076 (1997)) all-optical designs for POVM receivers to be used in conjunction with Bennett's B92 protocol for key distribution based on two photon polarization states. Expectation values for the POVM operators are calculated and shown to be faithfully realized by the POVM detectors.
Relativistic quantum cryptography
Molotkov, S. N.
2011-03-15
A new protocol of quantum key distribution is proposed to transmit keys through free space. Along with quantum-mechanical restrictions on the discernibility of nonorthogonal quantum states, the protocol uses additional restrictions imposed by special relativity theory. Unlike all existing quantum key distribution protocols, this protocol ensures key secrecy for a not strictly one-photon source of quantum states and an arbitrary length of a quantum communication channel.
Quantum cryptography with entangled photons
Jennewein; Simon; Weihs; Weinfurter; Zeilinger
2000-05-15
By realizing a quantum cryptography system based on polarization entangled photon pairs we establish highly secure keys, because a single photon source is approximated and the inherent randomness of quantum measurements is exploited. We implement a novel key distribution scheme using Wigner's inequality to test the security of the quantum channel, and, alternatively, realize a variant of the BB84 protocol. Our system has two completely independent users separated by 360 m, and generates raw keys at rates of 400-800 bits/s with bit error rates around 3%.
Quantum cryptography with entangled photons
Jennewein; Simon; Weihs; Weinfurter; Zeilinger
2000-05-15
By realizing a quantum cryptography system based on polarization entangled photon pairs we establish highly secure keys, because a single photon source is approximated and the inherent randomness of quantum measurements is exploited. We implement a novel key distribution scheme using Wigner's inequality to test the security of the quantum channel, and, alternatively, realize a variant of the BB84 protocol. Our system has two completely independent users separated by 360 m, and generates raw keys at rates of 400-800 bits/s with bit error rates around 3%. PMID:10990782
Quantum cryptography: Security criteria reexamined
Kaszlikowski, Dagomir; Liang, Y.C.; Englert, Berthold-Georg; Gopinathan, Ajay; Kwek, L.C.
2004-09-01
We find that the generally accepted security criteria are flawed for a whole class of protocols for quantum cryptography. This is so because a standard assumption of the security analysis, namely that the so-called square-root measurement is optimal for eavesdropping purposes, is not true in general. There are rather large parameter regimes in which the optimal measurement extracts substantially more information than the square-root measurement.
NASA Astrophysics Data System (ADS)
Salih, Hatim
2016-05-01
The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose a protocol for quantum key distribution (QKD) based on quantum erasure, promising inherent security against detector attacks. We particularly demonstrate its security against a powerful detector-blinding attack.
Secure communications using quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.
1997-08-01
The secure distribution of the secret random bit sequences known as {open_quotes}key{close_quotes} material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is an emerging technology for secure key distribution with single-photon transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal single-photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. In our optical fiber experiment we have performed quantum key distribution over 24-km of underground optical fiber using single-photon interference states, demonstrating that secure, real-time key generation over {open_quotes}open{close_quotes} multi-km node-to-node optical fiber communications links is possible. We have also constructed a quantum key distribution system for free-space, line-of-sight transmission using single-photon polarization states, which is currently undergoing laboratory testing. 7 figs.
Quantum cryptography without switching.
Weedbrook, Christian; Lance, Andrew M; Bowen, Warwick P; Symul, Thomas; Ralph, Timothy C; Lam, Ping Koy
2004-10-22
We propose a new coherent state quantum key distribution protocol that eliminates the need to randomly switch between measurement bases. This protocol provides significantly higher secret key rates with increased bandwidths than previous schemes that only make single quadrature measurements. It also offers the further advantage of simplicity compared to all previous protocols which, to date, have relied on switching.
Cryptography, quantum computation and trapped ions
Hughes, Richard J.
1998-03-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Quantum cryptography over underground optical fibers
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Peterson, C.G.; Simmons, C.
1996-05-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generated shared, secret cryptographic key material using the transmission of quantum states of light whose security is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the key transmissions, nor evade detection, owing to Heisenberg`s uncertainty principle. In this paper the authors describe the theory of quantum cryptography, and the most recent results from their experimental system with which they are generating key material over 14-km of underground optical fiber. These results show that optical-fiber based quantum cryptography could allow secure, real-time key generation over ``open`` multi-km node-to-node optical fiber communications links between secure ``islands.``
Quantum cryptography approaching the classical limit.
Weedbrook, Christian; Pirandola, Stefano; Lloyd, Seth; Ralph, Timothy C
2010-09-10
We consider the security of continuous-variable quantum cryptography as we approach the classical limit, i.e., when the unknown preparation noise at the sender's station becomes significantly noisy or thermal (even by as much as 10(4) times greater than the variance of the vacuum mode). We show that, provided the channel transmission losses do not exceed 50%, the security of quantum cryptography is not dependent on the channel transmission, and is therefore incredibly robust against significant amounts of excess preparation noise. We extend these results to consider for the first time quantum cryptography at wavelengths considerably longer than optical and find that regions of security still exist all the way down to the microwave.
Quantum cryptography approaching the classical limit.
Weedbrook, Christian; Pirandola, Stefano; Lloyd, Seth; Ralph, Timothy C
2010-09-10
We consider the security of continuous-variable quantum cryptography as we approach the classical limit, i.e., when the unknown preparation noise at the sender's station becomes significantly noisy or thermal (even by as much as 10(4) times greater than the variance of the vacuum mode). We show that, provided the channel transmission losses do not exceed 50%, the security of quantum cryptography is not dependent on the channel transmission, and is therefore incredibly robust against significant amounts of excess preparation noise. We extend these results to consider for the first time quantum cryptography at wavelengths considerably longer than optical and find that regions of security still exist all the way down to the microwave. PMID:20867556
Quantum three-pass cryptography protocol
NASA Astrophysics Data System (ADS)
Yang, Li; Wu, Ling-An; Liu, Songhao
2002-09-01
We present a new kind of quantum cryptography protocol based on Shamir's three-pass protocol of classical cryptography, which allows the transmission of qubits directly and secretly via the aid of an unjammable classical channel. In this protocol we implement the encryption and decryption transformations via rotations on the Poincare sphere of the photons polarization parameters. The key technique is that Bob's encryption rotation must be commutative with Alice s decryption rotation; this means that the axes of these two rotations must be parallel. We also present a security analysis of the protocol under a man-in-the-middle attack.
Short Distance Applications of Quantum Cryptography
NASA Astrophysics Data System (ADS)
Huttner, Bruno; Imoto, Nobuyuki; Barnett, Steve M.
We present an identification protocol based on quantum mechanics. The first user, Alice, needs to identify herself in front of a second user, Bob, by means of a password, known only to both. The safety requirement for Alice is that somebody impersonating Bob, who only pretended to know Alice’s password, shall not be able to obtain information on the password from the exchange. This is an example of a potentially practical new application of quantum mechanics to cryptography.
Quantum discord as a resource for quantum cryptography.
Pirandola, Stefano
2014-11-07
Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper.
Quantum discord as a resource for quantum cryptography.
Pirandola, Stefano
2014-01-01
Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper. PMID:25378231
Quantum discord as a resource for quantum cryptography
Pirandola, Stefano
2014-01-01
Quantum discord is the minimal bipartite resource which is needed for a secure quantum key distribution, being a cryptographic primitive equivalent to non-orthogonality. Its role becomes crucial in device-dependent quantum cryptography, where the presence of preparation and detection noise (inaccessible to all parties) may be so strong to prevent the distribution and distillation of entanglement. The necessity of entanglement is re-affirmed in the stronger scenario of device-independent quantum cryptography, where all sources of noise are ascribed to the eavesdropper. PMID:25378231
Quantum Cryptography in Existing Telecommunications Infrastructure
NASA Astrophysics Data System (ADS)
Rogers, Daniel; Bienfang, Joshua; Mink, Alan; Hershman, Barry; Nakassis, Anastase; Tang, Xiao; Ma, Lijun; Su, David; Williams, Carl; Clark, Charles
2006-03-01
Quantum cryptography has shown the potential for ultra-secure communications. However, all systems demonstrated to date operate at speeds that make them impractical for performing continuous one-time-pad encryption of today's broadband communications. By adapting clock and data recovery techniques from modern telecommunications engineering practice, and by designing and implementing expeditious error correction and privacy amplification algorithms, we have demonstrated error-corrected and privacy-amplified key rates up to 1.0 Mbps over a free-space link with a 1.25 Gbps clock. Using new detectors with improved timing resolution, careful wavelength selection and an increased clock speed, we expect to quadruple the transmission rate over a 1.5 km free-space link. We have identified scalable solutions for delivering sustained one-time-pad encryption at 10 Mbps, thus making it possible to integrate quantum cryptography with first-generation Ethernet protocols.
Multiphoton entanglement concentration and quantum cryptography.
Durkin, Gabriel A; Simon, Christoph; Bouwmeester, Dik
2002-05-01
Multiphoton states from parametric down-conversion can be entangled both in polarization and photon number. Maximal high-dimensional entanglement can be concentrated postselectively from these states via photon counting. This makes them natural candidates for quantum key distribution, where the presence of more than one photon per detection interval has up to now been considered undesirable. We propose a simple multiphoton cryptography protocol for the case of low losses.
Spectral coherent-state quantum cryptography.
Cincotti, Gabriella; Spiekman, Leo; Wada, Naoya; Kitayama, Ken-ichi
2008-11-01
A novel implementation of quantum-noise optical cryptography is proposed, which is based on a simplified architecture that allows long-haul, high-speed transmission in a fiber optical network. By using a single multiport encoder/decoder and 16 phase shifters, this new approach can provide the same confidentiality as other implementations of Yuen's encryption protocol, which use a larger number of phase or polarization coherent states. Data confidentiality and error probability for authorized and unauthorized receivers are carefully analyzed.
FREE-SPACE QUANTUM CRYPTOGRAPHY IN DAYLIGHT
Hughes, R.J.; Buttler, W.T.
2000-01-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
Experimental quantum secret sharing and third-man quantum cryptography.
Chen, Yu-Ao; Zhang, An-Ning; Zhao, Zhi; Zhou, Xiao-Qi; Lu, Chao-Yang; Peng, Cheng-Zhi; Yang, Tao; Pan, Jian-Wei
2005-11-11
Quantum secret sharing (QSS) and third-man quantum cryptography (TQC) are essential for advanced quantum communication; however, the low intensity and fragility of the multiphoton entanglement source in previous experiments have made their realization an extreme experimental challenge. Here, we develop and exploit an ultrastable high intensity source of four-photon entanglement to report an experimental realization of QSS and TQC. The technology developed in our experiment will be important for future multiparty quantum communication.
Entanglement-Based Quantum Cryptography and Quantum Communication
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
2007-03-01
Quantum entanglement, to Erwin Schroedinger the essential feature of quantum mechanics, has become a central resource in various quantum communication protocols including quantum cryptography and quantum teleportation. From a fundamental point of view what is exploited in these experiments is the very fact which led Schroedinger to his statement namely that in entangled states joint properties of the entangled systems may be well defined while the individual subsystems may carry no information at all. In entanglement-based quantum cryptography it leads to the most elegant possible solution of the classic key distribution problem. It implies that the key comes into existence at spatially distant location at the same time and does not need to be transported. A number recent developments include for example highly efficient, robust and stable sources of entangled photons with a broad bandwidth of desired features. Also, entanglement-based quantum cryptography is successfully joining other methods in the work towards demonstrating quantum key distribution networks. Along that line recently decoy-state quantum cryptography over a distance of 144 km between two Canary Islands was demonstrated successfully. Such experiments also open up the possibility of quantum communication on a really large scale using LEO satellites. Another important possible future branch of quantum communication involves quantum repeaters in order to cover larger distances with entangled states. Recently the connection of two fully independent lasers in an entanglement swapping experiment did demonstrate that the timing control of such systems on a femtosecond time scale is possible. A related development includes recent demonstrations of all-optical one-way quantum computation schemes with the extremely short cycle time of only 100 nanoseconds.
Limitations on practical quantum cryptography
Brassard; Lutkenhaus; Mor; Sanders
2000-08-01
We provide limits to practical quantum key distribution, taking into account channel losses, a realistic detection process, and imperfections in the "qubits" sent from the sender to the receiver. As we show, even quantum key distribution with perfect qubits might not be achievable over long distances when the other imperfections are taken into account. Furthermore, existing experimental schemes (based on weak pulses) currently do not offer unconditional security for the reported distances and signal strength. Finally we show that parametric down-conversion offers enhanced performance compared to its weak coherent pulse counterpart.
Spectral coherent-state quantum cryptography.
Cincotti, Gabriella; Spiekman, Leo; Wada, Naoya; Kitayama, Ken-ichi
2008-11-01
A novel implementation of quantum-noise optical cryptography is proposed, which is based on a simplified architecture that allows long-haul, high-speed transmission in a fiber optical network. By using a single multiport encoder/decoder and 16 phase shifters, this new approach can provide the same confidentiality as other implementations of Yuen's encryption protocol, which use a larger number of phase or polarization coherent states. Data confidentiality and error probability for authorized and unauthorized receivers are carefully analyzed. PMID:18978887
Enhanced autocompensating quantum cryptography system.
Bethune, Donald S; Navarro, Martha; Risk, William P
2002-03-20
We have improved the hardware and software of our autocompensating system for quantum key distribution by replacing bulk optical components at the end stations with fiber-optic equivalents and implementing software that synchronizes end-station activities, communicates basis choices, corrects errors, and performs privacy amplification over a local area network. The all-fiber-optic arrangement provides stable, efficient, and high-contrast routing of the photons. The low-bit error rate leads to high error-correction efficiency and minimizes data sacrifice during privacy amplification. Characterization measurements made on a number of commercial avalanche photodiodes are presented that highlight the need for improved devices tailored specifically for quantum information applications. A scheme for frequency shifting the photons returning from Alice's station to allow them to be distinguished from backscattered noise photons is also described.
Security of counterfactual quantum cryptography
Yin Zhenqiang; Li Hongwei; Chen Wei; Han Zhengfu; Guo Guangcan
2010-10-15
Recently, a 'counterfactual' quantum-key-distribution scheme was proposed by T.-G. Noh [Phys. Rev. Lett. 103, 230501 (2009)]. In this scheme, two legitimate distant peers may share secret keys even when the information carriers are not traveled in the quantum channel. We find that this protocol is equivalent to an entanglement distillation protocol. According to this equivalence, a strict security proof and the asymptotic key bit rate are both obtained when a perfect single-photon source is applied and a Trojan horse attack can be detected. We also find that the security of this scheme is strongly related to not only the bit error rate but also the yields of photons. And our security proof may shed light on the security of other two-way protocols.
Free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1998-12-31
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approximately}1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined. Possible applications include the rekeying of satellites in low earth orbit.
Twenty Seven Years of Quantum Cryptography!
NASA Astrophysics Data System (ADS)
Hughes, Richard
2011-03-01
One of the fundamental goals of cryptographic research is to minimize the assumptions underlying the protocols that enable secure communications between pairs or groups of users. In 1984, building on earlier research by Stephen Wiesner, Charles Bennett and Gilles Brassard showed how quantum physics could be harnessed to provide information-theoretic security for protocols such as the distribution of cryptographic keys, which enables two parties to secure their conventional communications. Bennett and Brassard and colleagues performed a proof-of-principle quantum key distribution (QKD) experiment with single-photon quantum state transmission over a 32-cm air path in 1991. This seminal experiment led other researchers to explore QKD in optical fibers and over line-of-sight outdoor atmospheric paths (``free-space''), resulting in dramatic increases in range, bit rate and security. These advances have been enabled by improvements in sources and single-photon detectors. Also in 1991 Artur Ekert showed how the security of QKD could be related to quantum entanglement. This insight led to a deeper understanding and proof of QKD security with practical sources and detectors in the presence of transmission loss and channel noise. Today, QKD has been implemented over ranges much greater than 100km in both fiber and free-space, multi-node network testbeds have been demonstrated, and satellite-based QKD is under study in several countries. ``Quantum hacking'' researchers have shown the importance of extending security considerations to the classical devices that produce and detect the photon quantum states. New quantum cryptographic protocols such as secure identification have been proposed, and others such as quantum secret splitting have been demonstrated. It is now possible to envision quantum cryptography providing a more secure alternative to present-day cryptographic methods for many secure communications functions. My talk will survey these remarkable developments.
PREFACE: Quantum Information, Communication, Computation and Cryptography
NASA Astrophysics Data System (ADS)
Benatti, F.; Fannes, M.; Floreanini, R.; Petritis, D.
2007-07-01
The application of quantum mechanics to information related fields such as communication, computation and cryptography is a fast growing line of research that has been witnessing an outburst of theoretical and experimental results, with possible practical applications. On the one hand, quantum cryptography with its impact on secrecy of transmission is having its first important actual implementations; on the other hand, the recent advances in quantum optics, ion trapping, BEC manipulation, spin and quantum dot technologies allow us to put to direct test a great deal of theoretical ideas and results. These achievements have stimulated a reborn interest in various aspects of quantum mechanics, creating a unique interplay between physics, both theoretical and experimental, mathematics, information theory and computer science. In view of all these developments, it appeared timely to organize a meeting where graduate students and young researchers could be exposed to the fundamentals of the theory, while senior experts could exchange their latest results. The activity was structured as a school followed by a workshop, and took place at The Abdus Salam International Center for Theoretical Physics (ICTP) and The International School for Advanced Studies (SISSA) in Trieste, Italy, from 12-23 June 2006. The meeting was part of the activity of the Joint European Master Curriculum Development Programme in Quantum Information, Communication, Cryptography and Computation, involving the Universities of Cergy-Pontoise (France), Chania (Greece), Leuven (Belgium), Rennes1 (France) and Trieste (Italy). This special issue of Journal of Physics A: Mathematical and Theoretical collects 22 contributions from well known experts who took part in the workshop. They summarize the present day status of the research in the manifold aspects of quantum information. The issue is opened by two review articles, the first by G Adesso and F Illuminati discussing entanglement in continuous variable
On the complexity of search for keys in quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.
2016-03-01
The trace distance is used as a security criterion in proofs of security of keys in quantum cryptography. Some authors doubted that this criterion can be reduced to criteria used in classical cryptography. The following question has been answered in this work. Let a quantum cryptography system provide an ɛ-secure key such that ½‖ρ XE - ρ U ⊗ ρ E ‖1 < ɛ, which will be repeatedly used in classical encryption algorithms. To what extent does the ɛ-secure key reduce the number of search steps (guesswork) as compared to the use of ideal keys? A direct relation has been demonstrated between the complexity of the complete consideration of keys, which is one of the main security criteria in classical systems, and the trace distance used in quantum cryptography. Bounds for the minimum and maximum numbers of search steps for the determination of the actual key have been presented.
Proposal for founding mistrustful quantum cryptography on coin tossing
Kent, Adrian
2003-07-01
A significant branch of classical cryptography deals with the problems which arise when mistrustful parties need to generate, process, or exchange information. As Kilian showed a while ago, mistrustful classical cryptography can be founded on a single protocol, oblivious transfer, from which general secure multiparty computations can be built. The scope of mistrustful quantum cryptography is limited by no-go theorems, which rule out, inter alia, unconditionally secure quantum protocols for oblivious transfer or general secure two-party computations. These theorems apply even to protocols which take relativistic signaling constraints into account. The best that can be hoped for, in general, are quantum protocols which are computationally secure against quantum attack. Here a method is described for building a classically certified bit commitment, and hence every other mistrustful cryptographic task, from a secure coin-tossing protocol. No security proof is attempted, but reasons are sketched why these protocols might resist quantum computational attack.
Optimal eavesdropping in cryptography with three-dimensional quantum states.
Bruss, D; Macchiavello, C
2002-03-25
We study optimal eavesdropping in quantum cryptography with three-dimensional systems, and show that this scheme is more secure against symmetric attacks than protocols using two-dimensional states. We generalize the according eavesdropping transformation to arbitrary dimensions, and discuss the connection with optimal quantum cloning.
Phase-modulation transmission system for quantum cryptography.
Mérolla, J M; Mazurenko, Y; Goedgebuer, J P; Porte, H; Rhodes, W T
1999-01-15
We describe a new method for quantum key distribution that utilizes phase modulation of sidebands of modulation by use of integrated electro-optic modulators at the transmitting and receiving modules. The system is shown to produce constructive or destructive interference with unity visibility, which should allow quantum cryptography to be carried out with high flexibility by use of conventional devices.
Postselection technique for quantum channels with applications to quantum cryptography.
Christandl, Matthias; König, Robert; Renner, Renato
2009-01-16
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained with help of the exponential de Finetti theorem.
Postselection technique for quantum channels with applications to quantum cryptography.
Christandl, Matthias; König, Robert; Renner, Renato
2009-01-16
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained with help of the exponential de Finetti theorem. PMID:19257257
Analysis of limiting information characteristics of quantum-cryptography protocols
Sych, D V; Grishanin, Boris A; Zadkov, Viktor N
2005-01-31
The problem of increasing the critical error rate of quantum-cryptography protocols by varying a set of letters in a quantum alphabet for space of a fixed dimensionality is studied. Quantum alphabets forming regular polyhedra on the Bloch sphere and the continual alphabet equally including all the quantum states are considered. It is shown that, in the absence of basis reconciliation, a protocol with the tetrahedral alphabet has the highest critical error rate among the protocols considered, while after the basis reconciliation, a protocol with the continual alphabet possesses the highest critical error rate. (quantum optics and quantum computation)
Quantum cryptography and applications in the optical fiber network
NASA Astrophysics Data System (ADS)
Luo, Yuhui
2005-09-01
Quantum cryptography, as part of quantum information and communications, can provide absolute security for information transmission because it is established on the fundamental laws of quantum theory, such as the principle of uncertainty, No-cloning theorem and quantum entanglement. In this thesis research, a novel scheme to implement quantum key distribution based on multiphoton entanglement with a new protocol is proposed. Its advantages are: a larger information capacity can be obtained with a longer transmission distance and the detection of multiple photons is easier than that of a single photon. The security and attacks pertaining to such a system are also studied. Next, a quantum key distribution over wavelength division multiplexed (WDM) optical fiber networks is realized. Quantum key distribution in networks is a long-standing problem for practical applications. Here we combine quantum cryptography and WDM to solve this problem because WDM technology is universally deployed in the current and next generation fiber networks. The ultimate target is to deploy quantum key distribution over commercial networks. The problems arising from the networks are also studied in this part. Then quantum key distribution in multi-access networks using wavelength routing technology is investigated in this research. For the first time, quantum cryptography for multiple individually targeted users has been successfully implemented in sharp contrast to that using the indiscriminating broadcasting structure. It overcomes the shortcoming that every user in the network can acquire the quantum key signals intended to be exchanged between only two users. Furthermore, a more efficient scheme of quantum key distribution is adopted, hence resulting in a higher key rate. Lastly, a quantum random number generator based on quantum optics has been experimentally demonstrated. This device is a key component for quantum key distribution as it can create truly random numbers, which is an
Quantum cryptography on multi-user network architectures
NASA Astrophysics Data System (ADS)
Kumavor, Patrick D.; Beal, Alan C.; Yelin, Susanne; Donkor, Eric; Wang, Bing C.
2006-05-01
Quantum cryptography applies the uncertainty principle and the no-cloning theorem to allow to parties to share a secret key over an ultra-secure link. Present quantum cryptography technologies provide encryption key distribution only between two users. However, practical implementations of encryption key distribution schemes require establishing secure quantum communications amongst multiple users. This paper looks at some of the advantages and drawbacks of some common network topologies that could be used in sending cryptographic keys across a network consisting of multiple users. These topologies are the star, ring, and bus networks. Their performances are compared and analyzed using quantum bit error rate analysis. The paper also presents an experimental demonstration of a six-user quantum key distribution network implemented on a bus topology.
NASA Astrophysics Data System (ADS)
Lütkenhaus, N.; Shields, A. J.
2009-04-01
Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the
Entangled state quantum cryptography: eavesdropping on the ekert protocol
Naik; Peterson; White; Berglund; Kwiat
2000-05-15
Using polarization-entangled photons from spontaneous parametric down-conversion, we have implemented Ekert's quantum cryptography protocol. The near-perfect correlations of the photons allow the sharing of a secret key between two parties. The presence of an eavesdropper is continually checked by measuring Bell's inequalities. We investigated several possible eavesdropper strategies, including pseudo-quantum-nondemolition measurements. In all cases, the eavesdropper's presence was readily apparent. We discuss a procedure to increase her detectability.
Practical Quantum Cryptography for Secure Free-Space Communications
Buttler, W.T.; Hughes, R.J.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-02-01
Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics and information-theoretically secure post-processing methods. An adversary can neither successfully tap the quantum transmissions, nor evade detection, owing to Heisenberg's uncertainty principle. In this paper we describe the theory of quantum cryptography, and the most recent results from our experimental free-space system with which we have demonstrated for the first time the feasibility of quantum key generation over a point-to-point outdoor atmospheric path in daylight. We achieved a transmission distance of 0.5 km, which was limited only by the length of the test range. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on orbit. We present a feasibility analysis of surface-to-satellite quantum key generation.
Quantum cryptography as a retrodiction problem.
Werner, A H; Franz, T; Werner, R F
2009-11-27
We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission-error free scenario, even if Eve is allowed to attack both transmissions. This establishes a connection between retrodiction and key distribution.
Quantum cryptography as a retrodiction problem.
Werner, A H; Franz, T; Werner, R F
2009-11-27
We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission-error free scenario, even if Eve is allowed to attack both transmissions. This establishes a connection between retrodiction and key distribution. PMID:20366080
An Online Banking System Based on Quantum Cryptography Communication
NASA Astrophysics Data System (ADS)
Zhou, Ri-gui; Li, Wei; Huan, Tian-tian; Shen, Chen-yi; Li, Hai-sheng
2014-07-01
In this paper, an online banking system has been built. Based on quantum cryptography communication, this system is proved unconditional secure. Two sets of GHZ states are applied, which can ensure the safety of purchase and payment, respectively. In another word, three trading participants in each triplet state group form an interdependent and interactive relationship. In the meantime, trading authorization and blind signature is introduced by means of controllable quantum teleportation. Thus, an effective monitor is practiced on the premise that the privacy of trading partners is guaranteed. If there is a dispute or deceptive behavior, the system will find out the deceiver immediately according to the relationship mentioned above.
Quantum cryptography with 3-state systems.
Bechmann-Pasquinucci, H; Peres, A
2000-10-01
We consider quantum cryptographic schemes where the carriers of information are 3-state particles. One protocol uses four mutually unbiased bases and appears to provide better security than obtainable with 2-state carriers. Another possible method allows quantum states to belong to more than one basis. Security is not better, but many curious features arise.
Some conservative estimates in quantum cryptography
Molotkov, S. N.
2006-08-15
Relationship is established between the security of the BB84 quantum key distribution protocol and the forward and converse coding theorems for quantum communication channels. The upper bound Q{sub c} {approx} 11% on the bit error rate compatible with secure key distribution is determined by solving the transcendental equation H(Q{sub c})=C-bar({rho})/2, where {rho} is the density matrix of the input ensemble, C-bar({rho}) is the classical capacity of a noiseless quantum channel, and H(Q) is the capacity of a classical binary symmetric channel with error rate Q.
Infeasibility of Quantum Cryptography Without Eavesdropping Check
NASA Astrophysics Data System (ADS)
Yang, Wei; Huang, Liusheng; Song, Fang; Wang, Qiyan
Secure key distribution is impossible in pure classical environment. Unconditional secure key distribution is available when quantum means are introduced, assisted by a classical communication channel. What is possible when a quantum key distribution scheme is without classical communication? We present a general model with this constraint and show that quantum key distribution without classical eavesdropping check is in principle impossible. For an adversary can always succeed in obtaining the secret key via a special case of man-in-the-middle attack, namely intercept-and-forward attack without any risk of being captured.
Quantum cryptography for secure free-space communications
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.
1999-03-01
The secure distribution of the secret random bit sequences known as key material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg`s uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). The authors have developed experimental quantum cryptography systems based on the transmission of non-orthogonal photon polarization states to generate shared key material over line-of-sight optical links. Key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. The authors have developed and tested a free-space quantum key distribution (QKD) system over an outdoor optical path of {approximately}1 km at Los Alamos National Laboratory under nighttime conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, they examine the feasibility of surface to satellite QKD.
Quantum random number generators and their applications in cryptography
NASA Astrophysics Data System (ADS)
Stipcevic, Mario
2012-06-01
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a physical RNG. Randomness of a RNG can be defined and scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG which, at state of the art, seem to be possible only by harvest of randomness inherent to certain (simple) quantum systems and such a generator we call Quantum RNG (QRNG). On the other hand, current industry standards dictate use of RNGs based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which, although quantum in nature, cannot be strictly proven. This approach is currently used in FPGA and ASIC chips. We compare weak and strong aspects of the two approaches for use in cryptography and in general. We also give an alternative definition of randomness, discuss usage of single photon detectors in realization of QRNGs and give several examples where QRNG can significantly improve security of a cryptographic system.
High-rate measurement-device-independent quantum cryptography
NASA Astrophysics Data System (ADS)
Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana; Weedbrook, Christian; Braunstein, Samuel L.; Lloyd, Seth; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.
2015-06-01
Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers.
Faraday-Michelson system for quantum cryptography.
Mo, Xiao-Fan; Zhu, Bing; Han, Zheng-Fu; Gui, You-Zhen; Guo, Guang-Can
2005-10-01
Quantum key distribution provides unconditional security for communication. Unfortunately, current experimental schemes are not suitable for long-distance fiber transmission because of phase drift or Rayleigh backscattering. In this Letter we present a unidirectional intrinsically stable scheme that is based on Michelson-Faraday interferometers, in which ordinary mirrors are replaced with 90 degree Faraday mirrors. With the scheme, a demonstration setup was built and excellent stability of interference fringe visibility was achieved over a fiber length of 175 km. Through a 125 km long commercial communication fiber cable between Beijing and Tianjin, the key exchange was performed with a quantum bit-error rate of less than 6%, which is to our knowledge the longest reported quantum key distribution experiment under field conditions.
Quantum cryptography with perfect multiphoton entanglement.
Luo, Yuhui; Chan, Kam Tai
2005-05-01
Multiphoton entanglement in the same polarization has been shown theoretically to be obtainable by type-I spontaneous parametric downconversion (SPDC), which can generate bright pulses more easily than type-II SPDC. A new quantum cryptographic protocol utilizing polarization pairs with the detected type-I entangled multiphotons is proposed as quantum key distribution. We calculate the information capacity versus photon number corresponding to polarization after considering the transmission loss inside the optical fiber, the detector efficiency, and intercept-resend attacks at the level of channel error. The result compares favorably with all other schemes employing entanglement.
Continuous variable quantum cryptography using coherent states.
Grosshans, Frédéric; Grangier, Philippe
2002-02-01
We propose several methods for quantum key distribution (QKD) based on the generation and transmission of random distributions of coherent or squeezed states, and we show that they are secure against individual eavesdropping attacks. These protocols require that the transmission of the optical line between Alice and Bob is larger than 50%, but they do not rely on "sub-shot-noise" features such as squeezing. Their security is a direct consequence of the no-cloning theorem, which limits the signal-to-noise ratio of possible quantum measurements on the transmission line. Our approach can also be used for evaluating various QKD protocols using light with Gaussian statistics.
Deterministic and efficient quantum cryptography based on Bell's theorem
Chen Zengbing; Pan Jianwei; Zhang Qiang; Bao Xiaohui; Schmiedmayer, Joerg
2006-05-15
We propose a double-entanglement-based quantum cryptography protocol that is both efficient and deterministic. The proposal uses photon pairs with entanglement both in polarization and in time degrees of freedom; each measurement in which both of the two communicating parties register a photon can establish one and only one perfect correlation, and thus deterministically create a key bit. Eavesdropping can be detected by violation of local realism. A variation of the protocol shows a higher security, similar to the six-state protocol, under individual attacks. Our scheme allows a robust implementation under the current technology.
POST Quantum Cryptography from Mutant Prime Knots
NASA Astrophysics Data System (ADS)
Marzuoli, Annalisa; Palumbo, Giandomenico
By resorting to basic features of topological knot theory we propose a (classical) cryptographic protocol based on the `difficulty' of decomposing complex knots generated as connected sums of prime knots and their mutants. The scheme combines an asymmetric public key protocol with symmetric private ones and is intrinsecally secure against quantum eavesdropper attacks.
NASA Astrophysics Data System (ADS)
Lütkenhaus, N.; Shields, A. J.
2009-04-01
Quantum cryptography, and especially quantum key distribution (QKD), is steadily progressing to become a viable tool for cryptographic services. In recent years we have witnessed a dramatic increase in the secure bit rate of QKD, as well as its extension to ever longer fibre- and air-based links and the emergence of metro-scale trusted networks. In the foreseeable future even global-scale communications may be possible using quantum repeaters or Earth-satellite links. A handful of start-ups and some bigger companies are already active in the field. The launch of an initiative to form industrial standards for QKD, under the auspices of the European Telecommunication Standards Institute, described in the paper by Laenger and Lenhart in this Focus Issue, can be taken as a sign of the growing commercial interest. Recent progress has seen an increase in the secure bit rate of QKD links, by orders of magnitude, to over 1 Mb s-1. This has resulted mainly from an improvement in the detection technology. Here changes in the way conventional semiconductor detectors are gated, as well as the development of novel devices based on non-linear processes and superconducting materials, are leading the way. Additional challenges for QKD at GHz clock rates include the design of high speed electronics, remote synchronization and high rate random number generation. Substantial effort is being devoted to increasing the range of individual links, which is limited by attenuation and other losses in optical fibres and air links. An important advance in the past few years has been the introduction of protocols with the same scaling as an ideal single-photon set-up. The good news is that these schemes use standard optical devices, such as weak laser pulses. Thanks to these new protocols and improvements in the detection technology, the range of a single fibre link can exceed a few hundred km. Outstanding issues include proving the unconditional security of some of the schemes. Much of the
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Lo, Hoi-Kwong
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD, together with its assumptions, strengths, and weaknesses.
Measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Lo, Hoi-Kwong
2014-12-18
In theory, quantum key distribution (QKD) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of QKD, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurement-device-independent QKD (mdiQKD), has been proposed. In addition, it can remove all side-channels from the measurement unit, arguably the most vulnerable part in QKD systems, thus offering a clear avenue toward secure QKD realisations. In this study, we review the latest developments in the framework of mdiQKD,more » together with its assumptions, strengths, and weaknesses.« less
Superlinear threshold detectors in quantum cryptography
NASA Astrophysics Data System (ADS)
Lydersen, Lars; Jain, Nitin; Wittmann, Christoffer; Marøy, Øystein; Skaar, Johannes; Marquardt, Christoph; Makarov, Vadim; Leuchs, Gerd
2011-09-01
We introduce the concept of a superlinear threshold detector, a detector that has a higher probability to detect multiple photons if it receives them simultaneously rather than at separate times. Highly superlinear threshold detectors in quantum key distribution systems allow eavesdropping the full secret key without being revealed. Here, we generalize the detector control attack, and analyze how it performs against quantum key distribution systems with moderately superlinear detectors. We quantify the superlinearity in superconducting single-photon detectors based on earlier published data, and gated avalanche photodiode detectors based on our own measurements. The analysis shows that quantum key distribution systems using detector(s) of either type can be vulnerable to eavesdropping. The avalanche photodiode detector becomes superlinear toward the end of the gate. For systems expecting substantial loss, or for systems not monitoring loss, this would allow eavesdropping using trigger pulses containing less than 120 photons per pulse. Such an attack would be virtually impossible to catch with an optical power meter at the receiver entrance.
Superlinear threshold detectors in quantum cryptography
Lydersen, Lars; Maroey, Oystein; Skaar, Johannes; Makarov, Vadim; Jain, Nitin; Wittmann, Christoffer; Marquardt, Christoph; Leuchs, Gerd
2011-09-15
We introduce the concept of a superlinear threshold detector, a detector that has a higher probability to detect multiple photons if it receives them simultaneously rather than at separate times. Highly superlinear threshold detectors in quantum key distribution systems allow eavesdropping the full secret key without being revealed. Here, we generalize the detector control attack, and analyze how it performs against quantum key distribution systems with moderately superlinear detectors. We quantify the superlinearity in superconducting single-photon detectors based on earlier published data, and gated avalanche photodiode detectors based on our own measurements. The analysis shows that quantum key distribution systems using detector(s) of either type can be vulnerable to eavesdropping. The avalanche photodiode detector becomes superlinear toward the end of the gate. For systems expecting substantial loss, or for systems not monitoring loss, this would allow eavesdropping using trigger pulses containing less than 120 photons per pulse. Such an attack would be virtually impossible to catch with an optical power meter at the receiver entrance.
Practical free-space quantum cryptography
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Luther, G.G.; Morgan, G.L.; Nordholt, J.E.; Peterson, C.G.; Simmons, C.M.
1998-12-01
An experimental free-space quantum key distribution (QKD) system has been tested over an outdoor optical path of {approx} 1 km under nighttime conditions at Los Alamos National Laboratory. This system employs the Bennett 92 protocol; here the authors give a brief overview of this protocol, and describe the experimental implementation of it. An analysis of the system efficiency is presented, as well as a description of the error detection protocol, which employs a two-dimensional parity check scheme. Finally, the susceptibility of this system to eavesdropping by various techniques is determined, and the effectiveness of privacy amplification procedures is discussed. The conclusions are that free-space QKD is both effective and secure; possible applications include the rekeying of satellites in low earth orbit.
Tight finite-key analysis for quantum cryptography.
Tomamichel, Marco; Lim, Charles Ci Wen; Gisin, Nicolas; Renner, Renato
2012-01-17
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies.
Tight finite-key analysis for quantum cryptography.
Tomamichel, Marco; Lim, Charles Ci Wen; Gisin, Nicolas; Renner, Renato
2012-01-01
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies. PMID:22252558
Tight finite-key analysis for quantum cryptography
Tomamichel, Marco; Lim, Charles Ci Wen; Gisin, Nicolas; Renner, Renato
2012-01-01
Despite enormous theoretical and experimental progress in quantum cryptography, the security of most current implementations of quantum key distribution is still not rigorously established. One significant problem is that the security of the final key strongly depends on the number, M, of signals exchanged between the legitimate parties. Yet, existing security proofs are often only valid asymptotically, for unrealistically large values of M. Another challenge is that most security proofs are very sensitive to small differences between the physical devices used by the protocol and the theoretical model used to describe them. Here we show that these gaps between theory and experiment can be simultaneously overcome by using a recently developed proof technique based on the uncertainty relation for smooth entropies. PMID:22252558
No information flow using statistical fluctuations and quantum cryptography
NASA Astrophysics Data System (ADS)
Larsson, Jan-Åke
2004-04-01
The communication protocol of Home and Whitaker [
Experimental quantum-cryptography scheme based on orthogonal states
NASA Astrophysics Data System (ADS)
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-12-01
Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.75.1239 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.
Experimental quantum-cryptography scheme based on orthogonal states
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo Pietro; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-12-15
Since, in general, nonorthogonal states cannot be cloned, any eavesdropping attempt in a quantum-communication scheme using nonorthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in quantum-cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75, 1239 (1995)] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets traveling along separate channels. Here we present an experiment realizing this scheme.
Experimental quantum cryptography scheme based on orthogonal states: preliminary results
NASA Astrophysics Data System (ADS)
Avella, Alessio; Brida, Giorgio; Degiovanni, Ivo P.; Genovese, Marco; Gramegna, Marco; Traina, Paolo
2010-04-01
Since, in general, non-orthogonal states cannot be cloned, any eavesdropping attempt in a Quantum Communication scheme using non-orthogonal states as carriers of information introduces some errors in the transmission, leading to the possibility of detecting the spy. Usually, orthogonal states are not used in Quantum Cryptography schemes since they can be faithfully cloned without altering the transmitted data. Nevertheless, L. Goldberg and L. Vaidman [Phys. Rev. Lett. 75 (7), pp. 12391243, 1995] proposed a protocol in which, even if the data exchange is realized using two orthogonal states, any attempt to eavesdrop is detectable by the legal users. In this scheme the orthogonal states are superpositions of two localized wave packets which travel along separate channels, i.e. two different paths inside a balanced Mach-Zehnder interferometer. Here we present an experiment realizing this scheme.
Quantum cryptography in real-life applications: Assumptions and security
NASA Astrophysics Data System (ADS)
Zhao, Yi
Quantum cryptography, or quantum key distribution (QKD), provides a means of unconditionally secure communication. The security is in principle based on the fundamental laws of physics. Security proofs show that if quantum cryptography is appropriately implemented, even the most powerful eavesdropper cannot decrypt the message from a cipher. The implementations of quantum crypto-systems in real life may not fully comply with the assumptions made in the security proofs. Such discrepancy between the experiment and the theory can be fatal to the security of a QKD system. In this thesis we address a number of these discrepancies. A perfect single-photon source is often assumed in many security proofs. However, a weak coherent source is widely used in a real-life QKD implementation. Decoy state protocols have been proposed as a novel approach to dramatically improve the performance of a weak coherent source based QKD implementation without jeopardizing its security. Here, we present the first experimental demonstrations of decoy state protocols. Our experimental scheme was later adopted by most decoy state QKD implementations. In the security proof of decoy state protocols as well as many other QKD protocols, it is widely assumed that a sender generates a phase-randomized coherent state. This assumption has been enforced in few implementations. We close this gap in two steps: First, we implement and verify the phase randomization experimentally; second, we prove the security of a QKD implementation without the coherent state assumption. In many security proofs of QKD, it is assumed that all the detectors on the receiver's side have identical detection efficiencies. We show experimentally that this assumption may be violated in a commercial QKD implementation due to an eavesdropper's malicious manipulation. Moreover, we show that the eavesdropper can learn part of the final key shared by the legitimate users as a consequence of this violation of the assumptions.
Effect of source tampering in the security of quantum cryptography
NASA Astrophysics Data System (ADS)
Sun, Shi-Hai; Xu, Feihu; Jiang, Mu-Sheng; Ma, Xiang-Chun; Lo, Hoi-Kwong; Liang, Lin-Mei
2015-08-01
The security of source has become an increasingly important issue in quantum cryptography. Based on the framework of measurement-device-independent quantum key distribution (MDI-QKD), the source becomes the only region exploitable by a potential eavesdropper (Eve). Phase randomization is a cornerstone assumption in most discrete-variable (DV) quantum communication protocols (e.g., QKD, quantum coin tossing, weak-coherent-state blind quantum computing, and so on), and the violation of such an assumption is thus fatal to the security of those protocols. In this paper, we show a simple quantum hacking strategy, with commercial and homemade pulsed lasers, by Eve that allows her to actively tamper with the source and violate such an assumption, without leaving a trace afterwards. Furthermore, our attack may also be valid for continuous-variable (CV) QKD, which is another main class of QKD protocol, since, excepting the phase random assumption, other parameters (e.g., intensity) could also be changed, which directly determine the security of CV-QKD.
Security in Quantum Cryptography vs. Nonlocal Hidden Variables
NASA Astrophysics Data System (ADS)
Aerts, Diederik; Czachor, Marek; Pawłowski, Marcin
2007-02-01
In order to prove equivalence of quantum mechanics with nonlocal hidden-variable theories of a Bohm type one assumes that all the possible measurements belong to a restricted class: (a) we measure only positions of particles and (b) have no access to exact values of initial conditions for Bohm's trajectories. However, in any computer simulation based on Bohm's equations one relaxes the assumption (b) and yet obtains agreement with quantum predictions concerning the results of positional measurements. Therefore a theory where (b) is relaxed, although in principle allowing for measurements of a more general type, cannot be experimentally falsified within the current experimental paradigm. Such generalized measurements have not been invented, or have been invented but the information is qualified, but we cannot exclude their possibility on the basis of known experimental data. Since the measurements would simultaneously allow for eavesdropping in standard quantum cryptosystems, the arguments for security of quantum cryptography become logically circular: Bohm-type theories do not allow for eavesdropping because they are fully equivalent to quantum mechanics, but the equivalence follows from the assumption that we cannot measure hidden variables, which would be equivalent to the possibility of eavesdropping… Here we break the vicious circle by a simple modification of entangled-state protocols that makes them secure even if our enemies have more imagination and know how to measure hidden-variable initial conditions with arbitrary precision.
Information investigation for B92 protocol in quantum cryptography
NASA Astrophysics Data System (ADS)
Zou, Ming; Zhang, Guoping
2005-01-01
In this paper, we simulate the quantum channel with a binary symmetric channel and a binary erasure channel, a series channel and a Markovian chain channel in classical information theory, then calculate respectively the mutual information between the signal's deliverer, the legal receiver and the eavesdropper, the bit error rate during propagating the signals with the theory about the quantum measurement channel and the quantum information theory. For B92 protocol, a simple quantum cryptography distribution scheme, we study the bound and the property of mutual information obtained by the legal receiver and the eavesdropper, seek the relationship between the bit error rates and the eavesdropper's way, in two cases of the opaque eavesdropping and the translucent eavesdropping. A new criteria for checking the eavesdropper and ensuring the legal correspondent is estimated. Furthermore, the comparison in bit error rates caused respectively in two different measuring ways indicates that POVM is better than the standard measurement by the way of orthogonal projecting for reducing the bit error rate and increasing effective communication.
Quantum cryptography and authentication with low key-consumption
NASA Astrophysics Data System (ADS)
Abidin, A.; Pacher, C.; Lorünser, T.; Larsson, J.-Å.; Peev, M.
2011-11-01
Quantum Key Distribution (QKD - also referred to as Quantum Cryptography) is a technique for secret key agreement. It has been shown that QKD rigged with Information-Theoretic Secure (ITS) authentication (using secret key) of the classical messages transmitted during the key distribution protocol is also ITS. Note, QKD without any authentication can trivially be broken by man-in-the-middle attacks. Here, we study an authentication method that was originally proposed because of its low key consumption; a two-step authentication that uses a publicly known hash function, followed by a secret strongly universal2 hash function, which is exchanged each round. This two-step authentication is not information-theoretically secure but it was argued that nevertheless it does not compromise the security of QKD. In the current contribution we study intrinsic weaknesses of this approach under the common assumption that the QKD adversary has access to unlimited resources including quantum memories. We consider one implementation of Quantum Cryptographic protocols that use such authentication and demonstrate an attack that fully extract the secret key. Even including the final key from the protocol in the authentication does not rule out the possibility of these attacks. To rectify the situation, we propose a countermeasure that, while not information-theoretically secure, restores the need for very large computing power for the attack to work. Finally, we specify conditions that must be satisfied by the two-step authentication in order to restore information-theoretic security.
Modification of error reconciliation scheme for quantum cryptography
NASA Astrophysics Data System (ADS)
Kuritsyn, Konstantin
2003-07-01
Quantum cryptography is essentially the quantum key distribution (QKD). In the context of QKD, one from two partners (Alice) generates and sends a sequence of qubits through a private quantum channel to another partner (Bob) and Bob receives the sequence and measures the state of each qubit. After the quantum transmission stage, Alice and Bob have almost identical qubit sequences. The erros are due to physical imperfections in the channel and presence of an eavesdropper. The next stage in QKD is key reconciliation (i.e. finding and correcting discrepancies between Alice's string and that of Bob). This reconciliation can be done by public discussion. Let us suppose there is a secret quantum channel between Alice and Bob through which Alice transmits a n-bit string A=(A1, A2,...,An)ɛ{0,1}n. Then Bob receives a n-bit string B=(B1, B2,...,Bn)ɛ{0,1)n. The string B differs from A due to the presence of noise and eavesdropper in the channel. One can estimate the bit error probability in the channel. For example, Bob can choose a random subset from his string and send it to Alice in public. Then Alice compares the received string with her corresponding subset and calculates the total number of protocol steps. The cascade scheme uses the interaction over the public channel to correct the secret strings by dividing them into the blocks of a fixed length. The length is determined from the bit error probability. A simple interactive routine is applied in each of these blocks. An error found in some block results in some action with other blocks. It is important to optimize the error-finding routines in standalone blocks as well as to organize the effective constrution of blocks with the object of protocol benchmark, information leakage and number of interactions between partners.
The (in)adequacy of applicative use of quantum cryptography in wireless sensor networks
NASA Astrophysics Data System (ADS)
Turkanović, Muhamed; Hölbl, Marko
2014-10-01
Recently quantum computation and cryptography principles are exploited in the design of security systems for wireless sensor networks (WSNs), which are consequently named as quantum WSN. Quantum cryptography is presumably secure against any eavesdropper and thus labeled as providing unconditional security. This paper tries to analyze the aspect of the applicative use of quantum principles in WSN. The outcome of the analysis elaborates a summary about the inadequacy of applicative use of quantum cryptography in WSN and presents an overview of all possible applicative challenges and problems while designing quantum-based security systems for WSN. Since WSNs are highly complex frameworks, with many restrictions and constraints, every security system has to be fully compatible and worthwhile. The aim of the paper was to contribute a verdict about this topic, backed up by equitable facts.
Quantum cryptography using coherent states: Randomized encryption and key generation
NASA Astrophysics Data System (ADS)
Corndorf, Eric
With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic
Practical Quantum Communication and Cryptography for WDM Optical Networks
NASA Astrophysics Data System (ADS)
Kumar, Prem
2004-11-01
Keeping in mind the ubiquitous standard optical fiber for long-distance transmission and the widespread availability of efficient active and passive fiber devices, we have been developing telecom-band resources for practical quantum communication and cryptography in wave-division-multiplexed (WDM) optical networks. In this talk I present our recent results on two fronts: i) telecom-band in-fiber entanglement generation, storage, and long-distance distribution and ii) quantum-noise protected high-speed data encryption through an optically-amplified WDM line. Along the first front, with our in-fiber entanglement source all four Bell states can be readily produced and we have demonstrated violation of Bell's inequalities by up to 10 standard deviations of measurement uncertainty. With such a source we have demonstrated storage of entanglement for up to 1/8 of a millisecond. Furthermore, when each photon of the entangled pair is propagated in separate 25km-long standard fibers, high visibility quantum interference is still observed, demonstrating that this system is capable of long-distance (> 50 km) entanglement distribution. Along the second front, we have implemented a new quantum cryptographic scheme, based on Yuen's KCQ protocol, in which the inherent quantum noise of coherent states of light is used to perform the cryptographic service of data encryption. In this scheme a legitimate receiver, with use of a short, shared, secret-key, executes a simple binary decision rule on every transmitted bit. An eavesdropper, on the other hand, who does not possess the secret-key, is subjected to an irreducible quantum uncertainty in each measurement, even with the use of ideal detectors. We have implemented this scheme to demonstrate quantum-noise-protected data encryption at 650 Mbps through a 200 km, in-line amplified, WDM line. The line simultaneously carried two 10 Gbps standard data channels, 100 GHz on either side of the encrypted channel, which shows that this scheme
Topics in quantum cryptography, quantum error correction, and channel simulation
NASA Astrophysics Data System (ADS)
Luo, Zhicheng
In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel
Tomographic quantum cryptography: equivalence of quantum and classical key distillation.
Bruss, Dagmar; Christandl, Matthias; Ekert, Artur; Englert, Berthold-Georg; Kaszlikowski, Dagomir; Macchiavello, Chiara
2003-08-29
The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. For an important class of protocols, which exploit tomographically complete measurements on entangled pairs of any dimension, we show that the noise threshold for classical advantage distillation is identical with the threshold for quantum entanglement distillation. As a consequence, the two distillation procedures are equivalent: neither offers a security advantage over the other.
A Secure Key Distribution System of Quantum Cryptography Based on the Coherent State
NASA Technical Reports Server (NTRS)
Guo, Guang-Can; Zhang, Xiao-Yu
1996-01-01
The cryptographic communication has a lot of important applications, particularly in the magnificent prospects of private communication. As one knows, the security of cryptographic channel depends crucially on the secrecy of the key. The Vernam cipher is the only cipher system which has guaranteed security. In that system the key must be as long as the message and most be used only once. Quantum cryptography is a method whereby key secrecy can be guaranteed by a physical law. So it is impossible, even in principle, to eavesdrop on such channels. Quantum cryptography has been developed in recent years. Up to now, many schemes of quantum cryptography have been proposed. Now one of the main problems in this field is how to increase transmission distance. In order to use quantum nature of light, up to now proposed schemes all use very dim light pulses. The average photon number is about 0.1. Because of the loss of the optical fiber, it is difficult for the quantum cryptography based on one photon level or on dim light to realize quantum key-distribution over long distance. A quantum key distribution based on coherent state is introduced in this paper. Here we discuss the feasibility and security of this scheme.
Security improvement by using a modified coherent state for quantum cryptography
Lu, Y.J.; Zhu, Luobei; Ou, Z.Y.
2005-03-01
Weak coherent states as a photon source for quantum cryptography have a limit in secure data rate and transmission distance because of the presence of multiphoton events and loss in transmission line. Two-photon events in a coherent state can be taken out by a two-photon interference scheme. We investigate the security issue of utilizing this modified coherent state in quantum cryptography. A 4-dB improvement in the secure data rate or a nearly twofold increase in transmission distance over the coherent state are found. With a recently proposed and improved encoding strategy, further improvement is possible.
Quantum Cryptography for Secure Communications to Low-Earth Orbit Satellites
Hughes, R.J.; Buttler, W.T.; Kwiat, P.G.; Lamoreaux, S.K.; Morgan, G.L.; Peterson, C.G.; Twyeffort, E.; Simmons, C.M.; Nordholt, J.E.
1999-06-03
This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Quantum cryptography is an emerging technology in which two parties may simultaneously generate shared, secret cryptographic key material using the transmission of quantum states of light. The security of these transmissions is based on the inviolability of the laws of quantum mechanics. An adversary can neither successfully tap the quantum transmissions, nor evade detection. Key material is built up using the transmission of a single-photon per bit. We have developed an experimental quantum cryptography system based on the transmission of non-orthogonal single-photon polarization states to generate shared key material over line-of-sight optical links. Our results provide strong evidence that cryptographic key material could be generated on demand between a ground station and a satellite (or between two satellites), allowing a satellite to be securely re-keyed on in orbit.
Characterization of collective Gaussian attacks and security of coherent-state quantum cryptography.
Pirandola, Stefano; Braunstein, Samuel L; Lloyd, Seth
2008-11-14
We provide a simple description of the most general collective Gaussian attack in continuous-variable quantum cryptography. In the scenario of such general attacks, we analyze the asymptotic secret-key rates which are achievable with coherent states, joint measurements of the quadratures and one-way classical communication.
Quantum-tomographic cryptography with a semiconductor single-photon source
Kaszlikowski, D.; Yang, L.J.; Yong, L.S.; Willeboordse, F.H.; Kwek, L.C.
2005-09-15
We analyze the security of so-called quantum-tomographic cryptography with the source producing entangled photons via an experimental scheme proposed by Fattal et al. [Phys. Rev. Lett. 92, 37903 (2004)]. We determine the range of the experimental parameters for which the protocol is secure against the most general incoherent attacks.
Characterization of collective Gaussian attacks and security of coherent-state quantum cryptography.
Pirandola, Stefano; Braunstein, Samuel L; Lloyd, Seth
2008-11-14
We provide a simple description of the most general collective Gaussian attack in continuous-variable quantum cryptography. In the scenario of such general attacks, we analyze the asymptotic secret-key rates which are achievable with coherent states, joint measurements of the quadratures and one-way classical communication. PMID:19113324
On a two-pass scheme without a faraday mirror for free-space relativistic quantum cryptography
Kravtsov, K. S.; Radchenko, I. V.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.
2013-05-15
The stability of destructive interference independent of the input polarization and the state of a quantum communication channel in fiber optic systems used in quantum cryptography plays a principal role in providing the security of communicated keys. A novel optical scheme is proposed that can be used both in relativistic quantum cryptography for communicating keys in open space and for communicating them over fiber optic lines. The scheme ensures stability of destructive interference and admits simple automatic balancing of a fiber interferometer.
Compact transmission system using single-sideband modulation of light for quantum cryptography.
Duraffourg, L; Merolla, J M; Goedgebuer, J P; Mazurenko, Y; Rhodes, W T
2001-09-15
We report a new transmission that can be used for quantum key distribution. The system uses single-sideband-modulated light in an implementation of the BB84 quantum cryptography protocol. The system is formed by two integrated unbalanced Mach-Zehnder interferometers and is based on interference between phase-modulated sidebands in the spectral domain. Experiments show that high interference visibility can be obtained.
Compact transmission system using single-sideband modulation of light for quantum cryptography.
Duraffourg, L; Merolla, J M; Goedgebuer, J P; Mazurenko, Y; Rhodes, W T
2001-09-15
We report a new transmission that can be used for quantum key distribution. The system uses single-sideband-modulated light in an implementation of the BB84 quantum cryptography protocol. The system is formed by two integrated unbalanced Mach-Zehnder interferometers and is based on interference between phase-modulated sidebands in the spectral domain. Experiments show that high interference visibility can be obtained. PMID:18049627
Comment on 'Two-way protocols for quantum cryptography with a nonmaximally entangled qubit pair'
Qin Sujuan; Gao Fei; Wen Qiaoyan; Guo Fenzhuo
2010-09-15
Three protocols of quantum cryptography with a nonmaximally entangled qubit pair [Phys. Rev. A 80, 022323 (2009)] were recently proposed by Shimizu, Tamaki, and Fukasaka. The security of these protocols is based on the quantum-mechanical constraint for a state transformation between nonmaximally entangled states. However, we find that the second protocol is vulnerable under the correlation-elicitation attack. An eavesdropper can obtain the encoded bit M although she has no knowledge about the random bit R.
Femtosecond Laser--Pumped Source of Entangled Photons for Quantum Cryptography Applications
Pan, D.; Donaldson, W.; Sobolewski, R.
2007-07-31
We present an experimental setup for generation of entangled-photon pairs via spontaneous parametric down-conversion, based on the femtosecond-pulsed laser. Our entangled-photon source utilizes a 76-MHz-repetition-rate, 100-fs-pulse-width, mode-locked, ultrafast femtosecond laser, which can produce, on average, more photon pairs than a cw laser of an equal pump power. The resulting entangled pairs are counted by a pair of high-quantum-efficiency, single-photon, silicon avalanche photodiodes. Our apparatus is intended as an efficient source/receiver system for the quantum communications and quantum cryptography applications.
The Modeling Library of Eavesdropping Methods in Quantum Cryptography Protocols by Model Checking
NASA Astrophysics Data System (ADS)
Yang, Fan; Yang, Guowu; Hao, Yujie
2016-07-01
The most crucial issue of quantum cryptography protocols is its security. There exists many ways to attack the quantum communication process. In this paper, we present a model checking method for modeling the eavesdropping in quantum information protocols. So when the security properties of a certain protocol are needed to be verified, we can directly use the models which are already built. Here we adopt the probabilistic model checking tool—PRISM to model these attack methods. The verification results show that the detection rate of eavesdropping is approximately close to 1 when enough photons are transmitted.
Timofeev, A. V.; Pomozov, D. I.; Makkaveev, A. P.; Molotkov, S. N.
2007-05-15
Quantum cryptography systems combine two communication channels: a quantum and a classical one. (They can be physically implemented in the same fiber-optic link, which is employed as a quantum channel when one-photon states are transmitted and as a classical one when it carries classical data traffic.) Both channels are supposed to be insecure and accessible to an eavesdropper. Error correction in raw keys, interferometer balancing, and other procedures are performed by using the public classical channel. A discussion of the requirements to be met by the classical channel is presented.
Active stabilization of the optical part in fiber optic quantum cryptography
NASA Astrophysics Data System (ADS)
Balygin, K. A.; Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.
2016-03-01
The method of active stabilization of the polarization and other parameters of the optical part of a two-pass fiber optic quantum cryptography has been proposed and implemented. The method allows the completely automated maintenance of the visibility of interference close to an ideal value ( V ≥ 0.99) and the reduction of the instrumental contribution to the error in primary keys (QBER) to 0.5%.
Cryptographic robustness of practical quantum cryptography: BB84 key distribution protocol
Molotkov, S. N.
2008-07-15
In real fiber-optic quantum cryptography systems, the avalanche photodiodes are not perfect, the source of quantum states is not a single-photon one, and the communication channel is lossy. For these reasons, key distribution is impossible under certain conditions for the system parameters. A simple analysis is performed to find relations between the parameters of real cryptography systems and the length of the quantum channel that guarantee secure quantum key distribution when the eavesdropper's capabilities are limited only by fundamental laws of quantum mechanics while the devices employed by the legitimate users are based on current technologies. Critical values are determined for the rate of secure real-time key generation that can be reached under the current technology level. Calculations show that the upper bound on channel length can be as high as 300 km for imperfect photodetectors (avalanche photodiodes) with present-day quantum efficiency ({eta} {approx} 20%) and dark count probability (p{sub dark} {approx} 10{sup -7})
NASA Astrophysics Data System (ADS)
Smirnov, K. V.; Vachtomin, Yu. B.; Ozhegov, R. V.; Pentin, I. V.; Slivinskaya, E. V.; Korneev, A. A.; Goltsman, G. N.
2008-11-01
At present superconducting detectors become increasingly attractive for various practical applications. In this paper we present results on the depelopment of fiber coupled receiver systems for the registration of IR single photons, optimized for telecommunication and quantum-cryptography. These receiver systems were developed on the basis of superconducting single photon detectors (SSPD) of VIS and IR wavelength ranges. The core of the SSPD is a narrow (~100 nm) and long (~0,5 mm) strip in the form of a meander which is patterned from a 4-nm-thick NbN film (TC=10-11 K, jC=~5-7•106 A/cm2); the sensitive area dimensions are 10×10 μm2. The main problem to be solved while the receiver system development was optical coupling of a single-mode fiber (9 microns in diameter) with the SSPD sensitive area. Characteristics of the developed system at the optical input are as follows: quantum efficiency >10 % (at 1.3 μm), >4 % (at 1.55 μm) dark counts rate <=1 s-1; duration of voltage pulse <=5 ns; jitter <=40 ps. The receiver systems have either one or two identical channels (for the case of carrying out correlation measurements) and are made as an insert in a helium storage Dewar.
Field test of a practical secure communication network with decoy-state quantum cryptography.
Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei
2009-04-13
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.
Practical limitation for continuous-variable quantum cryptography using coherent States.
Namiki, Ryo; Hirano, Takuya
2004-03-19
In this Letter, first, we investigate the security of a continuous-variable quantum cryptographic scheme with a postselection process against individual beam splitting attack. It is shown that the scheme can be secure in the presence of the transmission loss owing to the postselection. Second, we provide a loss limit for continuous-variable quantum cryptography using coherent states taking into account excess Gaussian noise on quadrature distribution. Since the excess noise is reduced by the loss mechanism, a realistic intercept-resend attack which makes a Gaussian mixture of coherent states gives a loss limit in the presence of any excess Gaussian noise.
Reduced randomness in quantum cryptography with sequences of qubits encoded in the same basis
Lamoureux, L.-P.; Cerf, N. J.; Bechmann-Pasquinucci, H.; Gisin, N.; Macchiavello, C.
2006-03-15
We consider the cloning of sequences of qubits prepared in the states used in the BB84 or six-state quantum cryptography protocol, and show that the single-qubit fidelity is unaffected even if entire sequences of qubits are prepared in the same basis. This result is only valid provided that the sequences are much shorter than the total key. It is of great importance for practical quantum cryptosystems because it reduces the need for high-speed random number generation without impairing on the security against finite-size cloning attacks.
Field test of a practical secure communication network with decoy-state quantum cryptography.
Chen, Teng-Yun; Liang, Hao; Liu, Yang; Cai, Wen-Qi; Ju, Lei; Liu, Wei-Yue; Wang, Jian; Yin, Hao; Chen, Kai; Chen, Zeng-Bing; Peng, Cheng-Zhi; Pan, Jian-Wei
2009-04-13
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption. PMID:19365479
Device-independent security of quantum cryptography against collective attacks.
Acín, Antonio; Brunner, Nicolas; Gisin, Nicolas; Massar, Serge; Pironio, Stefano; Scarani, Valerio
2007-06-01
We present the optimal collective attack on a quantum key distribution protocol in the "device-independent" security scenario, where no assumptions are made about the way the quantum key distribution devices work or on what quantum system they operate. Our main result is a tight bound on the Holevo information between one of the authorized parties and the eavesdropper, as a function of the amount of violation of a Bell-type inequality.
Information complementarity in multipartite quantum states and security in cryptography
NASA Astrophysics Data System (ADS)
Bera, Anindita; Kumar, Asutosh; Rakshit, Debraj; Prabhu, R.; SenDe, Aditi; Sen, Ujjwal
2016-03-01
We derive complementarity relations for arbitrary quantum states of multiparty systems of any number of parties and dimensions between the purity of a part of the system and several correlation quantities, including entanglement and other quantum correlations as well as classical and total correlations, of that part with the remainder of the system. We subsequently use such a complementarity relation between purity and quantum mutual information in the tripartite scenario to provide a bound on the secret key rate for individual attacks on a quantum key distribution protocol.
Cryptography in the Bounded-Quantum-Storage Model
NASA Astrophysics Data System (ADS)
Schaffner, Christian
2007-09-01
This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is required for honest players, whereas the protocols can only be broken by an adversary controlling a large amount of quantum memory. The protocols are efficient, non-interactive and can be implemented with today's technology. On the theoretical side, new entropic uncertainty relations involving min-entropy are established and used to prove the security of protocols according to new strong security definitions. For instance, in the realistic setting of Quantum Key Distribution (QKD) against quantum-memory-bounded eavesdroppers, the uncertainty relation allows to prove the security of QKD protocols while tolerating considerably higher error rates compared to the standard model with unbounded adversaries.
A weak blind signature scheme based on quantum cryptography
NASA Astrophysics Data System (ADS)
Wen, Xiaojun; Niu, Xiamu; Ji, Liping; Tian, Yuan
2009-02-01
In this paper, we present a weak blind signature scheme based on the correlation of EPR (Einstein-Padolsky-Rosen) pairs. Different from classical blind signature schemes and current quantum signature schemes, our quantum blind signature scheme could guarantee not only the unconditionally security but also the anonymity of the message owner. To achieve that, quantum key distribution and one-time pad are adopted in our scheme. Experimental analysis proved that our scheme have the characteristics of non-counterfeit, non-disavowal, blindness and traceability. It has a wide application to E-payment system, E-government, E-business, and etc.
Hacking commercial quantum cryptography systems by tailored bright illumination
NASA Astrophysics Data System (ADS)
Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim
2010-10-01
The peculiar properties of quantum mechanics allow two remote parties to communicate a private, secret key, which is protected from eavesdropping by the laws of physics. So-called quantum key distribution (QKD) implementations always rely on detectors to measure the relevant quantum property of single photons. Here we demonstrate experimentally that the detectors in two commercially available QKD systems can be fully remote-controlled using specially tailored bright illumination. This makes it possible to tracelessly acquire the full secret key; we propose an eavesdropping apparatus built from off-the-shelf components. The loophole is likely to be present in most QKD systems using avalanche photodiodes to detect single photons. We believe that our findings are crucial for strengthening the security of practical QKD, by identifying and patching technological deficiencies.
NASA Astrophysics Data System (ADS)
Jacak, Monika; Jacak, Janusz; Jóźwiak, Piotr; Jóźwiak, Ireneusz
2016-06-01
The overview of the current status of quantum cryptography is given in regard to quantum key distribution (QKD) protocols, implemented both on nonentangled and entangled flying qubits. Two commercial R&D platforms of QKD systems are described (the Clavis II platform by idQuantique implemented on nonentangled photons and the EPR S405 Quelle platform by AIT based on entangled photons) and tested for feasibility of their usage in commercial TELECOM fiber metropolitan networks. The comparison of systems efficiency, stability and resistivity against noise and hacker attacks is given with some suggestion toward system improvement, along with assessment of two models of QKD.
Quantum cryptography using entangled photons in energy-time bell states
Tittel; Brendel; Zbinden; Gisin
2000-05-15
We present a setup for quantum cryptography based on photon pairs in energy-time Bell states and show its feasibility in a laboratory experiment. Our scheme combines the advantages of using photon pairs instead of faint laser pulses and the possibility to preserve energy-time entanglement over long distances. Moreover, using four-dimensional energy-time states, no fast random change of bases is required in our setup: Nature itself decides whether to measure in the energy or in the time base, thus rendering eavesdropper attacks based on "photon number splitting" less efficient.
Optimality of Gaussian attacks in continuous-variable quantum cryptography.
Navascués, Miguel; Grosshans, Frédéric; Acín, Antonio
2006-11-10
We analyze the asymptotic security of the family of Gaussian modulated quantum key distribution protocols for continuous-variables systems. We prove that the Gaussian unitary attack is optimal for all the considered bounds on the key rate when the first and second momenta of the canonical variables involved are known by the honest parties.
Full-field implementation of a perfect eavesdropper on a quantum cryptography system.
Gerhardt, Ilja; Liu, Qin; Lamas-Linares, Antía; Skaar, Johannes; Kurtsiefer, Christian; Makarov, Vadim
2011-06-14
Quantum key distribution (QKD) allows two remote parties to grow a shared secret key. Its security is founded on the principles of quantum mechanics, but in reality it significantly relies on the physical implementation. Technological imperfections of QKD systems have been previously explored, but no attack on an established QKD connection has been realized so far. Here we show the first full-field implementation of a complete attack on a running QKD connection. An installed eavesdropper obtains the entire 'secret' key, while none of the parameters monitored by the legitimate parties indicate a security breach. This confirms that non-idealities in physical implementations of QKD can be fully practically exploitable, and must be given increased scrutiny if quantum cryptography is to become highly secure.
On protection against a bright-pulse attack in the two-pass quantum cryptography system
NASA Astrophysics Data System (ADS)
Balygin, K. A.; Klimov, A. N.; Korol'kov, A. V.; Kulik, S. P.; Molotkov, S. N.
2016-06-01
The security of keys in quantum cryptography systems, in contrast to mathematical cryptographic algorithms, is guaranteed by fundamental quantum-mechanical laws. However, the cryptographic resistance of such systems, which are distributed physical devices, fundamentally depends on the method of their implementation and particularly on the calibration and control of critical parameters. The most important parameter is the number of photons in quasi-single-photon information states in a communication channel. The sensitivity to a bright-pulse attack has been demonstrated in an explicit form for a number of systems. A method guaranteeing the resistance to such attacks has been proposed and implemented. Furthermore, the relation of physical observables used and obtained at the control of quantum states to the length of final secret keys has been obtained for the first time.
Full-field implementation of a perfect eavesdropper on a quantum cryptography system.
Gerhardt, Ilja; Liu, Qin; Lamas-Linares, Antía; Skaar, Johannes; Kurtsiefer, Christian; Makarov, Vadim
2011-01-01
Quantum key distribution (QKD) allows two remote parties to grow a shared secret key. Its security is founded on the principles of quantum mechanics, but in reality it significantly relies on the physical implementation. Technological imperfections of QKD systems have been previously explored, but no attack on an established QKD connection has been realized so far. Here we show the first full-field implementation of a complete attack on a running QKD connection. An installed eavesdropper obtains the entire 'secret' key, while none of the parameters monitored by the legitimate parties indicate a security breach. This confirms that non-idealities in physical implementations of QKD can be fully practically exploitable, and must be given increased scrutiny if quantum cryptography is to become highly secure. PMID:21673670
Thermal blinding of gated detectors in quantum cryptography.
Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim
2010-12-20
It has previously been shown that the gated detectors of two commercially available quantum key distribution (QKD) systems are blindable and controllable by an eavesdropper using continuous-wave illumination and short bright trigger pulses, manipulating voltages in the circuit [Nat. Photonics 4, 686 (2010)]. This allows for an attack eavesdropping the full raw and secret key without increasing the quantum bit error rate (QBER). Here we show how thermal effects in detectors under bright illumination can lead to the same outcome. We demonstrate that the detectors in a commercial QKD system Clavis2 can be blinded by heating the avalanche photo diodes (APDs) using bright illumination, so-called thermal blinding. Further, the detectors can be triggered using short bright pulses once they are blind. For systems with pauses between packet transmission such as the plug-and-play systems, thermal inertia enables Eve to apply the bright blinding illumination before eavesdropping, making her more difficult to catch.
A sessional blind signature based on quantum cryptography
NASA Astrophysics Data System (ADS)
Khodambashi, Siavash; Zakerolhosseini, Ali
2014-01-01
In this paper, we present a sessional blind signature protocol whose security is guaranteed by fundamental principles of quantum physics. It allows a message owner to get his message signed by an authorized signatory. However, the signatory is not capable of reading the message contents and everyone can verify authenticity of the message. For this purpose, we took advantage of a sessional signature as well as quantum entangled pairs which are generated with respect to it in our proposed protocol. We describe our proposed blind signature through an example and briefly discuss about its unconditional security. Due to the feasibility of the protocol, it can be widely employed for e-payment, e-government, e-business and etc.
Thermal blinding of gated detectors in quantum cryptography.
Lydersen, Lars; Wiechers, Carlos; Wittmann, Christoffer; Elser, Dominique; Skaar, Johannes; Makarov, Vadim
2010-12-20
It has previously been shown that the gated detectors of two commercially available quantum key distribution (QKD) systems are blindable and controllable by an eavesdropper using continuous-wave illumination and short bright trigger pulses, manipulating voltages in the circuit [Nat. Photonics 4, 686 (2010)]. This allows for an attack eavesdropping the full raw and secret key without increasing the quantum bit error rate (QBER). Here we show how thermal effects in detectors under bright illumination can lead to the same outcome. We demonstrate that the detectors in a commercial QKD system Clavis2 can be blinded by heating the avalanche photo diodes (APDs) using bright illumination, so-called thermal blinding. Further, the detectors can be triggered using short bright pulses once they are blind. For systems with pauses between packet transmission such as the plug-and-play systems, thermal inertia enables Eve to apply the bright blinding illumination before eavesdropping, making her more difficult to catch. PMID:21197067
High-Rate Strong-Signal Quantum Cryptography
NASA Technical Reports Server (NTRS)
Yuen, Horace P.
1996-01-01
Several quantum cryptosystems utilizing different kinds of nonclassical lights, which can accommodate high intensity fields and high data rate, are described. However, they are all sensitive to loss and both the high rate and the strong-signal character rapidly disappear. A squeezed light homodyne detection scheme is proposed which, with present-day technology, leads to more than two orders of magnitude data rate improvement over other current experimental systems for moderate loss.
Intermediate states in quantum cryptography and Bell inequalities
Bechmann-Pasquinucci, H.; Gisin, N.
2003-06-01
Intermediate states are known from intercept/resend eavesdropping in the Bennett-Brassard 1984 (BB84) quantum cryptographic protocol. But they also play fundamental roles in the optimal eavesdropping strategy on the BB84 protocol and in the CHSH (Clauser-Horne-Shimony-Holt) inequality. We generalize the intermediate states to an arbitrary dimension and consider intercept/resend eavesdropping, optimal eavesdropping on the generalized BB84 protocol and present a generalized Clauser-Horne-Shimony-Holt inequality for two entangled qudits based on these states.
Memory Attacks on Device-Independent Quantum Cryptography
NASA Astrophysics Data System (ADS)
Barrett, Jonathan; Colbeck, Roger; Kent, Adrian
2013-01-01
Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party).
Memory attacks on device-independent quantum cryptography.
Barrett, Jonathan; Colbeck, Roger; Kent, Adrian
2013-01-01
Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party). PMID:23383767
Memory attacks on device-independent quantum cryptography.
Barrett, Jonathan; Colbeck, Roger; Kent, Adrian
2013-01-01
Device-independent quantum cryptographic schemes aim to guarantee security to users based only on the output statistics of any components used, and without the need to verify their internal functionality. Since this would protect users against untrustworthy or incompetent manufacturers, sabotage, or device degradation, this idea has excited much interest, and many device-independent schemes have been proposed. Here we identify a critical weakness of device-independent protocols that rely on public communication between secure laboratories. Untrusted devices may record their inputs and outputs and reveal information about them via publicly discussed outputs during later runs. Reusing devices thus compromises the security of a protocol and risks leaking secret data. Possible defenses include securely destroying or isolating used devices. However, these are costly and often impractical. We propose other more practical partial defenses as well as a new protocol structure for device-independent quantum key distribution that aims to achieve composable security in the case of two parties using a small number of devices to repeatedly share keys with each other (and no other party).
Laser damage helps the eavesdropper in quantum cryptography.
Bugge, Audun Nystad; Sauge, Sebastien; Ghazali, Aina Mardhiyah M; Skaar, Johannes; Lydersen, Lars; Makarov, Vadim
2014-02-21
We propose a class of attacks on quantum key distribution (QKD) systems where an eavesdropper actively engineers new loopholes by using damaging laser illumination to permanently change properties of system components. This can turn a perfect QKD system into a completely insecure system. A proof-of-principle experiment performed on an avalanche photodiode-based detector shows that laser damage can be used to create loopholes. After ∼1 W illumination, the detectors' dark count rate reduces 2-5 times, permanently improving single-photon counting performance. After ∼1.5 W, the detectors switch permanently into the linear photodetection mode and become completely insecure for QKD applications.
Laser damage helps the eavesdropper in quantum cryptography.
Bugge, Audun Nystad; Sauge, Sebastien; Ghazali, Aina Mardhiyah M; Skaar, Johannes; Lydersen, Lars; Makarov, Vadim
2014-02-21
We propose a class of attacks on quantum key distribution (QKD) systems where an eavesdropper actively engineers new loopholes by using damaging laser illumination to permanently change properties of system components. This can turn a perfect QKD system into a completely insecure system. A proof-of-principle experiment performed on an avalanche photodiode-based detector shows that laser damage can be used to create loopholes. After ∼1 W illumination, the detectors' dark count rate reduces 2-5 times, permanently improving single-photon counting performance. After ∼1.5 W, the detectors switch permanently into the linear photodetection mode and become completely insecure for QKD applications. PMID:24579579
High-dimensional quantum cryptography with twisted light
NASA Astrophysics Data System (ADS)
Mirhosseini, Mohammad; Magaña-Loaiza, Omar S.; O'Sullivan, Malcolm N.; Rodenburg, Brandon; Malik, Mehul; Lavery, Martin P. J.; Padgett, Miles J.; Gauthier, Daniel J.; Boyd, Robert W.
2015-03-01
Quantum key distribution (QKD) systems often rely on polarization of light for encoding, thus limiting the amount of information that can be sent per photon and placing tight bounds on the error rates that such a system can tolerate. Here we describe a proof-of-principle experiment that indicates the feasibility of high-dimensional QKD based on the transverse structure of the light field allowing for the transfer of more than 1 bit per photon. Our implementation uses the orbital angular momentum (OAM) of photons and the corresponding mutually unbiased basis of angular position (ANG). Our experiment uses a digital micro-mirror device for the rapid generation of OAM and ANG modes at 4 kHz, and a mode sorter capable of sorting single photons based on their OAM and ANG content with a separation efficiency of 93%. Through the use of a seven-dimensional alphabet encoded in the OAM and ANG bases, we achieve a channel capacity of 2.05 bits per sifted photon. Our experiment demonstrates that, in addition to having an increased information capacity, multilevel QKD systems based on spatial-mode encoding can be more resilient against intercept-resend eavesdropping attacks.
NASA Astrophysics Data System (ADS)
Jeong, Youn-Chang; Kim, Yong-Su; Kim, Yoon-Ho
2016-01-01
The decoy-state method allows the use of weak coherent pulses in quantum cryptography, and to date, various strategies for the decoy state have been proposed. Here, we experimentally compare the secret key generation rates between the one-decoy and two-decoy implementations of the Bennett-Brassard 1984 (BB84) quantum key distribution protocol through a 3.1-km optical fiber at 780 nm. Once the parameters of the experimental setup are optimized for the maximal secret key generation rate for each implementation, it is found that the two-decoy implementation outperforms the one-decoy implementation.
Security of two quantum cryptography protocols using the same four qubit states
Branciard, Cyril; Gisin, Nicolas; Kraus, Barbara; Scarani, Valerio
2005-09-15
The first quantum cryptography protocol, proposed by Bennett and Brassard in 1984 (BB84), has been widely studied in recent years. This protocol uses four states (more precisely, two complementary bases) for the encoding of the classical bit. Recently, it has been noticed that by using the same four states, but a different encoding of information, one can define a protocol which is more robust in practical implementations, specifically when attenuated laser pulses are used instead of single-photon sources [V. Scarani et al., Phys. Rev. Lett. 92, 057901 (2004), referred to as the SARG04 protocol]. We present a detailed study of SARG04 in two different regimes. In the first part, we consider an implementation with a single-photon source: we derive bounds on the error rate Q for security against all possible attacks by the eavesdropper. The lower and the upper bound obtained for SARG04 (Q < or approx. 10.95% and Q > or approx. 14.9%, respectively) are close to those obtained for BB84 (Q < or approx. 12.4% and Q > or approx. 14.6%, respectively). In the second part, we consider a realistic source consisting of an attenuated laser and improve on previous analysis by allowing Alice to optimize the mean number of photons as a function of the distance. The SARG04 protocol is found to perform better than BB84, both in secret-key rate and in maximal achievable distance, for a wide class of Eve's attacks.
Renner, R; Cirac, J I
2009-03-20
We show that the quantum de Finetti theorem holds for states on infinite-dimensional systems, provided they satisfy certain experimentally verifiable conditions. This result can be applied to prove the security of quantum key distribution based on weak coherent states or other continuous variable states against general attacks.
Renner, R; Cirac, J I
2009-03-20
We show that the quantum de Finetti theorem holds for states on infinite-dimensional systems, provided they satisfy certain experimentally verifiable conditions. This result can be applied to prove the security of quantum key distribution based on weak coherent states or other continuous variable states against general attacks. PMID:19392183
Kaszlikowski, Dagomir; Lim, J.Y.; Englert, Berthold-Georg; Kwek, L.C.
2005-10-15
The security of a cryptographic key that is generated by communication through a noisy quantum channel relies on the ability to distill a shorter secure key sequence from a longer insecure one. We show that - for protocols that use quantum channels of any dimension and completely characterize them by state tomography - the noise threshold for classical advantage distillation of a specific kind is substantially lower than the threshold for quantum entanglement distillation if the eavesdropper can perform powerful coherent attacks. In marked contrast, earlier investigations had shown that the thresholds are identical for incoherent attacks on the same classical distillation scheme. It remains an open question whether other schemes for classical advantage distillation have higher thresholds for coherent eavesdropping attacks.
ERIC Educational Resources Information Center
Hall, Matthew
2003-01-01
Uses cryptography to demonstrate the importance of algebra and the use of technology as an effective real application of mathematics. Explains simple encoding and decoding of messages for student learning of modular arithmetic. This elementary encounter with cryptography along with its historical and modern background serves to motivate student…
ERIC Educational Resources Information Center
Wright, Marie A.
1993-01-01
Cryptography is the science that renders data unintelligible to prevent its unauthorized disclosure or modification. Presents an application of matrices used in linear transformations to illustrate a cryptographic system. An example is provided. (17 references) (MDH)
Niederberger, Armand; Scarani, Valerio; Gisin, Nicolas
2005-04-01
In practical quantum cryptography, the source sometimes produces multiphoton pulses, thus enabling the eavesdropper Eve to perform the powerful photon-number-splitting (PNS) attack. Recently, it was shown by Curty and Luetkenhaus [Phys. Rev. A 69, 042321 (2004)] that the PNS attack is not always the optimal attack when two photons are present: if errors are present in the correlations Alice-Bob and if Eve cannot modify Bob's detection efficiency, Eve gains a larger amount of information using another attack based on a 2{yields}3 cloning machine. In this work, we extend this analysis to all distances Alice-Bob. We identify a new incoherent 2{yields}3 cloning attack which performs better than those described before. Using it, we confirm that, in the presence of errors, Eve's better strategy uses 2{yields}3 cloning attacks instead of the PNS. However, this improvement is very small for the implementations of the Bennett-Brassard 1984 (BB84) protocol. Thus, the existence of these new attacks is conceptually interesting but basically does not change the value of the security parameters of BB84. The main results are valid both for Poissonian and sub-Poissonian sources.
Faint laser pulses versus a single-photon source in free space quantum cryptography
NASA Astrophysics Data System (ADS)
Molotkov, S. N.; Potapova, T. A.
2016-03-01
In this letter we present estimates for the distance of secret key transmission through free space for three different protocols of quantum key distribution: for BB84 and phase time-coding protocols in the case of a strictly single-photon source, and for the relativistic quantum key distribution protocol in the case of faint laser pulses.
Private classical capacity with a symmetric side channel and its application to quantum cryptography
NASA Astrophysics Data System (ADS)
Smith, Graeme
2008-08-01
We study the symmetric-side-channel-assisted private capacity of a quantum channel, for which we provide a single-letter formula. This capacity is additive, convex, and, for degradable channels, equal to the unassisted private capacity. While a channel’s (unassisted) capacity for private classical communication may be strictly larger than its quantum capacity, we will show that these capacities are equal for degradable channels, thus demonstrating the equivalence of privacy and quantum coherence in this context. We use these ideas to find new bounds on the key rate of quantum key distribution protocols with one-way classical post-processing. For the Bennett-Brassard 1984 protocol, our results demonstrate that collective attacks are strictly stronger than individual attacks.
Quantum cryptography: individual eavesdropping with the knowledge of the error-correcting protocol
Horoshko, D B
2007-12-31
The quantum key distribution protocol BB84 combined with the repetition protocol for error correction is analysed from the point of view of its security against individual eavesdropping relying on quantum memory. It is shown that the mere knowledge of the error-correcting protocol changes the optimal attack and provides the eavesdropper with additional information on the distributed key. (fifth seminar in memory of d.n. klyshko)
NASA Astrophysics Data System (ADS)
Jacak, Monika; Melniczuk, Damian; Jacak, Janusz; Jóźwiak, Ireneusz; Gruber, Jacek; Jóźwiak, Piotr
2015-02-01
In order to assess the susceptibility of the quantum key distribution (QKD) systems to the hacking attack including simultaneous and frequent system self-decalibrations, we analyze the stability of the QKD transmission organized in two commercially available systems. The first one employs non-entangled photons as flying qubits in the dark quantum channel for communication whereas the second one utilizes the entangled photon pairs to secretly share the cryptographic key. Applying standard methods of the statistical data analysis to the characteristic indicators of the quality of the QKD communication (the raw key exchange rate [RKER] and the quantum bit error rate [QBER]), we have estimated the pace of the self-decalibration of both systems and the repeatability rate in the case of controlled worsening of the dark channel quality.
Security of coherent-state quantum cryptography in the presence of Gaussian noise
Heid, Matthias; Luetkenhaus, Norbert
2007-08-15
We investigate the security against collective attacks of a continuous variable quantum key distribution scheme in the asymptotic key limit for a realistic setting. The quantum channel connecting the two honest parties is assumed to be lossy and imposes Gaussian noise on the observed quadrature distributions. Secret key rates are given for direct and reverse reconciliation schemes including post-selection in the collective attack scenario. The effect of a nonideal error correction and two-way communication in the classical post-processing step is also taken into account.
Continuous-variable quantum cryptography is secure against non-Gaussian attacks.
Grosshans, Frédéric; Cerf, Nicolas J
2004-01-30
A general study of arbitrary finite-size coherent attacks against continuous-variable quantum cryptographic schemes is presented. It is shown that, if the size of the blocks that can be coherently attacked by an eavesdropper is fixed and much smaller than the key size, then the optimal attack for a given signal-to-noise ratio in the transmission line is an individual Gaussian attack. Consequently, non-Gaussian coherent attacks do not need to be considered in the security analysis of such quantum cryptosystems.
Beating the photon-number-splitting attack in practical quantum cryptography.
Wang, Xiang-Bin
2005-06-17
We propose an efficient method to verify the upper bound of the fraction of counts caused by multiphoton pulses in practical quantum key distribution using weak coherent light, given whatever type of Eve's action. The protocol simply uses two coherent states for the signal pulses and vacuum for the decoy pulse. Our verified upper bound is sufficiently tight for quantum key distribution with a very lossy channel, in both the asymptotic and nonasymptotic case. So far our protocol is the only decoy-state protocol that works efficiently for currently existing setups.
Trojan-horse attacks threaten the security of practical quantum cryptography
NASA Astrophysics Data System (ADS)
Jain, Nitin; Anisimova, Elena; Khan, Imran; Makarov, Vadim; Marquardt, Christoph; Leuchs, Gerd
2014-12-01
A quantum key distribution (QKD) system may be probed by an eavesdropper Eve by sending in bright light from the quantum channel and analyzing the back-reflections. We propose and experimentally demonstrate a setup for mounting such a Trojan-horse attack. We show it in operation against the quantum cryptosystem Clavis2 from ID Quantique, as a proof-of-principle. With just a few back-reflected photons, Eve discerns Bob's (secret) basis choice, and thus the raw key bit in the Scarani-Acín-Ribordy-Gisin 2004 protocol, with higher than 90% probability. This would clearly breach the security of the cryptosystem. Unfortunately, Eve's bright pulses have a side effect of causing a high level of afterpulsing in Bob's single-photon detectors, resulting in a large quantum bit error rate that effectively protects this system from our attack. However, in a Clavis2-like system equipped with detectors with less-noisy but realistic characteristics, an attack strategy with positive leakage of the key would exist. We confirm this by a numerical simulation. Both the eavesdropping setup and strategy can be generalized to attack most of the current QKD systems, especially if they lack proper safeguards. We also propose countermeasures to prevent such attacks.
Scarani, Valerio; Acín, Antonio; Ribordy, Grégoire; Gisin, Nicolas
2004-02-01
We introduce a new class of quantum key distribution protocols, tailored to be robust against photon number splitting (PNS) attacks. We study one of these protocols, which differs from the original protocol by Bennett and Brassard (BB84) only in the classical sifting procedure. This protocol is provably better than BB84 against PNS attacks at zero error. PMID:14995344
Scarani, Valerio; Acín, Antonio; Ribordy, Grégoire; Gisin, Nicolas
2004-02-01
We introduce a new class of quantum key distribution protocols, tailored to be robust against photon number splitting (PNS) attacks. We study one of these protocols, which differs from the original protocol by Bennett and Brassard (BB84) only in the classical sifting procedure. This protocol is provably better than BB84 against PNS attacks at zero error.
Advanced techniques for free-space optical quantum cryptography over water
NASA Astrophysics Data System (ADS)
Hill, Alexander D.; Christensen, Bradley; Kwiat, Paul G.
2016-03-01
Free-space quantum key distribution (QKD) over water (e.g., ship to ship) may be limited by ship motion and atmospheric effects, such as mode distortion and beam wander due to turbulence. We report on a technique which reduces noise by excluding spatial modes which are less likely to contain QKD signal photons and experimentally demonstrate an improvement in QKD key generation rates in various noise and turbulence regimes.
Zhou, Ming; Chang, Shoude; Grover, Chander
2004-06-28
Further to the optical coding based on fluorescent semiconductor quantum dots (QDs), a concept of using mixtures of multiple single-color QDs for creating highly secret cryptograms based on their absorption/emission properties was demonstrated. The key to readout of the optical codes is a group of excitation lights with the predetermined wavelengths programmed in a secret manner. The cryptograms can be printed on the surfaces of different objects such as valuable documents for security purposes.
Hybrid ququart-encoded quantum cryptography protected by Kochen-Specker contextuality
Cabello, Adan; D'Ambrosio, Vincenzo; Nagali, Eleonora; Sciarrino, Fabio
2011-09-15
Quantum cryptographic protocols based on complementarity are not secure against attacks in which complementarity is imitated with classical resources. The Kochen-Specker (KS) theorem provides protection against these attacks, without requiring entanglement or spatially separated composite systems. We analyze the maximum tolerated noise to guarantee the security of a KS-protected cryptographic scheme against these attacks and describe a photonic realization of this scheme using hybrid ququarts defined by the polarization and orbital angular momentum of single photons.
Continuous variable quantum cryptography: beating the 3 dB loss limit.
Silberhorn, Ch; Ralph, T C; Lütkenhaus, N; Leuchs, G
2002-10-14
We demonstrate that secure quantum key distribution systems based on continuous variable implementations can operate beyond the apparent 3 dB loss limit that is implied by the beam splitting attack. The loss limit was established for standard minimum uncertainty states such as coherent states. We show that, by an appropriate postselection mechanism, we can enter a region where Eve's knowledge on Alice's key falls behind the information shared between Alice and Bob, even in the presence of substantial losses.
Modeling light entangled in polarization and frequency: case study in quantum cryptography
NASA Astrophysics Data System (ADS)
Myers, John M.
2005-08-01
With the recognition of a logical gap between experiments and equations of quantum mechanics comes: (1) a chance to clarify such purely mathematical entities as probabilities, density operators, and partial traces-separated out from the choices and judgments necessary to apply them to describing experiments with devices, and (2) an added freedom to invent equations by which to model devices, stemming from the corresponding freedom in interpreting how these equations connect to experiments. Here I apply a few of these clarifications and freedoms to model polarization-entangled light pulses called for in quantum key distribution (QKD). Available light pulses are entangled not only in polarization but also in frequency. Although absent from the simplified models that initiated QKD, the degree of frequency entanglement of polarization-entangled light pulses is shown to affect the amount of key that can be distilled from raw light signals, in one case by a factor of 4/3. Open questions remain, because QKD brings concepts of quantum decision theory, such as measures of distinguishability, mostly worked out in the context of finite-dimensional vector spaces, into contact with infinite-dimensional Hilbert spaces needed to give expression to optical frequency spectra.
General immunity and superadditivity of two-way Gaussian quantum cryptography.
Ottaviani, Carlo; Pirandola, Stefano
2016-03-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.
General immunity and superadditivity of two-way Gaussian quantum cryptography
NASA Astrophysics Data System (ADS)
Ottaviani, Carlo; Pirandola, Stefano
2016-03-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.
General immunity and superadditivity of two-way Gaussian quantum cryptography
Ottaviani, Carlo; Pirandola, Stefano
2016-01-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks. PMID:26928053
General immunity and superadditivity of two-way Gaussian quantum cryptography.
Ottaviani, Carlo; Pirandola, Stefano
2016-01-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks. PMID:26928053
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2015-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
Quantifying the leakage of quantum protocols for classical two-party cryptography
NASA Astrophysics Data System (ADS)
Salvail, Louis; Schaffner, Christian; Sotáková, Miroslava
2014-12-01
We study quantum protocols among two distrustful parties. By adopting a rather strict definition of correctness — guaranteeing that honest players obtain their correct outcomes only — we can show that every strictly correct quantum protocol implementing a non-trivial classical primitive necessarily leaks information to a dishonest player. This extends known impossibility results to all non-trivial primitives. We provide a framework for quantifying this leakage and argue that leakage is a good measure for the privacy provided to the players by a given protocol. Our framework also covers the case where the two players are helped by a trusted third party. We show that despite the help of a trusted third party, the players cannot amplify the cryptographic power of any primitive. All our results hold even against quantum honest-but-curious adversaries who honestly follow the protocol but purify their actions and apply a different measurement at the end of the protocol. As concrete examples, we establish lower bounds on the leakage of standard universal two-party primitives such as oblivious transfer.
A simple coherent attack and practical security of differential phase shift quantum cryptography
NASA Astrophysics Data System (ADS)
Kronberg, D. A.
2014-02-01
The differential phase shift quantum key distribution protocol reveals good security against such powerful attacks as unambiguous state discrimination and beam splitting attacks. Its complete security analysis is complex due to high dimensions of the supposed spaces and density operators. In this paper, we consider a particular and conceptually simple coherent attack, available in practical implementations. The main condition for this attack is the length of used coherent state tuples of order 8-12. We show that under this condition, no high level of practical distance between legitimate users can be achieved.
Cryptographic robustness of a quantum cryptography system using phase-time coding
Molotkov, S. N.
2008-01-15
A cryptographic analysis is presented of a new quantum key distribution protocol using phase-time coding. An upper bound is obtained for the error rate that guarantees secure key distribution. It is shown that the maximum tolerable error rate for this protocol depends on the counting rate in the control time slot. When no counts are detected in the control time slot, the protocol guarantees secure key distribution if the bit error rate in the sifted key does not exceed 50%. This protocol partially discriminates between errors due to system defects (e.g., imbalance of a fiber-optic interferometer) and eavesdropping. In the absence of eavesdropping, the counts detected in the control time slot are not caused by interferometer imbalance, which reduces the requirements for interferometer stability.
Discrete and continuous variables for measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Qian, Li; Lo, Hoi-Kwong
2015-11-16
In a recent Article in Nature Photonics, Pirandola et al.1 claim that the achievable secret key rates of discrete-variable (DV) measurementdevice- independent (MDI) quantum key distribution (QKD) (refs 2,3) are “typically very low, unsuitable for the demands of a metropolitan network” and introduce a continuous-variable (CV) MDI QKD protocol capable of providing key rates which, they claim, are “three orders of magnitude higher” than those of DV MDI QKD. We believe, however, that the claims regarding low key rates of DV MDI QKD made by Pirandola et al.1 are too pessimistic. Here in this paper, we show that the secretmore » key rate of DV MDI QKD with commercially available high-efficiency single-photon detectors (SPDs) (for example, see http://www.photonspot.com/detectors and http://www.singlequantum.com) and good system alignment is typically rather high and thus highly suitable for not only long-distance communication but also metropolitan networks.« less
Discrete and continuous variables for measurement-device-independent quantum cryptography
Xu, Feihu; Curty, Marcos; Qi, Bing; Qian, Li; Lo, Hoi-Kwong
2015-11-16
In a recent Article in Nature Photonics, Pirandola et al.1 claim that the achievable secret key rates of discrete-variable (DV) measurementdevice- independent (MDI) quantum key distribution (QKD) (refs 2,3) are “typically very low, unsuitable for the demands of a metropolitan network” and introduce a continuous-variable (CV) MDI QKD protocol capable of providing key rates which, they claim, are “three orders of magnitude higher” than those of DV MDI QKD. We believe, however, that the claims regarding low key rates of DV MDI QKD made by Pirandola et al.1 are too pessimistic. Here in this paper, we show that the secret key rate of DV MDI QKD with commercially available high-efficiency single-photon detectors (SPDs) (for example, see http://www.photonspot.com/detectors and http://www.singlequantum.com) and good system alignment is typically rather high and thus highly suitable for not only long-distance communication but also metropolitan networks.
ERIC Educational Resources Information Center
Bachman, Dale J.; Brown, Ezra A.; Norton, Anderson H.
2010-01-01
Cryptography is the science of hidden or secret writing. More generally, cryptography refers to the science of safeguarding information. Cryptography allows people to use a public medium such as the Internet to transmit private information securely, thus enabling a whole range of conveniences, from online shopping to personally printed movie…
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
NASA Astrophysics Data System (ADS)
Broadbent, Anne
2016-08-01
In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that instantaneous nonlocal quantum computation is possible, at the cost of an exponential amount of prior shared entanglement (in the size of the input). Here, we show that a linear amount of entanglement suffices, (in the size of the computation), as long as the parties share nonlocal correlations as given by the Popescu-Rohrlich box. This means that communication is not required for efficient instantaneous nonlocal quantum computation. Exploiting the well-known relation to position-based cryptography, our result also implies the impossibility of secure position-based cryptography against adversaries with nonsignaling correlations. Furthermore, our construction establishes a quantum analog of the classical communication complexity collapse under nonsignaling correlations.
High-speed data encryption over 25 km of fiber by two-mode coherent-state quantum cryptography.
Corndorf, Eric; Barbosa, Geraldo; Liang, Chuang; Yuen, Horace P; Kumar, Prem
2003-11-01
We demonstrate high-speed (250 Mbps) data encryption over 25 km of telecommunication fiber by use of coherent states. For the parameter values used in the experiment, the demonstration is secure against individual ciphertext-only eavesdropping attacks near the transmitter with ideal detection equipment. Whereas other quantum-cryptographic schemes require the use of fragile quantum states and ultrasensitive detection equipment, our protocol is loss tolerant, uses off-the-shelf components, and is optically amplifiable.
ERIC Educational Resources Information Center
Tapson, Frank
1996-01-01
Describes public key cryptography, also known as RSA, which is a system using two keys, one used to put a message into cipher and another used to decipher the message. Presents examples using small prime numbers. (MKR)
Neural cryptography with feedback.
Ruttor, Andreas; Kinzel, Wolfgang; Shacham, Lanir; Kanter, Ido
2004-04-01
Neural cryptography is based on a competition between attractive and repulsive stochastic forces. A feedback mechanism is added to neural cryptography which increases the repulsive forces. Using numerical simulations and an analytic approach, the probability of a successful attack is calculated for different model parameters. Scaling laws are derived which show that feedback improves the security of the system. In addition, a network with feedback generates a pseudorandom bit sequence which can be used to encrypt and decrypt a secret message.
Molotkov, S. N.
2012-12-15
Any key-generation session contains a finite number of quantum-state messages, and it is there-fore important to understand the fundamental restrictions imposed on the minimal length of a string required to obtain a secret key with a specified length. The entropy uncertainty relations for smooth min and max entropies considerably simplify and shorten the proof of security. A proof of security of quantum key distribution with phase-temporal encryption is presented. This protocol provides the maximum critical error compared to other protocols up to which secure key distribution is guaranteed. In addition, unlike other basic protocols (of the BB84 type), which are vulnerable with respect to an attack by 'blinding' of avalanche photodetectors, this protocol is stable with respect to such an attack and guarantees key security.
Zhou, Zhi; Arce, Gonzalo R; Di Crescenzo, Giovanni
2006-08-01
Visual cryptography encodes a secret binary image (SI) into n shares of random binary patterns. If the shares are xeroxed onto transparencies, the secret image can be visually decoded by superimposing a qualified subset of transparencies, but no secret information can be obtained from the superposition of a forbidden subset. The binary patterns of the n shares, however, have no visual meaning and hinder the objectives of visual cryptography. Extended visual cryptography [1] was proposed recently to construct meaningful binary images as shares using hypergraph colourings, but the visual quality is poor. In this paper, a novel technique named halftone visual cryptography is proposed to achieve visual cryptography via halftoning. Based on the blue-noise dithering principles, the proposed method utilizes the void and cluster algorithm [2] to encode a secret binary image into n halftone shares (images) carrying significant visual information. The simulation shows that the visual quality of the obtained halftone shares are observably better than that attained by any available visual cryptography method known to date.
Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP.
Bennett, Charles H; Brassard, Gilles; Breidbart, Seth
2014-01-01
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of being detected. With such a channel, a one-time pad can safely be reused many times as long as no eavesdrop is detected, and, planning ahead, part of the capacity of these uncompromised transmissions can be used to send fresh random bits with which to replace the one-time pad when an eavesdrop finally is detected. Unlike other schemes for stretching a one-time pad, this scheme does not depend on complexity-theoretic assumptions such as the difficulty of factoring.
NASA Astrophysics Data System (ADS)
Jiang, Mu-Sheng; Sun, Shi-Hai; Tang, Guang-Zhao; Ma, Xiang-Chun; Li, Chun-Yan; Liang, Lin-Mei
2013-12-01
Thanks to the high-speed self-differencing single-photon detector (SD-SPD), the secret key rate of quantum key distribution (QKD), which can, in principle, offer unconditionally secure private communications between two users (Alice and Bob), can exceed 1 Mbit/s. However, the SD-SPD may contain loopholes, which can be exploited by an eavesdropper (Eve) to hack into the unconditional security of the high-speed QKD systems. In this paper, we analyze the fact that the SD-SPD can be remotely controlled by Eve in order to spy on full information without being discovered, then proof-of-principle experiments are demonstrated. Here, we point out that this loophole is introduced directly by the operating principle of the SD-SPD, thus, it cannot be removed, except for the fact that some active countermeasures are applied by the legitimate parties.
Scarani, Valerio; Renner, Renato
2008-05-23
We derive a bound for the security of quantum key distribution with finite resources under one-way postprocessing, based on a definition of security that is composable and has an operational meaning. While our proof relies on the assumption of collective attacks, unconditional security follows immediately for standard protocols such as Bennett-Brassard 1984 and six-states protocol. For single-qubit implementations of such protocols, we find that the secret key rate becomes positive when at least N approximately 10(5) signals are exchanged and processed. For any other discrete-variable protocol, unconditional security can be obtained using the exponential de Finetti theorem, but the additional overhead leads to very pessimistic estimates.
Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP.
Bennett, Charles H; Brassard, Gilles; Breidbart, Seth
2014-01-01
When elementary quantum systems, such as polarized photons, are used to transmit digital information, the uncertainty principle gives rise to novel cryptographic phenomena unachievable with traditional transmission media, e.g. a communications channel on which it is impossible in principle to eavesdrop without a high probability of being detected. With such a channel, a one-time pad can safely be reused many times as long as no eavesdrop is detected, and, planning ahead, part of the capacity of these uncompromised transmissions can be used to send fresh random bits with which to replace the one-time pad when an eavesdrop finally is detected. Unlike other schemes for stretching a one-time pad, this scheme does not depend on complexity-theoretic assumptions such as the difficulty of factoring. PMID:25400534
Dynamics of neural cryptography.
Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido
2007-05-01
Synchronization of neural networks has been used for public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.
Dynamics of neural cryptography
Ruttor, Andreas; Kinzel, Wolfgang; Kanter, Ido
2007-05-15
Synchronization of neural networks has been used for public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.
Visual cryptography by use of polarization
NASA Astrophysics Data System (ADS)
Yamamoto, Hirotsugu; Imagawa, Takanori; Suyama, Shiro
2010-01-01
Visual cryptography is a powerful method to share secret information, such as identification numbers, between plural members. There have been many papers on visual cryptography by use of intensity modulation. Although the use of intensity modulation is suitable for printing, degradation of image quality is a problem. Another problem for conventional visual cryptography is a risk of theft of physical keys. To cope with these problems, we propose a new field of visual cryptography by use of polarization. In this study, we have implemented polarization decoding by stacking films. Use of polarization processing improves image quality of visual cryptography. The purpose of this paper is to construct visual cryptography based on polarization processing. Furthermore, we construct a new type of visual cryptography that uses stacking order as a key for decryption. The use of stacking order multiplies the complexity of encryption. Then, it is effective to prevent secret against theft because the theft cannot determine the secret only by collecting encrypted films.
Practicality of quantum information processing
NASA Astrophysics Data System (ADS)
Lau, Hoi-Kwan
Quantum Information Processing (QIP) is expected to bring revolutionary enhancement to various technological areas. However, today's QIP applications are far from being practical. The problem involves both hardware issues, i.e., quantum devices are imperfect, and software issues, i.e., the functionality of some QIP applications is not fully understood. Aiming to improve the practicality of QIP, in my PhD research I have studied various topics in quantum cryptography and ion trap quantum computation. In quantum cryptography, I first studied the security of position-based quantum cryptography (PBQC). I discovered a wrong assumption in the previous literature that the cheaters are not allowed to share entangled resources. I proposed entanglement attacks that could cheat all known PBQC protocols. I also studied the practicality of continuous-variable (CV) quantum secret sharing (QSS). While the security of CV QSS was considered by the literature only in the limit of infinite squeezing, I found that finitely squeezed CV resources could also provide finite secret sharing rate. Our work relaxes the stringent resources requirement of implementing QSS. In ion trap quantum computation, I studied the phase error of quantum information induced by dc Stark effect during ion transportation. I found an optimized ion trajectory for which the phase error is the minimum. I also defined a threshold speed, above which ion transportation would induce significant error. In addition, I proposed a new application for ion trap systems as universal bosonic simulators (UBS). I introduced two architectures, and discussed their respective strength and weakness. I illustrated the implementations of bosonic state initialization, transformation, and measurement by applying radiation fields or by varying the trap potential. When comparing with conducting optical experiments, the ion trap UBS is advantageous in higher state initialization efficiency and higher measurement accuracy. Finally, I
Cryptography as a Pedagogical Tool
ERIC Educational Resources Information Center
Kaur, Manmohan
2008-01-01
In order to get undergraduates interested in mathematics, it is necessary to motivate them, give them good reasons to spend time on a subject that requires hard work, and, if possible, involve them in undergraduate research. This article discusses how cryptography can be used for all these purposes. In particular, a special topics course on…
Finding Cryptography in Object Code
Jason L. Wright
2008-10-01
Finding and identifying Cryptography is a growing concern in the malware analysis community. In this paper, a heuristic method for determining the likelihood that a given function contains a cryptographic algorithm is discussed and the results of applying this method in various environments is shown. The algorithm is based on frequency analysis of opcodes that make up each function within a binary.
Secure quantum key distribution
NASA Astrophysics Data System (ADS)
Lo, Hoi-Kwong; Curty, Marcos; Tamaki, Kiyoshi
2014-08-01
Secure communication is crucial in the Internet Age, and quantum mechanics stands poised to revolutionize cryptography as we know it today. In this Review, we introduce the motivation and the current state of the art of research in quantum cryptography. In particular, we discuss the present security model together with its assumptions, strengths and weaknesses. After briefly introducing recent experimental progress and challenges, we survey the latest developments in quantum hacking and countermeasures against it.
Cryptography with DNA binary strands.
Leier, A; Richter, C; Banzhaf, W; Rauhe, H
2000-06-01
Biotechnological methods can be used for cryptography. Here two different cryptographic approaches based on DNA binary strands are shown. The first approach shows how DNA binary strands can be used for steganography, a technique of encryption by information hiding, to provide rapid encryption and decryption. It is shown that DNA steganography based on DNA binary strands is secure under the assumption that an interceptor has the same technological capabilities as sender and receiver of encrypted messages. The second approach shown here is based on steganography and a method of graphical subtraction of binary gel-images. It can be used to constitute a molecular checksum and can be combined with the first approach to support encryption. DNA cryptography might become of practical relevance in the context of labelling organic and inorganic materials with DNA 'barcodes'.
Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
American Council on Education, Washington, DC.
Concerns of the National Security Agency (NSA) that information contained in some articles about cryptography in learned and professional journals and in monographs might be inimical to the national security are addressed. The Public Cryptography Study Group, with one dissenting opinion, recommends that a voluntary system of prior review of…
Quantum entanglement, quantum communication and the limits of quantum computing
NASA Astrophysics Data System (ADS)
Ambainis, Andris
Quantum entanglement is a term describing the quantum correlations between different parts of a quantum system. Quantum information theory has developed sophisticated techniques to quantify and study quantum entanglement. In this thesis, we show how to apply those techniques to problems in quantum algorithms, complexity theory, communication and cryptography. The main results are: (1) quantum communication protocols that are exponentially more efficient that conventional (classical) communication protocols, (2) unconditionally secure quantum protocols for cryptographic problems, (3) a new "quantum adversary" method for proving lower bounds on quantum algorithms, (4) a study of "one clean qubit computation", a model related to the experimental implementation of quantum computers using NMR (nucleo-magnetic resonance) technology.
Cooperating attackers in neural cryptography.
Shacham, Lanir N; Klein, Einat; Mislovaty, Rachel; Kanter, Ido; Kinzel, Wolfgang
2004-06-01
A successful attack strategy in neural cryptography is presented. The neural cryptosystem, based on synchronization of neural networks by mutual learning, has been recently shown to be secure under different attack strategies. The success of the advanced attacker presented here, called the "majority-flipping attacker," does not decay with the parameters of the model. This attacker's outstanding success is due to its using a group of attackers which cooperate throughout the synchronization process, unlike any other attack strategy known. An analytical description of this attack is also presented, and fits the results of simulations.
Eavesdropping without quantum memory
Bechmann-Pasquinucci, H.
2006-04-15
In quantum cryptography the optimal eavesdropping strategy requires that the eavesdropper uses ancillas and quantum memories in order to optimize her information. What happens if the eavesdropper has no quantum memory? It is shown that in this case the eavesdropper obtains a better information/disturbance trade-off by adopting the simple intercept/resend strategy.
NASA Astrophysics Data System (ADS)
Weinfurter, Harald; Zeilinger, Anton
Quantum entanglement lies at the heart of the new field of quantum communication and computation. For a long time, entanglement was seen just as one of those fancy features which make quantum mechanics so counterintuitive. But recently, quantum information theory has shown the tremendous importance of quantum correlations for the formulation of new methods of information transfer and for algorithms exploiting the capabilities of quantum computers.This chapter describes the first experimental realizations of quantum communication schemes using entangled photon pairs. We show how to make communication secure against eavesdropping using entanglement-based quantum cryptography, how to increase the information capacity of a quantum channel by quantum dense coding and, finally, how to communicate quantum information itself in the process of quantum teleportation.
Arithmetic for Public-Key Cryptography
NASA Astrophysics Data System (ADS)
Sakiyama, Kazuo; Batina, Lejla
In this chapter, we discuss arithmetic algorithms used for implementing public-key cryptography (PKC). More precisely, we explore the various algorithms for RSA exponentiation and point/divisor multiplication for curve-based cryptography. The selection of the algorithms has a profound impact on the trade-off between cost, performance, and security. The goal of this chapter is to introduce the different recoding techniques to reduce the number of computations efficiently.
Cryptographie quantique à variables continues
NASA Astrophysics Data System (ADS)
Bencheikh, K.; Jankovic, A.; Symul, T.; Levenson, J. A.
2002-06-01
Nous avons élaboré un protocole de cryptographie quantique qui permet de générer et de distribuer une clé secrète aléatoire. Le protocole repose sur l'utilisation de paires de champs électromagnétiques dont les quadratures présentent des corrélations quantiques de type Einstein-Podolsky-Rosen. Les fluctuations quantiques instantanése constituent les bits aléatoires de la clé secrète, et la dégradation irréversible des corrélations quantiques des quadratures causée par une tierce personne permet de la détecter et de garantir la sécurité d'échange.
Genetic attack on neural cryptography.
Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido
2006-03-01
Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.
Cheating prevention in visual cryptography.
Hu, Chih-Ming; Tzeng, Wen-Guey
2007-01-01
Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. Most of the previous research work on VC focuses on improving two parameters: pixel expansion and contrast. In this paper, we studied the cheating problem in VC and extended VC. We considered the attacks of malicious adversaries who may deviate from the scheme in any way. We presented three cheating methods and applied them on attacking existent VC or extended VC schemes. We improved one cheat-preventing scheme. We proposed a generic method that converts a VCS to another VCS that has the property of cheating prevention. The overhead of the conversion is near optimal in both contrast degression and pixel expansion.
Genetic attack on neural cryptography
Ruttor, Andreas; Kinzel, Wolfgang; Naeh, Rivka; Kanter, Ido
2006-03-15
Different scaling properties for the complexity of bidirectional synchronization and unidirectional learning are essential for the security of neural cryptography. Incrementing the synaptic depth of the networks increases the synchronization time only polynomially, but the success of the geometric attack is reduced exponentially and it clearly fails in the limit of infinite synaptic depth. This method is improved by adding a genetic algorithm, which selects the fittest neural networks. The probability of a successful genetic attack is calculated for different model parameters using numerical simulations. The results show that scaling laws observed in the case of other attacks hold for the improved algorithm, too. The number of networks needed for an effective attack grows exponentially with increasing synaptic depth. In addition, finite-size effects caused by Hebbian and anti-Hebbian learning are analyzed. These learning rules converge to the random walk rule if the synaptic depth is small compared to the square root of the system size.
Quantum computing with trapped ions
Hughes, R.J.
1998-01-01
The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.
Course 10: Basic Concepts in Quantum Computation
NASA Astrophysics Data System (ADS)
Ekert, A.; Hayden, P. M.; Inamori, H.
Contents 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarks
Neural Network Approach to Locating Cryptography in Object Code
Jason L. Wright; Milos Manic
2009-09-01
Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.
Color extended visual cryptography using error diffusion.
Kang, InKoo; Arce, Gonzalo R; Lee, Heung-Kyu
2011-01-01
Color visual cryptography (VC) encrypts a color secret message into n color halftone image shares. Previous methods in the literature show good results for black and white or gray scale VC schemes, however, they are not sufficient to be applied directly to color shares due to different color structures. Some methods for color visual cryptography are not satisfactory in terms of producing either meaningless shares or meaningful shares with low visual quality, leading to suspicion of encryption. This paper introduces the concept of visual information pixel (VIP) synchronization and error diffusion to attain a color visual cryptography encryption method that produces meaningful color shares with high visual quality. VIP synchronization retains the positions of pixels carrying visual information of original images throughout the color channels and error diffusion generates shares pleasant to human eyes. Comparisons with previous approaches show the superior performance of the new method.
Number Theory and Public-Key Cryptography.
ERIC Educational Resources Information Center
Lefton, Phyllis
1991-01-01
Described are activities in the study of techniques used to conceal the meanings of messages and data. Some background information and two BASIC programs that illustrate the algorithms used in a new cryptographic system called "public-key cryptography" are included. (CW)
Report on Pairing-based Cryptography.
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST's position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed.
Harry Potter and the Cryptography with Matrices
ERIC Educational Resources Information Center
Chua, Boon Liang
2006-01-01
This article describes Cryptography, defined as the science of encrypting and deciphering messages written in secret codes, it has played a vital role in securing information since ancient times. There are several cryptographic techniques and many make extensive use of mathematics to secure information. The author discusses an activity built…
Report on Pairing-based Cryptography
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST’s position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435
Report on Pairing-based Cryptography.
Moody, Dustin; Peralta, Rene; Perlner, Ray; Regenscheid, Andrew; Roginsky, Allen; Chen, Lily
2015-01-01
This report summarizes study results on pairing-based cryptography. The main purpose of the study is to form NIST's position on standardizing and recommending pairing-based cryptography schemes currently published in research literature and standardized in other standard bodies. The report reviews the mathematical background of pairings. This includes topics such as pairing-friendly elliptic curves and how to compute various pairings. It includes a brief introduction to existing identity-based encryption (IBE) schemes and other cryptographic schemes using pairing technology. The report provides a complete study of the current status of standard activities on pairing-based cryptographic schemes. It explores different application scenarios for pairing-based cryptography schemes. As an important aspect of adopting pairing-based schemes, the report also considers the challenges inherent in validation testing of cryptographic algorithms and modules. Based on the study, the report suggests an approach for including pairing-based cryptography schemes in the NIST cryptographic toolkit. The report also outlines several questions that will require further study if this approach is followed. PMID:26958435
Increasing complexity with quantum physics.
Anders, Janet; Wiesner, Karoline
2011-09-01
We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity. We identify correlations as a central concept connecting quantum information and complex systems science. We present two examples for the power of correlations: using quantum resources to simulate the correlations of a stochastic process and to implement a classically impossible computational task. PMID:21974665
Increasing complexity with quantum physics.
Anders, Janet; Wiesner, Karoline
2011-09-01
We argue that complex systems science and the rules of quantum physics are intricately related. We discuss a range of quantum phenomena, such as cryptography, computation and quantum phases, and the rules responsible for their complexity. We identify correlations as a central concept connecting quantum information and complex systems science. We present two examples for the power of correlations: using quantum resources to simulate the correlations of a stochastic process and to implement a classically impossible computational task.
Asymmetric cryptography based on wavefront sensing.
Peng, Xiang; Wei, Hengzheng; Zhang, Peng
2006-12-15
A system of asymmetric cryptography based on wavefront sensing (ACWS) is proposed for the first time to our knowledge. One of the most significant features of the asymmetric cryptography is that a trapdoor one-way function is required and constructed by analogy to wavefront sensing, in which the public key may be derived from optical parameters, such as the wavelength or the focal length, while the private key may be obtained from a kind of regular point array. The ciphertext is generated by the encoded wavefront and represented with an irregular array. In such an ACWS system, the encryption key is not identical to the decryption key, which is another important feature of an asymmetric cryptographic system. The processes of asymmetric encryption and decryption are formulized mathematically and demonstrated with a set of numerical experiments.
Cryptography and the Internet: lessons and challenges
McCurley, K.S.
1996-12-31
The popularization of the Internet has brought fundamental changes to the world, because it allows a universal method of communication between computers. This carries enormous benefits with it, but also raises many security considerations. Cryptography is a fundamental technology used to provide security of computer networks, and there is currently a widespread engineering effort to incorporate cryptography into various aspects of the Internet. The system-level engineering required to provide security services for the Internet carries some important lessons for researchers whose study is focused on narrowly defined problems. It also offers challenges to the cryptographic research community by raising new questions not adequately addressed by the existing body of knowledge. This paper attempts to summarize some of these lessons and challenges for the cryptographic research community.
DRM: tales from the crypt(ography).
Kabachinski, Jeff
2007-01-01
That quenches my immediate thirst for researching cryptography. You can see how quickly these methods can get complicated. I don't know, and based on DMCA maybe I don't want to know, how encryption is used in DRM. We know that it includes encryption techniques to protect content from being copied and to control ultimate usage of the content. As with just about any technology, there are good and not so good uses. DRM is just another example. We barely touched the surface of the world of cryptography--you can find so much more with simple internet searches. I've included several of the encryption techniques I came across in the glossary to whet your appetite for more (see www.aami.org/ publications/bit). Remember, the key to encryption is the key to encryption!
Nonequivalence of two flavors of oblivious transfer at the quantum level
He Guangping; Wang, Z. D.
2006-04-15
Though all-or-nothing oblivious transfer and one-out-of-two oblivious transfer are equivalent in classical cryptography, we here show that a protocol built upon secure quantum all-or-nothing oblivious transfer cannot satisfy the rigorous definition of quantum one-out-of-two oblivious transfer due to the nature of quantum cryptography. Thus the securities of the two oblivious transfer protocols are not equivalent at the quantum level.
Device-independent two-party cryptography secure against sequential attacks
NASA Astrophysics Data System (ADS)
Kaniewski, Jędrzej; Wehner, Stephanie
2016-05-01
The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication enables security for all of these problems in the noisy-storage model by sending more signals than the adversary can store in a certain time frame. Here, we initiate the study of device-independent (DI) protocols for two-party cryptography in the noisy-storage model. Specifically, we present a relatively easy to implement protocol for a cryptographic building block known as weak string erasure and prove its security even if the devices used in the protocol are prepared by the dishonest party. DI two-party cryptography is made challenging by the fact that Alice and Bob do not trust each other, which requires new techniques to establish security. We fully analyse the case of memoryless devices (for which sequential attacks are optimal) and the case of sequential attacks for arbitrary devices. The key ingredient of the proof, which might be of independent interest, is an explicit (and tight) relation between the violation of the Clauser-Horne-Shimony-Holt inequality observed by Alice and Bob and uncertainty generated by Alice against Bob who is forced to measure his system before finding out Alice’s setting (guessing with postmeasurement information). In particular, we show that security is possible for arbitrarily small violation.
Resource Letter QI-1: Quantum Information
NASA Astrophysics Data System (ADS)
Strauch, Frederick W.
2016-07-01
This Resource Letter surveys the history and modern developments in the field of quantum information. It is written to guide advanced undergraduates, beginning graduate students, and other new researchers to the theoretical and experimental aspects of this field. The topics covered include quantum states and processes, quantum coding and cryptography, quantum computation, the experimental implementation of quantum information processing, and the role of quantum information in the fundamental properties and foundations of physical theories.
Comparative Analysis of Cryptography Library in IoT
NASA Astrophysics Data System (ADS)
Kumar, Uday; Borgohain, Tuhin; Sanyal, Sugata
2015-05-01
The paper aims to do a survey along with a comparative analysis of the various cryptography libraries that are applicable in the field of Internet of Things (IoT). The first half of the paper briefly introduces the various cryptography libraries available in the field of cryptography along with a list of all the algorithms contained within the libraries. The second half of the paper deals with cryptography libraries specifically aimed for application in the field of Internet of Things. The various libraries and their performance analysis listed down in this paper are consolidated from various sources with the aim of providing a single comprehensive repository for reference to the various cryptography libraries and the comparative analysis of their features in IoT.
Quantum tagging for tags containing secret classical data
Kent, Adrian
2011-08-15
Various authors have considered schemes for quantum tagging, that is, authenticating the classical location of a classical tagging device by sending and receiving quantum signals from suitably located distant sites, in an environment controlled by an adversary whose quantum information processing and transmitting power is potentially unbounded. All of the schemes proposed elsewhere in the literature assume that the adversary is able to inspect the interior of the tagging device. All of these schemes have been shown to be breakable if the adversary has unbounded predistributed entanglement. We consider here the case in which the tagging device contains a finite key string shared with distant sites but kept secret from the adversary, and show this allows the location of the tagging device to be authenticated securely and indefinitely. Our protocol relies on quantum key distribution between the tagging device and at least one distant site, and demonstrates a new practical application of quantum key distribution. It also illustrates that the attainable security in position-based cryptography can depend crucially on apparently subtle details in the security scenario considered.
Quantum tasks in Minkowski space
NASA Astrophysics Data System (ADS)
Kent, Adrian
2012-11-01
The fundamental properties of quantum information and its applications to computing and cryptography have been greatly illuminated by considering information-theoretic tasks that are provably possible or impossible within non-relativistic quantum mechanics. I describe here a general framework for defining tasks within (special) relativistic quantum theory and illustrate it with examples from relativistic quantum cryptography and relativistic distributed quantum computation. The framework gives a unified description of all tasks previously considered and also defines a large class of new questions about the properties of quantum information in relation to Minkowski causality. It offers a way of exploring interesting new fundamental tasks and applications, and also highlights the scope for a more systematic understanding of the fundamental information-theoretic properties of relativistic quantum theory.
Quantum Information in Non-physics Departments at Liberal Arts Colleges
NASA Astrophysics Data System (ADS)
Westmoreland, Michael
2012-02-01
Quantum information and quantum computing have changed our thinking about the basic concepts of quantum physics. These fields have also introduced exciting new applications of quantum mechanics such as quantum cryptography and non-interactive measurement. It is standard to teach such topics only to advanced physics majors who have completed coursework in quantum mechanics. Recent encounters with teaching quantum cryptography to non-majors and a bout of textbook-writing suggest strategies for teaching this interesting material to those without the standard quantum mechanics background. This talk will share some of those strategies.
Comment on "Cheating prevention in visual cryptography".
Chen, Yu-Chi; Horng, Gwoboa; Tsai, Du-Shiau
2012-07-01
Visual cryptography (VC), proposed by Naor and Shamir, has numerous applications, including visual authentication and identification, steganography, and image encryption. In 2006, Horng showed that cheating is possible in VC, where some participants can deceive the remaining participants by forged transparencies. Since then, designing cheating-prevention visual secret-sharing (CPVSS) schemes has been studied by many researchers. In this paper, we cryptanalyze the Hu-Tzeng CPVSS scheme and show that it is not cheating immune. We also outline an improvement that helps to overcome the problem.
The quantum cryptograpy: Communication and computation
NASA Astrophysics Data System (ADS)
Delicado, Raquel Fernandez; Cabello, David Bellver; Boada, Ivan Lloro
2005-07-01
Nowadays there are two secure ways of encrypting information, the public key cryptography (PKC), and the symmetric cryptography (SC). With the arrival of the quantum computation, both methods become vulnerable, thanks to its exponential-growing calculation capacity. To solve this lack of security, quantum physics nowadays offers us two satisfactory methods which have been proposed successfully from a theoretical point of view: the two non-commuting observables, based on the Bennet and Brassard protocol, and the quantum entanglement combined with the Bell's inequality theorem, based on the Ekert protocol. Since some experiments have demonstrated the viability of the conduction of free space quantum cryptography at the surface of the Earth, we propose that this could be a boost for secure ground-to-satellite or satellite-to-satellite communications.
Quantum walk public-key cryptographic system
NASA Astrophysics Data System (ADS)
Vlachou, C.; Rodrigues, J.; Mateus, P.; Paunković, N.; Souto, A.
2015-12-01
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
Counterfactual attack on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Zhang, Sheng; Wnang, Jian; Tang, Chao Jing
2012-05-01
It is interesting that counterfactual quantum cryptography protocols allow two remotely separated parties to share a secret key without transmitting any signal particles. Generally, these protocols, expected to provide security advantages, base their security on a translated no-cloning theorem. Therefore, they potentially exhibit unconditional security in theory. In this letter, we propose a new Trojan horse attack, by which an eavesdropper Eve can gain full information about the key without being noticed, to real implementations of a counterfactual quantum cryptography system. Most importantly, the presented attack is available even if the system has negligible imperfections. Therefore, it shows that the present realization of counterfactual quantum key distribution is vulnerable.
Securing information display by use of visual cryptography.
Yamamoto, Hirotsugu; Hayasaki, Yoshio; Nishida, Nobuo
2003-09-01
We propose a secure display technique based on visual cryptography. The proposed technique ensures the security of visual information. The display employs a decoding mask based on visual cryptography. Without the decoding mask, the displayed information cannot be viewed. The viewing zone is limited by the decoding mask so that only one person can view the information. We have developed a set of encryption codes to maintain the designed viewing zone and have demonstrated a display that provides a limited viewing zone.
NASA Astrophysics Data System (ADS)
Hwang, Tzonelih; Luo, Yi-Ping; Yang, Chun-Wei; Lin, Tzu-Han
2014-04-01
This work proposes a new direction in quantum cryptography called quantum authencryption. Quantum authencryption (QA), a new term to distinguish from authenticated quantum secure direct communications, is used to describe the technique of combining quantum encryption and quantum authentication into one process for off-line communicants. QA provides a new way of quantum communications without the presence of a receiver on line, and thus makes many applications depending on secure one-way quantum communications, such as quantum E-mail systems, possible. An example protocol using single photons and one-way hash functions is presented to realize the requirements on QA.
Towards secure quantum key distribution protocol for wireless LANs: a hybrid approach
NASA Astrophysics Data System (ADS)
Naik, R. Lalu; Reddy, P. Chenna
2015-12-01
The primary goals of security such as authentication, confidentiality, integrity and non-repudiation in communication networks can be achieved with secure key distribution. Quantum mechanisms are highly secure means of distributing secret keys as they are unconditionally secure. Quantum key distribution protocols can effectively prevent various attacks in the quantum channel, while classical cryptography is efficient in authentication and verification of secret keys. By combining both quantum cryptography and classical cryptography, security of communications over networks can be leveraged. Hwang, Lee and Li exploited the merits of both cryptographic paradigms for provably secure communications to prevent replay, man-in-the-middle, and passive attacks. In this paper, we propose a new scheme with the combination of quantum cryptography and classical cryptography for 802.11i wireless LANs. Since quantum cryptography is premature in wireless networks, our work is a significant step forward toward securing communications in wireless networks. Our scheme is known as hybrid quantum key distribution protocol. Our analytical results revealed that the proposed scheme is provably secure for wireless networks.
Efficient Quantum Pseudorandomness
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-04-01
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Efficient Quantum Pseudorandomness.
Brandão, Fernando G S L; Harrow, Aram W; Horodecki, Michał
2016-04-29
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics. PMID:27176509
Efficient Quantum Pseudorandomness.
Brandão, Fernando G S L; Harrow, Aram W; Horodecki, Michał
2016-04-29
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g., in computation, communication, and control. Fully random transformations require exponential time for either classical or quantum systems, but in many cases pseudorandom operations can emulate certain properties of truly random ones. Indeed, in the classical realm there is by now a well-developed theory regarding such pseudorandom operations. However, the construction of such objects turns out to be much harder in the quantum case. Here, we show that random quantum unitary time evolutions ("circuits") are a powerful source of quantum pseudorandomness. This gives for the first time a polynomial-time construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography, and understanding the self-equilibration of closed quantum dynamics.
Secure communications with low-orbit spacecraft using quantum cryptography
Hughes, Richard J.; Buttler, William T.; Kwiat, Paul G.; Luther, Gabriel G.; Morgan, George L; Nordholt, Jane E.; Peterson, Charles G.; Simmons, Charles M.
1999-01-01
Apparatus and method for secure communication between an earth station and spacecraft. A laser outputs single pulses that are split into preceding bright pulses and delayed attenuated pulses, and polarized. A Pockels cell changes the polarization of the polarized delayed attenuated pulses according to a string of random numbers, a first polarization representing a "1," and a second polarization representing a "0." At the receiving station, a beamsplitter randomly directs the preceding bright pulses and the polarized delayed attenuated pulses onto longer and shorter paths, both terminating in a beamsplitter which directs the preceding bright pulses and a first portion of the polarized delayed attenuated pulses to a first detector, and a second portion of the polarized delayed attenuated pulses to a second detector to generate a key for secure communication between the earth station and the spacecraft.
Optical scanning cryptography for secure wireless transmission.
Poon, Ting-Chung; Kim, Taegeun; Doh, Kyu
2003-11-10
We propose a method for secure wireless transmission of encrypted information. By use of an encryption key, an image or document is optically encrypted by optical heterodyne scanning and hence encryption is performed on the fly. We call this technique optical scanning cryptography. The output of the heterodyne encrypted signal is at radio frequency and can be directly sent through an antenna to a secure site for digital storage to be prepared for decryption. In the secure site, an identical optical scanning system to that used for encryption is used, together with a decryption key, to generate an electrical signal. The electrical signal is then processed and sent to a computer to be used for decryption. Utilizing the stored information received from the encryption stage and the electrical information from the secure site, a digital decryption unit performs a decryption algorithm. If the encryption key and the decryption key are matched, the decryption unit will decrypt the image or document faithfully. The overall cryptosystem can perform the incoherent optical processing counterpart of the well-known coherent double-random phase-encoding technique. We present computer simulations of the idea.
Implementation of Elliptic Curve Cryptography in Binary Field
NASA Astrophysics Data System (ADS)
Susantio, D. R.; Muchtadi-Alamsyah, I.
2016-04-01
Currently, there is a steadily increasing demand of information security, caused by a surge in information flow. There are many ways to create a secure information channel, one of which is to use cryptography. In this paper, we discuss the implementation of elliptic curves over the binary field for cryptography. We use the simplified version of the ECIES (Elliptic Curve Integrated Encryption Scheme). The ECIES encrypts a plaintext by masking the original message using specified points on the curve. The encryption process is done by separating the plaintext into blocks. Each block is then separately encrypted using the encryption scheme.
A brief review on quantum bit commitment
NASA Astrophysics Data System (ADS)
Almeida, Álvaro J.; Loura, Ricardo; Paunković, Nikola; Silva, Nuno A.; Muga, Nelson J.; Mateus, Paulo; André, Paulo S.; Pinto, Armando N.
2014-08-01
In classical cryptography, the bit commitment scheme is one of the most important primitives. We review the state of the art of bit commitment protocols, emphasizing its main achievements and applications. Next, we present a practical quantum bit commitment scheme, whose security relies on current technological limitations, such as the lack of long-term stable quantum memories. We demonstrate the feasibility of our practical quantum bit commitment protocol and that it can be securely implemented with nowadays technology.
Enhancing Undergraduate Mathematics Curriculum via Coding Theory and Cryptography
ERIC Educational Resources Information Center
Aydin, Nuh
2009-01-01
The theory of error-correcting codes and cryptography are two relatively recent applications of mathematics to information and communication systems. The mathematical tools used in these fields generally come from algebra, elementary number theory, and combinatorics, including concepts from computational complexity. It is possible to introduce the…
Securing resource constraints embedded devices using elliptic curve cryptography
NASA Astrophysics Data System (ADS)
Tam, Tony; Alfasi, Mohamed; Mozumdar, Mohammad
2014-06-01
The use of smart embedded device has been growing rapidly in recent time because of miniaturization of sensors and platforms. Securing data from these embedded devices is now become one of the core challenges both in industry and research community. Being embedded, these devices have tight constraints on resources such as power, computation, memory, etc. Hence it is very difficult to implement traditional Public Key Cryptography (PKC) into these resource constrained embedded devices. Moreover, most of the public key security protocols requires both public and private key to be generated together. In contrast with this, Identity Based Encryption (IBE), a public key cryptography protocol, allows a public key to be generated from an arbitrary string and the corresponding private key to be generated later on demand. While IBE has been actively studied and widely applied in cryptography research, conventional IBE primitives are also computationally demanding and cannot be efficiently implemented on embedded system. Simplified version of the identity based encryption has proven its competence in being robust and also satisfies tight budget of the embedded platform. In this paper, we describe the choice of several parameters for implementing lightweight IBE in resource constrained embedded sensor nodes. Our implementation of IBE is built using elliptic curve cryptography (ECC).
Quantum Entanglement and Information
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
2002-04-01
The development of quantum entanglement presents a very interesting and typical case how fundamental reasearch leads to new technologically interesting concepts. Initially it was introduced by Einstein and Schroedinger because of its philosophical interest. This, together with Bell's theorem, led to experiments beginning in the early 1970-s which also were only motivated by their importance for the foundations of physics. Most remarkably, in recent years people discovered that quantum entanglement can be useful in completely novel ways of transmitting and processing of information with no analog in classical physics. Here the most developed areas are quantum communication, quantum cryptography, quantum teleportation and quantum computation. In the talk I will present the basics of these applications of entanglement and I will discuss some existing experimental realisations. Finally I will argue that, while it is impossible to foresee where the present development will lead us, it is very likely that in the end a novel kind of information technology will emerge.
Trojan horse attacks on counterfactual quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Du, Yungang; Wu, Lingan
2016-04-01
There has been much interest in "counterfactual quantum cryptography" (T.-G. Noh, 2009 [10]). It seems that the counterfactual quantum key distribution protocol without any photon carrier through the quantum channel provides practical security advantages. However, we show that it is easy to break counterfactual quantum key distribution systems in practical situations. We introduce the two types of Trojan horse attacks that are available for the two-way protocol and become possible for practical counterfactual systems with our eavesdropping schemes.
QUANTUM MECHANICS: Enhanced: Schrodinger's Cat Is Out of the Hat.
Tesche, C
2000-10-27
In 1935, Erwin Schrödinger suggested his famous gedanken experiment of the cat that is simultaneously "dead" and "alive" inside its box until the box is opened. But as Tesche explains in her Perspective, such a macroscopic manifestation of quantum mechanics has remained elusive until recently. The experiments by van der Wal et al. are an important step toward demonstrating that quantum mechanics can describe macroscopic phenomena. The approach may be exploited in quantum computing and quantum cryptography.
NASA Astrophysics Data System (ADS)
Le Gouët, Jean-Louis; Moiseev, Sergey
2012-06-01
quest for higher efficiency, better fidelity, broader bandwidth, multimode capacity and longer storage lifetime is pursued in all those approaches, as shown in this special issue. The improvement of quantum memory operation specifically requires in-depth study and control of numerous physical processes leading to atomic decoherence. The present issue reflects the development of rare earth ion doped matrices offering long lifetime superposition states, either as bulk crystals or as optical waveguides. The need for quantum sources and high efficiency detectors at the single photon level is also illustrated. Several papers address the networking of quantum memories either in long-haul cryptography or in the prospect of quantum processing. In this context, much attention has been paid recently to interfacing quantum light with superconducting qubits and with nitrogen-vacancy centers in diamond. Finally, the quantum interfacing of light with matter raises questions on entanglement. The last two papers are devoted to the generation of entanglement by dissipative processes. It is shown that long lifetime entanglement may be built in this way. We hope this special issue will help readers to become familiar with the exciting field of ensemble-based quantum memories and will stimulate them to bring deeper insights and new ideas to this area.
Counterfactual quantum certificate authorization
NASA Astrophysics Data System (ADS)
Shenoy H., Akshata; Srikanth, R.; Srinivas, T.
2014-05-01
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.
Quantum random number generation
Ma, Xiongfeng; Yuan, Xiao; Cao, Zhu; Zhang, Zhen; Qi, Bing
2016-06-28
Here, quantum physics can be exploited to generate true random numbers, which play important roles in many applications, especially in cryptography. Genuine randomness from the measurement of a quantum system reveals the inherent nature of quantumness -- coherence, an important feature that differentiates quantum mechanics from classical physics. The generation of genuine randomness is generally considered impossible with only classical means. Based on the degree of trustworthiness on devices, quantum random number generators (QRNGs) can be grouped into three categories. The first category, practical QRNG, is built on fully trusted and calibrated devices and typically can generate randomness at amore » high speed by properly modeling the devices. The second category is self-testing QRNG, where verifiable randomness can be generated without trusting the actual implementation. The third category, semi-self-testing QRNG, is an intermediate category which provides a tradeoff between the trustworthiness on the device and the random number generation speed.« less
Practical quantum retrieval games
NASA Astrophysics Data System (ADS)
Arrazola, Juan Miguel; Karasamanis, Markos; Lütkenhaus, Norbert
2016-06-01
Complex cryptographic protocols are often constructed from simpler building blocks. In order to advance quantum cryptography, it is important to study practical building blocks that can be used to develop new protocols. An example is quantum retrieval games (QRGs), which have broad applicability and have already been used to construct quantum money schemes. In this work, we introduce a general construction of quantum retrieval games based on the hidden matching problem and show how they can be implemented in practice using available technology. More precisely, we provide a general method to construct (1-out-of-k ) QRGs, proving that their cheating probabilities decrease exponentially in k . In particular, we define QRGs based on coherent states of light, which can be implemented even in the presence of experimental imperfections. Our results constitute a tool in the arsenal of the practical quantum cryptographer.
Overcoming quantum noise in optical fibers
Wu Lianao; Lidar, Daniel A.
2004-12-01
Noise in optical telecommunication fibers is an important limitation on optical quantum data transmission. Unfortunately, the classically successful amplifiers cannot be used in quantum communication because of the no-cloning theorem. We propose a simple method to reduce quantum noise: the insertion of phase shifters and/or beam splitters at regular distance intervals into a fiber. We analyze in detail the case of qubits encoded into polarization states of low-intensity light, which is of central importance to various quantum information tasks, such as quantum cryptography and communication. We discuss the experimental feasibility of our scheme and propose a simple experiment to test our method.
Electronic Voting Protocol Using Identity-Based Cryptography
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. PMID:26090515
Electronic Voting Protocol Using Identity-Based Cryptography.
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps.
Electronic Voting Protocol Using Identity-Based Cryptography.
Gallegos-Garcia, Gina; Tapia-Recillas, Horacio
2015-01-01
Electronic voting protocols proposed to date meet their properties based on Public Key Cryptography (PKC), which offers high flexibility through key agreement protocols and authentication mechanisms. However, when PKC is used, it is necessary to implement Certification Authority (CA) to provide certificates which bind public keys to entities and enable verification of such public key bindings. Consequently, the components of the protocol increase notably. An alternative is to use Identity-Based Encryption (IBE). With this kind of cryptography, it is possible to have all the benefits offered by PKC, without neither the need of certificates nor all the core components of a Public Key Infrastructure (PKI). Considering the aforementioned, in this paper we propose an electronic voting protocol, which meets the privacy and robustness properties by using bilinear maps. PMID:26090515
Measurement-device-independent quantum key distribution.
Lo, Hoi-Kwong; Curty, Marcos; Qi, Bing
2012-03-30
How to remove detector side channel attacks has been a notoriously hard problem in quantum cryptography. Here, we propose a simple solution to this problem--measurement-device-independent quantum key distribution (QKD). It not only removes all detector side channels, but also doubles the secure distance with conventional lasers. Our proposal can be implemented with standard optical components with low detection efficiency and highly lossy channels. In contrast to the previous solution of full device independent QKD, the realization of our idea does not require detectors of near unity detection efficiency in combination with a qubit amplifier (based on teleportation) or a quantum nondemolition measurement of the number of photons in a pulse. Furthermore, its key generation rate is many orders of magnitude higher than that based on full device independent QKD. The results show that long-distance quantum cryptography over say 200 km will remain secure even with seriously flawed detectors.
Measurement-device-independent quantum key distribution.
Lo, Hoi-Kwong; Curty, Marcos; Qi, Bing
2012-03-30
How to remove detector side channel attacks has been a notoriously hard problem in quantum cryptography. Here, we propose a simple solution to this problem--measurement-device-independent quantum key distribution (QKD). It not only removes all detector side channels, but also doubles the secure distance with conventional lasers. Our proposal can be implemented with standard optical components with low detection efficiency and highly lossy channels. In contrast to the previous solution of full device independent QKD, the realization of our idea does not require detectors of near unity detection efficiency in combination with a qubit amplifier (based on teleportation) or a quantum nondemolition measurement of the number of photons in a pulse. Furthermore, its key generation rate is many orders of magnitude higher than that based on full device independent QKD. The results show that long-distance quantum cryptography over say 200 km will remain secure even with seriously flawed detectors. PMID:22540686
Fast, Parallel and Secure Cryptography Algorithm Using Lorenz's Attractor
NASA Astrophysics Data System (ADS)
Marco, Anderson Gonçalves; Martinez, Alexandre Souto; Bruno, Odemir Martinez
A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.
Classical command of quantum systems.
Reichardt, Ben W; Unger, Falk; Vazirani, Umesh
2013-04-25
Quantum computation and cryptography both involve scenarios in which a user interacts with an imperfectly modelled or 'untrusted' system. It is therefore of fundamental and practical interest to devise tests that reveal whether the system is behaving as instructed. In 1969, Clauser, Horne, Shimony and Holt proposed an experimental test that can be passed by a quantum-mechanical system but not by a system restricted to classical physics. Here we extend this test to enable the characterization of a large quantum system. We describe a scheme that can be used to determine the initial state and to classically command the system to evolve according to desired dynamics. The bipartite system is treated as two black boxes, with no assumptions about their inner workings except that they obey quantum physics. The scheme works even if the system is explicitly designed to undermine it; any misbehaviour is detected. Among its applications, our scheme makes it possible to test whether a claimed quantum computer is truly quantum. It also advances towards a goal of quantum cryptography: namely, the use of 'untrusted' devices to establish a shared random key, with security based on the validity of quantum physics.
Classical command of quantum systems.
Reichardt, Ben W; Unger, Falk; Vazirani, Umesh
2013-04-25
Quantum computation and cryptography both involve scenarios in which a user interacts with an imperfectly modelled or 'untrusted' system. It is therefore of fundamental and practical interest to devise tests that reveal whether the system is behaving as instructed. In 1969, Clauser, Horne, Shimony and Holt proposed an experimental test that can be passed by a quantum-mechanical system but not by a system restricted to classical physics. Here we extend this test to enable the characterization of a large quantum system. We describe a scheme that can be used to determine the initial state and to classically command the system to evolve according to desired dynamics. The bipartite system is treated as two black boxes, with no assumptions about their inner workings except that they obey quantum physics. The scheme works even if the system is explicitly designed to undermine it; any misbehaviour is detected. Among its applications, our scheme makes it possible to test whether a claimed quantum computer is truly quantum. It also advances towards a goal of quantum cryptography: namely, the use of 'untrusted' devices to establish a shared random key, with security based on the validity of quantum physics. PMID:23619692
Fully distrustful quantum bit commitment and coin flipping.
Silman, J; Chailloux, A; Aharon, N; Kerenidis, I; Pironio, S; Massar, S
2011-06-01
In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them "fully" distrustful. In this Letter, we show that for bit commitment-one of the most basic primitives within the model-the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice's and Bob's cheating probabilities are ≃0.854 and 3/4, which we then use to construct a device-independent coin flipping protocol with bias ≲0.336.
Fully distrustful quantum bit commitment and coin flipping.
Silman, J; Chailloux, A; Aharon, N; Kerenidis, I; Pironio, S; Massar, S
2011-06-01
In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them "fully" distrustful. In this Letter, we show that for bit commitment-one of the most basic primitives within the model-the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice's and Bob's cheating probabilities are ≃0.854 and 3/4, which we then use to construct a device-independent coin flipping protocol with bias ≲0.336. PMID:21702585
Fully Distrustful Quantum Bit Commitment and Coin Flipping
NASA Astrophysics Data System (ADS)
Silman, J.; Chailloux, A.; Aharon, N.; Kerenidis, I.; Pironio, S.; Massar, S.
2011-06-01
In the distrustful quantum cryptography model the parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to cryptography is to do away with the latter assumption, and, consequently, significantly increase security. It is an open question whether the scope of this approach also extends to protocols in the distrustful cryptography model, thereby rendering them “fully” distrustful. In this Letter, we show that for bit commitment—one of the most basic primitives within the model—the answer is positive. We present a device-independent (imperfect) bit-commitment protocol, where Alice’s and Bob’s cheating probabilities are ≃0.854 and (3)/(4), which we then use to construct a device-independent coin flipping protocol with bias ≲0.336.
A library for prototyping the computer arithmetic level in elliptic curve cryptography
NASA Astrophysics Data System (ADS)
Imbert, Laurent; Peirera, Agostinho; Tisserand, Arnaud
2007-09-01
This paper presents the first version of a software library called PACE ("Prototyping Arithmetic in Cryptography Easily"). This is a C++ library under LGPL license. It provides number systems and algorithms for prototyping the arithmetic layer in cryptographic applications. The first version of PACE includes basic support of prime finite fields and ECC (Elliptic Curve Cryptography) basic algorithms for software implementations.
Embracing the quantum limit in silicon computing.
Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A
2011-11-17
Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer. PMID:22094695
Embracing the quantum limit in silicon computing.
Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A
2011-11-16
Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer.
Novel optical scanning cryptography using Fresnel telescope imaging.
Yan, Aimin; Sun, Jianfeng; Hu, Zhijuan; Zhang, Jingtao; Liu, Liren
2015-07-13
We propose a new method called modified optical scanning cryptography using Fresnel telescope imaging technique for encryption and decryption of remote objects. An image or object can be optically encrypted on the fly by Fresnel telescope scanning system together with an encryption key. For image decryption, the encrypted signals are received and processed with an optical coherent heterodyne detection system. The proposed method has strong performance through use of secure Fresnel telescope scanning with orthogonal polarized beams and efficient all-optical information processing. The validity of the proposed method is demonstrated by numerical simulations and experimental results. PMID:26191901
An application of different dioids in public key cryptography
Durcheva, Mariana I.
2014-11-18
Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme is presented.
Novel optical scanning cryptography using Fresnel telescope imaging.
Yan, Aimin; Sun, Jianfeng; Hu, Zhijuan; Zhang, Jingtao; Liu, Liren
2015-07-13
We propose a new method called modified optical scanning cryptography using Fresnel telescope imaging technique for encryption and decryption of remote objects. An image or object can be optically encrypted on the fly by Fresnel telescope scanning system together with an encryption key. For image decryption, the encrypted signals are received and processed with an optical coherent heterodyne detection system. The proposed method has strong performance through use of secure Fresnel telescope scanning with orthogonal polarized beams and efficient all-optical information processing. The validity of the proposed method is demonstrated by numerical simulations and experimental results.
Secure satellite communication using multi-photon tolerant quantum communication protocol
NASA Astrophysics Data System (ADS)
Darunkar, Bhagyashri; Punekar, Nikhil; Verma, Pramode K.
2015-09-01
This paper proposes and analyzes the potential of a multi-photon tolerant quantum communication protocol to secure satellite communication. For securing satellite communication, quantum cryptography is the only known unconditionally secure method. A number of recent experiments have shown feasibility of satellite-aided global quantum key distribution (QKD) using different methods such as: Use of entangled photon pairs, decoy state methods, and entanglement swapping. The use of single photon in these methods restricts the distance and speed over which quantum cryptography can be applied. Contemporary quantum cryptography protocols like the BB84 and its variants suffer from the limitation of reaching the distances of only Low Earth Orbit (LEO) at the data rates of few kilobits per second. This makes it impossible to develop a general satellite-based secure global communication network using the existing protocols. The method proposed in this paper allows secure communication at the heights of the Medium Earth Orbit (MEO) and Geosynchronous Earth Orbit (GEO) satellites. The benefits of the proposed method are two-fold: First it enables the realization of a secure global communication network based on satellites and second it provides unconditional security for satellite networks at GEO heights. The multi-photon approach discussed in this paper ameliorates the distance and speed issues associated with quantum cryptography through the use of contemporary laser communication (lasercom) devices. This approach can be seen as a step ahead towards global quantum communication.
Fourier-based automatic alignment for improved Visual Cryptography schemes.
Machizaud, Jacques; Chavel, Pierre; Fournel, Thierry
2011-11-01
In Visual Cryptography, several images, called "shadow images", that separately contain no information, are overlapped to reveal a shared secret message. We develop a method to digitally register one printed shadow image acquired by a camera with a purely digital shadow image, stored in memory. Using Fourier techniques derived from Fourier Optics concepts, the idea is to enhance and exploit the quasi periodicity of the shadow images, composed by a random distribution of black and white patterns on a periodic sampling grid. The advantage is to speed up the security control or the access time to the message, in particular in the cases of a small pixel size or of large numbers of pixels. Furthermore, the interest of visual cryptography can be increased by embedding the initial message in two shadow images that do not have identical mathematical supports, making manual registration impractical. Experimental results demonstrate the successful operation of the method, including the possibility to directly project the result onto the printed shadow image.
Implementing Diffie-Hellman key exchange using quantum EPR pairs
NASA Astrophysics Data System (ADS)
Mandal, Sayonnha; Parakh, Abhishek
2015-05-01
This paper implements the concepts of perfect forward secrecy and the Diffie-Hellman key exchange using EPR pairs to establish and share a secret key between two non-authenticated parties and transfer messages between them without the risk of compromise. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. This makes BB84-based quantum cryptography protocol unsuitable for network computing environments. Diffie-Hellman does not require the two parties to be mutually authenticated to each other, yet it can provide a basis for a number of authenticated protocols, most notably the concept of perfect forward secrecy. The work proposed in this paper provides a new direction in utilizing quantum EPR pairs in quantum key exchange. Although, classical cryptography boasts of efficient and robust protocols like the Diffie-Hellman key exchange, in the current times, with the advent of quantum computing they are very much vulnerable to eavesdropping and cryptanalytic attacks. Using quantum cryptographic principles, however, these classical encryption algorithms show more promise and a more robust and secure structure for applications. The unique properties of quantum EPR pairs also, on the other hand, go a long way in removing attacks like eavesdropping by their inherent nature of one particle of the pair losing its state if a measurement occurs on the other. The concept of perfect forward secrecy is revisited in this paper to attribute tighter security to the proposed protocol.
Novel Quantum Proxy Signature without Entanglement
NASA Astrophysics Data System (ADS)
Xu, Guang-bao
2015-08-01
Proxy signature is an important research topic in classic cryptography since it has many application occasions in our real life. But only a few quantum proxy signature schemes have been proposed up to now. In this paper, we propose a quantum proxy signature scheme, which is designed based on quantum one-time pad. Our scheme can be realized easily since it only uses single-particle states. Security analysis shows that it is secure and meets all the properties of a proxy signature, such as verifiability, distinguishability, unforgeability and undeniability.
Image communication scheme based on dynamic visual cryptography and computer generated holography
NASA Astrophysics Data System (ADS)
Palevicius, Paulius; Ragulskis, Minvydas
2015-01-01
Computer generated holograms are often exploited to implement optical encryption schemes. This paper proposes the integration of dynamic visual cryptography (an optical technique based on the interplay of visual cryptography and time-averaging geometric moiré) with Gerchberg-Saxton algorithm. A stochastic moiré grating is used to embed the secret into a single cover image. The secret can be visually decoded by a naked eye if only the amplitude of harmonic oscillations corresponds to an accurately preselected value. The proposed visual image encryption scheme is based on computer generated holography, optical time-averaging moiré and principles of dynamic visual cryptography. Dynamic visual cryptography is used both for the initial encryption of the secret image and for the final decryption. Phase data of the encrypted image are computed by using Gerchberg-Saxton algorithm. The optical image is decrypted using the computationally reconstructed field of amplitudes.
Cryptanalysis and security enhancement of optical cryptography based on computational ghost imaging
NASA Astrophysics Data System (ADS)
Yuan, Sheng; Yao, Jianbin; Liu, Xuemei; Zhou, Xin; Li, Zhongyang
2016-04-01
Optical cryptography based on computational ghost imaging (CGI) has attracted much attention of researchers because it encrypts plaintext into a random intensity vector rather than complexed-valued function. This promising feature of the CGI-based cryptography reduces the amount of data to be transmitted and stored and therefore brings convenience in practice. However, we find that this cryptography is vulnerable to chosen-plaintext attack because of the linear relationship between the input and output of the encryption system, and three feasible strategies are proposed to break it in this paper. Even though a large number of plaintexts need to be chosen in these attack methods, it means that this cryptography still exists security risks. To avoid these attacks, a security enhancement method utilizing an invertible matrix modulation is further discussed and the feasibility is verified by numerical simulations.
Authentication Protocol using Quantum Superposition States
Kanamori, Yoshito; Yoo, Seong-Moo; Gregory, Don A.; Sheldon, Frederick T
2009-01-01
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 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.
Optimal architectures for long distance quantum communication.
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D; Jiang, Liang
2016-01-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥ 1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances. PMID:26876670
Optimal architectures for long distance quantum communication
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D.; Jiang, Liang
2016-01-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances. PMID:26876670
Prospects for quantum computation with trapped ions
Hughes, R.J.; James, D.F.V.
1997-12-31
Over the past decade information theory has been generalized to allow binary data to be represented by two-state quantum mechanical systems. (A single two-level system has come to be known as a qubit in this context.) The additional freedom introduced into information physics with quantum systems has opened up a variety of capabilities that go well beyond those of conventional information. For example, quantum cryptography allows two parties to generate a secret key even in the presence of eavesdropping. But perhaps the most remarkable capabilities have been predicted in the field of quantum computation. Here, a brief survey of the requirements for quantum computational hardware, and an overview of the in trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.
Optimal architectures for long distance quantum communication
NASA Astrophysics Data System (ADS)
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D.; Jiang, Liang
2016-02-01
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.
Optimal architectures for long distance quantum communication.
Muralidharan, Sreraman; Li, Linshu; Kim, Jungsang; Lütkenhaus, Norbert; Lukin, Mikhail D; Jiang, Liang
2016-02-15
Despite the tremendous progress of quantum cryptography, efficient quantum communication over long distances (≥ 1000 km) remains an outstanding challenge due to fiber attenuation and operation errors accumulated over the entire communication distance. Quantum repeaters (QRs), as a promising approach, can overcome both photon loss and operation errors, and hence significantly speedup the communication rate. Depending on the methods used to correct loss and operation errors, all the proposed QR schemes can be classified into three categories (generations). Here we present the first systematic comparison of three generations of quantum repeaters by evaluating the cost of both temporal and physical resources, and identify the optimized quantum repeater architecture for a given set of experimental parameters for use in quantum key distribution. Our work provides a roadmap for the experimental realizations of highly efficient quantum networks over transcontinental distances.
Step to improve neural cryptography against flipping attacks.
Zhou, Jiantao; Xu, Qinzhen; Pei, Wenjiang; He, Zhenya; Szu, Harold
2004-12-01
Synchronization of neural networks by mutual learning has been demonstrated to be possible for constructing key exchange protocol over public channel. However, the neural cryptography schemes presented so far are not the securest under regular flipping attack (RFA) and are completely insecure under majority flipping attack (MFA). We propose a scheme by splitting the mutual information and the training process to improve the security of neural cryptosystem against flipping attacks. Both analytical and simulation results show that the success probability of RFA on the proposed scheme can be decreased to the level of brute force attack (BFA) and the success probability of MFA still decays exponentially with the weights' level L. The synchronization time of the parties also remains polynomial with L. Moreover, we analyze the security under an advanced flipping attack.
Differential phase shift quantum key distribution.
Inoue, Kyo; Waks, Edo; Yamamoto, Yoshihisa
2002-07-15
A novel quantum cryptography scheme is proposed, in which a single photon is prepared in a linear superposition state of three basis kets. A photon split to three pulses is sent from Alice to Bob, where the phase difference between sequential two pulses carries bit information. Bob measures the phase difference by passive differential phase detection. This scheme is suitable for fiber transmission systems and offers a key creation efficiency higher than conventional fiber-based BB84. PMID:12144419
Quantum Information Science: An Update
NASA Astrophysics Data System (ADS)
Kwek, L. C.; Zen, Freddy P.
2016-08-01
It is now roughly thirty years since the incipient ideas on quantum information science was concretely formalized. Over the last three decades, there has been much development in this field, and at least one technology, namely devices for quantum cryptography, is now commercialized. Yet, the holy grail of a workable quantum computing machine still lies faraway at the horizon. In any case, it took nearly several centuries before the vacuum tubes were invented after the first mechanical calculating were constructed, and several decades later, for the transistor to bring the current computer technology to fruition. In this review, we provide a short survey of the current development and progress in quantum information science. It clearly does not do justice to the amount of work in the past thirty years. Nevertheless, despite the modest attempt, this review hopes to induce younger researchers into this exciting field.
Philosophy of Quantum Information and Entanglement
NASA Astrophysics Data System (ADS)
Bokulich, Alisa; Jaeger, Gregg
2010-06-01
Preface; Introduction; Part I. Quantum Entanglement and Nonlocality: 1. Nonlocality beyond quantum mechanics Sandu Popescu; 2. Entanglement and subsystems, entanglement beyond subsystems, and all that Lorenza Viola and Howard Barnum; 3. Formalism locality in quantum theory and quantum gravity Lucien Hardy; Part II. Quantum Probability: 4. Bell's inequality from the contextual probabilistic viewpoint Andrei Khrennikov; 5. Probabilistic theories: what is special about quantum mechanics? Giacomo Mauro D'Ariano; 6. What probabilities tell about quantum systems, with application to entropy and entanglement John Myers and Hadi Madjid; 7. Bayesian updating and information gain in quantum measurements Leah Henderson; Part III. Quantum Information: 8. Schumacher information and the philosophy of physics Arnold Duwell; 9. From physics to information theory and back Wayne Myrvold; 10. Information, immaterialism, and instrumentalism: old and new in quantum information Chris Timpson; Part IV. Quantum Communication and Computing: 11. Quantum computation: where does the speed-up come from? Jeff Bub; 12. Quantum mechanics, quantum computing and quantum cryptography Tai Wu.
Observable Measure of Quantum Coherence in Finite Dimensional Systems
NASA Astrophysics Data System (ADS)
Girolami, Davide
2014-10-01
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology, and cryptography. Yet, there is no universally efficient method for quantifying coherence either in theoretical or in experimental practice. I introduce a framework for measuring quantum coherence in finite dimensional systems. I define a theoretical measure which satisfies the reliability criteria established in the context of quantum resource theories. Then, I present an experimental scheme implementable with current technology which evaluates the quantum coherence of an unknown state of a d-dimensional system by performing two programmable measurements on an ancillary qubit, in place of the O(d2) direct measurements required by full state reconstruction. The result yields a benchmark for monitoring quantum effects in complex systems, e.g., certifying nonclassicality in quantum protocols and probing the quantum behavior of biological complexes.
Observable measure of quantum coherence in finite dimensional systems.
Girolami, Davide
2014-10-24
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology, and cryptography. Yet, there is no universally efficient method for quantifying coherence either in theoretical or in experimental practice. I introduce a framework for measuring quantum coherence in finite dimensional systems. I define a theoretical measure which satisfies the reliability criteria established in the context of quantum resource theories. Then, I present an experimental scheme implementable with current technology which evaluates the quantum coherence of an unknown state of a d-dimensional system by performing two programmable measurements on an ancillary qubit, in place of the O(d2) direct measurements required by full state reconstruction. The result yields a benchmark for monitoring quantum effects in complex systems, e.g., certifying nonclassicality in quantum protocols and probing the quantum behavior of biological complexes.
Observable measure of quantum coherence in finite dimensional systems.
Girolami, Davide
2014-10-24
Quantum coherence is the key resource for quantum technology, with applications in quantum optics, information processing, metrology, and cryptography. Yet, there is no universally efficient method for quantifying coherence either in theoretical or in experimental practice. I introduce a framework for measuring quantum coherence in finite dimensional systems. I define a theoretical measure which satisfies the reliability criteria established in the context of quantum resource theories. Then, I present an experimental scheme implementable with current technology which evaluates the quantum coherence of an unknown state of a d-dimensional system by performing two programmable measurements on an ancillary qubit, in place of the O(d2) direct measurements required by full state reconstruction. The result yields a benchmark for monitoring quantum effects in complex systems, e.g., certifying nonclassicality in quantum protocols and probing the quantum behavior of biological complexes. PMID:25379903
Secure self-calibrating quantum random-bit generator
Fiorentino, M.; Santori, C.; Spillane, S. M.; Beausoleil, R. G.; Munro, W. J.
2007-03-15
Random-bit generators (RBGs) are key components of a variety of information processing applications ranging from simulations to cryptography. In particular, cryptographic systems require 'strong' RBGs that produce high-entropy bit sequences, but traditional software pseudo-RBGs have very low entropy content and therefore are relatively weak for cryptography. Hardware RBGs yield entropy from chaotic or quantum physical systems and therefore are expected to exhibit high entropy, but in current implementations their exact entropy content is unknown. Here we report a quantum random-bit generator (QRBG) that harvests entropy by measuring single-photon and entangled two-photon polarization states. We introduce and implement a quantum tomographic method to measure a lower bound on the 'min-entropy' of the system, and we employ this value to distill a truly random-bit sequence. This approach is secure: even if an attacker takes control of the source of optical states, a secure random sequence can be distilled.
Reliable freestanding position-based routing in highway scenarios.
Galaviz-Mosqueda, Gabriel A; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur
2012-01-01
Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159
Approach to design neural cryptography: a generalized architecture and a heuristic rule.
Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen
2013-06-01
Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.
Approach to design neural cryptography: A generalized architecture and a heuristic rule
NASA Astrophysics Data System (ADS)
Mu, Nankun; Liao, Xiaofeng; Huang, Tingwen
2013-06-01
Neural cryptography, a type of public key exchange protocol, is widely considered as an effective method for sharing a common secret key between two neural networks on public channels. How to design neural cryptography remains a great challenge. In this paper, in order to provide an approach to solve this challenge, a generalized network architecture and a significant heuristic rule are designed. The proposed generic framework is named as tree state classification machine (TSCM), which extends and unifies the existing structures, i.e., tree parity machine (TPM) and tree committee machine (TCM). Furthermore, we carefully study and find that the heuristic rule can improve the security of TSCM-based neural cryptography. Therefore, TSCM and the heuristic rule can guide us to designing a great deal of effective neural cryptography candidates, in which it is possible to achieve the more secure instances. Significantly, in the light of TSCM and the heuristic rule, we further expound that our designed neural cryptography outperforms TPM (the most secure model at present) on security. Finally, a series of numerical simulation experiments are provided to verify validity and applicability of our results.
Influence of satellite motion on polarization qubits in a Space-Earth quantum communication link.
Bonato, Cristian; Aspelmeyer, Markus; Jennewein, Thomas; Pernechele, Claudio; Villoresi, Paolo; Zeilinger, Anton
2006-10-16
In a Space quantum-cryptography experiment a satellite pointing system is needed to send single photons emitted by the source on the satellite to the polarization analysis apparatus on Earth. In this paper a simulation is presented regarding how the satellite pointing systems affect the polarization state of the single photons, to help designing a proper compensation system.
A neural-network approach for visual cryptography and authorization.
Yue, Tai-Wen; Chiang, Suchen
2004-06-01
In this paper, we propose a neural-network approach for visual authorization, which is an application of visual cryptography (VC). The scheme contains a key-share and a set of user-shares. The administrator owns the key-share, and each user owns a user-share issued by the administrator from the user-share set. The shares in the user-share set are visually indistinguishable, i.e. they have the same pictorial meaning. However, the stacking of the key-share with different user-shares will reveal significantly different images. Therefore, the administrator (in fact, only the administrator) can visually recognize the authority assigned to a particular user by viewing the information appearing in the superposed image of key-share and user-share. This approach is completely different from traditional VC approaches. The salient features include: (i) the access schemes are described using a set of graytone images, and (ii) the codebooks to fulfil them are not required; and (iii) the size of share images is the same as the size of target image.
Virtual microscopy and public-key cryptography for Internet telepathology.
Strauss, J S; Felten, C L; Okada, D H; Marchevsky, A M
1999-01-01
The Internet is a potentially inexpensive, widely available medium for telepathology, but there are concerns about its reliability and security. Using a digital camera, 41 photomicrographs of transbronchial biopsies, at x 100 optical magnification, were captured and digitized at 2700 x 3400 pixel, 24 bit/pixel resolution. The image files were saved in JPEG format at medium compression, attached to text files with patient information, encrypted for security in the S/MIME format using a digital signature and digital envelope, and transmitted by email. Received email files were decrypted automatically and the images viewed with standard software. Telepathology diagnoses were compared with original interpretations. The images averaged 810 kByte in size. The encryption and decryption did not cause significant delays in overall transmission time and, together with transmission, did not produce noticeable image degradation. The received image files could be viewed in a manner that simulated light microscopy. There was agreement between telepathology and original diagnoses in 92% of the cases. All the discrepancies were due to inadequate area selection because the pathological features of interest were present in histological levels other than those photographed. The use of high-resolution digital photomicrography, the Internet and public-key cryptography offers an effective and relatively inexpensive method of telepathology consultation. The method is best suited for the diagnosis of small biopsy specimens that require the transmission of only a few digital images that represent the majority of the biopsy materials.
Adaptive and distributed cryptography for signature biometrics protection
NASA Astrophysics Data System (ADS)
Campisi, Patrizio; Maiorana, Emanuele; Gonzalez Prats, Miguel; Neri, Alessandro
2007-02-01
The most emerging technology for people identification and authentication is biometrics. In contrast with traditional recognition approaches, biometric authentication relies on who a person is or what a person does, being based on strictly personal traits, much more difficult to be forgotten, lost, stolen, copied or forged than traditional data. In this paper, we focus on two vulnerable points of biometric systems: the database where the templates are stored and the communication channel between the stored templates and the matcher. Specifically, we propose a method, based on user adaptive error correction codes, to achieve securitization and cancelability of the stored templates applied to dynamic signature features. More in detail, the employed error correction code is tailored to the intra-class variability of each user's signature features. This leads to an enhancement of the system performance expressed in terms of false acceptance rate. Moreover, in order to avoid corruption or interception of the stored templates in the transmission channels, we propose a scheme based on threshold cryptography: the distribution of the certificate authority functionality among a number of nodes provides distributed, fault-tolerant, and hierarchical key management services. Experimental results show the effectiveness of our approach, when compared to traditional non-secure correlation-based classifiers.
Network-Centric Quantum Communications
NASA Astrophysics Data System (ADS)
Hughes, Richard
2014-03-01
Single-photon quantum communications (QC) offers ``future-proof'' cryptographic security rooted in the laws of physics. Today's quantum-secured communications cannot be compromised by unanticipated future technological advances. But to date, QC has only existed in point-to-point instantiations that have limited ability to address the cyber security challenges of our increasingly networked world. In my talk I will describe a fundamentally new paradigm of network-centric quantum communications (NQC) that leverages the network to bring scalable, QC-based security to user groups that may have no direct user-to-user QC connectivity. With QC links only between each of N users and a trusted network node, NQC brings quantum security to N2 user pairs, and to multi-user groups. I will describe a novel integrated photonics quantum smartcard (``QKarD'') and its operation in a multi-node NQC test bed. The QKarDs are used to implement the quantum cryptographic protocols of quantum identification, quantum key distribution and quantum secret splitting. I will explain how these cryptographic primitives are used to provide key management for encryption, authentication, and non-repudiation for user-to-user communications. My talk will conclude with a description of a recent demonstration that QC can meet both the security and quality-of-service (latency) requirements for electric grid control commands and data. These requirements cannot be met simultaneously with present-day cryptography.
Quantum cloning disturbed by thermal Davies environment
NASA Astrophysics Data System (ADS)
Dajka, Jerzy; Łuczka, Jerzy
2016-06-01
A network of quantum gates designed to implement universal quantum cloning machine is studied. We analyze how thermal environment coupled to auxiliary qubits, `blank paper' and `toner' required at the preparation stage of copying, modifies an output fidelity of the cloner. Thermal environment is described in terms of the Markovian Davies theory. We show that such a cloning machine is not universal any more but its output is independent of at least a part of parameters of the environment. As a case study, we consider cloning of states in a six-state cryptography's protocol. We also briefly discuss cloning of arbitrary input states.
Extremal quantum correlations and cryptographic security.
Franz, T; Furrer, F; Werner, R F
2011-06-24
We investigate a fundamental property of device-independent security in quantum cryptography by characterizing probability distributions which are necessarily independent of the measurement results of any eavesdropper. We show that probability distributions that are secure in this sense are exactly the extremal quantum probability distributions. This allows us to give a characterization of security in algebraic terms. We apply the method to common examples for two-party as well as multiparty setups and present a scheme for verifying security of probability distributions with two parties, two measurement settings, and two outcomes. PMID:21770618
Two-out-of-two color matching based visual cryptography schemes.
Machizaud, Jacques; Fournel, Thierry
2012-09-24
Visual cryptography which consists in sharing a secret message between transparencies has been extended to color prints. In this paper, we propose a new visual cryptography scheme based on color matching. The stacked printed media reveal a uniformly colored message decoded by the human visual system. In contrast with the previous color visual cryptography schemes, the proposed one enables to share images without pixel expansion and to detect a forgery as the color of the message is kept secret. In order to correctly print the colors on the media and to increase the security of the scheme, we use spectral models developed for color reproduction describing printed colors from an optical point of view.
NASA Astrophysics Data System (ADS)
Zhang, KeJia; Zhang, Long; Song, TingTing; Yang, YingHui
2016-06-01
In this paper, we propose certain different design ideas on a novel topic in quantum cryptography — quantum operation sharing (QOS). Following these unique ideas, three QOS schemes, the "HIEC" (The scheme whose messages are hidden in the entanglement correlation), "HIAO" (The scheme whose messages are hidden with the assistant operations) and "HIMB" (The scheme whose messages are hidden in the selected measurement basis), have been presented to share the single-qubit operations determinately on target states in a remote node. These schemes only require Bell states as quantum resources. Therefore, they can be directly applied in quantum networks, since Bell states are considered the basic quantum channels in quantum networks. Furthermore, after analyse on the security and resource consumptions, the task of QOS can be achieved securely and effectively in these schemes.
Teleporting photonic qudits using multimode quantum scissors.
Goyal, Sandeep K; Konrad, Thomas
2013-01-01
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a "qudit") by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of "quantum scissors" they are converted back into a qudit carried by a single photon which completes the teleportation scheme.
Teleporting photonic qudits using multimode quantum scissors.
Goyal, Sandeep K; Konrad, Thomas
2013-01-01
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a "qudit") by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of "quantum scissors" they are converted back into a qudit carried by a single photon which completes the teleportation scheme. PMID:24352610
Teleporting photonic qudits using multimode quantum scissors
NASA Astrophysics Data System (ADS)
Goyal, Sandeep K.; Konrad, Thomas
2013-12-01
Teleportation plays an important role in the communication of quantum information between the nodes of a quantum network and is viewed as an essential ingredient for long-distance Quantum Cryptography. We describe a method to teleport the quantum information carried by a photon in a superposition of a number d of light modes (a ``qudit'') by the help of d additional photons based on transcription. A qudit encoded into a single excitation of d light modes (in our case Laguerre-Gauss modes which carry orbital angular momentum) is transcribed to d single-rail photonic qubits, which are spatially separated. Each single-rail qubit consists of a superposition of vacuum and a single photon in each one of the modes. After successful teleportation of each of the d single-rail qubits by means of ``quantum scissors'' they are converted back into a qudit carried by a single photon which completes the teleportation scheme.
Quantum communication and information processing
NASA Astrophysics Data System (ADS)
Beals, Travis Roland
Quantum computers enable dramatically more efficient algorithms for solving certain classes of computational problems, but, in doing so, they create new problems. In particular, Shor's Algorithm allows for efficient cryptanalysis of many public-key cryptosystems. As public key cryptography is a critical component of present-day electronic commerce, it is crucial that a working, secure replacement be found. Quantum key distribution (QKD), first developed by C.H. Bennett and G. Brassard, offers a partial solution, but many challenges remain, both in terms of hardware limitations and in designing cryptographic protocols for a viable large-scale quantum communication infrastructure. In Part I, I investigate optical lattice-based approaches to quantum information processing. I look at details of a proposal for an optical lattice-based quantum computer, which could potentially be used for both quantum communications and for more sophisticated quantum information processing. In Part III, I propose a method for converting and storing photonic quantum bits in the internal state of periodically-spaced neutral atoms by generating and manipulating a photonic band gap and associated defect states. In Part II, I present a cryptographic protocol which allows for the extension of present-day QKD networks over much longer distances without the development of new hardware. I also present a second, related protocol which effectively solves the authentication problem faced by a large QKD network, thus making QKD a viable, information-theoretic secure replacement for public key cryptosystems.
Quantum rewinding via phase estimation
NASA Astrophysics Data System (ADS)
Tabia, Gelo Noel
2015-03-01
In cryptography, the notion of a zero-knowledge proof was introduced by Goldwasser, Micali, and Rackoff. An interactive proof system is said to be zero-knowledge if any verifier interacting with an honest prover learns nothing beyond the validity of the statement being proven. With recent advances in quantum information technologies, it has become interesting to ask if classical zero-knowledge proof systems remain secure against adversaries with quantum computers. The standard approach to show the zero-knowledge property involves constructing a simulator for a malicious verifier that can be rewinded to a previous step when the simulation fails. In the quantum setting, the simulator can be described by a quantum circuit that takes an arbitrary quantum state as auxiliary input but rewinding becomes a nontrivial issue. Watrous proposed a quantum rewinding technique in the case where the simulation's success probability is independent of the auxiliary input. Here I present a more general quantum rewinding scheme that employs the quantum phase estimation algorithm. This work was funded by institutional research grant IUT2-1 from the Estonian Research Council and by the European Union through the European Regional Development Fund.
Bank Transfer Over Quantum Channel With Digital Checks
Kanamori, Yoshito; Yoo, Seong-Moo; Sheldon, Frederick T
2006-01-01
In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distributions) as practical applications. In this paper, we propose a bank transfer (i.e., funds or Electronic Funds Transfer) system utilizing both classical and quantum cryptography to provide theoretically unbreakable security. This system can be realized using current technologies (e.g., linear polarizers and Faraday rotators) and requires no additional authentication and no key distribution scheme. However, a trusted third party must keep all member banks' private keys for encryption, authentication and also for functions to generate classical digital signatures.
On the passive probing of fiber optic quantum communication channels
Korol'kov, A. V.; Katamadze, K. G.; Kulik, S. P.; Molotkov, S. N.
2010-04-15
Avalanche photodetectors based on InGaAs:P are the most sensitive and only detectors operating in the telecommunication wavelength range 1.30-1.55 {mu}m in the fiber optic quantum cryptography systems that can operate in the single photon count mode. In contrast to the widely used silicon photodetectors for wavelengths up to 1 {mu}m operating in a waiting mode, these detectors always operate in a gated mode. The production of an electron-hole pair in the process of the absorption of a photon and the subsequent appearance of an avalanche of carriers can be accompanied by the inverse processes of the recombination and emission of photons. Such a backward emission can present a potential serious problem for the stability of fiber optic quantum cryptography systems against passive probing. The results of analyzing the detection of backscattered radiation are reported. The probability of such an emission has been estimated.
Intensity modulation and direct detection quantum key distribution based on quantum noise
NASA Astrophysics Data System (ADS)
Ikuta, Takuya; Inoue, Kyo
2016-01-01
Quantum key distribution (QKD) has been studied for achieving perfectly secure cryptography based on quantum mechanics. This paper presents a novel QKD scheme that is based on an intensity-modulation and direct-detection system. Two slightly intensity-modulated pulses are sent from a transmitter, and a receiver determines key bits from the directly detected intensity. We analyzed the system performance for two typical eavesdropping methods, a beam splitting attack and an intercept-resend attack, with an assumption that the transmitting and receiving devices are fully trusted. Our brief analysis showed that short- or middle-range QKD systems are achievable with a simple setup.
No extension of quantum theory can have improved predictive power.
Colbeck, Roger; Renner, Renato
2011-01-01
According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory that removes this indeterminism, as suspected by Einstein, Podolsky and Rosen. Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography. PMID:21811240
Quantum Entanglement: A Fundamental Concept Finding its Applications
NASA Astrophysics Data System (ADS)
Zeilinger, Anton
Entanglement, according to the Austrian physicist Erwin Schrödinger the Essence of Quantum Mechanics, has been known for a long time now to be the source of a number of paradoxical and counterintuitive phenomena. Of those the most remarkable one is usually called non-locality and it is at the heart of the Einstein-Podolsky-Rosen Paradox and of the fact that Quantum Mechanics violates Bell's inequalities. Recent years saw an emergence of novel ideas in entanglement of three or more particles. Most recently it turned out that entanglement is an important concept in the development of quantum communication, quantum cryptography and quantum computation. First explicit experimental realizations with two or more photons include quantum dense coding and quantum teleportation.
No extension of quantum theory can have improved predictive power.
Colbeck, Roger; Renner, Renato
2011-08-02
According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory that removes this indeterminism, as suspected by Einstein, Podolsky and Rosen. Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography.
Memory-built-in quantum cloning in a hybrid solid-state spin register
Wang, W.-B.; Zu, C.; He, L.; Zhang, W.-G.; Duan, L.-M.
2015-01-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science. PMID:26178617
Memory-built-in quantum cloning in a hybrid solid-state spin register
NASA Astrophysics Data System (ADS)
Wang, W.-B.; Zu, C.; He, L.; Zhang, W.-G.; Duan, L.-M.
2015-07-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science.
Memory-built-in quantum cloning in a hybrid solid-state spin register.
Wang, W-B; Zu, C; He, L; Zhang, W-G; Duan, L-M
2015-01-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science. PMID:26178617
Quantum entanglement between an optical photon and a solid-state spin qubit.
Togan, E; Chu, Y; Trifonov, A S; Jiang, L; Maze, J; Childress, L; Dutt, M V G; Sørensen, A S; Hemmer, P R; Zibrov, A S; Lukin, M D
2010-08-01
Quantum entanglement is among the most fascinating aspects of quantum theory. Entangled optical photons are now widely used for fundamental tests of quantum mechanics and applications such as quantum cryptography. Several recent experiments demonstrated entanglement of optical photons with trapped ions, atoms and atomic ensembles, which are then used to connect remote long-term memory nodes in distributed quantum networks. Here we realize quantum entanglement between the polarization of a single optical photon and a solid-state qubit associated with the single electronic spin of a nitrogen vacancy centre in diamond. Our experimental entanglement verification uses the quantum eraser technique, and demonstrates that a high degree of control over interactions between a solid-state qubit and the quantum light field can be achieved. The reported entanglement source can be used in studies of fundamental quantum phenomena and provides a key building block for the solid-state realization of quantum optical networks. PMID:20686569
Quantum entanglement between an optical photon and a solid-state spin qubit.
Togan, E; Chu, Y; Trifonov, A S; Jiang, L; Maze, J; Childress, L; Dutt, M V G; Sørensen, A S; Hemmer, P R; Zibrov, A S; Lukin, M D
2010-08-01
Quantum entanglement is among the most fascinating aspects of quantum theory. Entangled optical photons are now widely used for fundamental tests of quantum mechanics and applications such as quantum cryptography. Several recent experiments demonstrated entanglement of optical photons with trapped ions, atoms and atomic ensembles, which are then used to connect remote long-term memory nodes in distributed quantum networks. Here we realize quantum entanglement between the polarization of a single optical photon and a solid-state qubit associated with the single electronic spin of a nitrogen vacancy centre in diamond. Our experimental entanglement verification uses the quantum eraser technique, and demonstrates that a high degree of control over interactions between a solid-state qubit and the quantum light field can be achieved. The reported entanglement source can be used in studies of fundamental quantum phenomena and provides a key building block for the solid-state realization of quantum optical networks.
Memory-built-in quantum cloning in a hybrid solid-state spin register.
Wang, W-B; Zu, C; He, L; Zhang, W-G; Duan, L-M
2015-07-16
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude. The realization of a cloning machine with built-in quantum memory provides a key step for application of quantum cloning in quantum information science.
Practical secure quantum communications
NASA Astrophysics Data System (ADS)
Diamanti, Eleni
2015-05-01
We review recent advances in the field of quantum cryptography, focusing in particular on practical implementations of two central protocols for quantum network applications, namely key distribution and coin flipping. The former allows two parties to share secret messages with information-theoretic security, even in the presence of a malicious eavesdropper in the communication channel, which is impossible with classical resources alone. The latter enables two distrustful parties to agree on a random bit, again with information-theoretic security, and with a cheating probability lower than the one that can be reached in a classical scenario. Our implementations rely on continuous-variable technology for quantum key distribution and on a plug and play discrete-variable system for coin flipping, and necessitate a rigorous security analysis adapted to the experimental schemes and their imperfections. In both cases, we demonstrate the protocols with provable security over record long distances in optical fibers and assess the performance of our systems as well as their limitations. The reported advances offer a powerful toolbox for practical applications of secure communications within future quantum networks.
Cryptographic Research and NSA: Report of the Public Cryptography Study Group.
ERIC Educational Resources Information Center
Davida, George I.
1981-01-01
The Public Cryptography Study Group accepted the claim made by the National Security Agency that some information in some publications concerning cryptology could be inimical to national security, and is allowing the establishment of a voluntary mechanism, on an experimental basis, for NSA to review cryptology manuscripts. (MLW)
The Design and Evaluation of a Cryptography Teaching Strategy for Software Engineering Students
ERIC Educational Resources Information Center
Dowling, T.
2006-01-01
The present paper describes the design, implementation and evaluation of a cryptography module for final-year software engineering students. The emphasis is on implementation architectures and practical cryptanalysis rather than a standard mathematical approach. The competitive continuous assessment process reflects this approach and rewards…
An Application-Independent Cryptography Model That Is Easy to Use for All Level Users
ERIC Educational Resources Information Center
Gabrielson, Anthony J.
2013-01-01
Cryptography libraries are inflexible and difficult for developers to integrate with their applications. These difficulties are often encountered by applications, like PGP, which are non-intuitive for end-users and are often used improperly or not at all. This thesis discusses the negative impact of the current prevailing poor usability on…
An Anti-Cheating Visual Cryptography Scheme Based on Chaotic Encryption System
NASA Astrophysics Data System (ADS)
Han, Yanyan; Xu, Zhuolin; Ge, Xiaonan; He, Wencai
By chaotic encryption system and introducing the trusted third party (TTP), in this paper, an anti-cheating visual cryptography scheme (VCS) is proposed. The scheme solved the problem of dishonest participants and improved the security of chaotic encryption system. Simulation results and analysis show that the recovery image is acceptable, the system can detect the cheating in participants effectively and with high security.
Elliptic Curve Cryptography with Security System in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Huang, Xu; Sharma, Dharmendra
2010-10-01
The rapid progress of wireless communications and embedded micro-electro-system technologies has made wireless sensor networks (WSN) very popular and even become part of our daily life. WSNs design are generally application driven, namely a particular application's requirements will determine how the network behaves. However, the natures of WSN have attracted increasing attention in recent years due to its linear scalability, a small software footprint, low hardware implementation cost, low bandwidth requirement, and high device performance. It is noted that today's software applications are mainly characterized by their component-based structures which are usually heterogeneous and distributed, including the WSNs. But WSNs typically need to configure themselves automatically and support as hoc routing. Agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. This paper based on our previous works [1, 2], three contributions have made, namely (a) fuzzy controller for dynamic slide window size to improve the performance of running ECC (b) first presented a hidden generation point for protection from man-in-the middle attack and (c) we first investigates multi-agent applying for key exchange together. Security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the natures that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic curve cryptography (ECC) is one of high potential candidates for WSNs, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. For saving pre-computing storages recently there is a trend for the sensor networks that the sensor group leaders rather than sensors communicate to the end database, which highlighted the needs to prevent from the man
Quantum control on entangled bipartite qubits
Delgado, Francisco
2010-04-15
Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not alter their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.
Measurement and Information Extraction in Complex Dynamics Quantum Computation
NASA Astrophysics Data System (ADS)
Casati, Giulio; Montangero, Simone
Quantum Information processing has several di.erent applications: some of them can be performed controlling only few qubits simultaneously (e.g. quantum teleportation or quantum cryptography) [1]. Usually, the transmission of large amount of information is performed repeating several times the scheme implemented for few qubits. However, to exploit the advantages of quantum computation, the simultaneous control of many qubits is unavoidable [2]. This situation increases the experimental di.culties of quantum computing: maintaining quantum coherence in a large quantum system is a di.cult task. Indeed a quantum computer is a many-body complex system and decoherence, due to the interaction with the external world, will eventually corrupt any quantum computation. Moreover, internal static imperfections can lead to quantum chaos in the quantum register thus destroying computer operability [3]. Indeed, as it has been shown in [4], a critical imperfection strength exists above which the quantum register thermalizes and quantum computation becomes impossible. We showed such e.ects on a quantum computer performing an e.cient algorithm to simulate complex quantum dynamics [5,6].
Generation and confirmation of a (100 x 100)-dimensional entangled quantum system.
Krenn, Mario; Huber, Marcus; Fickler, Robert; Lapkiewicz, Radek; Ramelow, Sven; Zeilinger, Anton
2014-04-29
Entangled quantum systems have properties that have fundamentally overthrown the classical worldview. Increasing the complexity of entangled states by expanding their dimensionality allows the implementation of novel fundamental tests of nature, and moreover also enables genuinely new protocols for quantum information processing. Here we present the creation of a (100 × 100)-dimensional entangled quantum system, using spatial modes of photons. For its verification we develop a novel nonlinear criterion which infers entanglement dimensionality of a global state by using only information about its subspace correlations. This allows very practical experimental implementation as well as highly efficient extraction of entanglement dimensionality information. Applications in quantum cryptography and other protocols are very promising.
Subcarrier Wave Quantum Key Distribution in Telecommunication Network with Bitrate 800 kbit/s
NASA Astrophysics Data System (ADS)
Gleim, A. V.; Nazarov, Yu. V.; Egorov, V. I.; Smirnov, S. V.; Bannik, O. I.; Chistyakov, V. V.; Kynev, S. M.; Anisimov, A. A.; Kozlov, S. A.; Vasiliev, V. N.
2015-09-01
In the course of work on creating the first quantum communication network in Russia we demonstrated quantum key distribution in metropolitan optical network infrastructure. A single-pass subcarrier wave quantum cryptography scheme was used in the experiments. BB84 protocol with strong reference was chosen for performing key distribution. The registered sifted key rate in an optical cable with 1.5 dB loss was 800 Kbit/s. Signal visibility exceeded 98%, and quantum bit error rate value was 1%. The achieved result is a record for this type of systems.
Conditions for monogamy of quantum correlations in multipartite systems
NASA Astrophysics Data System (ADS)
Kumar, Asutosh
2016-09-01
Monogamy of quantum correlations is a vibrant area of research because of its potential applications in several areas in quantum information ranging from quantum cryptography to co-operative phenomena in many-body physics. In this paper, we investigate conditions under which monogamy is preserved for functions of quantum correlation measures. We prove that a monogamous measure remains monogamous on raising its power, and a non-monogamous measure remains non-monogamous on lowering its power. We also prove that monogamy of a convex quantum correlation measure for arbitrary multipartite pure quantum state leads to its monogamy for mixed states in the same Hilbert space. Monogamy of squared negativity for mixed states and that of entanglement of formation follow as corollaries of our results.
An image encryption scheme based on quantum logistic map
NASA Astrophysics Data System (ADS)
Akhshani, A.; Akhavan, A.; Lim, S.-C.; Hassan, Z.
2012-12-01
The topic of quantum chaos has begun to draw increasing attention in recent years. While a satisfactory definition for it is not settled yet in order to differentiate between its classical counterparts. Dissipative quantum maps can be characterized by sensitive dependence on initial conditions, like classical maps. Considering this property, an implementation of image encryption scheme based on the quantum logistic map is proposed. The security and performance analysis of the proposed image encryption is performed using well-known methods. The results of the reliability analysis are encouraging and it can be concluded that, the proposed scheme is efficient and secure. The results of this study also suggest application of other quantum maps such as quantum standard map and quantum baker map in cryptography and other aspects of security and privacy.
Quantum key distribution with an entangled light emitting diode
Dzurnak, B.; Stevenson, R. M.; Nilsson, J.; Dynes, J. F.; Yuan, Z. L.; Skiba-Szymanska, J.; Shields, A. J.; Farrer, I.; Ritchie, D. A.
2015-12-28
Measurements performed on entangled photon pairs shared between two parties can allow unique quantum cryptographic keys to be formed, creating secure links between users. An advantage of using such entangled photon links is that they can be adapted to propagate entanglement to end users of quantum networks with only untrusted nodes. However, demonstrations of quantum key distribution with entangled photons have so far relied on sources optically excited with lasers. Here, we realize a quantum cryptography system based on an electrically driven entangled-light-emitting diode. Measurement bases are passively chosen and we show formation of an error-free quantum key. Our measurements also simultaneously reveal Bell's parameter for the detected light, which exceeds the threshold for quantum entanglement.
Authentication of quantum messages.
Barnum, Howard; Crépeau, Jean-Claude; Gottesman, D.; Smith, A.; Tapp, Alan
2001-01-01
Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a private, classical random key, we provide a non-interactive scheme that both enables A to encrypt and authenticate (with unconditional security) an m qubit message by encoding it into m + s qubits, where the probability decreases exponentially in the security parameter s. The scheme requires a private key of size 2m + O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically: authentication and encryption are independent tasks, and one can authenticate a message while leaving it publicly readable. This reasoning has two important consequences: On one hand, it allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. On the other hand, we use it to show that digitally signing quantum states is impossible, even with only computational security.
Quantum paradox of choice: More freedom makes summoning a quantum state harder
NASA Astrophysics Data System (ADS)
Adlam, Emily; Kent, Adrian
2016-06-01
The properties of quantum information in space-time can be investigated by studying operational tasks, such as "summoning," in which an unknown quantum state is supplied at one point and a call is made at another for it to be returned at a third. Hayden and May [arXiv:1210.0913] recently proved necessary and sufficient conditions for guaranteeing successful return of a summoned state for finite sets of call and return points when there is a guarantee of at most one summons. We prove necessary and sufficient conditions when there may be several possible summonses and complying with any one constitutes success, and we demonstrate the existence of an apparent paradox: The extra freedom makes it strictly harder to complete the summoning task. This result has practical applications for distributed quantum computing and cryptography and implications for our understanding of relativistic quantum information and its localization in space-time.
Chen, Wen; Chen, Xudong
2011-05-01
In recent years, coherent diffractive imaging has been considered as a promising alternative for information retrieval instead of conventional interference methods. Coherent diffractive imaging using the X-ray light source has opened up a new research perspective for the measurement of non-crystalline and biological specimens, and can achieve unprecedentedly high resolutions. In this paper, we show how a three-dimensional (3D) particle-like distribution and coherent diffractive imaging can be applied for a study of optical cryptography. An optical multiple-random-phase-mask encoding approach is used, and the plaintext is considered as a series of particles distributed in a 3D space. A topology concept is also introduced into the proposed optical cryptosystem. During image decryption, a retrieval algorithm is developed to extract the plaintext from the ciphertexts. In addition, security and advantages of the proposed optical cryptography topology are also analyzed.
Public channel cryptography by synchronization of neural networks and chaotic maps.
Mislovaty, Rachel; Klein, Einat; Kanter, Ido; Kinzel, Wolfgang
2003-09-12
Two different kinds of synchronization have been applied to cryptography: synchronization of chaotic maps by one common external signal and synchronization of neural networks by mutual learning. By combining these two mechanisms, where the external signal to the chaotic maps is synchronized by the nets, we construct a hybrid network which allows a secure generation of secret encryption keys over a public channel. The security with respect to attacks, recently proposed by Shamir et al., is increased by chaotic synchronization.
Experimental reversion of the optimal quantum cloning and flipping processes
Sciarrino, Fabio; Secondi, Veronica; De Martini, Francesco
2006-04-15
The quantum cloner machine maps an unknown arbitrary input qubit into two optimal clones and one optimal flipped qubit. By combining linear and nonlinear optical methods we experimentally implement a scheme that, after the cloning transformation, restores the original input qubit in one of the output channels, by using local measurements, classical communication, and feedforward. This nonlocal method demonstrates how the information on the input qubit can be restored after the cloning process. The realization of the reversion process is expected to find useful applications in the field of modern multipartite quantum cryptography.
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2016-07-12
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Bell's Theorem, Entanglement, Quantum Teleportation, and All That
Legett, Anthony
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as 'teleportation' and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Bell's Theorem, Entaglement, Quantum Teleportation and All That
Anthony Leggett
2008-03-05
One of the most surprising aspects of quantum mechanics is that under certain circumstances it does not allow individual physical systems, even when isolated, to possess properties in their own right. This feature, first clearly appreciated by John Bell in 1964, has in the last three decades been tested experimentally and found (in most people's opinion) to be spectacularly confirmed. More recently it has been realized that it permits various operations which are classically impossible, such as "teleportation" and secure-in-principle cryptography. This talk is a very basic introduction to the subject, which requires only elementary quantum mechanics.
Memory-built-in quantum cloning in a hybrid solid-state spin register
NASA Astrophysics Data System (ADS)
Wang, Weibin; Zu, Chong; He, Li; Zhang, Wengang; Duan, Luming
2015-05-01
As a way to circumvent the quantum no-cloning theorem, approximate quantum cloning protocols have received wide attention with remarkable applications. Copying of quantum states to memory qubits provides an important strategy for eavesdropping in quantum cryptography. We report an experiment that realizes cloning of quantum states from an electron spin to a nuclear spin in a hybrid solid-state spin register with near-optimal fidelity. The nuclear spin provides an ideal memory qubit at room temperature, which stores the cloned quantum states for a millisecond under ambient conditions, exceeding the lifetime of the original quantum state carried by the electron spin by orders of magnitude, and making it an ideal memory qubit. Our experiment is based on control of an individual nitrogen vacancy (NV) center in the diamond, which is a diamond defect that attracts strong interest in recent years with great potential for implementation of quantum information protocols.
Design of an Elliptic Curve Cryptography processor for RFID tag chips.
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-09-26
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip.
Design of an Elliptic Curve Cryptography Processor for RFID Tag Chips
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-01-01
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip. PMID:25264952
Devi, B Pushpa; Singh, Kh Manglem; Roy, Sudipta
2016-01-01
This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same size after shuffling it and then the singular value decomposition is applied to each randomly selected block. Shares are generated by comparing one of the elements in the first column of the left orthogonal matrix with its corresponding element in the right orthogonal matrix of the singular value decomposition of the block of the low frequency sub-band. The experimental results show that the proposed scheme clearly verifies the copyright of the digital images, and is robust to withstand several image processing attacks. Comparison with the other related visual cryptography-based algorithms reveals that the proposed method gives better performance. The proposed method is especially resilient against the rotation attack.
Devi, B Pushpa; Singh, Kh Manglem; Roy, Sudipta
2016-01-01
This paper proposes a new watermarking algorithm based on the shuffled singular value decomposition and the visual cryptography for copyright protection of digital images. It generates the ownership and identification shares of the image based on visual cryptography. It decomposes the image into low and high frequency sub-bands. The low frequency sub-band is further divided into blocks of same size after shuffling it and then the singular value decomposition is applied to each randomly selected block. Shares are generated by comparing one of the elements in the first column of the left orthogonal matrix with its corresponding element in the right orthogonal matrix of the singular value decomposition of the block of the low frequency sub-band. The experimental results show that the proposed scheme clearly verifies the copyright of the digital images, and is robust to withstand several image processing attacks. Comparison with the other related visual cryptography-based algorithms reveals that the proposed method gives better performance. The proposed method is especially resilient against the rotation attack. PMID:27468392
Design of an Elliptic Curve Cryptography processor for RFID tag chips.
Liu, Zilong; Liu, Dongsheng; Zou, Xuecheng; Lin, Hui; Cheng, Jian
2014-01-01
Radio Frequency Identification (RFID) is an important technique for wireless sensor networks and the Internet of Things. Recently, considerable research has been performed in the combination of public key cryptography and RFID. In this paper, an efficient architecture of Elliptic Curve Cryptography (ECC) Processor for RFID tag chip is presented. We adopt a new inversion algorithm which requires fewer registers to store variables than the traditional schemes. A new method for coordinate swapping is proposed, which can reduce the complexity of the controller and shorten the time of iterative calculation effectively. A modified circular shift register architecture is presented in this paper, which is an effective way to reduce the area of register files. Clock gating and asynchronous counter are exploited to reduce the power consumption. The simulation and synthesis results show that the time needed for one elliptic curve scalar point multiplication over GF(2163) is 176.7 K clock cycles and the gate area is 13.8 K with UMC 0.13 μm Complementary Metal Oxide Semiconductor (CMOS) technology. Moreover, the low power and low cost consumption make the Elliptic Curve Cryptography Processor (ECP) a prospective candidate for application in the RFID tag chip. PMID:25264952
Experimental demonstration of counterfactual quantum communication.
Liu, Yang; Ju, Lei; Liang, Xiao-Lei; Tang, Shi-Biao; Tu, Guo-Liang Shen; Zhou, Lei; Peng, Cheng-Zhi; Chen, Kai; Chen, Teng-Yun; Chen, Zeng-Bing; Pan, Jian-Wei
2012-07-20
Quantum effects, besides offering substantial superiority in many tasks over classical methods, are also expected to provide interesting ways to establish secret keys between remote parties. A striking scheme called "counterfactual quantum cryptography" proposed by Noh [Phys. Rev. Lett. 103, 230501 (2009).] allows one to maintain secure key distributions, in which particles carrying secret information are seemingly not being transmitted through quantum channels. We have experimentally demonstrated, for the first time, a faithful implementation for such a scheme with an on-table realization operating at telecom wavelengths. To verify its feasibility for extension over a long distance, we have furthermore reported an illustration on a 1 km fiber. In both cases, high visibilities of more than 98% are achieved through active stabilization of interferometers. Our demonstration is crucial as a direct verification of such a remarkable application, and this procedure can become a key communication module for revealing fundamental physics through counterfactuals.
Experimental demonstration of counterfactual quantum communication.
Liu, Yang; Ju, Lei; Liang, Xiao-Lei; Tang, Shi-Biao; Tu, Guo-Liang Shen; Zhou, Lei; Peng, Cheng-Zhi; Chen, Kai; Chen, Teng-Yun; Chen, Zeng-Bing; Pan, Jian-Wei
2012-07-20
Quantum effects, besides offering substantial superiority in many tasks over classical methods, are also expected to provide interesting ways to establish secret keys between remote parties. A striking scheme called "counterfactual quantum cryptography" proposed by Noh [Phys. Rev. Lett. 103, 230501 (2009).] allows one to maintain secure key distributions, in which particles carrying secret information are seemingly not being transmitted through quantum channels. We have experimentally demonstrated, for the first time, a faithful implementation for such a scheme with an on-table realization operating at telecom wavelengths. To verify its feasibility for extension over a long distance, we have furthermore reported an illustration on a 1 km fiber. In both cases, high visibilities of more than 98% are achieved through active stabilization of interferometers. Our demonstration is crucial as a direct verification of such a remarkable application, and this procedure can become a key communication module for revealing fundamental physics through counterfactuals. PMID:22861830
Entanglement enhances security in quantum communication
Demkowicz-Dobrzanski, Rafal; Sen, Aditi; Sen, Ujjwal; Lewenstein, Maciej
2009-07-15
Secret sharing is a protocol in which a 'boss' wants to send a classical message secretly to two 'subordinates', such that none of the subordinates is able to know the message alone, while they can find it if they cooperate. Quantum mechanics is known to allow for such a possibility. We analyze tolerable quantum bit error rates in such secret sharing protocols in the physically relevant case when the eavesdropping is local with respect to the two channels of information transfer from the boss to the two subordinates. We find that using entangled encoding states is advantageous to legitimate users of the protocol. We therefore find that entanglement is useful for secure quantum communication. We also find that bound entangled states with positive partial transpose are not useful as a local eavesdropping resource. Moreover, we provide a criterion for security in secret sharing--a parallel of the Csiszar-Koerner criterion in single-receiver classical cryptography.
Quantum key distribution session with 16-dimensional photonic states.
Etcheverry, S; Cañas, G; Gómez, E S; Nogueira, W A T; Saavedra, C; Xavier, G B; Lima, G
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.
Quantum key distribution session with 16-dimensional photonic states.
Etcheverry, S; Cañas, G; Gómez, E S; Nogueira, W A T; Saavedra, C; Xavier, G B; Lima, G
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
Quantum key distribution session with 16-dimensional photonic states
Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.
2013-01-01
The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033
The Quantum Information Revolution: 101 Uses for Schodinger's Cat
Kwait, Paul G.
2007-09-05
A century after Einstein's revolutionary suggestion that light is composed of particles, the quantum information revolution seeks to use the almost magical properties of non-classical physics to enable new feats in information processing. The critical quantum resource is entanglement, which can now be produced at high rates with exquisite precision, enabling such feats as quantum cryptography and teleportation. I will describe some of these "micracles," and our investigations into how the usual benefits can be further extended, by using more complex quantum states (e.g., "hyper-entanglement"), and by incorporating other elements of modern physics (e.g., special relativity). Time and appetites permitting, a brief lesson in quantum cooking may be forthcoming.
Quantum entanglement and geometry of determinantal varieties
Chen Hao
2006-05-15
Quantum entanglement was first recognized as a feature of quantum mechanics in the famous paper of Einstein, Podolsky, and Rosen. Recently it has been realized that quantum entanglement is a key ingredient in quantum computation, quantum communication, and quantum cryptography. In this paper, we introduce algebraic sets, which are determinantal varieties in the complex projective spaces or the products of complex projective spaces, for the mixed states on bipartite or multipartite quantum systems as their invariants under local unitary transformations. These invariants are naturally arised from the physical consideration of measuring mixed states by separable pure states. Our construction has applications in the following important topics in quantum information theory: (1) separability criterion, it is proved that the algebraic sets must be a union of the linear subspaces if the mixed states are separable; (2) simulation of Hamiltonians, it is proved that the simulation of semipositive Hamiltonians of the same rank implies the projective isomorphisms of the corresponding algebraic sets; (3) construction of bound entangled mixed states, examples of the entangled mixed states which are invariant under partial transpositions (thus PPT bound entanglement) are constructed systematically from our new separability criterion.
Quantum crytography over 14km of installed optical fiber
Hughes, R.J.; Luther, G.G.; Morgan, G.L.; Simmons, C.
1995-09-01
We have made the first demonstration that low error rate quantum cryptography over long distances (14km) of installed optical fiber in a real-world environment, subject to uncontrolled temperature and mechanical influences, representing an important new step towards incorporation of quantum cryptography into existing information security systems. We also point out that the high visibility single-photon interference in our experiment allows us to infer a test of the superposition principle of quantum mechanics: a photon reaching the detector has traveled over 14km of optical fiber in a wavepacket comprising a coherent superposition of two components that are spatially separated by about 2m. In principle, there are decoherence processes (or even possible modifications of quantum mechanics) that could cause the photon`s wavefunction to collapse into one component or the other during propagation, leading to a reduction in visibility. However, our results are consistent with no such loss of quantum coherence during the 67-{mu}s propagation time.
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.
Quantum attack-resistent certificateless multi-receiver signcryption scheme.
Li, Huixian; Chen, Xubao; Pang, Liaojun; Shi, Weisong
2013-01-01
The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards. PMID:23967037
Improving the security of arbitrated quantum signature against the forgery attack
NASA Astrophysics Data System (ADS)
Zhang, Ke-Jia; Zhang, Wei-Wei; Li, Dan
2013-08-01
As a feasible model for signing quantum messages, some cryptanalysis and improvement of arbitrated quantum signature (AQS) have received a great deal of attentions in recent years. However, in this paper we find the previous improvement is not suitable implemented in some typical AQS protocols in the sense that the receiver, Bob, can forge a valid signature under known message attack. We describe the forgery strategy and present some corresponding improved strategies to stand against the forgery attack by modifying the encryption algorithm, an important part of AQS. These works preserve the merits of AQS and lead some potential improvements of the security in quantum signature or other cryptography problems.
On the number of entangled qubits in quantum wireless sensor networks
NASA Astrophysics Data System (ADS)
Mohapatra, Amit Kumar; Balakrishnan, S.
2016-08-01
Wireless sensor networks (WSNs) can take the advantages by utilizing the security schemes based on the concepts of quantum computation and cryptography. However, quantum wireless sensor networks (QWSNs) are shown to have many practical constraints. One of the constraints is the number of entangled qubits which is very high in the quantum security scheme proposed by [Nagy et al., Nat. Comput. 9 (2010) 819]. In this work, we propose a modification of the security scheme introduced by Nagy et al. and hence the reduction in the number of entangled qubits is shown. Further, the modified scheme can overcome some of the constraints in the QWSNs.
NASA Astrophysics Data System (ADS)
Bartkiewicz, Karol; Černoch, Antonín; Lemr, Karel; Miranowicz, Adam; Nori, Franco
2016-06-01
Temporal steering, which is a temporal analog of Einstein-Podolsky-Rosen steering, refers to temporal quantum correlations between the initial and final state of a quantum system. Our analysis of temporal steering inequalities in relation to the average quantum bit error rates reveals the interplay between temporal steering and quantum cloning, which guarantees the security of quantum key distribution based on mutually unbiased bases against individual attacks. The key distributions analyzed here include the Bennett-Brassard 1984 protocol and the six-state 1998 protocol by Bruss. Moreover, we define a temporal steerable weight, which enables us to identify a kind of monogamy of temporal correlation that is essential to quantum cryptography and useful for analyzing various scenarios of quantum causality.
Single-dot optical emission from ultralow density well-isolated InP quantum dots
Ugur, A.; Hatami, F.; Masselink, W. T.; Vamivakas, A. N.; Lombez, L.; Atatuere, M.
2008-10-06
We demonstrate a straightforward way to obtain single well-isolated quantum dots emitting in the visible part of the spectrum and characterize the optical emission from single quantum dots using this method. Self-assembled InP quantum dots are grown using gas-source molecular-beam epitaxy over a wide range of InP deposition rates, using an ultralow growth rate of about 0.01 atomic monolayers/s, a quantum-dot density of 1 dot/{mu}m{sup 2} is realized. The resulting isolated InP quantum dots embedded in an InGaP matrix are individually characterized without the need for lithographical patterning and masks on the substrate. Such low-density quantum dots show excitonic emission at around 670 nm with a linewidth limited by instrument resolution. This system is applicable as a single-photon source for applications such as quantum cryptography.
Fully device-independent quantum key distribution.
Vazirani, Umesh; Vidick, Thomas
2014-10-01
Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol.
Fully device-independent quantum key distribution.
Vazirani, Umesh; Vidick, Thomas
2014-10-01
Quantum cryptography promises levels of security that are impossible to replicate in a classical world. Can this security be guaranteed even when the quantum devices on which the protocol relies are untrusted? This central question dates back to the early 1990s when the challenge of achieving device-independent quantum key distribution was first formulated. We answer this challenge by rigorously proving the device-independent security of a slight variant of Ekert's original entanglement-based protocol against the most general (coherent) attacks. The resulting protocol is robust: While assuming only that the devices can be modeled by the laws of quantum mechanics and are spatially isolated from each other and from any adversary's laboratory, it achieves a linear key rate and tolerates a constant noise rate in the devices. In particular, the devices may have quantum memory and share arbitrary quantum correlations with the eavesdropper. The proof of security is based on a new quantitative understanding of the monogamous nature of quantum correlations in the context of a multiparty protocol. PMID:25325625
Robust quantum data locking from phase modulation
NASA Astrophysics Data System (ADS)
Lupo, Cosmo; Wilde, Mark M.; Lloyd, Seth
2014-08-01
Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the key by a proportionate amount. This implies that a constant size key can still lock an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random code words, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.
BOOK REVIEW Quantum Measurement and Control Quantum Measurement and Control
NASA Astrophysics Data System (ADS)
Kiefer, Claus
2010-12-01
In the last two decades there has been an enormous progress in the experimental investigation of single quantum systems. This progress covers fields such as quantum optics, quantum computation, quantum cryptography, and quantum metrology, which are sometimes summarized as `quantum technologies'. A key issue there is entanglement, which can be considered as the characteristic feature of quantum theory. As disparate as these various fields maybe, they all have to deal with a quantum mechanical treatment of the measurement process and, in particular, the control process. Quantum control is, according to the authors, `control for which the design requires knowledge of quantum mechanics'. Quantum control situations in which measurements occur at important steps are called feedback (or feedforward) control of quantum systems and play a central role here. This book presents a comprehensive and accessible treatment of the theoretical tools that are needed to cope with these situations. It also provides the reader with the necessary background information about the experimental developments. The authors are both experts in this field to which they have made significant contributions. After an introduction to quantum measurement theory and a chapter on quantum parameter estimation, the central topic of open quantum systems is treated at some length. This chapter includes a derivation of master equations, the discussion of the Lindblad form, and decoherence - the irreversible emergence of classical properties through interaction with the environment. A separate chapter is devoted to the description of open systems by the method of quantum trajectories. Two chapters then deal with the central topic of quantum feedback control, while the last chapter gives a concise introduction to one of the central applications - quantum information. All sections contain a bunch of exercises which serve as a useful tool in learning the material. Especially helpful are also various separate
LDRD final report on quantum computing using interacting semiconductor quantum wires.
Lyo, Sungkwun Kenneth; Dunn, Roberto G.; Lilly, Michael Patrick; Tibbetts, Denise R. ); Stephenson, Larry L.; Seamons, John Andrew; Reno, John Louis; Bielejec, Edward Salvador; Simmons, Jerry Alvon
2006-01-01
For several years now quantum computing has been viewed as a new paradigm for certain computing applications. Of particular importance to this burgeoning field is the development of an algorithm for factoring large numbers which obviously has deep implications for cryptography and national security. Implementation of these theoretical ideas faces extraordinary challenges in preparing and manipulating quantum states. The quantum transport group at Sandia has demonstrated world-leading, unique double quantum wires devices where we have unprecedented control over the coupling strength, number of 1 D channels, overlap and interaction strength in this nanoelectronic system. In this project, we study 1D-1D tunneling with the ultimate aim of preparing and detecting quantum states of the coupled wires. In a region of strong tunneling, electrons can coherently oscillate from one wire to the other. By controlling the velocity of the electrons, length of the coupling region and tunneling strength we will attempt to observe tunneling oscillations. This first step is critical for further development double quantum wires into the basic building block for a quantum computer, and indeed for other coupled nanoelectronic devices that will rely on coherent transport. If successful, this project will have important implications for nanoelectronics, quantum computing and information technology.
Secure information display with limited viewing zone by use of multi-color visual cryptography.
Yamamoto, Hirotsugu; Hayasaki, Yoshio; Nishida, Nobuo
2004-04-01
We propose a display technique that ensures security of visual information by use of visual cryptography. A displayed image appears as a completely random pattern unless viewed through a decoding mask. The display has a limited viewing zone with the decoding mask. We have developed a multi-color encryption code set. Eight colors are represented in combinations of a displayed image composed of red, green, blue, and black subpixels and a decoding mask composed of transparent and opaque subpixels. Furthermore, we have demonstrated secure information display by use of an LCD panel.
Chen, Wen; Chen, Xudong; Sheppard, Colin J R
2011-10-10
In this paper, we propose a method using structured-illumination-based diffractive imaging with a laterally-translated phase grating for optical double-image cryptography. An optical cryptosystem is designed, and multiple random phase-only masks are placed in the optical path. When a phase grating is laterally translated just before the plaintexts, several diffraction intensity patterns (i.e., ciphertexts) can be correspondingly obtained. During image decryption, an iterative retrieval algorithm is developed to extract plaintexts from the ciphertexts. In addition, security and advantages of the proposed method are analyzed. Feasibility and effectiveness of the proposed method are demonstrated by numerical simulation results.
Information hiding based on double random-phase encoding and public-key cryptography.
Sheng, Yuan; Xin, Zhou; Alam, Mohammed S; Xi, Lu; Xiao-Feng, Li
2009-03-01
A novel information hiding method based on double random-phase encoding (DRPE) and Rivest-Shamir-Adleman (RSA) public-key cryptosystem is proposed. In the proposed technique, the inherent diffusion property of DRPE is cleverly utilized to make up the diffusion insufficiency of RSA public-key cryptography, while the RSA cryptosystem is utilized for simultaneous transmission of the cipher text and the two phase-masks, which is not possible under the DRPE technique. This technique combines the complementary advantages of the DPRE and RSA encryption techniques and brings security and convenience for efficient information transmission. Extensive numerical simulation results are presented to verify the performance of the proposed technique.
Design and Implementation of KSP on the Next Generation Cryptography API
NASA Astrophysics Data System (ADS)
Lina, Zhang
With good seamless connectivity and higher safety, KSP (Key Storage Providers) is the inexorable trend of security requirements and development to take the place of CSP (Cryptographic Service Provider). But the study on KSP has just started in our country, and almost no reports of its implementation can be found. Based on the analysis of function modules and the architecture of Cryptography API (Next Generation (CNG)), this paper discusses the design and implementation of KSP (key storage providers) based on smart card in detail, and an example is also presented to illustrate how to use KSP in Windows Vista.
Jin, Chunhua; Xu, Chunxiang; Zhang, Xiaojun; Zhao, Jining
2015-03-01
Radio Frequency Identification(RFID) is an automatic identification technology, which can be widely used in healthcare environments to locate and track staff, equipment and patients. However, potential security and privacy problems in RFID system remain a challenge. In this paper, we design a mutual authentication protocol for RFID based on elliptic curve cryptography(ECC). We use pre-computing method within tag's communication, so that our protocol can get better efficiency. In terms of security, our protocol can achieve confidentiality, unforgeability, mutual authentication, tag's anonymity, availability and forward security. Our protocol also can overcome the weakness in the existing protocols. Therefore, our protocol is suitable for healthcare environments. PMID:25666925
Jin, Chunhua; Xu, Chunxiang; Zhang, Xiaojun; Zhao, Jining
2015-03-01
Radio Frequency Identification(RFID) is an automatic identification technology, which can be widely used in healthcare environments to locate and track staff, equipment and patients. However, potential security and privacy problems in RFID system remain a challenge. In this paper, we design a mutual authentication protocol for RFID based on elliptic curve cryptography(ECC). We use pre-computing method within tag's communication, so that our protocol can get better efficiency. In terms of security, our protocol can achieve confidentiality, unforgeability, mutual authentication, tag's anonymity, availability and forward security. Our protocol also can overcome the weakness in the existing protocols. Therefore, our protocol is suitable for healthcare environments.
A novel protocol for multiparty quantum key management
NASA Astrophysics Data System (ADS)
Xu, Gang; Chen, Xiu-Bo; Dou, Zhao; Yang, Yi-Xian; Li, Zongpeng
2015-08-01
Key management plays a fundamental role in the field of cryptography. In this paper, we propose a novel multiparty quantum key management (QKM) protocol. Departing from single-function quantum cryptography protocols, our protocol has a salient feature in that it accomplishes a complete QKM process. In this process, we can simultaneously realize the functions of key generation, key distribution and key backup by executing the protocol once. Meanwhile, for the first time, we propose the idea of multi-function QKM. Firstly, the secret key is randomly generated by managers via the quantum measurements in -level Bell basis. Then, through entanglement swapping, the secret key is successfully distributed to users. Under circumstances of urgent requirement, all managers can cooperate to recover the users' secret key, but neither of them can recover it unilaterally. Furthermore, this protocol is further generalized into the multi-manager and multi-user QKM scenario. It has clear advantages in the burgeoning area of quantum security group communication. In this system, all group members share the same group key, and group key management is the foundation of secure group communication and hence an important subject of study.
Efficient arbitrated quantum signature and its proof of security
NASA Astrophysics Data System (ADS)
Li, Qin; Li, Chengqing; Long, Dongyang; Chan, Wai Hong; Wang, Changji
2013-07-01
In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.
Long-distance continuous-variable quantum key distribution by controlling excess noise
NASA Astrophysics Data System (ADS)
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network.
Long-distance continuous-variable quantum key distribution by controlling excess noise.
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network. PMID:26758727
Long-distance continuous-variable quantum key distribution by controlling excess noise
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-01
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network. PMID:26758727
Long-distance continuous-variable quantum key distribution by controlling excess noise.
Huang, Duan; Huang, Peng; Lin, Dakai; Zeng, Guihua
2016-01-13
Quantum cryptography founded on the laws of physics could revolutionize the way in which communication information is protected. Significant progresses in long-distance quantum key distribution based on discrete variables have led to the secure quantum communication in real-world conditions being available. However, the alternative approach implemented with continuous variables has not yet reached the secure distance beyond 100 km. Here, we overcome the previous range limitation by controlling system excess noise and report such a long distance continuous-variable quantum key distribution experiment. Our result paves the road to the large-scale secure quantum communication with continuous variables and serves as a stepping stone in the quest for quantum network.
Allam, Ahmed M; Abbas, Hazem M
2010-12-01
Neural cryptography deals with the problem of "key exchange" between two neural networks using the mutual learning concept. The two networks exchange their outputs (in bits) and the key between the two communicating parties is eventually represented in the final learned weights, when the two networks are said to be synchronized. Security of neural synchronization is put at risk if an attacker is capable of synchronizing with any of the two parties during the training process. Therefore, diminishing the probability of such a threat improves the reliability of exchanging the output bits through a public channel. The synchronization with feedback algorithm is one of the existing algorithms that enhances the security of neural cryptography. This paper proposes three new algorithms to enhance the mutual learning process. They mainly depend on disrupting the attacker confidence in the exchanged outputs and input patterns during training. The first algorithm is called "Do not Trust My Partner" (DTMP), which relies on one party sending erroneous output bits, with the other party being capable of predicting and correcting this error. The second algorithm is called "Synchronization with Common Secret Feedback" (SCSFB), where inputs are kept partially secret and the attacker has to train its network on input patterns that are different from the training sets used by the communicating parties. The third algorithm is a hybrid technique combining the features of the DTMP and SCSFB. The proposed approaches are shown to outperform the synchronization with feedback algorithm in the time needed for the parties to synchronize.
Memory assisted free space quantum communication
NASA Astrophysics Data System (ADS)
Jordaan, Bertus; Namazi, Mehdi; Goham, Connor; Shahrokhshahi, Reihaneh; Vallone, Giuseppe; Villoresi, Paolo; Figueroa, Eden
2016-05-01
A quantum memory assisted node between different quantum channels has the capability to modify and synchronize its output, allowing for easy connectivity, and advanced cryptography protocols. We present the experimental progress towards the storage of single photon level pulses carrying random polarization qubits into a dual rail room temperature quantum memory (RTQM) after ~ 20m of free space propagation. The RTQM coherently stores the input pulses through electromagnetically induced transparency (EIT) of a warm 87 Rb vapor and filters the output by polarization elements and temperature-controlled etalon resonators. This allows the characterization of error rates for each polarization basis and the testing of the synchronization ability of the quantum memory. This work presents a steppingstone towards quantum key distribution and quantum repeater networks. The work was supported by the US-Navy Office of Naval Research, Grant Number N00141410801 and the Simons Foundation, Grant Number SBF241180.B. J. acknowledges financial assistance of the National Research Foundation (NRF) of South Africa.
Quantum Information with Continuous Variable systems
NASA Astrophysics Data System (ADS)
Rodó, Carles
2010-05-01
This thesis deals with the study of quantum communication protocols with Continuous Variable (CV) systems. Continuous Variable systems are those described by canonical conjugated coordinates x and p endowed with infinite dimensional Hilbert spaces, thus involving a complex mathematical structure. A special class of CV states, are the so-called Gaussian states. With them, it has been possible to implement certain quantum tasks as quantum teleportation, quantum cryptography and quantum computation with fantastic experimental success. The importance of Gaussian states is two-fold; firstly, its structural mathematical description makes them much more amenable than any other CV system. Secondly, its production, manipulation and detection with current optical technology can be done with a very high degree of accuracy and control. Nevertheless, it is known that in spite of their exceptional role within the space of all Continuous Variable states, in fact, Gaussian states are not always the best candidates to perform quantum information tasks. Thus non-Gaussian states emerge as potentially good candidates for communication and computation purposes.
Robust Operation of Tendon-Driven Robot Fingers Using Force and Position-Based Control Laws
NASA Technical Reports Server (NTRS)
Abdallah, Muhammad E (Inventor); Platt, Jr., Robert J. (Inventor); Reiland, Matthew J (Inventor); Hargrave, Brian (Inventor); Diftler, Myron A (Inventor); Strawser, Philip A (Inventor); Ihrke, Chris A. (Inventor)
2013-01-01
A robotic system includes a tendon-driven finger and a control system. The system controls the finger via a force-based control law when a tension sensor is available, and via a position-based control law when a sensor is not available. Multiple tendons may each have a corresponding sensor. The system selectively injects a compliance value into the position-based control law when only some sensors are available. A control system includes a host machine and a non-transitory computer-readable medium having a control process, which is executed by the host machine to control the finger via the force- or position-based control law. A method for controlling the finger includes determining the availability of a tension sensor(s), and selectively controlling the finger, using the control system, via the force or position-based control law. The position control law allows the control system to resist disturbances while nominally maintaining the initial state of internal tendon tensions.
Electroluminescence from a single InGaN quantum dot in the green spectral region up to 150 K.
Kalden, J; Tessarek, C; Sebald, K; Figge, S; Kruse, C; Hommel, D; Gutowski, J
2010-01-01
We present electrically driven luminescence from single InGaN quantum dots embedded into a light emitting diode structure grown by metal-organic vapor-phase epitaxy. Single sharp emission lines in the green spectral region can be identified. Temperature dependent measurements demonstrate thermal stability of the emission of a single quantum dot up to 150 K. These results are an important step towards applications like electrically driven single-photon emitters, which are a basis for applications incorporating plastic optical fibers as well as for modern concepts of free space quantum cryptography. PMID:19946174
ERIC Educational Resources Information Center
White, Tobin
2009-01-01
This paper introduces an applied problem-solving task, set in the context of cryptography and embedded in a network of computer-based tools. This designed learning environment engaged students in a series of collaborative problem-solving activities intended to introduce the topic of functions through a set of linked representations. In a…
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d'Ischia, Marco
2015-06-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system.
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d’Ischia, Marco
2015-01-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system. PMID:26246999
Leone, Loredana; Pezzella, Alessandro; Crescenzi, Orlando; Napolitano, Alessandra; Barone, Vincenzo; d'Ischia, Marco
2015-06-01
Current molecular cryptography (MoCryp) systems are almost exclusively based on DNA chemistry and reports of cryptography technologies based on other less complex chemical systems are lacking. We describe herein, as proof of concept, the prototype of the first asymmetric MoCryp system, based on an 8-compound set of a novel bioinspired class of cyanine-type dyes called trichocyanines. These novel acidichromic cyanine-type dyes inspired by red hair pigments were synthesized and characterized with the aid of density functional theory (DFT) calculations. Trichocyanines consist of a modular scaffold easily accessible via an expedient condensation of 3-phenyl- or 3-methyl-2H-1,4-benzothiazines with N-dimethyl- or o-methoxyhydroxy-substituted benzaldehyde or cinnamaldehyde derivatives. The eight representative members synthesized herein can be classified as belonging to two three-state systems tunable through four different control points. This versatile dye platform can generate an expandable palette of colors and appears to be specifically suited to implement an unprecedented single-use asymmetric molecular cryptography system. With this system, we intend to pioneer the translation of digital public-key cryptography into a chemical-coding one-time-pad-like system. PMID:26246999
Frames, designs, and spherical codes in quantum information theory
NASA Astrophysics Data System (ADS)
Renes, Joseph M.
Frame theory offers a lens through which to view a large portion of quantum information theory, providing an organizational principle to those topics in its purview. In this thesis, I cut a trail from foundational questions to practical applications, from the origin of the quantum probability rule to quantum cryptography, by way of a standard quantum measurement helpful in quantum tomography and representation of quantum theory. Before embarking, preparations are undertaken by outlining the relevant aspects of frame theory, particularly the characterization of generalized orthonormal bases in terms of physical quantum measurements, as well as several aesthetically appealing families of measurements, each possessing a high degree of symmetry. Much more than just elegant, though, these quantum measurements are found to be useful in many aspects of quantum information theory. I first consider the foundational question of justifying the quantum probability rule, showing that putting a probability valuation on generalized quantum measurements leads directly to the Born rule. Moreover, for qubits, the case neglected in the traditional formulation of Gleason's theorem, a symmetric three-outcome measurement called the trine is sufficient to impel the desired form. Keeping with foundational questions, I then turn to the problem of establishing a symmetric measurement capable of effortlessly rendering quantum theory in terms of classical probability theory. Numerical results provide an almost utterly convincing amount of evidence for this, justifying the subsequent study of its use in quantum tomography and detailed account of the properties of the reduction to probabilistic terms. Saving perhaps the most exciting topic for last, I make use of these aesthetic ensembles in the applied field of quantum cryptography. A large class of streamlined key distribution protocols may be cut from the cloth of these ensembles, and their symmetry affords them improved tolerance to
Quantum computing accelerator I/O : LDRD 52750 final report.
Schroeppel, Richard Crabtree; Modine, Normand Arthur; Ganti, Anand; Pierson, Lyndon George; Tigges, Christopher P.
2003-12-01
In a superposition of quantum states, a bit can be in both the states '0' and '1' at the same time. This feature of the quantum bit or qubit has no parallel in classical systems. Currently, quantum computers consisting of 4 to 7 qubits in a 'quantum computing register' have been built. Innovative algorithms suited to quantum computing are now beginning to emerge, applicable to sorting and cryptanalysis, and other applications. A framework for overcoming slightly inaccurate quantum gate interactions and for causing quantum states to survive interactions with surrounding environment is emerging, called quantum error correction. Thus there is the potential for rapid advances in this field. Although quantum information processing can be applied to secure communication links (quantum cryptography) and to crack conventional cryptosystems, the first few computing applications will likely involve a 'quantum computing accelerator' similar to a 'floating point arithmetic accelerator' interfaced to a conventional Von Neumann computer architecture. This research is to develop a roadmap for applying Sandia's capabilities to the solution of some of the problems associated with maintaining quantum information, and with getting data into and out of such a 'quantum computing accelerator'. We propose to focus this work on 'quantum I/O technologies' by applying quantum optics on semiconductor nanostructures to leverage Sandia's expertise in semiconductor microelectronic/photonic fabrication techniques, as well as its expertise in information theory, processing, and algorithms. The work will be guided by understanding of practical requirements of computing and communication architectures. This effort will incorporate ongoing collaboration between 9000, 6000 and 1000 and between junior and senior personnel. Follow-on work to fabricate and evaluate appropriate experimental nano/microstructures will be proposed as a result of this work.
Quantum key distribution without detector vulnerabilities using optically seeded lasers
NASA Astrophysics Data System (ADS)
Comandar, L. C.; Lucamarini, M.; Fröhlich, B.; Dynes, J. F.; Sharpe, A. W.; Tam, S. W.-B.; Yuan, Z. L.; Penty, R. V.; Shields, A. J.
2016-05-01
Security in quantum cryptography is continuously challenged by inventive attacks targeting the real components of a cryptographic set-up, and duly restored by new countermeasures to foil them. Owing to their high sensitivity and complex design, detectors are the most frequently attacked components. It was recently shown that two-photon interference from independent light sources can be used to remove any vulnerability from detectors. This new form of detection-safe quantum key distribution (QKD), termed measurement-device-independent (MDI), has been experimentally demonstrated but with modest key rates. Here, we introduce a new pulsed laser seeding technique to obtain high-visibility interference from gain-switched lasers and thereby perform MDI-QKD with unprecedented key rates in excess of 1 megabit per second in the finite-size regime. This represents a two to six orders of magnitude improvement over existing implementations and supports the new scheme as a practical resource for secure quantum communications.
Measurement-device-independent entanglement-based quantum key distribution
NASA Astrophysics Data System (ADS)
Yang, Xiuqing; Wei, Kejin; Ma, Haiqiang; Sun, Shihai; Liu, Hongwei; Yin, Zhenqiang; Li, Zuohan; Lian, Shibin; Du, Yungang; Wu, Lingan
2016-05-01
We present a quantum key distribution protocol in a model in which the legitimate users gather statistics as in the measurement-device-independent entanglement witness to certify the sources and the measurement devices. We show that the task of measurement-device-independent quantum communication can be accomplished based on monogamy of entanglement, and it is fairly loss tolerate including source and detector flaws. We derive a tight bound for collective attacks on the Holevo information between the authorized parties and the eavesdropper. Then with this bound, the final secret key rate with the source flaws can be obtained. The results show that long-distance quantum cryptography over 144 km can be made secure using only standard threshold detectors.
Quantum random bit generation using stimulated Raman scattering.
Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J
2011-12-01
Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond. PMID:22273908
Quantum random bit generation using stimulated Raman scattering.
Bustard, Philip J; Moffatt, Doug; Lausten, Rune; Wu, Guorong; Walmsley, Ian A; Sussman, Benjamin J
2011-12-01
Random number sequences are a critical resource in a wide variety of information systems, including applications in cryptography, simulation, and data sampling. We introduce a quantum random number generator based on the phase measurement of Stokes light generated by amplification of zero-point vacuum fluctuations using stimulated Raman scattering. This is an example of quantum noise amplification using the most noise-free process possible: near unitary quantum evolution. The use of phase offers robustness to classical pump noise and the ability to generate multiple bits per measurement. The Stokes light is generated with high intensity and as a result, fast detectors with high signal-to-noise ratios can be used for measurement, eliminating the need for single-photon sensitive devices. The demonstrated implementation uses optical phonons in bulk diamond.
Industrial application for global quantum communication
NASA Astrophysics Data System (ADS)
Mirza, A.; Petruccione, F.
2012-09-01
In the last decade the quantum communication community has witnessed great advances in photonic quantum cryptography technology with the research, development and commercialization of automated Quantum Key Distribution (QKD) devices. These first generation devices are however bottlenecked by the achievable spatial coverage. This is due to the intrinsic absorption of the quantum particle into the communication medium. As QKD is of paramount importance in the future ICT landscape, various innovative solutions have been developed and tested to expand the spatial coverage of these networks such as the Quantum City initiative in Durban, South Africa. To expand this further into a global QKD-secured network, recent efforts have focussed on high-altitude free-space techniques through the use of satellites. This couples the QKD-secured Metropolitan Area Networks (MANs) with secured ground-tosatellite links as access points to a global network. Such a solution, however, has critical limitations that reduce its commercial feasibility. As parallel step to the development of satellitebased global QKD networks, we investigate the use of the commercial aircrafts' network as secure transport mechanisms in a global QKD network. This QKD-secured global network will provide a robust infrastructure to create, distribute and manage encryption keys between the MANs of the participating cities.
Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang
2010-08-16
Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.
Lin, Chao; Shen, Xueju; Wang, Zhisong; Zhao, Cheng
2014-06-20
We demonstrate a novel optical asymmetric cryptosystem based on the principle of elliptical polarized light linear truncation and a numerical reconstruction technique. The device of an array of linear polarizers is introduced to achieve linear truncation on the spatially resolved elliptical polarization distribution during image encryption. This encoding process can be characterized as confusion-based optical cryptography that involves no Fourier lens and diffusion operation. Based on the Jones matrix formalism, the intensity transmittance for this truncation is deduced to perform elliptical polarized light reconstruction based on two intensity measurements. Use of a quick response code makes the proposed cryptosystem practical, with versatile key sensitivity and fault tolerance. Both simulation and preliminary experimental results that support theoretical analysis are presented. An analysis of the resistance of the proposed method on a known public key attack is also provided.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-07-14
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes.
Lee, Kai-Hui; Chiu, Pei-Ling
2013-10-01
Conventional visual cryptography (VC) suffers from a pixel-expansion problem, or an uncontrollable display quality problem for recovered images, and lacks a general approach to construct visual secret sharing schemes for general access structures. We propose a general and systematic approach to address these issues without sophisticated codebook design. This approach can be used for binary secret images in non-computer-aided decryption environments. To avoid pixel expansion, we design a set of column vectors to encrypt secret pixels rather than using the conventional VC-based approach. We begin by formulating a mathematic model for the VC construction problem to find the column vectors for the optimal VC construction, after which we develop a simulated-annealing-based algorithm to solve the problem. The experimental results show that the display quality of the recovered image is superior to that of previous papers.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-01-01
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224
Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang
2010-08-16
Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs. PMID:20721222
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2015-09-01
In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of asymmetric cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.
A User Authentication Scheme Based on Elliptic Curves Cryptography for Wireless Ad Hoc Networks.
Chen, Huifang; Ge, Linlin; Xie, Lei
2015-01-01
The feature of non-infrastructure support in a wireless ad hoc network (WANET) makes it suffer from various attacks. Moreover, user authentication is the first safety barrier in a network. A mutual trust is achieved by a protocol which enables communicating parties to authenticate each other at the same time and to exchange session keys. For the resource-constrained WANET, an efficient and lightweight user authentication scheme is necessary. In this paper, we propose a user authentication scheme based on the self-certified public key system and elliptic curves cryptography for a WANET. Using the proposed scheme, an efficient two-way user authentication and secure session key agreement can be achieved. Security analysis shows that our proposed scheme is resilient to common known attacks. In addition, the performance analysis shows that our proposed scheme performs similar or better compared with some existing user authentication schemes. PMID:26184224
Zhang, Zezhong; Qi, Qingqing
2014-05-01
Medication errors are very dangerous even fatal since it could cause serious even fatal harm to patients. In order to reduce medication errors, automated patient medication systems using the Radio Frequency Identification (RFID) technology have been used in many hospitals. The data transmitted in those medication systems is very important and sensitive. In the past decade, many security protocols have been proposed to ensure its secure transition attracted wide attention. Due to providing mutual authentication between the medication server and the tag, the RFID authentication protocol is considered as the most important security protocols in those systems. In this paper, we propose a RFID authentication protocol to enhance patient medication safety using elliptic curve cryptography (ECC). The analysis shows the proposed protocol could overcome security weaknesses in previous protocols and has better performance. Therefore, the proposed protocol is very suitable for automated patient medication systems.
Two-layer tree-connected feed-forward neural network model for neural cryptography
NASA Astrophysics Data System (ADS)
Lei, Xinyu; Liao, Xiaofeng; Chen, Fei; Huang, Tingwen
2013-03-01
Neural synchronization by means of mutual learning provides an avenue to design public key exchange protocols, bringing about what is known as neural cryptography. Two identically structured neural networks learn from each other and reach full synchronization eventually. The full synchronization enables two networks to have the same weight, which can be used as a secret key for many subsequent cryptographic purposes. It is striking to observe that after the first decade of neural cryptography, the tree parity machine (TPM) network with hidden unit K=3 appears to be the sole network that is suitable for a neural protocol. No convincingly secure neural protocol is well designed by using other network structures despite considerable research efforts. With the goal of overcoming the limitations of a suitable network structure, in this paper we develop a two-layer tree-connected feed-forward neural network (TTFNN) model for a neural protocol. The TTFNN model captures the notion that two partners are capable of exchanging a vector with multiple bits in each time step. An in-depth study of the dynamic process of TTFNN-based protocols is then undertaken, based upon which a feasible condition is theoretically obtained to seek applicable protocols. Afterward, according to two analytically derived heuristic rules, a complete methodology for designing feasible TTFNN-based protocols is elaborated. A variety of feasible neural protocols are constructed, which exhibit the effectiveness and benefits of the proposed model. With another look from the perspective of application, TTFNN-based instances, which can outperform the conventional TPM-based protocol with respect to synchronization speed, are also experimentally confirmed.
Li, Shu-Shen; Long, Gui-Lu; Bai, Feng-Shan; Feng, Song-Lin; Zheng, Hou-Zhi
2001-01-01
Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization. PMID:11562459
Security of Quantum Key Distribution
NASA Astrophysics Data System (ADS)
Lütkenhaus, Norbert
2007-03-01
Quantum Key Distribution (QKD) is the most advanced application of Quantum Information Science. It allows extending secret keys over some distances in such a way that the security of the resulting key material can be guaranteed by the laws of quantum mechanics. In contrast to presently used encryption techniques, the security of QKD can be proven in terms of information-theoretic measures. The resulting key can then be used for many tasks, including exchanging secret messages. QKD has been developed in the language of abstract two-level systems, the qubits. They cannot be easily implemented in optical signals. It took some time to bring the protocols and theory of QKD to the point where they fit to the realities of fiber-optical or free-space applications, including lossy channels. Today, QKD schemes can be implemented reliably using standard off-the-shelf components. Information theoretic security is a theoretical concept. Naturally, it is impossible to demonstrate directly that a given experimental set-up indeed creates a secret key. What one can do is to show that the experiment can give data within a certain parameters regime, such as error rate and loss rate, for which a security proof exists. I will discuss what parameter regime gives provable secure key and which parameter regime cannot lead to secret key. It is desirable to prove `unconditional security,' as it is termed in the world of classical cryptography: no assumption is made about the attacks of an eavesdropper on the quantum channel. However, one has to assume that the signal structure and the measurement device are correctly described by the adopted model and that no eavesdropper can intrude the sender or receiver unit. In this talk I will briefly introduce the concept of QKD and optical implementations. Especially I will discuss security aspects of modern approaches of QKD schemes that allow us to increase the covered distance and the achievable rate.
All-optical cryptography of M-QAM formats by using two-dimensional spectrally sliced keys.
Abbade, Marcelo L F; Cvijetic, Milorad; Messani, Carlos A; Alves, Cleiton J; Tenenbaum, Stefan
2015-05-10
There has been an increased interest in enhancing the security of optical communications systems and networks. All-optical cryptography methods have been considered as an alternative to electronic data encryption. In this paper we propose and verify the use of a novel all-optical scheme based on cryptographic keys applied on the spectral signal for encryption of the M-QAM modulated data with bit rates of up to 200 gigabits per second.
All-optical cryptography of M-QAM formats by using two-dimensional spectrally sliced keys.
Abbade, Marcelo L F; Cvijetic, Milorad; Messani, Carlos A; Alves, Cleiton J; Tenenbaum, Stefan
2015-05-10
There has been an increased interest in enhancing the security of optical communications systems and networks. All-optical cryptography methods have been considered as an alternative to electronic data encryption. In this paper we propose and verify the use of a novel all-optical scheme based on cryptographic keys applied on the spectral signal for encryption of the M-QAM modulated data with bit rates of up to 200 gigabits per second. PMID:25967489
NASA Astrophysics Data System (ADS)
Auletta, Gennaro; Fortunato, Mauro; Parisi, Giorgio
2014-01-01
Introduction; Part I. Basic Features of Quantum Mechanics: 1. From classical mechanics to quantum mechanics; 2. Quantum observable and states; 3. Quantum dynamics; 4. Examples of quantum dynamics; 5. Density matrix; Part II. More Advanced Topics: 6. Angular momentum and spin; 7. Identical particles; 8. Symmetries and conservation laws; 9. The measurement problem; Part III. Matter and Light: 10. Perturbations and approximation methods; 11. Hydrogen and helium atoms; 12. Hydrogen molecular ion; 13. Quantum optics; Part IV. Quantum Information: State and Correlations: 14. Quantum theory of open systems; 15. State measurement in quantum mechanics; 16. Entanglement: non-separability; 17. Entanglement: quantum information; References; Index.
NASA Astrophysics Data System (ADS)
Lukishova, Svetlana G.; Liapis, Andreas C.; Bissell, Luke J.; Gehring, George M.; Winkler, Justin M.; Boyd, Robert W.
2015-03-01
We present here our results on using liquid crystals in experiments with nonclassical light sources: (1) single-photon sources exhibiting antibunching (separation of all photons in time), which are key components for secure quantum communication systems, and (2) entangled photon source with photons exhibiting quantum interference in a Hong-Ou- Mandel interferometer. In the first part, cholesteric liquid crystal hosts were used to create definite circular polarization of antibunched photons emitted by nanocrystal quantum dots. If the photon has unknown polarization, filtering it through a polarizer to produce the desired polarization for quantum key distribution with bits based on polarization states of photons will reduce by half the efficiency of a quantum cryptography system. In the first part, we also provide our results on observation of a circular polarized microcavity resonance in nanocrystal quantum dot fluorescence in a 1-D chiral photonic bandgap cholesteric liquid crystal microcavity. In the second part of this paper with indistinguishable, time-entangled photons, we demonstrate our experimental results on simulating quantum-mechanical barrier tunnelling phenomena. A Hong-Ou-Mandel dip (quantum interference effect) is shifted when a phase change was introduced on the way of one of entangled photons in pair (one arm of the interferometer) by inserting in this arm an electrically controlled planar-aligned nematic liquid crystal layer between two prisms in the conditions close to a frustrated total internal reflection. By applying different AC-voltages to the planar-aligned nematic layer and changing its refractive index, we can obtain various conditions for incident photon propagation - from total reflection to total transmission. Measuring changes of tunnelling times of photon through this structure with femtosecond resolution permitted us to answer some unresolved questions in quantum-mechanical barrier tunnelling phenomena.
Experimental eavesdropping based on optimal quantum cloning.
Bartkiewicz, Karol; Lemr, Karel; Cernoch, Antonín; Soubusta, Jan; Miranowicz, Adam
2013-04-26
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level of disturbance has to be allowed to cover, e.g., transmission losses. An eavesdropper can attack such systems by replacing a noisy channel by a better one and by performing approximate cloning of transmitted qubits which disturb them but below the noise level assumed by legitimate users. We experimentally demonstrate such symmetric individual eavesdropping on the quantum key distribution protocols of Bennett and Brassard (BB84) and the trine-state spherical code of Renes (R04) with two-level probes prepared using a recently developed photonic multifunctional quantum cloner [Lemr et al., Phys. Rev. A 85, 050307(R) (2012)]. We demonstrated that our optimal cloning device with high-success rate makes the eavesdropping possible by hiding it in usual transmission losses. We believe that this experiment can stimulate the quest for other operational applications of quantum cloning.
Experimental eavesdropping based on optimal quantum cloning.
Bartkiewicz, Karol; Lemr, Karel; Cernoch, Antonín; Soubusta, Jan; Miranowicz, Adam
2013-04-26
The security of quantum cryptography is guaranteed by the no-cloning theorem, which implies that an eavesdropper copying transmitted qubits in unknown states causes their disturbance. Nevertheless, in real cryptographic systems some level of disturbance has to be allowed to cover, e.g., transmission losses. An eavesdropper can attack such systems by replacing a noisy channel by a better one and by performing approximate cloning of transmitted qubits which disturb them but below the noise level assumed by legitimate users. We experimentally demonstrate such symmetric individual eavesdropping on the quantum key distribution protocols of Bennett and Brassard (BB84) and the trine-state spherical code of Renes (R04) with two-level probes prepared using a recently developed photonic multifunctional quantum cloner [Lemr et al., Phys. Rev. A 85, 050307(R) (2012)]. We demonstrated that our optimal cloning device with high-success rate makes the eavesdropping possible by hiding it in usual transmission losses. We believe that this experiment can stimulate the quest for other operational applications of quantum cloning. PMID:23679725
BOOK REVIEW: Quantum Squeezing
NASA Astrophysics Data System (ADS)
Zubairy, Suhail
2005-05-01
Langevin formalism for squeezing in lasing systems. In the last article of this part, Wiseman deals with squeezing systems when the system's environment can be deliberately engineered so that the feedback is important. The third part of the book includes four articles dealing with the applications of quantum squeezing. In the first article, Yuen presents a discussion of communications and measurement using squeezed states and discusses the advantages of using nonclassical light over classical light in communications and measurement. In the second article, Swain deals with the interaction of squeezed light with the atomic systems and presents a review of novel phenomena in spectroscopy. This chapter on two-level atomic system is followed by Ficek's article on squeezed-light based spectroscopy in three-level atomic systems. In the last article, Reid again addresses the advantages of squeezed light in communications, but her emphasis is different from that of Yuen's article. Here she discusses EPR correlations for squeezed light and presents squeezed-light based methods for quantum cryptography. All the authors are leading figures in the field of squeezed states who have made pioneering contributions to various aspects of the field over the years. This is reflected in the authoritative style with which all the articles are written. These articles are rich in content, easy to read and cover a broad base. The emphasis is however on the theoretical aspects with occasional references to experimental work. This book is an excellent collection of articles on quantum squeezing that are highly useful both for beginners who would like to learn about squeezing and its applications, as well as for experts who would like to learn about the frontiers.
Two-slit experiment: quantum and classical probabilities
NASA Astrophysics Data System (ADS)
Khrennikov, Andrei
2015-06-01
Inter-relation between quantum and classical probability models is one of the most fundamental problems of quantum foundations. Nowadays this problem also plays an important role in quantum technologies, in quantum cryptography and the theory of quantum random generators. In this letter, we compare the viewpoint of Richard Feynman that the behavior of quantum particles cannot be described by classical probability theory with the viewpoint that quantum-classical inter-relation is more complicated (cf, in particular, with the tomographic model of quantum mechanics developed in detail by Vladimir Man'ko). As a basic example, we consider the two-slit experiment, which played a crucial role in quantum foundational debates at the beginning of quantum mechanics (QM). In particular, its analysis led Niels Bohr to the formulation of the principle of complementarity. First, we demonstrate that in complete accordance with Feynman's viewpoint, the probabilities for the two-slit experiment have the non-Kolmogorovian structure, since they violate one of basic laws of classical probability theory, the law of total probability (the heart of the Bayesian analysis). However, then we show that these probabilities can be embedded in a natural way into the classical (Kolmogorov, 1933) probability model. To do this, one has to take into account the randomness of selection of different experimental contexts, the joint consideration of which led Feynman to a conclusion about the non-classicality of quantum probability. We compare this embedding of non-Kolmogorovian quantum probabilities into the Kolmogorov model with well-known embeddings of non-Euclidean geometries into Euclidean space (e.g., the Poincaré disk model for the Lobachvesky plane).
Probabilistic Model of Fault Detection in Quantum Circuits
NASA Astrophysics Data System (ADS)
Banerjee, A.; Pathak, A.
Since the introduction of quantum computation, several protocols (such as quantum cryptography, quantum algorithm, quantum teleportation) have established quantum computing as a superior future technology. Each of these processes involves quantum circuits, which are prone to different kinds of faults. Consequently, it is important to verify whether the circuit hardware is defective or not. The systematic procedure to do so is known as fault testing. Normally testing is done by providing a set of valid input states and measuring the corresponding output states and comparing the output states with the expected output states of the perfect (fault less) circuit. This particular set of input vectors are known as test set [6]. If there exists a fault then the next step would be to find the exact location and nature of the defect. This is known as fault localization. A model that explains the logical or functional faults in the circuit is a fault model. Conventional fault models include (i) stuck at faults, (ii) bridge faults, and (iii) delay faults. These fault models have been rigorously studied for conventional irreversible circuit. But with the advent of reversible classical computing and quantum computing it has become important to enlarge the domain of the study on test vectors.
Quantum-locked key distribution at nearly the classical capacity rate.
Lupo, Cosmo; Lloyd, Seth
2014-10-17
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.
Generation and confirmation of a (100 x 100)-dimensional entangled quantum system.
Krenn, Mario; Huber, Marcus; Fickler, Robert; Lapkiewicz, Radek; Ramelow, Sven; Zeilinger, Anton
2014-04-29
Entangled quantum systems have properties that have fundamentally overthrown the classical worldview. Increasing the complexity of entangled states by expanding their dimensionality allows the implementation of novel fundamental tests of nature, and moreover also enables genuinely new protocols for quantum information processing. Here we present the creation of a (100 × 100)-dimensional entangled quantum system, using spatial modes of photons. For its verification we develop a novel nonlinear criterion which infers entanglement dimensionality of a global state by using only information about its subspace correlations. This allows very practical experimental implementation as well as highly efficient extraction of entanglement dimensionality information. Applications in quantum cryptography and other protocols are very promising. PMID:24706902
Quantum-locked key distribution at nearly the classical capacity rate.
Lupo, Cosmo; Lloyd, Seth
2014-10-17
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit. PMID:25361242
NASA Astrophysics Data System (ADS)
Kato, Kentaro; Hirota, Osamu
2011-08-01
The quantum noise based direct encryption protocol Y-OO is expected to provide physical complexity based security, which is thought to be comparable to information theoretic security in mathematical cryptography, for the. physical layer of fiber-optic communication systems. So far, several randomization techniques for the quantum stream cipher by Y-OO protocol have been proposed, but most of them were developed under the assumption that phase shift keying is used as the modulation format. On the other hand, the recent progress in the experimental study on the intensity modulation based quantum stream cipher by Y-OO protocol raises expectations for its realization. The purpose of this paper is to present design and implementation methods of a composite model of the intensity modulation based quantum stream cipher with some randomization techniques. As a result this paper gives a viewpoint of how the Y-OO cryptosystem is miniaturized.
Chen Benyong; Zhang Enzheng; Yan Liping; Li Chaorong; Tang Wuhua; Feng Qibo
2009-11-15
Not only the magnitude but also the position of straightness errors are of concern to users. However, current laser interferometers used for measuring straightness seldom give the relative position of the straightness error. To solve this problem, a laser interferometer for measuring straightness and its position based on heterodyne interferometry is proposed. The optical configuration of the interferometer is designed and the measurement principle is analyzed theoretically. Two experiments were carried out. The first experiment verifies the validity and repeatability of the interferometer by measuring a linear stage. Also, the second one for measuring a flexure-hinge stage demonstrates that the interferometer is capable of nanometer measurement accuracy. These results show that this interferometer has advantages of simultaneously measuring straightness error and the relative position with high precision, and a compact structure.
Molotkov, S. N.
2012-05-15
The fundamental quantum mechanics prohibitions on the measurability of quantum states allow secure key distribution between spatially remote users to be performed. Experimental and commercial implementations of quantum cryptography systems, however, use components that exist at the current technology level, in particular, one-photon avalanche photodetectors. These detectors are subject to the blinding effect. It was shown that all the known basic quantum key distribution protocols and systems based on them are vulnerable to attacks with blinding of photodetectors. In such attacks, an eavesdropper knows all the key transferred, does not produce errors at the reception side, and remains undetected. Three protocols of quantum key distribution stable toward such attacks are suggested. The security of keys and detection of eavesdropping attempts are guaranteed by the internal structure of protocols themselves rather than additional technical improvements.
Quantum-secure covert communication on bosonic channels
NASA Astrophysics Data System (ADS)
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-10-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
Quantum-secure covert communication on bosonic channels.
Bash, Boulat A; Gheorghe, Andrei H; Patel, Monika; Habif, Jonathan L; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary. PMID:26478089
Quantum-secure covert communication on bosonic channels
Bash, Boulat A.; Gheorghe, Andrei H.; Patel, Monika; Habif, Jonathan L.; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth—that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary—for example, thermal noise from blackbody radiation—the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary. PMID:26478089
Quantum-secure covert communication on bosonic channels.
Bash, Boulat A; Gheorghe, Andrei H; Patel, Monika; Habif, Jonathan L; Goeckel, Dennis; Towsley, Don; Guha, Saikat
2015-01-01
Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids.
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham-Yahalom logic. PMID:27007951
An Interoperability Consideration in Selecting Domain Parameters for Elliptic Curve Cryptography
NASA Technical Reports Server (NTRS)
Ivancic, Will (Technical Monitor); Eddy, Wesley M.
2005-01-01
Elliptic curve cryptography (ECC) will be an important technology for electronic privacy and authentication in the near future. There are many published specifications for elliptic curve cryptosystems, most of which contain detailed descriptions of the process for the selection of domain parameters. Selecting strong domain parameters ensures that the cryptosystem is robust to attacks. Due to a limitation in several published algorithms for doubling points on elliptic curves, some ECC implementations may produce incorrect, inconsistent, and incompatible results if domain parameters are not carefully chosen under a criterion that we describe. Few documents specify the addition or doubling of points in such a manner as to avoid this problematic situation. The safety criterion we present is not listed in any ECC specification we are aware of, although several other guidelines for domain selection are discussed in the literature. We provide a simple example of how a set of domain parameters not meeting this criterion can produce catastrophic results, and outline a simple means of testing curve parameters for interoperable safety over doubling.
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-06-10
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs.
Policy for cryptography in healthcare--a view from the NHS.
Donaldson, A
2000-11-01
Effective security arrangements, which both protect and assure those information assets of healthcare providers, doctors and patients, are fundamental requirements in a modern electronic healthcare culture. At the heart of healthcare information systems in future will be those infrastructure components and services, which underpin the principles of confidentiality, integrity and availability. Before embarking upon any major implementation of cryptographic support services, there are a number of critical policy issues, which must first be considered and addressed. To address these successfully will maximise the potential values of these services and facilities to their users on a broad front. A primary consideration for all information security projects, is the need to establish clear scope and objectives for the security services to be implemented. When considering the policy, scope and design implications of a large scale cryptography programme, a number of external issues also need to be considered not least of which are the legal liabilities, implications and obligations of the country or countries where the system(s) will operate. Where such legislation exists, regulatory arrangements may potentially influence how secure information sharing across international healthcare boundaries can be achieved.
Deciphering the language of nature: cryptography, secrecy, and alterity in Francis Bacon.
Clody, Michael C
2011-01-01
The essay argues that Francis Bacon's considerations of parables and cryptography reflect larger interpretative concerns of his natural philosophic project. Bacon describes nature as having a language distinct from those of God and man, and, in so doing, establishes a central problem of his natural philosophy—namely, how can the language of nature be accessed through scientific representation? Ultimately, Bacon's solution relies on a theory of differential and duplicitous signs that conceal within them the hidden voice of nature, which is best recognized in the natural forms of efficient causality. The "alphabet of nature"—those tables of natural occurrences—consequently plays a central role in his program, as it renders nature's language susceptible to a process and decryption that mirrors the model of the bilateral cipher. It is argued that while the writing of Bacon's natural philosophy strives for literality, its investigative process preserves a space for alterity within scientific representation, that is made accessible to those with the interpretative key. PMID:22371983
NASA Astrophysics Data System (ADS)
Jungeblut, T.; Puttmann, C.; Dreesen, R.; Porrmann, M.; Thies, M.; Rückert, U.; Kastens, U.
2010-12-01
The secure transmission of data plays a significant role in today's information era. Especially in the area of public-key-cryptography methods, which are based on elliptic curves (ECC), gain more and more importance. Compared to asymmetric algorithms, like RSA, ECC can be used with shorter key lengths, while achieving an equal level of security. The performance of ECC-algorithms can be increased significantly by adding application specific hardware extensions. Due to their fine grained parallelism, VLIW-processors are well suited for the execution of ECC algorithms. In this work, we extended the fourfold parallel CoreVA-VLIW-architecture by several hardware accelerators to increase the resource efficiency of the overall system. For the design-space exploration we use a dual design flow, which is based on the automatic generation of a complete C-compiler based tool chain from a central processor specification. Using the hardware accelerators the performance of the scalar multiplication on binary fields can be increased by the factor of 29. The energy consumption can be reduced by up to 90%. The extended processor hardware was mapped on a current 65 nm low-power standard-cell-technology. The chip area of the CoreVA-VLIW-architecture is 0.24 mm2 at a power consumption of 29 mW/MHz. The performance gain is analyzed in respect to the increased hardware costs, as chip area or power consumption.
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids.
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham-Yahalom logic.
Elliptic Curve Cryptography-Based Authentication with Identity Protection for Smart Grids
Zhang, Liping; Tang, Shanyu; Luo, He
2016-01-01
In a smart grid, the power service provider enables the expected power generation amount to be measured according to current power consumption, thus stabilizing the power system. However, the data transmitted over smart grids are not protected, and then suffer from several types of security threats and attacks. Thus, a robust and efficient authentication protocol should be provided to strength the security of smart grid networks. As the Supervisory Control and Data Acquisition system provides the security protection between the control center and substations in most smart grid environments, we focus on how to secure the communications between the substations and smart appliances. Existing security approaches fail to address the performance-security balance. In this study, we suggest a mitigation authentication protocol based on Elliptic Curve Cryptography with privacy protection by using a tamper-resistant device at the smart appliance side to achieve a delicate balance between performance and security of smart grids. The proposed protocol provides some attractive features such as identity protection, mutual authentication and key agreement. Finally, we demonstrate the completeness of the proposed protocol using the Gong-Needham- Yahalom logic. PMID:27007951
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-01-01
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs. PMID:24919012
Choi, Younsung; Lee, Donghoon; Kim, Jiye; Jung, Jaewook; Nam, Junghyun; Won, Dongho
2014-01-01
Wireless sensor networks (WSNs) consist of sensors, gateways and users. Sensors are widely distributed to monitor various conditions, such as temperature, sound, speed and pressure but they have limited computational ability and energy. To reduce the resource use of sensors and enhance the security of WSNs, various user authentication protocols have been proposed. In 2011, Yeh et al. first proposed a user authentication protocol based on elliptic curve cryptography (ECC) for WSNs. However, it turned out that Yeh et al.'s protocol does not provide mutual authentication, perfect forward secrecy, and key agreement between the user and sensor. Later in 2013, Shi et al. proposed a new user authentication protocol that improves both security and efficiency of Yeh et al.'s protocol. However, Shi et al.'s improvement introduces other security weaknesses. In this paper, we show that Shi et al.'s improved protocol is vulnerable to session key attack, stolen smart card attack, and sensor energy exhausting attack. In addition, we propose a new, security-enhanced user authentication protocol using ECC for WSNs. PMID:24919012
Deciphering the language of nature: cryptography, secrecy, and alterity in Francis Bacon.
Clody, Michael C
2011-01-01
The essay argues that Francis Bacon's considerations of parables and cryptography reflect larger interpretative concerns of his natural philosophic project. Bacon describes nature as having a language distinct from those of God and man, and, in so doing, establishes a central problem of his natural philosophy—namely, how can the language of nature be accessed through scientific representation? Ultimately, Bacon's solution relies on a theory of differential and duplicitous signs that conceal within them the hidden voice of nature, which is best recognized in the natural forms of efficient causality. The "alphabet of nature"—those tables of natural occurrences—consequently plays a central role in his program, as it renders nature's language susceptible to a process and decryption that mirrors the model of the bilateral cipher. It is argued that while the writing of Bacon's natural philosophy strives for literality, its investigative process preserves a space for alterity within scientific representation, that is made accessible to those with the interpretative key.
Arbitrated Quantum Signature Scheme with Continuous-Variable Coherent States
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Huang, Dazu; Shi, Jinjing
2016-04-01
Motivated by the revealing features of the continuous-variable (CV) quantum cryptography, we suggest an arbitrated quantum signature (AQS) protocol with CV coherent states. It involves three participants, i.e., the signer Alice, the verifier Bob and the arbitrator Charlie who is trustworthy by Alice and Bob. Three phases initializing phase, signing phase and verifying phase are included in our protocol. The security of the signature scheme is guaranteed by the generation of the shared keys via the CV-based quantum key distribution (CV-QKD) and the implementation process of the CV-based quantum teleportation as well. Security analysis demonstrates that the signature can be neither forged by anyone nor disavowed by the receiver and signer. Moreover, the authenticity and integrality of the transmitted messages can be ensured. The paper shows that a potential high-speed quantum signature scheme with high detection efficiency and repetition rate can be realized when compared to the discrete-variable (DV) quantum signature scheme attributing to the well characteristics of CV-QKD.
NASA Astrophysics Data System (ADS)
Georgescu, I. M.; Ashhab, S.; Nori, Franco
2014-01-01
Simulating quantum mechanics is known to be a difficult computational problem, especially when dealing with large systems. However, this difficulty may be overcome by using some controllable quantum system to study another less controllable or accessible quantum system, i.e., quantum simulation. Quantum simulation promises to have applications in the study of many problems in, e.g., condensed-matter physics, high-energy physics, atomic physics, quantum chemistry, and cosmology. Quantum simulation could be implemented using quantum computers, but also with simpler, analog devices that would require less control, and therefore, would be easier to construct. A number of quantum systems such as neutral atoms, ions, polar molecules, electrons in semiconductors, superconducting circuits, nuclear spins, and photons have been proposed as quantum simulators. This review outlines the main theoretical and experimental aspects of quantum simulation and emphasizes some of the challenges and promises of this fast-growing field.
DPNuc: Identifying Nucleosome Positions Based on the Dirichlet Process Mixture Model.
Chen, Huidong; Guan, Jihong; Zhou, Shuigeng
2015-01-01
Nucleosomes and the free linker DNA between them assemble the chromatin. Nucleosome positioning plays an important role in gene transcription regulation, DNA replication and repair, alternative splicing, and so on. With the rapid development of ChIP-seq, it is possible to computationally detect the positions of nucleosomes on chromosomes. However, existing methods cannot provide accurate and detailed information about the detected nucleosomes, especially for the nucleosomes with complex configurations where overlaps and noise exist. Meanwhile, they usually require some prior knowledge of nucleosomes as input, such as the size or the number of the unknown nucleosomes, which may significantly influence the detection results. In this paper, we propose a novel approach DPNuc for identifying nucleosome positions based on the Dirichlet process mixture model. In our method, Markov chain Monte Carlo (MCMC) simulations are employed to determine the mixture model with no need of prior knowledge about nucleosomes. Compared with three existing methods, our approach can provide more detailed information of the detected nucleosomes and can more reasonably reveal the real configurations of the chromosomes; especially, our approach performs better in the complex overlapping situations. By mapping the detected nucleosomes to a synthetic benchmark nucleosome map and two existing benchmark nucleosome maps, it is shown that our approach achieves a better performance in identifying nucleosome positions and gets a higher F-score. Finally, we show that our approach can more reliably detect the size distribution of nucleosomes.
DPNuc: Identifying Nucleosome Positions Based on the Dirichlet Process Mixture Model.
Chen, Huidong; Guan, Jihong; Zhou, Shuigeng
2015-01-01
Nucleosomes and the free linker DNA between them assemble the chromatin. Nucleosome positioning plays an important role in gene transcription regulation, DNA replication and repair, alternative splicing, and so on. With the rapid development of ChIP-seq, it is possible to computationally detect the positions of nucleosomes on chromosomes. However, existing methods cannot provide accurate and detailed information about the detected nucleosomes, especially for the nucleosomes with complex configurations where overlaps and noise exist. Meanwhile, they usually require some prior knowledge of nucleosomes as input, such as the size or the number of the unknown nucleosomes, which may significantly influence the detection results. In this paper, we propose a novel approach DPNuc for identifying nucleosome positions based on the Dirichlet process mixture model. In our method, Markov chain Monte Carlo (MCMC) simulations are employed to determine the mixture model with no need of prior knowledge about nucleosomes. Compared with three existing methods, our approach can provide more detailed information of the detected nucleosomes and can more reasonably reveal the real configurations of the chromosomes; especially, our approach performs better in the complex overlapping situations. By mapping the detected nucleosomes to a synthetic benchmark nucleosome map and two existing benchmark nucleosome maps, it is shown that our approach achieves a better performance in identifying nucleosome positions and gets a higher F-score. Finally, we show that our approach can more reliably detect the size distribution of nucleosomes. PMID:26671796
Scalable quantum information processing with photons and atoms
NASA Astrophysics Data System (ADS)
Pan, Jian-Wei
Over the past three decades, the promises of super-fast quantum computing and secure quantum cryptography have spurred a world-wide interest in quantum information, generating fascinating quantum technologies for coherent manipulation of individual quantum systems. However, the distance of fiber-based quantum communications is limited due to intrinsic fiber loss and decreasing of entanglement quality. Moreover, probabilistic single-photon source and entanglement source demand exponentially increased overheads for scalable quantum information processing. To overcome these problems, we are taking two paths in parallel: quantum repeaters and through satellite. We used the decoy-state QKD protocol to close the loophole of imperfect photon source, and used the measurement-device-independent QKD protocol to close the loophole of imperfect photon detectors--two main loopholes in quantum cryptograph. Based on these techniques, we are now building world's biggest quantum secure communication backbone, from Beijing to Shanghai, with a distance exceeding 2000 km. Meanwhile, we are developing practically useful quantum repeaters that combine entanglement swapping, entanglement purification, and quantum memory for the ultra-long distance quantum communication. The second line is satellite-based global quantum communication, taking advantage of the negligible photon loss and decoherence in the atmosphere. We realized teleportation and entanglement distribution over 100 km, and later on a rapidly moving platform. We are also making efforts toward the generation of multiphoton entanglement and its use in teleportation of multiple properties of a single quantum particle, topological error correction, quantum algorithms for solving systems of linear equations and machine learning. Finally, I will talk about our recent experiments on quantum simulations on ultracold atoms. On the one hand, by applying an optical Raman lattice technique, we realized a two-dimensional spin-obit (SO
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope.
Feist, Armin; Echternkamp, Katharina E; Schauss, Jakob; Yalunin, Sergey V; Schäfer, Sascha; Ropers, Claus
2015-05-14
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope
NASA Astrophysics Data System (ADS)
Feist, Armin; Echternkamp, Katharina E.; Schauss, Jakob; Yalunin, Sergey V.; Schäfer, Sascha; Ropers, Claus
2015-05-01
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven `quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.
Complete insecurity of quantum protocols for classical two-party computation.
Buhrman, Harry; Christandl, Matthias; Schaffner, Christian
2012-10-19
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice.
Complete insecurity of quantum protocols for classical two-party computation.
Buhrman, Harry; Christandl, Matthias; Schaffner, Christian
2012-10-19
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other's input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice. PMID:23215060
Complete Insecurity of Quantum Protocols for Classical Two-Party Computation
NASA Astrophysics Data System (ADS)
Buhrman, Harry; Christandl, Matthias; Schaffner, Christian
2012-10-01
A fundamental task in modern cryptography is the joint computation of a function which has two inputs, one from Alice and one from Bob, such that neither of the two can learn more about the other’s input than what is implied by the value of the function. In this Letter, we show that any quantum protocol for the computation of a classical deterministic function that outputs the result to both parties (two-sided computation) and that is secure against a cheating Bob can be completely broken by a cheating Alice. Whereas it is known that quantum protocols for this task cannot be completely secure, our result implies that security for one party implies complete insecurity for the other. Our findings stand in stark contrast to recent protocols for weak coin tossing and highlight the limits of cryptography within quantum mechanics. We remark that our conclusions remain valid, even if security is only required to be approximate and if the function that is computed for Bob is different from that of Alice.
Sub-millimeter servo system for sample positioning based on thresholding of defocused laser spot
NASA Astrophysics Data System (ADS)
Wang, Zheng; Cao, Liangcai; Zhang, Enyao; Jin, Guofan
2013-12-01
Accurate sample positioning and automatic sample operation can improve the performance of measuring instruments. A Sub-millimeter servo system for sample positioning based on thresholding of defocused laser spot is proposed. The effective laser spot image is extracted by thresholding of the light cone section on the sample surface. By estimating the section area and centroid of the spot, the defocus status and position of the measured sample can be acquired. A focused light cone at visible wavelength is cast onto the surface of sample, forming a marked laser spot as the indicator of the measurement point. A CCD camera is used for visual imaging, and a high-precision three-dimensional motorized translation stage is used for the accurate servo control. The marked spot is real-time monitored and processed in the platform of LabVIEW. The Autonomous Thresholding Image-Processing Algorithm (ATIPA) is proposed to detect and analyze the defocused marked spot, through which system creates a servo whereby accurate position control of the sample can be achieved. The measurement point on the sample can be accurately located by computing the center coordinates of the marked spot. And a focus function is implemented by measuring the size of defocused spot. This focus function is then used within an improved climbing search algorithm to obtain the focused sample position via moving the sample stage. Experimental results show that the system could measure the laser spot and control the sample in a robust, repeatable way within reasonable errors. The accuracy of the sample autofocus reaches 0.1 mm.
Stapp, H.P.
1988-12-01
Quantum ontologies are conceptions of the constitution of the universe that are compatible with quantum theory. The ontological orientation is contrasted to the pragmatic orientation of science, and reasons are given for considering quantum ontologies both within science, and in broader contexts. The principal quantum ontologies are described and evaluated. Invited paper at conference: Bell's Theorem, Quantum Theory, and Conceptions of the Universe, George Mason University, October 20-21, 1988. 16 refs.
Quantum Computer Games: Quantum Minesweeper
ERIC Educational Resources Information Center
Gordon, Michal; Gordon, Goren
2010-01-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…
Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network
NASA Astrophysics Data System (ADS)
Tang, Yan-Lin; Yin, Hua-Lei; Zhao, Qi; Liu, Hui; Sun, Xiang-Xiang; Huang, Ming-Qi; Zhang, Wei-Jun; Chen, Si-Jing; Zhang, Lu; You, Li-Xing; Wang, Zhen; Liu, Yang; Lu, Chao-Yang; Jiang, Xiao; Ma, Xiongfeng; Zhang, Qiang; Chen, Teng-Yun; Pan, Jian-Wei
2016-01-01
Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.
Experimental quantum key distribution with finite-key security analysis for noisy channels.
Bacco, Davide; Canale, Matteo; Laurenti, Nicola; Vallone, Giuseppe; Villoresi, Paolo
2013-01-01
In quantum key distribution implementations, each session is typically chosen long enough so that the secret key rate approaches its asymptotic limit. However, this choice may be constrained by the physical scenario, as in the perspective use with satellites, where the passage of one terminal over the other is restricted to a few minutes. Here we demonstrate experimentally the extraction of secure keys leveraging an optimal design of the prepare-and-measure scheme, according to recent finite-key theoretical tight bounds. The experiment is performed in different channel conditions, and assuming two distinct attack models: individual attacks or general quantum attacks. The request on the number of exchanged qubits is then obtained as a function of the key size and of the ambient quantum bit error rate. The results indicate that viable conditions for effective symmetric, and even one-time-pad, cryptography are achievable.
Experimental quantum key distribution with finite-key security analysis for noisy channels.
Bacco, Davide; Canale, Matteo; Laurenti, Nicola; Vallone, Giuseppe; Villoresi, Paolo
2013-01-01
In quantum key distribution implementations, each session is typically chosen long enough so that the secret key rate approaches its asymptotic limit. However, this choice may be constrained by the physical scenario, as in the perspective use with satellites, where the passage of one terminal over the other is restricted to a few minutes. Here we demonstrate experimentally the extraction of secure keys leveraging an optimal design of the prepare-and-measure scheme, according to recent finite-key theoretical tight bounds. The experiment is performed in different channel conditions, and assuming two distinct attack models: individual attacks or general quantum attacks. The request on the number of exchanged qubits is then obtained as a function of the key size and of the ambient quantum bit error rate. The results indicate that viable conditions for effective symmetric, and even one-time-pad, cryptography are achievable. PMID:24008848
Local Random Quantum Circuits are Approximate Polynomial-Designs
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-09-01
We prove that local random quantum circuits acting on n qubits composed of O( t 10 n 2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O( t 10 n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O( n k ) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O( n ( k-9)/11) that are given oracle access to U.
Local Random Quantum Circuits are Approximate Polynomial-Designs
NASA Astrophysics Data System (ADS)
Brandão, Fernando G. S. L.; Harrow, Aram W.; Horodecki, Michał
2016-08-01
We prove that local random quantum circuits acting on n qubits composed of O(t 10 n 2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t 10 n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n k ) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n (k-9)/11) that are given oracle access to U.
Quantum anonymous voting with unweighted continuous-variable graph states
NASA Astrophysics Data System (ADS)
Guo, Ying; Feng, Yanyan; Zeng, Guihua
2016-08-01
Motivated by the revealing topological structures of continuous-variable graph state (CVGS), we investigate the design of quantum voting scheme, which has serious advantages over the conventional ones in terms of efficiency and graphicness. Three phases are included, i.e., the preparing phase, the voting phase and the counting phase, together with three parties, i.e., the voters, the tallyman and the ballot agency. Two major voting operations are performed on the yielded CVGS in the voting process, namely the local rotation transformation and the displacement operation. The voting information is carried by the CVGS established before hand, whose persistent entanglement is deployed to keep the privacy of votes and the anonymity of legal voters. For practical applications, two CVGS-based quantum ballots, i.e., comparative ballot and anonymous survey, are specially designed, followed by the extended ballot schemes for the binary-valued and multi-valued ballots under some constraints for the voting design. Security is ensured by entanglement of the CVGS, the voting operations and the laws of quantum mechanics. The proposed schemes can be implemented using the standard off-the-shelf components when compared to discrete-variable quantum voting schemes attributing to the characteristics of the CV-based quantum cryptography.
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E.
2016-01-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems. PMID:27381511
Pfeiffer, P; Egusquiza, I L; Di Ventra, M; Sanz, M; Solano, E
2016-01-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems. PMID:27381511
Pfeiffer, P; Egusquiza, I L; Di Ventra, M; Sanz, M; Solano, E
2016-07-06
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.
NASA Astrophysics Data System (ADS)
Pfeiffer, P.; Egusquiza, I. L.; di Ventra, M.; Sanz, M.; Solano, E.
2016-07-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.
Electrically driven polarized single-photon emission from an InGaN quantum dot in a GaN nanowire.
Deshpande, Saniya; Heo, Junseok; Das, Ayan; Bhattacharya, Pallab
2013-01-01
In a classical light source, such as a laser, the photon number follows a Poissonian distribution. For quantum information processing and metrology applications, a non-classical emitter of single photons is required. A single quantum dot is an ideal source of single photons and such single-photon sources in the visible spectral range have been demonstrated with III-nitride and II-VI-based single quantum dots. It has been suggested that short-wavelength blue single-photon emitters would be useful for free-space quantum cryptography, with the availability of high-speed single-photon detectors in this spectral region. Here we demonstrate blue single-photon emission with electrical injection from an In0.25Ga0.75N quantum dot in a single nanowire. The emitted single photons are linearly polarized along the c axis of the nanowire with a degree of linear polarization of ~70%.
Electrically driven polarized single-photon emission from an InGaN quantum dot in a GaN nanowire.
Deshpande, Saniya; Heo, Junseok; Das, Ayan; Bhattacharya, Pallab
2013-01-01
In a classical light source, such as a laser, the photon number follows a Poissonian distribution. For quantum information processing and metrology applications, a non-classical emitter of single photons is required. A single quantum dot is an ideal source of single photons and such single-photon sources in the visible spectral range have been demonstrated with III-nitride and II-VI-based single quantum dots. It has been suggested that short-wavelength blue single-photon emitters would be useful for free-space quantum cryptography, with the availability of high-speed single-photon detectors in this spectral region. Here we demonstrate blue single-photon emission with electrical injection from an In0.25Ga0.75N quantum dot in a single nanowire. The emitted single photons are linearly polarized along the c axis of the nanowire with a degree of linear polarization of ~70%. PMID:23575679
NASA Astrophysics Data System (ADS)
Brzeziński, Tomasz; Fairfax, Simon A.
2012-11-01
Algebras of functions on quantum weighted projective spaces are introduced, and the structure of quantum weighted projective lines or quantum teardrops is described in detail. In particular the presentation of the coordinate algebra of the quantum teardrop in terms of generators and relations and classification of irreducible *-representations are derived. The algebras are then analysed from the point of view of Hopf-Galois theory or the theory of quantum principal bundles. Fredholm modules and associated traces are constructed. C*-algebras of continuous functions on quantum weighted projective lines are described and their K-groups computed.
Quantum Error Correction with Biased Noise
NASA Astrophysics Data System (ADS)
Brooks, Peter
Quantum computing offers powerful new techniques for speeding up the calculation of many classically intractable problems. Quantum algorithms can allow for the efficient simulation of physical systems, with applications to basic research, chemical modeling, and drug discovery; other algorithms have important implications for cryptography and internet security. At the same time, building a quantum computer is a daunting task, requiring the coherent manipulation of systems with many quantum degrees of freedom while preventing environmental noise from interacting too strongly with the system. Fortunately, we know that, under reasonable assumptions, we can use the techniques of quantum error correction and fault tolerance to achieve an arbitrary reduction in the noise level. In this thesis, we look at how additional information about the structure of noise, or "noise bias," can improve or alter the performance of techniques in quantum error correction and fault tolerance. In Chapter 2, we explore the possibility of designing certain quantum gates to be extremely robust with respect to errors in their operation. This naturally leads to structured noise where certain gates can be implemented in a protected manner, allowing the user to focus their protection on the noisier unprotected operations. In Chapter 3, we examine how to tailor error-correcting codes and fault-tolerant quantum circuits in the presence of dephasing biased noise, where dephasing errors are far more common than bit-flip errors. By using an appropriately asymmetric code, we demonstrate the ability to improve the amount of error reduction and decrease the physical resources required for error correction. In Chapter 4, we analyze a variety of protocols for distilling magic states, which enable universal quantum computation, in the presence of faulty Clifford operations. Here again there is a hierarchy of noise levels, with a fixed error rate for faulty gates, and a second rate for errors in the distilled
Dissipative production of a maximally entangled steady state of two quantum bits.
Lin, Y; Gaebler, J P; Reiter, F; Tan, T R; Bowler, R; Sørensen, A S; Leibfried, D; Wineland, D J
2013-12-19
Entangled states are a key resource in fundamental quantum physics, quantum cryptography and quantum computation. Introduction of controlled unitary processes--quantum gates--to a quantum system has so far been the most widely used method to create entanglement deterministically. These processes require high-fidelity state preparation and minimization of the decoherence that inevitably arises from coupling between the system and the environment, and imperfect control of the system parameters. Here we combine unitary processes with engineered dissipation to deterministically produce and stabilize an approximate Bell state of two trapped-ion quantum bits (qubits), independent of their initial states. Compared with previous studies that involved dissipative entanglement of atomic ensembles or the application of sequences of multiple time-dependent gates to trapped ions, we implement our combined process using trapped-ion qubits in a continuous time-independent fashion (analogous to optical pumping of atomic states). By continuously driving the system towards the steady state, entanglement is stabilized even in the presence of experimental noise and decoherence. Our demonstration of an entangled steady state of two qubits represents a step towards dissipative state engineering, dissipative quantum computation and dissipative phase transitions. Following this approach, engineered coupling to the environment may be applied to a broad range of experimental systems to achieve desired quantum dynamics or steady states. Indeed, concurrently with this work, an entangled steady state of two superconducting qubits was demonstrated using dissipation.
Dissipative production of a maximally entangled steady state of two quantum bits.
Lin, Y; Gaebler, J P; Reiter, F; Tan, T R; Bowler, R; Sørensen, A S; Leibfried, D; Wineland, D J
2013-12-19
Entangled states are a key resource in fundamental quantum physics, quantum cryptography and quantum computation. Introduction of controlled unitary processes--quantum gates--to a quantum system has so far been the most widely used method to create entanglement deterministically. These processes require high-fidelity state preparation and minimization of the decoherence that inevitably arises from coupling between the system and the environment, and imperfect control of the system parameters. Here we combine unitary processes with engineered dissipation to deterministically produce and stabilize an approximate Bell state of two trapped-ion quantum bits (qubits), independent of their initial states. Compared with previous studies that involved dissipative entanglement of atomic ensembles or the application of sequences of multiple time-dependent gates to trapped ions, we implement our combined process using trapped-ion qubits in a continuous time-independent fashion (analogous to optical pumping of atomic states). By continuously driving the system towards the steady state, entanglement is stabilized even in the presence of experimental noise and decoherence. Our demonstration of an entangled steady state of two qubits represents a step towards dissipative state engineering, dissipative quantum computation and dissipative phase transitions. Following this approach, engineered coupling to the environment may be applied to a broad range of experimental systems to achieve desired quantum dynamics or steady states. Indeed, concurrently with this work, an entangled steady state of two superconducting qubits was demonstrated using dissipation. PMID:24270806
NASA Astrophysics Data System (ADS)
Ohori, Daisuke; Fukuyama, Atsuhiko; Thomas, Cedric; Higo, Akio; Samukawa, Seiji; Ikari, Tetsuo
2016-09-01
We demonstrated that the lattice-matched GaAs quantum nanodisks (QNDs) embedded in an AlGaAs matrix were fabricated by our original top-down nanoprocess. Lattice-matched GaAs QNDs are very attractive in quantum cryptography because the spin relaxation time of QNDs might be longer than that of strained quantum dots. Quantum levels of QNDs were investigated by the photoluminescence (PL) technique. The minimum diameter and thickness of QNDs were 7 and 8 nm, respectively. PL peaks of QNDs at 1.64 and 1.66 eV were observed to be higher than that of multiple quantum wells (MQWs) observed at 1.57 eV. It is suggested that these peaks are due to the diameter distribution of QNDs. The calculated quantum levels were in good agreement with the present experimental results. The observation of the PL peaks from QNDs demonstrates that the quantum level is strongly confined not only in the perpendicular direction but also in the lateral direction.
Zurek, Wojciech H
2008-01-01
Quantum Darwinism - proliferation, in the environment, of multiple records of selected states of the system (its information-theoretic progeny) - explains how quantum fragility of individual state can lead to classical robustness of their multitude.
Pfeiffer, P.; Egusquiza, I. L.; Di Ventra, M.; Sanz, M.; Solano, E.
2016-07-06
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantummore » regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. As a result, the proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.« less
Completely device-independent quantum key distribution
NASA Astrophysics Data System (ADS)
Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin
2016-08-01
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.
NASA Astrophysics Data System (ADS)
Coleman, Piers; Schofield, Andrew J.
2005-01-01
As we mark the centenary of Albert Einstein's seminal contribution to both quantum mechanics and special relativity, we approach another anniversary - that of Einstein's foundation of the quantum theory of solids. But 100 years on, the same experimental measurement that puzzled Einstein and his contemporaries is forcing us to question our understanding of how quantum matter transforms at ultra-low temperatures.
NASA Astrophysics Data System (ADS)
Brown, Matthew J.
2014-02-01
The framework of quantum frames can help unravel some of the interpretive difficulties i the foundation of quantum mechanics. In this paper, I begin by tracing the origins of this concept in Bohr's discussion of quantum theory and his theory of complementarity. Engaging with various interpreters and followers of Bohr, I argue that the correct account of quantum frames must be extended beyond literal space-time reference frames to frames defined by relations between a quantum system and the exosystem or external physical frame, of which measurement contexts are a particularly important example. This approach provides superior solutions to key EPR-type measurement and locality paradoxes.
NASA Astrophysics Data System (ADS)
Moulick, Subhayan Roy; Panigrahi, Prasanta K.
2016-06-01
We propose the idea of a quantum cheque scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a quantum cheque and present the first unconditionally secure quantum cheque scheme and show it to be secure against any no-signalling adversary. The proposed quantum cheque scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.
NASA Astrophysics Data System (ADS)
Zurek, Wojciech Hubert
2009-03-01
Quantum Darwinism describes the proliferation, in the environment, of multiple records of selected states of a quantum system. It explains how the quantum fragility of a state of a single quantum system can lead to the classical robustness of states in their correlated multitude; shows how effective `wave-packet collapse' arises as a result of the proliferation throughout the environment of imprints of the state of the system; and provides a framework for the derivation of Born's rule, which relates the probabilities of detecting states to their amplitudes. Taken together, these three advances mark considerable progress towards settling the quantum measurement problem.
Loss-tolerant quantum secure positioning with weak laser sources
Lim, Charles Ci Wen; Xu, Feihu; Siopsis, George; Chitambar, Eric; Evans, Philip G.; Qi, Bing
2016-09-14
Quantum position verification (QPV) is the art of verifying the geographical location of an untrusted party. It has recently been shown that the widely studied Bennett & Brassard 1984 (BB84) QPV protocol is insecure after the 3 dB loss point assuming local operations and classical communication (LOCC) adversaries. Here in this paper, we propose a time-reversed entanglement swapping QPV protocol (based on measurement-device-independent quantum cryptography) that is highly robust against quantum channel loss. First, assuming ideal qubit sources, we show that the protocol is secure against LOCC adversaries for any quantum channel loss, thereby overcoming the 3 dB loss limit.more » Then, we analyze the security of the protocol in a more practical setting involving weak laser sources and linear optics. Lastly, in this setting, we find that the security only degrades by an additive constant and the protocol is able to verify positions up to 47 dB channel loss.« less
NASA Astrophysics Data System (ADS)
Orvil Scully, Marlan; Zubairy, Muhammad Suhail
1997-09-01
Quantum optics has witnessed significant theoretical and experimental developments in recent years. This book provides an in-depth and wide-ranging introduction to the subject, emphasizing throughout the basic principles and their applications. The book begins by developing the basic tools of quantum optics, and goes on to show the application of these tools in a variety of quantum optical systems, including lasing without inversion, squeezed states, and atom optics. The final four chapters discuss quantum optical tests of the foundations of quantum mechanics, and particular aspects of measurement theory. Assuming only a background of standard quantum mechanics and electromagnetic theory, and containing many problems and references, this book will be invaluable to graduate students of quantum optics, as well as to researchers in this field.
NASA Astrophysics Data System (ADS)
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-08-01
A novel image encryption system based on double random phase encoding (DRPE) and RSA public-key algorithm is proposed. The main characteristic of the system is that each encryption process produces a new decryption key (even for the same plaintext), thus the encryption system conforms to the feature of the one-time pad (OTP) cryptography. The other characteristic of the system is the use of fingerprint key. Only with the rightful authorization will the true decryption be obtained, otherwise the decryption will result in noisy images. So the proposed system can be used to determine whether the ciphertext is falsified by attackers. In addition, the system conforms to the basic agreement of asymmetric cryptosystem (ACS) due to the combination with the RSA public-key algorithm. The simulation results show that the encryption scheme has high robustness against the existing attacks.
Practical quantum key distribution protocol without monitoring signal disturbance.
Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato
2014-05-22
Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD.
Practical quantum key distribution protocol without monitoring signal disturbance.
Sasaki, Toshihiko; Yamamoto, Yoshihisa; Koashi, Masato
2014-05-22
Quantum cryptography exploits the fundamental laws of quantum mechanics to provide a secure way to exchange private information. Such an exchange requires a common random bit sequence, called a key, to be shared secretly between the sender and the receiver. The basic idea behind quantum key distribution (QKD) has widely been understood as the property that any attempt to distinguish encoded quantum states causes a disturbance in the signal. As a result, implementation of a QKD protocol involves an estimation of the experimental parameters influenced by the eavesdropper's intervention, which is achieved by randomly sampling the signal. If the estimation of many parameters with high precision is required, the portion of the signal that is sacrificed increases, thus decreasing the efficiency of the protocol. Here we propose a QKD protocol based on an entirely different principle. The sender encodes a bit sequence onto non-orthogonal quantum states and the receiver randomly dictates how a single bit should be calculated from the sequence. The eavesdropper, who is unable to learn the whole of the sequence, cannot guess the bit value correctly. An achievable rate of secure key distribution is calculated by considering complementary choices between quantum measurements of two conjugate observables. We found that a practical implementation using a laser pulse train achieves a key rate comparable to a decoy-state QKD protocol, an often-used technique for lasers. It also has a better tolerance of bit errors and of finite-sized-key effects. We anticipate that this finding will give new insight into how the probabilistic nature of quantum mechanics can be related to secure communication, and will facilitate the simple and efficient use of conventional lasers for QKD. PMID:24848060
NASA Astrophysics Data System (ADS)
Ryabov, V. A.
2015-08-01
Quantum systems in a mechanical embedding, the breathing mode of a small particles, optomechanical system, etc. are far not the full list of examples in which the volume exhibits quantum behavior. Traditional consideration suggests strain in small systems as a result of a collective movement of particles, rather than the dynamics of the volume as an independent variable. The aim of this work is to show that some problem here might be essentially simplified by introducing periodic boundary conditions. At this case, the volume is considered as the independent dynamical variable driven by the internal pressure. For this purpose, the concept of quantum volume based on Schrödinger’s equation in 𝕋3 manifold is proposed. It is used to explore several 1D model systems: An ensemble of free particles under external pressure, quantum manometer and a quantum breathing mode. In particular, the influence of the pressure of free particle on quantum oscillator is determined. It is shown also that correction to the spectrum of the breathing mode due to internal degrees of freedom is determined by the off-diagonal matrix elements of the quantum stress. The new treatment not using the “force” theorem is proposed for the quantum stress tensor. In the general case of flexible quantum 3D dynamics, quantum deformations of different type might be introduced similarly to monopole mode.
NASA Astrophysics Data System (ADS)
Levy, Amikam; Diósi, Lajos; Kosloff, Ronnie
2016-05-01
In this work we present the concept of a quantum flywheel coupled to a quantum heat engine. The flywheel stores useful work in its energy levels, while additional power is extracted continuously from the device. Generally, the energy exchange between a quantum engine and a quantized work repository is accompanied by heat, which degrades the charging efficiency. Specifically when the quantum harmonic oscillator acts as a work repository, quantum and thermal fluctuations dominate the dynamics. Quantum monitoring and feedback control are applied to the flywheel in order to reach steady state and regulate its operation. To maximize the charging efficiency one needs a balance between the information gained by measuring the system and the information fed back to the system. The dynamics of the flywheel are described by a stochastic master equation that accounts for the engine, the external driving, the measurement, and the feedback operations.
Quantum random bit generation using energy fluctuations in stimulated Raman scattering.
Bustard, Philip J; England, Duncan G; Nunn, Josh; Moffatt, Doug; Spanner, Michael; Lausten, Rune; Sussman, Benjamin J
2013-12-01
Random number sequences are a critical resource in modern information processing systems, with applications in cryptography, numerical simulation, and data sampling. We introduce a quantum random number generator based on the measurement of pulse energy quantum fluctuations in Stokes light generated by spontaneously-initiated stimulated Raman scattering. Bright Stokes pulse energy fluctuations up to five times the mean energy are measured with fast photodiodes and converted to unbiased random binary strings. Since the pulse energy is a continuous variable, multiple bits can be extracted from a single measurement. Our approach can be generalized to a wide range of Raman active materials; here we demonstrate a prototype using the optical phonon line in bulk diamond. PMID:24514488
Augusiak, Remigiusz; Horodecki, Pawel
2006-07-15
It is shown that Smolin four-qubit bound entangled states [J. A. Smolin, Phys. Rev. A 63, 032306 (2001)] can maximally violate the simple two-setting Bell inequality similar to the standard Clauser-Horne-Shimony-Holt (CHSH) inequality. The simplicity of the setting and the robustness of the entanglement make it promising for current experimental technology. On the other hand, the entanglement does not allow for secure key distillation, so neither entanglement nor maximal violation of Bell inequalities implies directly the presence of a quantum secure key. As a result, one concludes that two tasks--reducing of communication complexity and cryptography--are not (even qualitatively) equivalent in a quantum multipartite scenario.
Quantum random bit generation using energy fluctuations in stimulated Raman scattering.
Bustard, Philip J; England, Duncan G; Nunn, Josh; Moffatt, Doug; Spanner, Michael; Lausten, Rune; Sussman, Benjamin J
2013-12-01
Random number sequences are a critical resource in modern information processing systems, with applications in cryptography, numerical simulation, and data sampling. We introduce a quantum random number generator based on the measurement of pulse energy quantum fluctuations in Stokes light generated by spontaneously-initiated stimulated Raman scattering. Bright Stokes pulse energy fluctuations up to five times the mean energy are measured with fast photodiodes and converted to unbiased random binary strings. Since the pulse energy is a continuous variable, multiple bits can be extracted from a single measurement. Our approach can be generalized to a wide range of Raman active materials; here we demonstrate a prototype using the optical phonon line in bulk diamond.
Coleman, Piers; Schofield, Andrew J
2005-01-20
As we mark the centenary of Albert Einstein's seminal contribution to both quantum mechanics and special relativity, we approach another anniversary--that of Einstein's foundation of the quantum theory of solids. But 100 years on, the same experimental measurement that puzzled Einstein and his contemporaries is forcing us to question our understanding of how quantum matter transforms at ultra-low temperatures. PMID:15662409
NASA Astrophysics Data System (ADS)
Lanzagorta, Marco; Jitrik, Oliverio; Uhlmann, Jeffrey; Venegas, Salvador
2016-05-01
A major scientific thrust from recent years has been to try to harness quantum phenomena to increase the performance of a wide variety of information processing devices. In particular, quantum radar has emerged as an intriguing theoretical concept that could revolutionize electromagnetic standoff sensing. In this paper we will discuss how the techniques developed for quantum radar could also be used towards the design of novel seismographs able to detect small ground vibrations., We use a hypothetical earthquake warning system in order to compare quantum seismography with traditional seismographic techniques.
NASA Astrophysics Data System (ADS)
Tartakovskii, Alexander
2012-07-01
Part I. Nanostructure Design and Structural Properties of Epitaxially Grown Quantum Dots and Nanowires: 1. Growth of III/V semiconductor quantum dots C. Schneider, S. Hofling and A. Forchel; 2. Single semiconductor quantum dots in nanowires: growth, optics, and devices M. E. Reimer, N. Akopian, M. Barkelid, G. Bulgarini, R. Heeres, M. Hocevar, B. J. Witek, E. Bakkers and V. Zwiller; 3. Atomic scale analysis of self-assembled quantum dots by cross-sectional scanning tunneling microscopy and atom probe tomography J. G. Keizer and P. M. Koenraad; Part II. Manipulation of Individual Quantum States in Quantum Dots Using Optical Techniques: 4. Studies of the hole spin in self-assembled quantum dots using optical techniques B. D. Gerardot and R. J. Warburton; 5. Resonance fluorescence from a single quantum dot A. N. Vamivakas, C. Matthiesen, Y. Zhao, C.-Y. Lu and M. Atature; 6. Coherent control of quantum dot excitons using ultra-fast optical techniques A. J. Ramsay and A. M. Fox; 7. Optical probing of holes in quantum dot molecules: structure, symmetry, and spin M. F. Doty and J. I. Climente; Part III. Optical Properties of Quantum Dots in Photonic Cavities and Plasmon-Coupled Dots: 8. Deterministic light-matter coupling using single quantum dots P. Senellart; 9. Quantum dots in photonic crystal cavities A. Faraon, D. Englund, I. Fushman, A. Majumdar and J. Vukovic; 10. Photon statistics in quantum dot micropillar emission M. Asmann and M. Bayer; 11. Nanoplasmonics with colloidal quantum dots V. Temnov and U. Woggon; Part IV. Quantum Dot Nano-Laboratory: Magnetic Ions and Nuclear Spins in a Dot: 12. Dynamics and optical control of an individual Mn spin in a quantum dot L. Besombes, C. Le Gall, H. Boukari and H. Mariette; 13. Optical spectroscopy of InAs/GaAs quantum dots doped with a single Mn atom O. Krebs and A. Lemaitre; 14. Nuclear spin effects in quantum dot optics B. Urbaszek, B. Eble, T. Amand and X. Marie; Part V. Electron Transport in Quantum Dots Fabricated by
NASA Astrophysics Data System (ADS)
Wang, Huiquan; Wu, Junjie; He, Hongjuan; Tang, Yuhua
2016-08-01
Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers' state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state 1/√{2}(|A rangle _1|Arangle _2 ± |Brangle _1|Brangle _2) in the coin space of two walkers with fidelity greater than 99.99999 % in theory, and we have at least a 50 % probability to obtain the expected Bell state after a proper local measurement.
NASA Astrophysics Data System (ADS)
Wang, Huiquan; Wu, Junjie; He, Hongjuan; Tang, Yuhua
2016-09-01
Studies on two-particle quantum walks show that the spatial interaction between walkers will dynamically generate complex entanglement. However, those entanglement states are usually on a large state space and their evolutions are complex. It makes the entanglement states generated by quantum walk difficult to be applied directly in many applications of quantum information, such as quantum teleportation and quantum cryptography. In this paper, we firstly analyse a localization phenomena of two-particle quantum walk and then introduce how to use it to generate a Bell state. We will show that one special superposition component of the walkers' state is localized on the root vertex if a certain interaction exists between walkers. This localization is interesting because it is contrary to our knowledge that quantum walk spreads faster than its classical counterpart. More interestingly, the localized component is a Bell state in the coin space of two walkers. By this method, we can obtain a Bell state easily from the quantum walk with spatial interaction by a local measurement, which is required in many applications. Through simulations, we verify that this method is able to generate the Bell state 1/√{2}(|A rangle _1|Arangle _2 ± |Brangle _1|Brangle _2) in the coin space of two walkers with fidelity greater than 99.99999 % in theory, and we have at least a 50 % probability to obtain the expected Bell state after a proper local measurement.
Dissipative quantum computing with open quantum walks
Sinayskiy, Ilya; Petruccione, Francesco
2014-12-04
An open quantum walk approach to the implementation of a dissipative quantum computing scheme is presented. The formalism is demonstrated for the example of an open quantum walk implementation of a 3 qubit quantum circuit consisting of 10 gates.
Graph State-Based Quantum Secret Sharing with the Chinese Remainder Theorem
NASA Astrophysics Data System (ADS)
Guo, Ying; Luo, Peng; Wang, Yijun
2016-07-01
Quantum secret sharing (QSS) is a significant quantum cryptography technology in the literature. Dividing an initial secret into several sub-secrets which are then transferred to other legal participants so that it can be securely recovered in a collaboration fashion. In this paper, we develop a quantum route selection based on the encoded quantum graph state, thus enabling the practical QSS scheme in the small-scale complex quantum network. Legal participants are conveniently designated with the quantum route selection using the entanglement of the encoded graph states. Each participant holds a vertex of the graph state so that legal participants are selected through performing operations on specific vertices. The Chinese remainder theorem (CRT) strengthens the security of the recovering process of the initial secret among the legal participants. The security is ensured by the entanglement of the encoded graph states that are cooperatively prepared and shared by legal users beforehand with the sub-secrets embedded in the CRT over finite fields.
Quantum secure communication using a multi-photon tolerant protocol
NASA Astrophysics Data System (ADS)
El Rifai, Mayssaa; Verma, Pramode K.
2015-03-01
This paper proposes a quantum secure communication protocol using multiple photons to represent each bit of a message to be shared. The multi-photon tolerant approach to quantum cryptography provides a quantum level security while using more than a single photon per transmission. The protocol proposed is a multi-stage protocol; an explanation of its operation and implementation are provided. The multi-stage protocol is based on the use of unitary transformations known only to Alice and Bob. This paper studies the security aspects of the multi-stage protocol by assessing its vulnerability to different attacks. It is well known that as the number of photons increases, the level of vulnerability of the multi-stage protocol increases. This paper sets a limit on the number of photons that can be used while keeping the multi-stage protocol a multi-photon tolerant quantum secure method for communication. The analysis of the number of photons to be used is based on the probability of success of a Helstrom discrimination done by an eavesdropper on the channel. Limiting the number of photons up to certain threshold per stage makes it impossible for an eavesdropper to decipher the message sent over the channel. The proposed protocol obviates the disadvantages associated with single photon implementations, such as limited data rates and distances along with the need to have no more than a single photon per time slot. The multi-stage protocol is a step toward direct quantum communication rather than quantum key distribution associated with single photon approaches.
NASA Technical Reports Server (NTRS)
Lee, H.; Kok, P.; Dowling, J. P.
2002-01-01
This paper addresses the formal equivalence between the Mach-Zehnder interferometer, the Ramsey spectroscope, and a specific quantum logical gate. Based on this equivalence we introduce the quantum Rosetta Stone, and we describe a projective measurement scheme for generating the desired correlations between the interferometric input states in order to achieve Heisenberg-limited sensitivity.
Trevors, J T; Masson, L
2011-01-01
During his famous 1943 lecture series at Trinity College Dublin, the reknown physicist Erwin Schrodinger discussed the failure and challenges of interpreting life by classical physics alone and that a new approach, rooted in Quantum principles, must be involved. Quantum events are simply a level of organization below the molecular level. This includes the atomic and subatomic makeup of matter in microbial metabolism and structures, as well as the organic, genetic information code of DNA and RNA. Quantum events at this time do not elucidate, for example, how specific genetic instructions were first encoded in an organic genetic code in microbial cells capable of growth and division, and its subsequent evolution over 3.6 to 4 billion years. However, due to recent technological advances, biologists and physicists are starting to demonstrate linkages between various quantum principles like quantum tunneling, entanglement and coherence in biological processes illustrating that nature has exerted some level quantum control to optimize various processes in living organisms. In this article we explore the role of quantum events in microbial processes and endeavor to show that after nearly 67 years, Schrödinger was prophetic and visionary in his view of quantum theory and its connection with some of the fundamental mechanisms of life. PMID:21368338
NASA Astrophysics Data System (ADS)
Coecke, Bob
2010-01-01
Why did it take us 50 years since the birth of the quantum mechanical formalism to discover that unknown quantum states cannot be cloned? Yet, the proof of the 'no-cloning theorem' is easy, and its consequences and potential for applications are immense. Similarly, why did it take us 60 years to discover the conceptually intriguing and easily derivable physical phenomenon of 'quantum teleportation'? We claim that the quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the arrays of 0s and 1s of the early days of computer programming practice. Using a technical term from computer science, the quantum mechanical formalism is 'low-level'. In this review we present steps towards a diagrammatic 'high-level' alternative for the Hilbert space formalism, one which appeals to our intuition. The diagrammatic language as it currently stands allows for intuitive reasoning about interacting quantum systems, and trivialises many otherwise involved and tedious computations. It clearly exposes limitations such as the no-cloning theorem, and phenomena such as quantum teleportation. As a logic, it supports 'automation': it enables a (classical) computer to reason about interacting quantum systems, prove theorems, and design protocols. It allows for a wider variety of underlying theories, and can be easily modified, having the potential to provide the required step-stone towards a deeper conceptual understanding of quantum theory, as well as its unification with other physical theories. Specific applications discussed here are purely diagrammatic proofs of several quantum computational schemes, as well as an analysis of the structural origin of quantum non-locality. The underlying mathematical foundation of this high-level diagrammatic formalism relies on so-called monoidal categories, a product of a fairly
Generation of entanglement in quantum parametric oscillators using phase control.
Gonzalez-Henao, J C; Pugliese, E; Euzzor, S; Abdalah, S F; Meucci, R; Roversi, J A
2015-08-19
The control of quantum entanglement in systems in contact with environment plays an important role in information processing, cryptography and quantum computing. However, interactions with the environment, even when very weak, entail decoherence in the system with consequent loss of entanglement. Here we consider a system of two coupled oscillators in contact with a common heat bath and with a time dependent oscillation frequency. The possibility to control the entanglement of the oscillators by means of an external sinusoidal perturbation applied to the oscillation frequency has been theoretically explored. We demonstrate that the oscillators become entangled exactly in the region where the classical counterpart is unstable, otherwise when the classical system is stable, entanglement is not possible. Therefore, we can control the entanglement swapping from stable to unstable regions by adjusting amplitude and phase of our external controller. We also show that the entanglement rate is approximately proportional to the real part of the Floquet coefficient of the classical counterpart of the oscillators. Our results have the intriguing peculiarity of manipulating quantum information operating on a classical system.
An approach to experimental photonic quantum digital signatures in fiber
NASA Astrophysics Data System (ADS)
Donaldson, Ross J.; Collins, Robert J.; Dunjko, Vedran; Clarke, Partick J.; Andersson, Erika; Jeffers, John; Buller, Gerald S.
2013-10-01
As society becomes more reliant on electronic communication and transactions, ensuring the security of these interactions becomes more important. Digital signatures are a widely used form of cryptography which allows parties to certify the origins of their communications, meaning that one party, a sender, can send information to other parties in such a way that messages cannot be forged. In addition, messages are transferrable, meaning that a recipient who accepts a message as genuine can be sure that if it is forwarded to another recipient, it will again be accepted as genuine. The classical digital signature schemes currently employed typically rely on computational complexity for security. Quantum digital signatures offer the potential for increased security. In our system, quantum signature states are passed through a network of polarization maintaining fiber interferometers (a multiport) to ensure that recipients will not disagree on the validity of a message. These signatures are encoded in the phase of photonic coherent states and the choice of photon number, signature length and number of possible phase states affects the level of security possible by this approach. We will give a brief introduction into quantum digital signatures and present results from our experimental demonstration system.
Generation of entanglement in quantum parametric oscillators using phase control.
Gonzalez-Henao, J C; Pugliese, E; Euzzor, S; Abdalah, S F; Meucci, R; Roversi, J A
2015-01-01
The control of quantum entanglement in systems in contact with environment plays an important role in information processing, cryptography and quantum computing. However, interactions with the environment, even when very weak, entail decoherence in the system with consequent loss of entanglement. Here we consider a system of two coupled oscillators in contact with a common heat bath and with a time dependent oscillation frequency. The possibility to control the entanglement of the oscillators by means of an external sinusoidal perturbation applied to the oscillation frequency has been theoretically explored. We demonstrate that the oscillators become entangled exactly in the region where the classical counterpart is unstable, otherwise when the classical system is stable, entanglement is not possible. Therefore, we can control the entanglement swapping from stable to unstable regions by adjusting amplitude and phase of our external controller. We also show that the entanglement rate is approximately proportional to the real part of the Floquet coefficient of the classical counterpart of the oscillators. Our results have the intriguing peculiarity of manipulating quantum information operating on a classical system. PMID:26286485
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
2006-11-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
NASA Astrophysics Data System (ADS)
Casati, Giulio; Chirikov, Boris
1995-04-01
Preface; Acknowledgments; Introduction: 1. The legacy of chaos in quantum mechanics G. Casati and B. V. Chirikov; Part I. Classical Chaos and Quantum Localization: 2. Stochastic behaviour of a quantum pendulum under a periodic perturbation G. Casati, B. V. Chirikov, F. M. Izrailev and J. Ford; 3. Quantum dynamics of a nonintegrable system D. R. Grempel, R. E. Prange and S. E. Fishman; 4. Excitation of molecular rotation by periodic microwave pulses. A testing ground for Anderson localization R. Blümel, S. Fishman and U. Smilansky; 5. Localization of diffusive excitation in multi-level systems D. K. Shepelyansky; 6. Classical and quantum chaos for a kicked top F. Haake, M. Kus and R. Scharf; 7. Self-similarity in quantum dynamics L. E. Reichl and L. Haoming; 8. Time irreversibility of classically chaotic quantum dynamics K. Ikeda; 9. Effect of noise on time-dependent quantum chaos E. Ott, T. M. Antonsen Jr and J. D. Hanson; 10. Dynamical localization, dissipation and noise R. F. Graham; 11. Maximum entropy models and quantum transmission in disordered systems J.-L. Pichard and M. Sanquer; 12. Solid state 'atoms' in intense oscillating fields M. S. Sherwin; Part II. Atoms in Strong Fields: 13. Localization of classically chaotic diffusion for hydrogen atoms in microwave fields J. E. Bayfield, G. Casati, I. Guarneri and D. W. Sokol; 14. Inhibition of quantum transport due to 'scars' of unstable periodic orbits R. V. Jensen, M. M. Sanders, M. Saraceno and B. Sundaram; 15. Rubidium Rydberg atoms in strong fields G. Benson, G. Raithel and H. Walther; 16. Diamagnetic Rydberg atom: confrontation of calculated and observed spectra C.-H. Iu, G. R. Welch, M. M. Kash, D. Kleppner, D. Delande and J. C. Gay; 17. Semiclassical approximation for the quantum states of a hydrogen atom in a magnetic field near the ionization limit M. Y. Kuchiev and O. P. Sushkov; 18. The semiclassical helium atom D. Wintgen, K. Richter and G. Tanner; 19. Stretched helium: a model for quantum chaos
NASA Astrophysics Data System (ADS)
Claeson, Tord; Delsing, Per; Wendin, Göran
2009-12-01
correction, have yet to be solved. It has been predicted that quantum computers will be able to perform certain complicated computations or simulations in minutes or hours instead of years as with present computers. So far there exist very few useful quantum algorithms; however there is hope that the development of these will be stimulated once there is a breakthrough in hardware. Remarkable progress has been made in quantum engineering and quantum measurements, but a large scale quantum computer is still far off. Quantum communication and cryptography are much closer to the market than a quantum computer. The development of quantum information has meant a large push in the field of quantum physics, that previously could only be studied in the microscopic world. Artificial atoms, realized by circuit technology and mimicking the properties of 'natural' atoms, are one example of the new possibilities opened up by quantum engineering. Several different types of qubits have been suggested. Some are based upon microscopic entities, like atoms and ions in traps, or nuclear spins in molecules. They can have long coherence times (i.e. a long period allowing many operations, of the order of 10 000, to be performed before the state needs to be refreshed) but they are difficult to integrate into large systems. Other qubits are based upon solid state components that facilitate integration and coupling between qubits, but they suffer from interactions with the environment and their coherent states have a limited lifetime. Advanced experiments have been performed with superconducting Josephson junctions and many breakthroughs have been reported in the last few years. They have an advantage in the inherent coherence of superconducting Cooper pairs over macroscopic distances. We chose to focus the Nobel Symposium on Qubits for Future Quantum Information on superconducting qubits to allow for depth in discussions, but at the same time to allow comparison with other types of qubits that may
Quantum strategies of quantum measurements
NASA Astrophysics Data System (ADS)
Li, Chuan-Feng; Zhang, Yong-Sheng; Huang, Yun-Feng; Guo, Guang-Can
2001-03-01
In the classical Monty Hall problem, one player can always win with probability 2/3. We generalize the problem to the quantum domain and show that a fair two-party zero-sum game can be carried out if the other player is permitted to adopt quantum measurement strategy.
Quantum physics without quantum philosophy
NASA Astrophysics Data System (ADS)
Dürr, Detlef; Goldstein, Sheldon; Zanghì, Nino
Quantum philosophy, a peculiar twentieth-century malady, is responsible for most of the conceptual muddle plaguing the foundations of quantum physics. When this philosophy is eschewed, one naturally arrives at Bohmian mechanics, which is what emerges from Schrödinger's equation for a nonrelativistic system of particles when we merely insist that 'particles' means particles. While distinctly non-Newtonian, Bohmian mechanics is a fully deterministic theory of particles in motion, a motion choreographed by the wave function. The quantum formalism emerges when measurement situations are analyzed according to this theory. When the quantum formalism is regarded as arising in this way, the paradoxes and perplexities so often associated with quantum theory simply evaporate.
ERIC Educational Resources Information Center
Peterson, Ivars
1989-01-01
An analogy from the game of baseball can be used to examine the philosophy involved in statistics surrounding quantum mechanical events. The "Strong Baseball Principle" is proposed and discussed. (CW)
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.’s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.’s protocol and existing similar protocols. PMID:27163786
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.'s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols.
Reddy, Alavalapati Goutham; Das, Ashok Kumar; Odelu, Vanga; Yoo, Kee-Young
2016-01-01
Biometric based authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in wireless technologies and associated constraints. Lu et al. recently proposed a robust biometric based authentication with key agreement protocol for a multi-server environment using smart cards. They claimed that their protocol is efficient and resistant to prominent security attacks. The careful investigation of this paper proves that Lu et al.'s protocol does not provide user anonymity, perfect forward secrecy and is susceptible to server and user impersonation attacks, man-in-middle attacks and clock synchronization problems. In addition, this paper proposes an enhanced biometric based authentication with key-agreement protocol for multi-server architecture based on elliptic curve cryptography using smartcards. We proved that the proposed protocol achieves mutual authentication using Burrows-Abadi-Needham (BAN) logic. The formal security of the proposed protocol is verified using the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to show that our protocol can withstand active and passive attacks. The formal and informal security analyses and performance analysis demonstrates that the proposed protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols. PMID:27163786
NASA Astrophysics Data System (ADS)
Stapp, Henry P.
2012-05-01
Robert Griffiths has recently addressed, within the framework of a `consistent quantum theory' that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues that the putative proofs of this property that involve hidden variables include in their premises some essentially classical-physics-type assumptions that are not entailed by the precepts of quantum mechanics. Thus whatever is proved is not a feature of quantum mechanics, but is a property of a theory that tries to combine quantum theory with quasi-classical features that go beyond what is entailed by quantum theory itself. One cannot logically prove properties of a system by establishing, instead, properties of a system modified by adding properties alien to the original system. Hence Griffiths' rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his `consistent quantum theory' shows that the cited proof is valid within that restrictive version of quantum theory. An added section responds to Griffiths' reply, which cites general possibilities of ambiguities that might make what is to be proved ill-defined, and hence render the pertinent `consistent framework' ill defined. But the vagaries that he cites do not upset the proof in question, which, both by its physical formulation and by explicit identification, specify the framework to be used. Griffiths confirms the validity of the proof insofar as that pertinent framework is used. The section also shows
Quantum coherent optical phase modulation in an ultrafast transmission electron microscope.
Feist, Armin; Echternkamp, Katharina E; Schauss, Jakob; Yalunin, Sergey V; Schäfer, Sascha; Ropers, Claus
2015-05-14
Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers. PMID:25971512