Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
