Concurrent non-malleable commitments from any one-way function

Huijia Lin*, Rafael Pass, Muthuramakrishnan Venkitasubramaniam

*Corresponding author for this work

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

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.

Original languageEnglish
Title of host publicationTheory of Cryptography - Fifth Theory of Cryptography Conference, TCC 2008, Proceedings
Pages571-588
Number of pages18
DOIs
StatePublished - 2008
Externally publishedYes
Event5th Theory of Cryptography Conference, TCC 2008 - New York, United States
Duration: 19 Mar 200821 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4948 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Theory of Cryptography Conference, TCC 2008
Country/TerritoryUnited States
CityNew York
Period19/03/0821/03/08

Fingerprint

Dive into the research topics of 'Concurrent non-malleable commitments from any one-way function'. Together they form a unique fingerprint.

Cite this