• Please send your full manuscript to: jocm@vip.163.com

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

Chunhui Wu 1, Qin Li 2, and Dongyang Long 3
1. Department of Computer Science, Guangdong University of Finance, Guangzhou 510521, P.R.China
2. College of Information Engineering, Xiangtan University, Xiangtan 411105, P.R.China
3. Department of Computer Science, Sun Yat-sen University, Guangzhou 510275, P.R.China
Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We 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 our proposed schemes satisfy all the desired security properties.
 
Index Terms—Trapdoor commitment, ID-based, non-malleable

Cite: Chunhui Wu, Qin Li, and Dongyang Long, "Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring," Journal of Communications, vol. 10, no. 5, pp. 330-338, 2015. Doi: 10.12720/jcm.10.5.330-338
Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com