Efficient ID-based non-malleable trapdoor commitment

doi:10.1016/j.compeleceng.2012.06.013

Efficient ID-based non-malleable trapdoor commitment

2012-11-01

1

PRE

AI

DOI：10.1016/j.compeleceng.2012.06.013

Original

Original request for help

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

Efficient ID-based non-malleable trapdoor commitment

Abstract

Journal

Organization