Efficient and non-interactive non-malleable commitment

Giovanni Di Crescenzo; Jonathan Katz; Rafail Ostrovsky; Adam Smith

doi:10.1007/3-540-44987-6_4

Efficient and non-interactive non-malleable commitment

Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam Smith

School of Electrical Engineering and Computer Science

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

87 Scopus citations

Abstract

We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are noninteractive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.

Original language	English (US)
Title of host publication	Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings
Editors	Birgit Pfitzmann
Publisher	Springer Verlag
Pages	40-49
Number of pages	10
ISBN (Print)	3540420703
DOIs	https://doi.org/10.1007/3-540-44987-6_4
State	Published - 2001
Event	International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001 - Innsbruck, Austria Duration: May 6 2001 → May 10 2001

Publication series

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

Other

Other	International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001
Country/Territory	Austria
City	Innsbruck
Period	5/6/01 → 5/10/01

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-44987-6_4

Cite this

Di Crescenzo, G., Katz, J., Ostrovsky, R., & Smith, A. (2001). Efficient and non-interactive non-malleable commitment. In B. Pfitzmann (Ed.), Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings (pp. 40-49). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2045). Springer Verlag. https://doi.org/10.1007/3-540-44987-6_4

Di Crescenzo, Giovanni ; Katz, Jonathan ; Ostrovsky, Rafail et al. / Efficient and non-interactive non-malleable commitment. Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. editor / Birgit Pfitzmann. Springer Verlag, 2001. pp. 40-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{6d1bd74f3dd443a891a7e705b4967fd1,

title = "Efficient and non-interactive non-malleable commitment",

abstract = "We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are noninteractive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.",

author = "{Di Crescenzo}, Giovanni and Jonathan Katz and Rafail Ostrovsky and Adam Smith",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001 ; Conference date: 06-05-2001 Through 10-05-2001",

year = "2001",

doi = "10.1007/3-540-44987-6_4",

language = "English (US)",

isbn = "3540420703",

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

publisher = "Springer Verlag",

pages = "40--49",

editor = "Birgit Pfitzmann",

booktitle = "Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings",

address = "Germany",

}

Di Crescenzo, G, Katz, J, Ostrovsky, R & Smith, A 2001, Efficient and non-interactive non-malleable commitment. in B Pfitzmann (ed.), Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2045, Springer Verlag, pp. 40-49, International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001, Innsbruck, Austria, 5/6/01. https://doi.org/10.1007/3-540-44987-6_4

Efficient and non-interactive non-malleable commitment. / Di Crescenzo, Giovanni; Katz, Jonathan; Ostrovsky, Rafail et al.
Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. ed. / Birgit Pfitzmann. Springer Verlag, 2001. p. 40-49 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2045).

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

TY - GEN

T1 - Efficient and non-interactive non-malleable commitment

AU - Di Crescenzo, Giovanni

AU - Katz, Jonathan

AU - Ostrovsky, Rafail

AU - Smith, Adam

PY - 2001

Y1 - 2001

N2 - We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are noninteractive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.

AB - We present new constructions of non-malleable commitment schemes, in the public parameter model (where a trusted party makes parameters available to all parties), based on the discrete logarithm or RSA assumptions. The main features of our schemes are: they achieve near-optimal communication for arbitrarily-large messages and are noninteractive. Previous schemes either required (several rounds of) interaction or focused on achieving non-malleable commitment based on general assumptions and were thus efficient only when committing to a single bit. Although our main constructions are for the case of perfectly-hiding commitment, we also present a communication-efficient, non-interactive commitment scheme (based on general assumptions) that is perfectly binding.

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

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

U2 - 10.1007/3-540-44987-6_4

DO - 10.1007/3-540-44987-6_4

M3 - Conference contribution

AN - SCOPUS:84945133720

SN - 3540420703

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

SP - 40

EP - 49

BT - Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings

A2 - Pfitzmann, Birgit

PB - Springer Verlag

T2 - International Conference on the Theory and Application of Cryptographic Techniques, EUROCRYPT 2001

Y2 - 6 May 2001 through 10 May 2001

ER -

Di Crescenzo G, Katz J, Ostrovsky R, Smith A. Efficient and non-interactive non-malleable commitment. In Pfitzmann B, editor, Advances in Cryptology - EUROCRYPT 2001 - International Conference on the Theory and Application of Cryptographic Techniques, Proceedings. Springer Verlag. 2001. p. 40-49. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44987-6_4

Efficient and non-interactive non-malleable commitment

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this