{"quality_controlled":"1","_id":"1907","title":"Optimality of non-adaptive strategies: The case of parallel games","department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:54:39Z","publication":"IEEE International Symposium on Information Theory","date_updated":"2021-01-12T06:53:59Z","month":"01","status":"public","day":"01","year":"2014","type":"conference","article_number":"6875125","date_published":"2014-01-01T00:00:00Z","author":[{"full_name":"Demay, Grégory","last_name":"Demay","first_name":"Grégory"},{"first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi","full_name":"Gazi, Peter"},{"last_name":"Maurer","full_name":"Maurer, Ueli","first_name":"Ueli"},{"full_name":"Tackmann, Björn","last_name":"Tackmann","first_name":"Björn"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/299"}],"scopus_import":1,"doi":"10.1109/ISIT.2014.6875125","oa":1,"oa_version":"Submitted Version","citation":{"ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2014. Optimality of non-adaptive strategies: The case of parallel games. IEEE International Symposium on Information Theory. IEEE International Symposium on Information Theory Proceedings, 6875125.","mla":"Demay, Grégory, et al. “Optimality of Non-Adaptive Strategies: The Case of Parallel Games.” <i>IEEE International Symposium on Information Theory</i>, 6875125, IEEE, 2014, doi:<a href=\"https://doi.org/10.1109/ISIT.2014.6875125\">10.1109/ISIT.2014.6875125</a>.","apa":"Demay, G., Gazi, P., Maurer, U., &#38; Tackmann, B. (2014). Optimality of non-adaptive strategies: The case of parallel games. In <i>IEEE International Symposium on Information Theory</i>. Honolulu, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2014.6875125\">https://doi.org/10.1109/ISIT.2014.6875125</a>","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, IEEE International Symposium on Information Theory, IEEE, 2014.","chicago":"Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Optimality of Non-Adaptive Strategies: The Case of Parallel Games.” In <i>IEEE International Symposium on Information Theory</i>. IEEE, 2014. <a href=\"https://doi.org/10.1109/ISIT.2014.6875125\">https://doi.org/10.1109/ISIT.2014.6875125</a>.","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Optimality of non-adaptive strategies: The case of parallel games,” in <i>IEEE International Symposium on Information Theory</i>, Honolulu, USA, 2014.","ama":"Demay G, Gazi P, Maurer U, Tackmann B. Optimality of non-adaptive strategies: The case of parallel games. In: <i>IEEE International Symposium on Information Theory</i>. IEEE; 2014. doi:<a href=\"https://doi.org/10.1109/ISIT.2014.6875125\">10.1109/ISIT.2014.6875125</a>"},"publication_status":"published","conference":{"location":"Honolulu, USA","start_date":"2014-06-29","end_date":"2014-07-04","name":"IEEE International Symposium on Information Theory Proceedings"},"publisher":"IEEE","publist_id":"5188","abstract":[{"text":"Most cryptographic security proofs require showing that two systems are indistinguishable. A central tool in such proofs is that of a game, where winning the game means provoking a certain condition, and it is shown that the two systems considered cannot be distinguished unless this condition is provoked. Upper bounding the probability of winning such a game, i.e., provoking this condition, for an arbitrary strategy is usually hard, except in the special case where the best strategy for winning such a game is known to be non-adaptive. A sufficient criterion for ensuring the optimality of non-adaptive strategies is that of conditional equivalence to a system, a notion introduced in [1]. In this paper, we show that this criterion is not necessary to ensure the optimality of non-adaptive strategies by giving two results of independent interest: 1) the optimality of non-adaptive strategies is not preserved under parallel composition; 2) in contrast, conditional equivalence is preserved under parallel composition.","lang":"eng"}],"language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"}