Advertisement

Journal of Cryptology

, Volume 12, Issue 2, pp 77–89 | Cite as

Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver

  • Shai Halevi
Article

Abstract.

In this paper we address the problem of constructing commitment schemes where the sender is bounded to polynomial time and the receiver may be all powerful. Many known constructions for such commitment schemes are based on the hardness of factoring large integers. However, these schemes typically use integers of a special form and thus require a rather expensive initialization procedure for establishing these special-form integers. In this paper we present a scheme which is based on the hardness of factoring large integers but avoids the need of a complex initialization procedure.

Key words. Blum integers, Commitment schemes, Factoring, Permutation pairs. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Criptologic Research 1999

Authors and Affiliations

  • Shai Halevi
    • 1
  1. 1.Laboratory for Computer Science, Massachusetts Institute of TechnologyCambridgeU.S.A

Personalised recommendations