Results 1 
5 of
5
What is going on with Quantum Bit Commitment?
"... Recent results in quantum physics indicate that Quantum Bit Commitment is impossible in a scenario where the participants have the full power of quantum mechanics to attack the protocol. This implies that all existing protocols for this task can be cheated in theory. In the current paper, we review ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Recent results in quantum physics indicate that Quantum Bit Commitment is impossible in a scenario where the participants have the full power of quantum mechanics to attack the protocol. This implies that all existing protocols for this task can be cheated in theory. In the current paper, we review the state of the art in quantum cryptographic protocols, and analyze the impact of this new result from a theoretical and practical point of view. 1 Introduction The idea of using quantum physics to achieve security in cryptographic protocols marked the birth of quantum cryptography with the work of Wiesner [29] who introduced the notion of a multiplexing channel. Such a channel may be used by a party A to transmit two pieces of information w 0 ; w 1 to another party B who chooses to receive either w 0 or w 1 but cannot get both. A never finds out which information B got. This small primitive later known as oneoutoftwo Oblivious Transfer by cryptographers [24, 13] can be used to implemen...
Cryptology Column  25 Years of Quantum Cryptography
, 1996
"... The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was known at the timecame out. Muc ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
The fates of SIGACT News and Quantum Cryptography are inseparably entangled. The exact date of Stephen Wiesner's invention of "conjugate coding" is unknown but it cannot be far from April 1969, when the premier issue of SIGACT Newsor rather SICACT News as it was known at the timecame out. Much later, it was in SIGACT News that Wiesner's paper finally appeared [74] in the wake of the first author's early collaboration with Charles H. Bennett [7]. It was also in SIGACT News that the original experimental demonstration for quantum key distribution was announced for the first time [6] and that a thorough bibliography was published [19]. Finally, it was in SIGACT News that Doug Wiedemann chose to publish his discovery when he reinvented quantum key distribution in 1987, unaware of all previous work but Wiesner's [73, 5]. Most of the first decade of the history of quant
Nuclear Magnetic Resonance Spectroscopy: An Experimentally Accessible Paradigm for Quantum Computing
, 1996
"... this paper will describe how basic quantum logic gates can be implemented via NMR spectroscopy, and present experimental results to validate our claims. After submitting the revised version of this abstract, we learned that an analogous approach has also been submitted to this workshop[7]. 2 Basic r ..."
Abstract
 Add to MetaCart
this paper will describe how basic quantum logic gates can be implemented via NMR spectroscopy, and present experimental results to validate our claims. After submitting the revised version of this abstract, we learned that an analogous approach has also been submitted to this workshop[7]. 2 Basic results from NMR
Quantum Computation
, 1996
"... Introduction Traditionally the Turing Machine has been accepted as the universal model of computation. That is to say if a computation can be performed by any deterministic single processor computing machine, then it can be performed by a turing machine with at most a polynomial increase in runni ..."
Abstract
 Add to MetaCart
Introduction Traditionally the Turing Machine has been accepted as the universal model of computation. That is to say if a computation can be performed by any deterministic single processor computing machine, then it can be performed by a turing machine with at most a polynomial increase in running time. It has been suggested that traditional Turing Machines cannot efficiently simulate quantum mechanical effects. This raises the question of whether computing machines which utilize quantum mechanical effects are more powerful than the traditional (classical) model? In 1992, Deutsch and Jozsa [DJ] presented a problem which could be solved, without error, on a quantum computer exponentially faster than on a classical deterministic machine. However, this problem could be solved efficiently by a classical probabilistic Turing Machine with a small probability of error. In 1993, Bernstein and Vazirani [BV] showed that there are problems which are superpolynomially faster on