Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring

Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle attacks within the interaction. In this article, the authors have focus on the non-malleability in ID-based trapdoor commitments. They first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively, and then extend them to non-malleable schemes. The formal proofs show that the proposed schemes satisfy all the desired security properties.