By Topic

Optimal multi-bit commitment reductions to weak bit commitments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nascimento, A.C.A. ; Imai Lab., Univ. of Tokyo, Japan ; Mueller-Quade, J. ; Imai, H.

Bit commitments are very fundamental protocols in modern cryptography. In this paper, we introduce a model to study bit commitment schemes with a probability of failure (we call them, weak bit commitments). We characterize when it is possible to reduce bit commitments to weak bit commitments. We introduce a new concept in cryptographic reductions called the rate. We prove that our reductions are optimal regarding the rate. Additionally, we show that, when written in the appropriate way, several reductions among cryptographic primitives are equivalent to well known problems in Shannon theory.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: