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

IEEE International Symposium on Information Theory (ISIT)

Optimal multibit commitment Information theoretical reductions to weak bit commitments

A Nascimento Anderson Clayton, Hideki Imai

Published Dec 4, 2001• 0 citations
OpenAlex

Related papers

On the Efficiency of Bit Commitment Reductions

Samuel Ranellucci, Alain Tapp, Severin Winkler +1 more

Lecture notes in computer science•Jan 1, 2011•11 citations

Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction

Junji Shikata, Daisuke Yamanaka

Lecture notes in computer science•Jan 1, 2011•3 citations

Game theoretic security of quantum bit commitment

Lu Qun Zhou, Xin Sun, Chunhua Su +2 more

Information Sciences•Mar 20, 2018•14 citations

Game-Theoretic Security for Bit Commitment

Haruna Higo, Keisuke Tanaka, Kenji Yasunaga

Lecture notes in computer science•Jan 1, 2013•7 citations

Cryptanalysis and improvement of “Game theoretic security of quantum bit commitment”

Hao Cao, Wenping Ma, Liangdong Lü +3 more

Information Sciences•Jul 13, 2020•2 citations

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions

Ivan Damgård, Joe Kilian, Louis Salvail

We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives.We introduce a general model for describing such primitives, called Weak Generic Transfer (WGT). This model includes as important special cases Weak Oblivious Transfer (WOT), where both the sender and receiver may learn too much about the other party's input, and a new, more realistic model of noisy channels, called unfair noisy channels. An unfair noisy channel has a known range of possible noise levels; protocols must work for any level within this range against adversaries who know the actual noise level. We give a precise characterization for when one can base OT on WOT. When the deviation of the WOT from the ideal is above a certain threshold, we show that no information-theoretic reductions from OT (even against passive adversaries) and BC exist; when the deviation is below this threshold, we give a reduction from OT (and hence BC) that is information-theoretically secure against active adversaries. For unfair noisy channels we show a similar threshold phenomenon for bit commitment. If the upper bound on the noise is above a threshold (given as function of the lower bound) then no information-theoretic reduction from OT (even against passive adversaries) or BC exist; when it is below this threshold we give a reduction from BC. As a partial result, we give a reduction from OT to UNC for smaller noise intervals.

BRICS Report Series•Jun 7, 1998•7 citations
We consider the problem of basing Oblivious Transfer (OT) and Bit Commitment (BC), with information theoretic security, on seemingly weaker primitives.We introduce a general model for describing such primitives, called Weak Generic Transfer (WGT). This model includes as important special cases Weak Oblivious Transfer (WOT), where both the sender and receiver may learn too much about the other party's input, and a new, more realistic model of noisy channels, called unfair noisy channels. An unfair noisy channel has a known range of possible noise levels; protocols must work for any level within this range against adversaries who know the actual noise level. We give a precise characterization for when one can base OT on WOT. When the deviation of the WOT from the ideal is above a certain threshold, we show that no information-theoretic reductions from OT (even against passive adversaries) and BC exist; when the deviation is below this threshold, we give a reduction from OT (and hence BC) that is information-theoretically secure against active adversaries. For unfair noisy channels we show a similar threshold phenomenon for bit commitment. If the upper bound on the noise is above a threshold (given as function of the lower bound) then no information-theoretic reduction from OT (even against passive adversaries) or BC exist; when it is below this threshold we give a reduction from BC. As a partial result, we give a reduction from OT to UNC for smaller noise intervals.