Results 1 
6 of
6
Quantum Bit Commitment and Coin Tossing Protocols
 in Advances in Cryptology: Proceedings of Crypto '90, Lecture Notes in Computer Science
, 1991
"... this paper does not yield to this attack. Unfortunately, we can still describe a possible attack on this new scheme, which is based on an unverified belief about quantum mechanics (unlike EPR, which has been verified experimentally). Can one build such a scheme, unbreakable in an absolute way, bas ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
this paper does not yield to this attack. Unfortunately, we can still describe a possible attack on this new scheme, which is based on an unverified belief about quantum mechanics (unlike EPR, which has been verified experimentally). Can one build such a scheme, unbreakable in an absolute way, based solely on the equations of quantum mechanics? We cannot answer this question at this time. Still we have been able to build a cointossing protocol that is secure unless both attacks can be implemented. This seems to indicate that maybe Bit Commitment is more than CoinTossing since, at this time, we are unable to offer a Bit Commitment scheme with this same level of security. 7 Acknowledgements
Oblivious Transfers and Privacy Amplification
, 1997
"... Assume A owns two secret kbit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other string. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement Oneoutoftwo ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
Assume A owns two secret kbit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other string. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement Oneoutoftwo String Oblivious Transfer, denoted ( 2 1 )OT k . This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k = 1 of two onebit secrets: this is known as Oneoutoftwo Bit Oblivious Transfer, denoted ( 2 1 )OT. We address the question of reducing ( 2 1 )OT k to ( 2 1 )OT. This question is not new: it was introduced in 1986. However, most solutions until now have implicitly or explicitly depended on the notion of selfintersecting codes. It can be proved that this restriction makes it asymptotically impossible to implement ( 2 1 )OT k with fewer than about 3:5277 k instances of ( 2 1 )OT. The cur...
Quantum Information Processing: The good, the Bad and the Ugly
 ADVANCES IN CRYPTOLOGY  CRYPTO '97, VOLUME 1294 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1997
"... Quantum mechanics has the potential to play a major role in the future of cryptology. On the one hand, it could bring to its knees most of the current trends in contemporary cryptography. On the other hand, it offers an alternative for the protection of privacy whose security cannot be matched b ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Quantum mechanics has the potential to play a major role in the future of cryptology. On the one hand, it could bring to its knees most of the current trends in contemporary cryptography. On the other hand, it offers an alternative for the protection of privacy whose security cannot be matched by classical means.
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
Converting the Flavor of a Quantum Bit
"... The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme require ..."
Abstract
 Add to MetaCart
The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires ) executions of the statistically binding scheme. As a consequence of the reduction, statistically concealing but computationally binding quantum bit commitments can be based upon any family of quantum oneway functions. Such a construction is not known to exist in the classical world.