Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments

When commitment schemes are used in complex environments, e.g., the internet, the issue of malleability appears, i.e., a concurrent man-in-the-middle adversary might generate commitments to values related to ones committed to by honest players. In the plain model, the current best solution towards resolving this problem in a constant number of rounds is the work of the researchers (TCC' 09). They constructed a constant-round commitment scheme that is concurrent non-malleable with respect to both commitment and de-commitment.

Provided by: University of Salamanca Topic: Security Date Added: Mar 2010 Format: PDF

Find By Topic