Name
Title | ||
|---|---|---|
Constant-Round concurrent non-malleable statistically binding commitments and decommitments |
Abstract | ||
|---|---|---|
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 Ostrovsky, Persiano and Visconti (TCC’ 09). They constructed a constant-round commitment scheme that is concurrent non-malleable with respect to both commitment and decommitment. However, the scheme is only computationally binding. For application scenarios where the security of receivers is of a great concern, computational binding may not suffice. In this work, we follow the line of their work and give a construction of statistically binding commitment scheme which is concurrent non-malleable with respect to both commitment and decommitment. Our work can be seen as a complement of the work of Ostrovsky et al. in the plain model. Our construction relies on the existence of a family of pairs of claw-free permutations and only needs a constant number of communication rounds in the plain model. Our proof of security uses non-black-box techniques and satisfies the (most powerful) simulation-based definitions of non-malleability. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-13013-7_12 | Public Key Cryptography |
Keywords | Field | DocType |
constant-round commitment scheme,communication round,concurrent man-in-the-middle adversary,constant number,constant-round concurrent non-malleable,commitment scheme,claw-free permutation,concurrent non-malleable,plain model,application scenario,binding commitment scheme,man in the middle,satisfiability | Computer science,Permutation,Commitment scheme,Theoretical computer science,Adversary,Malleability,The Internet | Conference |
Volume | ISSN | ISBN |
6056 | 0302-9743 | 3-642-13012-7 |
Citations | PageRank | References |
5 | 0.40 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhenfu Cao | 1 | 2650 | 177.89 |
| Ivan Visconti | 2 | 612 | 40.30 |
| Zongyang Zhang | 3 | 59 | 8.79 |