Dorit Aharonov, Amnon Ta-Shma, et al.  Home/Search
Context Related
| berkeley.edu/~vazirani/coinflip.ps berkeley.edu/~vazirani/coinflip.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~vazirani/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Unconditionally secure bit commitment and coin flipping are known to be impossible in the classical world. Bit commitment is known to be impossible also in the quantum world. We introduce a related new primitive - quantum bit escrow. The difference from Bit commitment is that Bob can learn information about the depositted bit before revealing time, but not without the risk of being caught with certain probability. This is a unique feature of the quantum world. Rigorously proving the correctness ... (Update)
Context of citations to this paper: More
...2 and gave a protocol in which any dishonest player can achieve his desired outcome with probability at most 0.827. Aharonov et.al. [2] gave a protocol with the stronger security guarantee of De nition 1. In their protocol, no dishonest party can achieve one outcome with...
.... Although arbitrarily small error is known to be impossible, several works have focused on reducing the error as much as possible [LC96, MS99, ATVY00, Amb01] Yet another line of work has focused on how to achieve certain twoparty tasks using computional assumptions, i.e....
Cited by: More
Cryptographic Randomized Response Techniques - Andris Ambainis Markus (Correct)
Basing Cryptographic Protocols on Tamper-Evident Seals - Moran, Naor (2005) (Correct)
Multi-party Quantum Computation - Smith (2001) (Correct)
Similar documents (at the sentence level):
28.8%: Quantum Bit Escrow - Aharonov, Ta-Shma, Vazirani (Correct)
Similar documents based on text: More All
0.1: Efficient Checking of Polynomials and Proofs and the Hardness of.. - Sudan (1992) (Correct)
0.1: Verifiable Partial Escrow of Integer Factors - Mao (2000) (Correct)
0.1: A Mechanized Logic for Secure Key Escrow Protocol Verification - Schubert, Mocas (1995) (Correct)
Related documents from co-citation: More All
5: Quantum Computation and Quantum Information (context) - Nielsen, Huang - 2000
4: Unconditionally Secure Quantum Bit Commitment is Impossible (context) - Dominic - 1997
4: Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible (context) - Lo, Chau - 1998
BibTeX entry: (Update)
D. Aharonov, A. Ta-Shma, U. Vazirani, A. Yao. Quantum bit escrow. Proceedings of STOC'00, pp. 705-714. Also quant-ph/0004017. http://citeseer.ist.psu.edu/article/aharonov00quantum.html More
@inproceedings{ aharonov00quantum,
author = "Dorit Aharonov and Amnon Ta-Shma and Umesh V. Vazirani and Andrew C. Yao",
title = "Quantum bit escrow",
pages = "705--714",
year = "2000",
url = "citeseer.ist.psu.edu/article/aharonov00quantum.html" }
Citations (may not include all citations):Documents on the same site (http://www.cs.berkeley.edu/~vazirani/): More
"Go With the Winners" Algorithms - Aldous, Vazirani (1994) (Correct)
On the Power of Quantum Computation - Vazirani (1998) (Correct)
Strengths and Weaknesses of Quantum Computing - Bennett, Bernstein, Brassard, .. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC