Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Bit Commitment from Correlated Randomness

Himanshu Tyagi, Shun Watanabe

Published Mar 23, 2023• 0 citations
Publisher
DOI
10.1017/9781108670203.015

Related papers

Bit Commitment Using Pseudo-Randomness

Moni Naor

Springer eBooks•Nov 9, 2007•208 citations

Bit commitment using pseudo-randomness (extended abstract)

Moni Naor

International Cryptology Conference•Jul 1, 1989•25 citations

Bit commitment using pseudo-random synthesizer

Dong Zheng, Shengli Liu, Yumin Wang

Journal of Electronics (China)•Oct 1, 1999•0 citations

Bit commitment from weak non-locality

Stefan Wolf, Jürg Wullschleger

So-called non-local boxes, which have been introduced as an idealizationndifferent respects - of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system

IEEE Information Theory Workshop (ITW)•Dec 10, 2005•3 citations

Bit Commitment from Weak Non-Locality

Stefan Wolf, Juerg Wullschleger

So-called non-local boxes, which have been introduced as an idealization-in different respects-of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system.

arXiv:quant-ph/0508233•Aug 31, 2005•1 citation

Bit commitment using pseudorandomness

Moni Naor

Journal of Cryptology•Jan 1, 1991•815 citations
So-called non-local boxes, which have been introduced as an idealizationndifferent respects - of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system
So-called non-local boxes, which have been introduced as an idealization-in different respects-of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system.