Provable Multiparty Delay Encryption
By Provable MDE
Description
Proof for exponent range check is being used in some important cryptographic primitives as a critical component. For example, multiparty delay encryption makes use of it as a way to prove a private key is well-constructed without revealing any information. Due to being able to describe an ordering statement within the context of field and groups, the most efficient way to achieve this is via general purpose proving machineries such as SNARKs. For this hackathon, we tried multiple different proving systems with unique approaches to efficiently implement an exponent range proof check. One of the most important application of our construction is can be used in a mempool privacy scheme for elimination of censorship and toxic MEV from Ethereum.
