In a batched identity-based encryption (IBE) scheme, ciphertexts are associated with a batch label \(\textsf{tg}^*\) and an identity \(\textsf{id}^*\) while secret keys are associated with a batch label \(\textsf{tg}\) and a set of identities S. Decryption is possible whenever \(\textsf{tg}= \textsf{tg}^*\) and \(\textsf{id}^*\in S\) . The primary efficiency property in a batched IBE scheme is that the size of the decryption key for a set S should be independent of the size of S. Batched IBE schemes provide an elegant cryptographic mechanism to support encrypted memory pools in blockchain applications.    In this work, we introduce a new algebraic framework for building pairing-based batched IBE. Our framework gives the following: Our constructions rely on classic algebraic techniques underlying pairing-based IBE and do not rely on the signature-based witness encryption viewpoint taken in previous works.