Paper 2009/527
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
Seiko Arita
Abstract
It is known that composable secure commitments, that is, concurrent non-malleable commitments exist in the plain model, based only on standard assumptions such as the existence of claw-free permutations or even one-way functions. Since being based on the plain model, the deniability of them is trivially satisfied, and especially the latter scheme satisfies also adaptivity, hence it is adaptive-deniable-concurrent non-malleable. However, those schemes cannot be said to be practically efficient. We show a practically efficient (string) adaptive-deniable-concurrent commitment scheme is possible under a global setup model, called global CRS-KR model.
Note: Some typos are corrected.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- cryptographic protocols
- Contact author(s)
- arita @ iisec ac jp
- History
- 2010-03-09: last of 2 revisions
- 2009-11-02: received
- See all versions
- Short URL
- https://ia.cr/2009/527
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/527,
author = {Seiko Arita},
title = {An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme},
howpublished = {Cryptology {ePrint} Archive, Paper 2009/527},
year = {2009},
url = {https://eprint.iacr.org/2009/527}
}
