Name
Abstract | ||
|---|---|---|
Commitment schemes are fundamental building blocks in cryptography, and have wide applications in constructing various protocols. Non-malleable commitment considers concurrent executions of a commitment scheme against a man-in-the-middle adversary. In this paper, we investigate non-malleability of statistically hiding commitment schemes, and present the first concurrent non-malleable statistically hiding commitment scheme. Our protocol admits black-box simulation, and relies on the robust (stand-alone) non-malleable commitment and specially designed witness indistinguishable proofs to achieve concurrent non-malleability. Based on the one-way function assumption, the commit phase of our protocol needs polynomial rounds, and the decommit phase needs super-logarithmic rounds. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ipl.2012.03.003 | Information Processing Letters |
Keywords | DocType | Volume |
set-up assumption,black-box simulation,concurrent non-malleability,concurrent non-malleable statistically hiding,modular construction,non-malleable commitment,plain model,black-box technique,various protocol,concurrent non-malleable zero-knowledge protocol,decommit phase,commitment scheme,concurrent execution,concurrent non-malleable,polynomial number,fundamental building block,man-in-the-middle adversary,statistical analysis,cryptographic protocols,man in the middle,one way function,probability,cryptography,protocols | Journal | 112 |
Issue | ISSN | Citations |
11 | 0020-0190 | 1 |
PageRank | References | Authors |
0.35 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Li | 1 | 19 | 16.31 |
| Qiuliang Xu | 2 | 157 | 42.71 |
| Hao Wang | 3 | 280 | 211.71 |