Show simple item record

dc.contributor.authorLin, Huijia
dc.contributor.authorPass, Rafael
dc.date.accessioned2010-09-03T04:37:40Z
dc.date.available2010-09-03T04:37:40Z
dc.date.issued2010-09-03T04:37:40Z
dc.identifier.urihttps://hdl.handle.net/1813/17360
dc.description.abstractWe show \emph{unconditionally} that the existence of commitment schemes implies the existence of \emph{constant-round} non-malleable commitments; earlier protocol required additional assumptions such as collision resistant hashfunctions or subexponential one-way functions. Our protocol also satisfies the stronger notions of concurrent non-malleability and robustness. As a corollary, we establish that constant-round secure multi-party computation can be based on only enhanced trapdoor permutations; also here, earlier protocols additionally required either collision-resistant hash functions or subexponential one-way functions.en_US
dc.language.isoen_USen_US
dc.subjectnon-malleabilityen_US
dc.subjectcommitmenten_US
dc.subjectconstant-rounden_US
dc.titleSettling the Round-Complexity of Non-Malleable Commitmentsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics