Public-key cryptosystems can theoretically be adapted into bit-commitment schemes, but there are inherent limitations. A commitment scheme must balance two properties: binding and concealing. Perfectly binding schemes ensure that once a commitment is made, it cannot be altered, while perfectly concealing schemes prevent the recipient from deducing the commitment until it is revealed. However, achieving both properties simultaneously is impossible due to the nature of cryptographic functions. If a scheme is perfectly binding, it may allow the recipient to eventually uncover the commitment, and if it is perfectly concealing, the committer may retain the ability to alter the commitment. This fundamental trade-off highlights the challenges in creating a secure bit-commitment scheme using public-key cryptography.
