Abstract
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they do not guarantee independence of the committed values. We present three increasingly strong definitions of independence in this setting and give practical protocols for each. Our work is related to work in non-malleable cryptography. However, the two-party commitment problem can be solved much more efficiently than by using non-malleability techniques.
Cite
CITATION STYLE
Liskov, M., Lysyanskaya, A., Micali, S., Reyzin, L., & Smith, A. (2001). Mutually independent commitments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2248, pp. 385–401). Springer Verlag. https://doi.org/10.1007/3-540-45682-1_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
