Mutually independent commitments

Moses Liskov; Anna Lysyanskaya; Silvio Micali; Leonid Reyzin; Adam Smith

doi:10.1007/3-540-45682-1_23

Mutually independent commitments

Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Adam Smith

School of Electrical Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Scopus citations

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.

Original language	English (US)
Title of host publication	Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Editors	Colin Boyd
Publisher	Springer Verlag
Pages	385-401
Number of pages	17
ISBN (Print)	3540429875, 9783540429876
DOIs	https://doi.org/10.1007/3-540-45682-1_23
State	Published - 2001
Event	7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001 - Gold Coast, Australia Duration: Dec 9 2001 → Dec 13 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2248
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001
Country/Territory	Australia
City	Gold Coast
Period	12/9/01 → 12/13/01

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45682-1_23

Cite this

Liskov, M., Lysyanskaya, A., Micali, S., Reyzin, L., & Smith, A. (2001). Mutually independent commitments. In C. Boyd (Ed.), Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 385-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2248). Springer Verlag. https://doi.org/10.1007/3-540-45682-1_23

Liskov, Moses ; Lysyanskaya, Anna ; Micali, Silvio et al. / Mutually independent commitments. Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. editor / Colin Boyd. Springer Verlag, 2001. pp. 385-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{51055b22a3d74f3898a1ba8266b6095c,

title = "Mutually independent commitments",

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.",

author = "Moses Liskov and Anna Lysyanskaya and Silvio Micali and Leonid Reyzin and Adam Smith",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001 ; Conference date: 09-12-2001 Through 13-12-2001",

year = "2001",

doi = "10.1007/3-540-45682-1_23",

language = "English (US)",

isbn = "3540429875",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "385--401",

editor = "Colin Boyd",

booktitle = "Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings",

address = "Germany",

}

Liskov, M, Lysyanskaya, A, Micali, S, Reyzin, L & Smith, A 2001, Mutually independent commitments. in C Boyd (ed.), Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2248, Springer Verlag, pp. 385-401, 7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001, Gold Coast, Australia, 12/9/01. https://doi.org/10.1007/3-540-45682-1_23

Mutually independent commitments. / Liskov, Moses; Lysyanskaya, Anna; Micali, Silvio et al.
Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. ed. / Colin Boyd. Springer Verlag, 2001. p. 385-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2248).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Mutually independent commitments

AU - Liskov, Moses

AU - Lysyanskaya, Anna

AU - Micali, Silvio

AU - Reyzin, Leonid

AU - Smith, Adam

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745918093&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745918093&partnerID=8YFLogxK

U2 - 10.1007/3-540-45682-1_23

DO - 10.1007/3-540-45682-1_23

M3 - Conference contribution

AN - SCOPUS:33745918093

SN - 3540429875

SN - 9783540429876

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 385

EP - 401

BT - Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings

A2 - Boyd, Colin

PB - Springer Verlag

T2 - 7th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2001

Y2 - 9 December 2001 through 13 December 2001

ER -

Liskov M, Lysyanskaya A, Micali S, Reyzin L, Smith A. Mutually independent commitments. In Boyd C, editor, Advances in Cryptology - ASIACRYPT 2001 - 7th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings. Springer Verlag. 2001. p. 385-401. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45682-1_23

Mutually independent commitments

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this