TDP over bit strings ⇒ UC commitment in the CRS model (Canetti–Fischlin)
Statement
If trapdoor permutations over bit strings exist, then in the common reference string model there is a protocol that UC-realizes the bit-commitment functionality (UC commitment), each commitment using its own reference string — CF01. The commit phase and the opening are each a single message from the committer to the receiver — CF01.
Sketch
The reference string holds keys of trapdoor permutations of and a uniform string ; the commitment to is for and for , where is a Blum–Micali–Yao generator built from and is a uniform seed, and the opening is . Binding is statistical, since lies in the at most -element set with probability at most . The simulator sets , so it can open to either bit, and keeps the trapdoor of , with which it extracts from a corrupted committer’s by testing whether lies in the image of ; the simulated reference string is indistinguishable from a real one by the pseudorandomness of , whose trapdoor the simulator does not use — CF01.
Notes
- Without setup no terminating protocol between the committer and the receiver alone UC-realizes (no UC commitment from authenticated channels) — CF01.
- To realize the multi-commitment functionality with one reference string for all commitments, CF01 assume a claw-free pair of trapdoor permutations and a CCA2-secure PKE (claw-free TDP + CCA2 PKE ⇒ UC multi-commitment) — CF01.