Concurrent non-malleable commitments

Rafael Pass*, Alon Rosen

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

88 Scopus citations

Abstract

We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a man-in-the-middle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a receiver, cannot make the values he commits to depend on the values he receives commitments to. Our result is achieved without assuming an a-priori bound on the number of executions and without relying on any set-up assumptions. Our construction relies on the existence of standard collision resistant hash functions and only requires a constant number of communication rounds.

Original languageEnglish
Title of host publicationProceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Pages563-572
Number of pages10
DOIs
StatePublished - 2005
Externally publishedYes
Event46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005 - Pittsburgh, PA, United States
Duration: 23 Oct 200525 Oct 2005

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume2005
ISSN (Print)0272-5428

Conference

Conference46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
Country/TerritoryUnited States
CityPittsburgh, PA
Period23/10/0525/10/05

Fingerprint

Dive into the research topics of 'Concurrent non-malleable commitments'. Together they form a unique fingerprint.

Cite this