|
| related topics |
| {key, protocol, security} |
| {alice, bob, state} |
| {states, state, optimal} |
| {error, code, errors} |
| {state, states, entangled} |
| {entanglement, phys, rev} |
| {information, entropy, channel} |
| {cos, sin, state} |
|
Dilemma that cannot be resolved by biased quantum coin flipping
Satoshi Ishizaka
abstract: We show that a biased quantum coin flip (QCF) cannot provide the performance
of a black-boxed biased coin flip, if it satisfies some fidelity conditions.
Although such a QCF satisfies the security conditions of a biased coin flip, it
does not realize the ideal functionality, and therefore, does not fulfill the
demands for universally composable security. Moreover, through a comparison
within a small restricted bias range, we show that an arbitrary QCF is
distinguishable from a black-boxed coin flip unless it is unbiased on both
sides of parties against insensitive cheating. We also point out the difficulty
in developing cheat-sensitive quantum bit commitment in terms of the
uncomposability of a QCF.
- oai_identifier:
- oai:arXiv.org:quant-ph/0703099
- categories:
- quant-ph
- comments:
- 5 pages and 1 figure. Accepted version
- doi:
- 10.1103/PhysRevLett.100.070501
- arxiv_id:
- quant-ph/0703099
- journal_ref:
- Phys. Rev. Lett. 100, 070501 (2008)
- created:
- 2007-03-13
- updated:
- 2008-01-11
Full article ▸
|
|
| related documents |
| 0304035v1 |
| 0409099v2 |
| 0009006v5 |
| 0001046v1 |
| 0403036v5 |
| 0410017v2 |
| 0205060v3 |
| 0107130v1 |
| 0003101v2 |
| 9810021v1 |
| 0410215v2 |
| 9702002v1 |
| 9909030v2 |
| 0310168v2 |
| 0111073v2 |
| 0211153v5 |
| 0504150v2 |
| 0505108v1 |
| 0611145v1 |
| 0304141v3 |
| 0503192v4 |
| 0508002v2 |
| 0702155v3 |
| 0603234v1 |
| 0510029v1 |
|