Partial Fractions Techniques: Foundations and Efficient Batch Threshold Encryption
Ertem Nusret Tas
Session summary
Nusret Tas presents work on using batch threshold encryption to support encrypted mempools that reduce maximum extractable value by hiding transaction contents from block proposers while still enabling timely decryption. He contrasts two baseline designs: sharing a block-specific secret key, which reveals both included and still-pending transactions, and per-transaction threshold decryption, which preserves privacy but requires communication proportional to the number of validators times the number of transactions in a block. Tas frames the main question as whether all transactions in a block can be decrypted via a single succinct key derived through threshold sharing.
The authors claim to answer this affirmatively with a batch threshold encryption construction where each validator publishes one decryption share per block, which combines into a key that decrypts exactly that block’s ciphertexts and nothing else. Tas explains that the core technique comes from partial fraction decomposition, used to linearize off-diagonal terms in a structured matrix of rational functions. They first design an index-dependent batch encryption scheme, then combine it with broadcast encryption, and finally add threshold functionality. Tas states that their final construction is index-independent, does not rely on epochs, and uses public keys growing linearly with batch size, and he briefly mentions separate, less efficient, plausibly post-quantum variants.
Key takeaways
- Tas motivates batch threshold encryption as a way to make encrypted mempools practical, avoiding both loss of privacy for pending transactions and the high N·L communication cost of naive threshold decryption.
- The proposed scheme has validators publish one decryption share per block; combining these shares yields a single key that, according to the authors, decrypts all ciphertexts in the block and no others, addressing the stated mempool decryption problem.
- Tas attributes the construction’s properties to partial fraction techniques and a three-step design (index-dependent batch encryption, broadcast encryption, then thresholdization), leading to an index-independent, epochless scheme and inspiring related post-quantum work.