A Parallel Repetition Theorem for Leakage Resilience

@article{Brakerski2011APR,
  title={A Parallel Repetition Theorem for Leakage Resilience},
  author={Zvika Brakerski and Yael Tauman Kalai},
  journal={IACR Cryptology ePrint Archive},
  year={2011},
  volume={2011},
  pages={250}
}
A leakage resilient encryption scheme is one which stays secure even against an attacker that obtains a bounded amount of side information on the secret key (say λ bits of “leakage”). A fundamental question is whether parallel repetition amplifies leakage resilience. Namely, if we secret share our message, and encrypt the shares under two independent keys, will the resulting scheme be resilient to 2λ bits of leakage? Surprisingly, Lewko and Waters (FOCS 2010) showed that this is false. They… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
17 Citations
19 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…