Anzeige
Erschienen in:
2016 | OriginalPaper | Buchkapitel
Standard Security Does Imply Security Against Selective Opening for Markov Distributions
verfasst von : Georg Fuchsbauer, Felix Heuer, Eike Kiltz, Krzysztof Pietrzak
Erschienen in: Theory of Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (\({\mathsf {IND\text {-}CPA}}\)) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to \({\mathsf {IND\text {-}CPA}}\) security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other.
In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial.