{"abstract":[{"text":"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 (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-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.","lang":"eng"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"quality_controlled":"1","scopus_import":1,"alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"author":[{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer"},{"last_name":"Heuer","full_name":"Heuer, Felix","first_name":"Felix"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"citation":{"chicago":"Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard Security Does Imply Security against Selective Opening for Markov Distributions,” 9562:282–305. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>.","ieee":"G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.","apa":"Fuchsbauer, G., Heuer, F., Kiltz, E., &#38; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>","mla":"Fuchsbauer, Georg, et al. <i>Standard Security Does Imply Security against Selective Opening for Markov Distributions</i>. Vol. 9562, Springer, 2016, pp. 282–305, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>.","ista":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562, 282–305.","short":"G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.","ama":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. Standard security does imply security against selective opening for markov distributions. In: Vol 9562. Springer; 2016:282-305. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>"},"intvolume":"      9562","title":"Standard security does imply security against selective opening for markov distributions","status":"public","ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","date_created":"2018-12-11T11:50:51Z","date_published":"2016-01-01T00:00:00Z","month":"01","type":"conference","_id":"1233","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/853"}],"conference":{"name":"TCC: Theory of Cryptography Conference","end_date":"2016-01-13","location":"Tel Aviv, Israel","start_date":"2016-01-10"},"date_updated":"2021-01-12T06:49:16Z","acknowledgement":"G. Fuchsbauer and K. Pietrzak are supported by the European Research Council, ERC Starting Grant (259668-PSPC). F. Heuer is funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and DFG SPP 1736, Algorithms for BIG DATA. E. Kiltz is supported by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation, the German Israel Foundation, and ERC Project ERCC (FP7/615074).","page":"282 - 305","publist_id":"6100","doi":"10.1007/978-3-662-49096-9_12","publication_status":"published","oa":1,"language":[{"iso":"eng"}],"year":"2016","volume":9562,"publisher":"Springer","day":"01"}