Abstract
Blockchain-based bidding systems are becoming increasingly popular nowadays. Due to the properties of blockchain, bidding records are unchangeable. With existing encryption techniques, these bidding records can only be shared by the bidder and the seller. Although this scenario sounds secure, it does not consider a coercion case. A powerful coercer may force the bidding system to open the records stored on the blockchain, and the system loses privacy. To solve this problem, in this paper, we introduce a new encryption scheme called deniable matchmaking encryption (DME). This new encryption scheme provides deniability not only for the message, but also for the identities. We use the chameleon hash function to make fake message and fake identities indistinguishable from the real message and the real identities. Therefore, the bidding system can use fake information to answer the coercer, and user privacy is kept by the blockchain-based bidding system.
Highlights
Blockchain has become highly popular, especially in commerce, and it has influenced the growth and usefulness of many commercial applications
In this paper, we propose an encryption scheme called deniable matchmaking encryption (DME)
In this paper, we proposed a new encryption called DME to solve the coercion problem on blockchain-based bidding systems
Summary
Blockchain has become highly popular, especially in commerce, and it has influenced the growth and usefulness of many commercial applications. To protect the sender’s identity and the secrets in the message, deniable encryption is used to generate convincing proof to mislead others that the ciphertext is encrypted from a different source. In 2011, O’Neill et al [20] constructed bi-translucent sets based on lattice groups and created a bi-deniable encryption scheme so that both the sender and the receiver can generate fake proofs simultaneously. Note that in the ME scheme, the receiver must know the sender’s identity or the receiver cannot open the ciphertext This encryption system is suitable for the case in which both the sender and the receiver know the event of secret transmission, similar to the seller and the bidder in the bidding system. In this paper, we enhance the matchmaking encryption scheme by providing identity deniability against coercion attacks
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
