Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fully parallelized multi-prover protocols for NEXP-time
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
How to Convert the Flavor of a Quantum Bit Commitment
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Consequences and Limits of Nonlocal Strategies
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels
Journal of Cryptology
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Using Entanglement in Quantum Multi-prover Interactive Proofs
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Quantum Multi Prover Interactive Proofs with Communicating Provers
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Perfectly concealing quantum bit commitment from any quantum one-way permutation
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Feasibility and completeness of cryptographic tasks in the quantum world
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.00 |
We revisit the Two-Prover Bit Commitment Scheme of BenOr, Goldwasser, Kilian and Wigderson [BGKW88]. First, we introduce Two-Prover Bit Commitment Schemes similar to theirs and demonstrate that although they are classically secure using their proof technique, we also show that if the provers are allowed to share quantum entanglement, they are able to successfully break the binding condition. Secondly, we translate this result in a purely classical setting and investigate the possibility of using this Bit Commitment scheme in applications. We observe that the security claim of [BGKW88] based on the assumption that the provers cannot communicate is not a sufficient criteria to obtain soundness. We develop a set of conditions, called isolation, that must be satisfied by any third party interacting with the provers to guarantee the binding property of the Bit Commitment.