Tree-BTE lays the groundwork for post-quantum encrypted mempools
Check out Tree-BTE 🌳, our new tree-based approach to designing batched threshold encryption (BTE), the cryptographic tool for encrypted mempools.
Tree-BTE can be instantiated with different cryptographic hardness assumptions to yield different properties. For example, with a lattice-based hardness assumption, we get a post-quantum secure BTE scheme with >100x faster decryption than prior lattice-based schemes.
Instantiations based on other assumptions (such as DDH, DCR, LWR) are also possible. Check out our paper on eprint.