Efficiently-Thresholdizable Batched Identity Based Encryption, with Applications
Amit Agarwal, Rex Fernando, Benny Pinkas
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper3
- Threshold Batched Identity-Based Encryption from Pairings in the Plain ModelJunqing Gong, Brent Waters, Hoeteck Wee, David J. WuEUROCRYPT 2026 · 被引用 9 次
- Lighthouse: Single-Server Secure Aggregation with O(1) Server-Committee Communication at ScaleSanjam Garg, Alireza Kavousi, Dimitris Kolonelos, Erkan Tairi 等USENIX Security 2026 · 被引用 1 次
- BABE: Verifying Proofs on Bitcoin Made 1000x CheaperSanjam Garg, Dimitris Kolonelos, Mikhail Sergeevitch, Srivatsan Sridhar 等CCS 2026
相关 Paper
- Mempool Privacy via Batched Threshold Encryption: Attacks and DefensesArka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi PolicharlaUSENIX Security 2024 · 被引用 41 次
- BEAST-MEV: Batched Threshold Encryption with Silent Setup for MEV preventionJan Bormet, Arka Rai Choudhuri, Sebastian Faust, Sanjam Garg 等CCS 2026 · 被引用 12 次
- BTX and SimpleBTE: Efficient Batched Threshold EncryptionAmit Agarwal, Sourav Das, Babak Poorebrahim Gilkalaye, Guru-Vamsi Policharla 等CCS 2026
- Efficient Batch Threshold Encryption Using Partial Fraction TechniquesDan Boneh, Rohit Nema, Arnab Roy, Ertem Nusret TasCRYPTO 2026 · 被引用 1 次
- CCA-Secure Traceable Threshold (ID-based) Encryption and ApplicationRishiraj Bhattacharyya, Jan Bormet, Sebastian Faust, Pratyay Mukherjee 等CCS 2025 · 被引用 2 次
