[Resource Topic] 2000/043: Constructions and Bounds for Unconditionally Secure Commitment Schemes

Welcome to the resource topic for 2000/043

Constructions and Bounds for Unconditionally Secure Commitment Schemes

Authors: C. Blundo, B. Masucci, D. R. Stinson, R. Wei


Commitment schemes have been extensively studied since they
were introduced by Blum in 1982. Rivest recently
showed how to construct unconditionally secure commitment schemes,
assuming the existence of a trusted initializer. In this paper, we present a
formal mathematical model for such schemes, and analyze their
binding and concealing properties. In particular, we
show that such schemes cannot be perfectly concealing: there is necessarily
a small probability that Alice can cheat Bob by committing to one value
but later revealing a different value. We prove several
bounds on Alice’s cheating probability, and present constructions
of schemes that achieve optimal cheating probabilities. We also
show a close link between commitment schemes and the classical
``affine resolvable designs’'.

ePrint: https://eprint.iacr.org/2000/043

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .