Registration Based Encryption
Encryption schemes that remove the trusted key-generation authority of identity-based encryption in favour of a public registration process.
| Status | Problem | Tags |
|---|---|---|
|
RBE needs \(\Omega(\log n)\) updates Refuted. Mahmoody and Qi, Online Mergers and Applications to Registration-Based Encryption and Accumulators (ITC 2023), construct an RBE scheme with \(O(\log n/\log\log n)\) decryption updates and \(\mathrm{poly}(\kappa,\log n)\) public parameters – strictly below the \(\Omega(\log n)\) this statement conjectured – via a fully online merger structure, matching the known lower bound exactly. The paper states this explicitly resolves the open question. 4 open |
Registration Based Encryptionlower-boundresearch-solvedadaptation (ai) | |
|
RBE update bound, key-dependent schedules Resolved. Wei Qi, Tight Lower Bound on Witness Update Frequency in Additive Positive Accumulators (IACR Communications in Cryptology, 2026), generalizes the Mahmoody-Qi-Rahimi lower-bound framework to schedules that may depend on the sampled public keys themselves, via a new combinatorial structure (the falling-step sequence), and proves the same asymptotic bound holds. The paper states this explicitly resolves the open problem left in the source paper. 5 open |
Registration Based Encryptionlower-boundresearch-solvedadaptation (ai) |
No matching items