Leakage-Resilient $$\mathsf {IBE}$$/$$\mathsf {ABE}$$ with Optimal Leakage Rates from Lattices

We derive the first adaptively secure $$\mathsf {IBE}$$ and $$\mathsf {ABE}$$ for t-CNF, and selectively secure $$\mathsf {ABE}$$ for general circuits from lattices, with $$1-o(1)$$ leakage rates, in the both relative leakage model and bounded retrieval model ( $$\mathsf {BRM}$$ ). To achieve this, we first identify a new fine-grained security notion for $$\mathsf {ABE}$$ – partially adaptive/selective security, and instantiate this notion from $$\mathsf {LWE}$$ . Then, by using this notion, we design a new key compressing mechanism for identity-based/attributed-based weak hash proof system ( $$\mathsf {IB}$$ / $$\mathsf {AB}$$ - $$\mathsf {wHPS}$$ ) for various policy classes, achieving (1) succinct secret keys and (2) adaptive/selective security matching the existing non-leakage resilient lattice-based designs. Using the existing connection between weak hash proof system and leakage resilient encryption, the succinct-key $$\mathsf {IB}$$ / $$\mathsf {AB}$$ - $$\mathsf {wHPS}$$ can yield the desired leakage resilient $$\mathsf {IBE}$$ / $$\mathsf {ABE}$$ schemes with the optimal leakage rates in the relative leakage model. Finally, by further improving the prior analysis of the compatible locally computable extractors, we can achieve the optimal leakage rates in the $$\mathsf {BRM}$$ .