Annual International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2005: Advances in Cryptology – EUROCRYPT 2005 pp 422-439

Mercurial Commitments with Applications to Zero-Knowledge Sets

Extended Abstract
  • Melissa Chase
  • Alexander Healy
  • Anna Lysyanskaya
  • Tal Malkin
  • Leonid Reyzin
Conference paper

DOI: 10.1007/11426639_25

Volume 3494 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

We introduce a new flavor of commitment schemes, which we call mercurial commitments. Informally, mercurial commitments are standard commitments that have been extended to allow for soft decommitment. Soft decommitments, on the one hand, are not binding but, on the other hand, cannot be in conflict with true decommitments.

We then demonstrate that a particular instantiation of mercurial commitments has been implicitly used by Micali, Rabin and Kilian to construct zero-knowledge sets. (A zero-knowledge set scheme allows a Prover to (1) commit to a set S in a way that reveals nothing about S and (2) prove to a Verifier, in zero-knowledge, statements of the form xS and xS.) The rather complicated construction of Micali et al. becomes easy to understand when viewed as a more general construction with mercurial commitments as an underlying building block.

By providing mercurial commitments based on various assumptions, we obtain several different new zero-knowledge set constructions.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Melissa Chase
    • 1
  • Alexander Healy
    • 2
  • Anna Lysyanskaya
    • 1
  • Tal Malkin
    • 3
  • Leonid Reyzin
    • 4
  1. 1.Brown University 
  2. 2.Harvard University 
  3. 3.Columbia University 
  4. 4.Boston University