Abstract
We show the existence of concurrent non-malleable commitments based on the existence of one-way functions. Our proof of security only requires the use of black-box techniques, and additionally provides an arguably simplified proof of the existence of even stand-alone secure non-malleable commitments. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lin, H., Pass, R., & Venkitasubramaniam, M. (2008). Concurrent non-malleable commitments from any one-way function. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4948 LNCS, pp. 571–588). Springer Verlag. https://doi.org/10.1007/978-3-540-78524-8_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
