### Leakage-Resilient Tweakable Encryption from One-Way Functions

##### Abstract

In this paper, we initiate the study of leakage-resilient tweakable encryption schemes in the relative key-leakage model, where the adversary can obtain (arbitrary) partial information about the secret key. We also focus on the minimal and generic assumptions needed to construct such a primitive. Interestingly, we show provably secure constructions of leakage-resilient (LR) tweakable encryption based on the sole assumption that one-way functions (OWF) exist via some interesting intermediate generic connections. A central tool used in our construction of LR-tweakable encryption is the notion of Symmetric-key tweakable weak hash proof system, which we introduce. This can be seen as a generalization of the Symmetric-key weak hash proof framework of Hazay et. al (Eurocrypt'13). Along the way, we also introduce a new primitive called tweakable weak pseudo-random functions (t-wPRF) and show how to generically construct it from weak-PRF. We then construct LR-version of t-wPRF and use it to construct LR-tweakable encryption.

Available format(s)
Publication info
Preprint. MINOR revision.
Keywords
Tweakable-weak PRFtweakable encryptionrelative-leakage modelafter-the-fact leakageone-way function
Contact author(s)
History
Short URL
https://ia.cr/2017/462

CC BY

BibTeX

@misc{cryptoeprint:2017/462,
author = {Suvradip Chakraborty and Chester Rebeiro and Debdeep Mukhopadhyay and C.  Pandu Rangan},
title = {Leakage-Resilient Tweakable Encryption from One-Way Functions},
howpublished = {Cryptology ePrint Archive, Paper 2017/462},
year = {2017},
note = {\url{https://eprint.iacr.org/2017/462}},
url = {https://eprint.iacr.org/2017/462}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.