Abstract
The notion of commitment is one of the most important primitives in cryptography. To meet various needs, there have been many kinds of commitment schemes among which non-malleable commitment scheme and selective decommitment scheme are important and in general use. And, the increasing security demands suggest a closer look at the relationship between the two schemes. For the convenience of our proof, a new definition for selective decommitment scheme is proposed, which is named as modified selective decommitment scheme. The security relation is deduced that a non-malleable commitment scheme implies a modified selective decommitment scheme, but the reverse is not true.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dolev D, Dwork C, Naor M. Non-malleable cryptography. SIAM J. Computing, 2000, 30: 392–437.
Di Crescenzo G, Ishai Y, Ostrovsky R. Non-interactive and non-malleable commitment. In Proc. STOC’98, Dallas, May 23–26, 1998, pp.140–151.
Dwork C, Naor M, Reingold O et al. Magic functions. In 40th Annual Symposium on Foundations of Computer Science, New York City, October 17–19, 1999, pp.523–534.
Canetti R, Fischlin M. Universally composable commitments. In Proc. Crypto’01, California, USA, August 19–23, 2001, LNCS 2139, pp.19–40.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China under Grant No. 90304013.
Rights and permissions
About this article
Cite this article
Xu, HX., Li, B. Relationship Between a Non-Malleable Commitment Scheme and a Modified Selective Decommitment Scheme. J Comput Sci Technol 22, 75–78 (2007). https://doi.org/10.1007/s11390-007-9009-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11390-007-9009-7