Bit-commitment based on public-key encryption

  • Thread starter Dragonfall
  • Start date
  • Tags
    Encryption
In summary, "bit-commitment based on public-key encryption" is a cryptographic protocol where a party commits to a value without revealing it until a later point, achieved through public-key encryption. It involves two steps: commitment and unveiling. This method has advantages such as secure communication and non-repudiation, but also relies on the security of the underlying encryption scheme and the cooperation of the committing party. It differs from other bit-commitment protocols by using public-key encryption, making it more secure and flexible.
  • #1
Dragonfall
1,030
4
Can any public-key cryptosystem be turned into a bit-commitment scheme? For example, if I encrypt a bit using my public key and send it to Bob, how can I cheat?
 
Technology news on Phys.org
  • #2
Also, from Wikipedia:

A commitment scheme can either be perfectly binding (it is impossible for Alice to alter her commitment after she has made it, even if she has unbounded computational resources) or perfectly concealing (it is impossible for Bob to find out the commitment without Alice revealing it, even if he has unbounded computational resources) but not both.

Why not?
 
  • #3


I can provide a response to this content by explaining the concept of bit-commitment and public-key encryption. Bit-commitment is a cryptographic protocol that allows a sender to commit to a chosen bit (0 or 1) without revealing the actual value to the receiver. Public-key encryption, on the other hand, is a type of encryption where a pair of keys (public and private) is used to encrypt and decrypt data.

In theory, it is possible to use any public-key cryptosystem to create a bit-commitment scheme. However, the security of such a scheme would depend on the specific properties and vulnerabilities of the chosen cryptosystem. In the example given, if a bit is encrypted using the sender's public key and sent to Bob, the sender can cheat by simply changing the bit before encrypting it with their private key. This would result in Bob receiving a different bit than the one originally committed to.

To prevent cheating in a bit-commitment scheme based on public-key encryption, additional measures would need to be implemented. For example, the use of zero-knowledge proofs or commitment schemes based on cryptographic hash functions can enhance the security of the protocol. It is important to carefully consider the security properties of the chosen public-key cryptosystem and to implement appropriate measures to prevent cheating.
 

1. What is "bit-commitment based on public-key encryption"?

"Bit-commitment" refers to a cryptographic protocol where a party commits to a certain value (usually a bit, meaning either 0 or 1) without revealing the actual value until a later point. This is achieved using public-key encryption, where the committing party encrypts the value using the receiver's public key. The receiver cannot decrypt the value until the committing party reveals the corresponding private key.

2. How does "bit-commitment based on public-key encryption" work?

The protocol typically involves two steps: commitment and unveiling. In the commitment step, the committing party encrypts the desired value using the receiver's public key, creating a ciphertext. In the unveiling step, the committing party reveals the corresponding private key, allowing the receiver to decrypt the ciphertext and obtain the committed value. This ensures that the committing party cannot change the value after it has been committed.

3. What are the advantages of using "bit-commitment based on public-key encryption"?

One advantage is that it allows for secure communication over an insecure channel, as the committed value cannot be tampered with or changed by the committing party. It also allows for non-repudiation, meaning the committing party cannot deny committing to a certain value. Additionally, it can be used in various applications such as secure voting, electronic lotteries, and secure auctions.

4. Are there any limitations or vulnerabilities of "bit-commitment based on public-key encryption"?

One limitation is that it relies on the security of the underlying public-key encryption scheme. If the encryption scheme is broken, the committed value can be decrypted and potentially changed by an attacker. Additionally, if the committing party does not reveal the private key, the receiver will not be able to obtain the committed value.

5. How is "bit-commitment based on public-key encryption" different from other types of bit-commitment protocols?

"Bit-commitment based on public-key encryption" differs from other protocols in that it uses public-key encryption to achieve commitment, rather than other cryptographic primitives such as hash functions or symmetric encryption. This makes it more secure against certain attacks, such as a malicious receiver trying to guess the committed value. It also allows for more flexibility in the unveiling step, as the committed value can be revealed using the corresponding private key at any time.

Similar threads

  • Programming and Computer Science
Replies
14
Views
1K
  • Programming and Computer Science
Replies
1
Views
500
  • Programming and Computer Science
Replies
8
Views
2K
  • Programming and Computer Science
Replies
3
Views
962
  • Computing and Technology
Replies
8
Views
1K
  • Programming and Computer Science
Replies
13
Views
4K
  • Programming and Computer Science
Replies
9
Views
1K
  • Programming and Computer Science
Replies
1
Views
832
  • Programming and Computer Science
Replies
14
Views
2K
  • Computing and Technology
Replies
27
Views
1K
Back
Top