Cryptology ePrint Archive: Report 2017/462

Leakage-Resilient Tweakable Encryption from One-Way Functions

Suvradip Chakraborty and Chester Rebeiro and Debdeep Mukhopadhyay and C. Pandu Rangan

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.

Category / Keywords: Tweakable-weak PRF, symmetric key tweakable weak hash proof system, tweakable encryption, relative-leakage model, after-the-fact leakage, one-way function

Date: received 24 May 2017, last revised 26 May 2017

Contact author: suvradip1111 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20170528:181231 (All versions of this report)

Short URL: ia.cr/2017/462

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]