Results 1 
5 of
5
A quantum GoldreichLevin theorem with cryptographic applications
 In Proc. of STACS ’02, LNCS 2285
, 2002
"... We investigate the GoldreichLevin Theorem in the context of quantum information. This result is a reduction from the computational problem of inverting a oneway function to the problem of predicting a particular bit associated with that function. We show that the quantum version of the reduction—b ..."
Abstract

Cited by 33 (2 self)
 Add to MetaCart
We investigate the GoldreichLevin Theorem in the context of quantum information. This result is a reduction from the computational problem of inverting a oneway function to the problem of predicting a particular bit associated with that function. We show that the quantum version of the reduction—between quantum oneway functions and quantum hardpredicates—is quantitatively more efficient than the known classical version. Roughly speaking, if the oneway function acts on nbit strings then the overhead in the reduction is by a factor of O(n/ε2) in the classical case but only by a factor of O(1/ε) in the quantum case, where 1 2 +ε is the probability of predicting the hardpredicate. Moreover, we prove via a lower bound that, in a blackbox framework, the classical version of the reduction cannot have overhead less than Ω(n/ε2). We also show that, using this reduction, a quantum bit commitment scheme that is perfectly binding and computationally concealing can be obtained from any quantum oneway permutation. This complements a recent result by Dumais, Mayers and Salvail, where the bit commitment scheme is perfectly concealing and computationally binding. We also show how to perform qubit commitment by a similar approach. 1
The Trouble With Quantum Bit Commitment
 Computing Research Repository (CoRR
, 1996
"... In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Crépeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common to all ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Crépeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common to all proposals of a certain kind, but the BCJL protocol does not fall in this
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 time ..."
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
U.K.
"... It had been widely claimed that quantum mechanics can protect private information during public decision in for example the socalled twoparty se cure computation. If this were the case, quantum smartcards could prevent fake teller machines from learning the PIN (Personal Identification Number) fr ..."
Abstract
 Add to MetaCart
It had been widely claimed that quantum mechanics can protect private information during public decision in for example the socalled twoparty se cure computation. If this were the case, quantum smartcards could prevent fake teller machines from learning the PIN (Personal Identification Number) from the customers ' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the socalled quantum bit commitment, the security of quantum twoparty computation itself remains unaddressed. Here we answer this question directly by showing that all one