Efficiently-Thresholdizable Batched Identity Based Encryption, with Applications
Amit Agarwal, Rex Fernando, Benny Pinkas
Abstract
We propose a new cryptographic primitive called "batched identity-based encryption" (Batched IBE) and its thresholdized version. The new primitive allows encrypting messages with specific identities and batch labels, where the latter can represent, for example, a block number on a blockchain. Given an arbitrary subset of identities for a particular batch, our primitive enables efficient issuance of a single decryption key that can be used to decrypt all ciphertexts having identities that are included in the subset while preserving the privacy of all ciphertexts having identities that are excluded from the subset. At the heart of our construction is a new technique that enables public aggregation (i.e. without knowledge of any secrets) of any subset of identities, into a succinct digest. This digest is used to derive, via a master secret key, a single succinct decryption key for all the identities that were digested in this batch. In a threshold system, where the master key is distributed as secret shares among multiple authorities, our method significantly reduces the communication (and in some cases, computation) overhead for the authorities. It achieves this by making their costs for key issuance independent of the batch size.
We present a concrete instantiation of a Batched IBE scheme based on the KZG polynomial commitment scheme by Kate et al. (Asiacrypt'10) and a modified form of the BLS signature scheme by Boneh et al. (Asiacrypt'01). The construction is proven secure in the generic group model (GGM).
In a blockchain setting, the new construction can be used for achieving mempool privacy by encrypting transactions to a block, opening only the transactions included in a given block and hiding the transactions that are not included in it. With the thresholdized version, multiple authorities (validators) can collaboratively manage the decryption process. Other possible applications include scalable support via blockchain for fairness of dishonest majority MPC, and conditional batched threshold decryption that can be used for implementing secure Dutch auctions and privacy preserving options trading.
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 8a247caa-b6e6-48c8-953f-8ffe157cc1b0Cited by top-tier papers3
- Threshold Batched Identity-Based Encryption from Pairings in the Plain ModelJunqing Gong, Brent Waters, Hoeteck Wee, David J. WuEUROCRYPT 2026 · 9 citations
- Lighthouse: Single-Server Secure Aggregation with O(1) Server-Committee Communication at ScaleSanjam Garg, Alireza Kavousi, Dimitris Kolonelos, Erkan Tairi et al.USENIX Security 2026 · 1 citation
- BABE: Verifying Proofs on Bitcoin Made 1000x CheaperSanjam Garg, Dimitris Kolonelos, Mikhail Sergeevitch, Srivatsan Sridhar et al.CCS 2026
Related papers
- Mempool Privacy via Batched Threshold Encryption: Attacks and DefensesArka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi PolicharlaUSENIX Security 2024 · 41 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
- BTX and SimpleBTE: Efficient Batched Threshold EncryptionAmit Agarwal, Sourav Das, Babak Poorebrahim Gilkalaye, Guru-Vamsi Policharla et al.CCS 2026
- Efficient Batch Threshold Encryption Using Partial Fraction TechniquesDan Boneh, Rohit Nema, Arnab Roy, Ertem Nusret TasCRYPTO 2026 · 1 citation
- CCA-Secure Traceable Threshold (ID-based) Encryption and ApplicationRishiraj Bhattacharyya, Jan Bormet, Sebastian Faust, Pratyay Mukherjee et al.CCS 2025 · 2 citations
