Bilinear pairing + DLIN ⇒ CLR-PKE
Statement
If the decisional linear assumption holds in bilinear groups, there is a public-key encryption scheme resilient to continual memory leakage: the secret key is refreshed between periods while stays fixed, and the scheme remains CPA-secure when the adversary learns up to a fraction of the secret key in every period and bits during each update, with no bound on the total leakage — BKKV10.
Notes
- Under SXDH in place of DLIN, the per-period leakage rate is — BKKV10.
- Relying on subexponential hardness, each update may leak bits, for some constant , in place of — BKKV10.
- The same paper constructs identity-based encryption and signature schemes resilient to continual memory leakage — BKKV10.
- DHLW10 construct continual-leakage-resilient one-way relations, signatures, identification schemes and authenticated key agreement under the -Linear assumption in bilinear groups.
- Without updates, the bounded-leakage notion is met: CLR-PKE ⇒ LR-PKE — folklore.