\begin{enumerate} \item[$\bullet$] We show how to construct a leakage-resilient IND-CCA-2-secure PKE scheme in the bounded-memory leakage setting, from LR-NIKE protocol. Our construction differs from the state-of-the-art constructions of leakage-resilient IND-CCA-2-secure PKE, which use hash proof techniques to achieve leakage resiliency. Moreover, our transformation preserves the leakage-rate of the underlying LR-NIKE and admits more efficient construction than the previous such PKE constructions.
%\vspace{0.3 mm}
\item[$\bullet$] We introduce a new leakage model for AKE protocols, in the bounded-memory leakage setting. We show how to construct a leakage-resilient AKE protocol starting from LR-NIKE protocol. %This gives new constructions of leakage-resilient AKE.
%\vspace{0.3 mm}
\item[$\bullet$] We introduce the first-ever leakage model for LLKE protocols, in the bounded-memory leakage setting, and the first construction of such a leakage-resilient LLKE from LR-NIKE protocol. %Our work gives the first leakage security model for leakage-resilient LLKE and their construction. \end{enumerate}
Category / Keywords: leakage-resilient, public-key encryption, key exchange protocols Date: received 20 May 2017, last revised 10 Jun 2017 Contact author: araliyaqut at gmail com Available format(s): PDF | BibTeX Citation Version: 20170611:054842 (All versions of this report) Short URL: ia.cr/2017/441 Discussion forum: Show discussion | Start new discussion