Efficient String-Commitment from Weak Bit-Commitment

We study security amplification for weak bit-commitment schemes and improve the efficiency of (black-box) transformations in both the information-theoretic and computational settings. Let Com0 be a (weak) bit-commitment scheme that is p-hiding in the sense that no cheating receiver can guess the committed bit correctly with probability better than (1 + p)/2, and qbinding in the sense that no cheating sender can open in two ways with probability better than

• Type: Journal
• Year: 2010
• Where: ASIACRYPT
• Authors: Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang
• Keywords: ASIACRYPT 2010, Bit-commitment Scheme, Computational Settings, Cryptology, Weak Bit-commitment Schemes