.png){kind=icon}
Return
Efficient ID-based non-malleable trapdoor commitment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2012.06.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Non-malleability is an important property in commitment schemes, which can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability of ID-based trapdoor commitment. We first point out some weakness of the definition for Fischlin's ID-based trapdoor commitments, which we call the partial ID-based trapdoor commitments. Moreover, we present the formal definition for the full ID-based trapdoor commitment and give a concrete construction based on the computational Diffie-Hellman (CDH) assumption. Finally, we use the idea of multi-trapdoor commitments and the technique of non-malleability to propose two efficient interactive full ID-based non-malleable trapdoor commitments in discrete logarithm (DL) system, with/without random oracle respectively. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
ZERO-KNOWLEDGE
CHAMELEON HASH
KEY
SIGNATURES
PROOFS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSave
no more