Welcome to the resource topic for 2008/164
Title:
On the (Im)Possibility of Key Dependent Encryption
Authors: Iftach Haitner, Thomas Holenstein
Abstract:We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key~k of the encryption scheme itself. We give the following separation results that hold both in the private and in the public key settings: \begin{itemize} \item Let~\mathcal{H} be the family of \poly(n)-wise independent hash-functions. There exists no fully-black-box reduction from an encryption scheme secure against key-dependent messages to one-way permutations (and also to families of trapdoor permutations) if the adversary can obtain encryptions of~h(k) for~h \in \mathcal{H}. \item There exists no reduction from an encryption scheme secure against key-dependent messages to, essentially, \emph{any} cryptographic assumption, if the adversary can obtain an encryption of~g(k) for an \emph{arbitrary} g, as long as the reduction’s proof of security treats both the adversary and the function g as black boxes. \end{itemize}
ePrint: https://eprint.iacr.org/2008/164
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .