Weighted Batched Threshold Encryption With Applications to Mempool Privacy
Amit Agarwal, Kushal Babel, Sourav Das, Babak Poorebrahim Gilkalaye, Arup Mondal, Benny Pinkas, Peter Rindal, Aayush Yadav
Abstract
A Batched Threshold Encryption (BTE) scheme enables a committee of servers to perform lightweight (in terms of communication and computation) threshold decryption of an arbitrary batch of ciphertexts from a larger pool, while ensuring the privacy of ciphertexts that are outside the batch. Such a primitive has a direct application in designing encrypted mempools for MEV protection in modern blockchains. Bormet et al. (USENIX 2025) recently proposed a BTE scheme called “BEAT-MEV” which is concretely efficient for small to moderate batch sizes. In this work, we improve and extend the BEAT-MEV scheme in multiple ways. First, we improve the computational cost from quadratic to quasilinear in the batch size thus making it practical for large batch sizes. This improvement is achieved by substituting the key-homomorphic punctured PRF used in BEAT-MEV with an FFT-friendly alternative. Second, we extend the ideas in their scheme to the weighted setting, where each server in the committee has an associated 'weight' value (e.g. stake weight of validators in PoS blockchains), while crucially ensuring that the communication cost remains independent of the weights. In contrast, BEAT-MEV with naive virtualization would incur communication cost linear in the total weight. Third, to handle the small failure rate inherent in BEAT-MEV scheme due to index collisions across different clients at the time of encryption, we propose a generalization of their suggested approach which offers an option to tradeoff between ciphertext size and server communication cost. We implement and evaluate our scheme and compare it with BEAT-MEV to demonstrate our concrete improvement. In the unweighted setting, we improve the computational cost (without increasing the communication cost) by for a batch size of 512 ciphertexts. In the weighted setting, we improve the communication cost (without compromising computation time), over BEAT-MEV with naive virtualization, by for 100 validators with total stake weight 5000 distributed as per the latest Solana stake distribution.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 983d4bee-5548-443b-91e1-3428a56bdc94Related papers
- Mempool Privacy via Batched Threshold Encryption: Attacks and DefensesArka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi PolicharlaUSENIX Security 2024 · 41 citations
- BEAT-MEV: Epochless Approach to Batched Threshold Encryption for MEV PreventionJan Bormet, Sebastian Faust, Hussien Othman, Ziyan QuUSENIX Security 2025
- BTX and SimpleBTE: Efficient Batched Threshold EncryptionAmit Agarwal, Sourav Das, Babak Poorebrahim Gilkalaye, Guru-Vamsi Policharla et al.CCS 2026
- Efficiently-Thresholdizable Batched Identity Based Encryption, with ApplicationsAmit Agarwal, Rex Fernando, Benny PinkasCRYPTO 2025 · 12 citations
- BEAST-MEV: Batched Threshold Encryption with Silent Setup for MEV preventionJan Bormet, Arka Rai Choudhuri, Sebastian Faust, Sanjam Garg et al.CCS 2026 · 12 citations
