[{"status":"public","main_file_link":[{"url":"https://eprint.iacr.org/2016/989","open_access":"1"}],"publication_identifier":{"isbn":["978-331956616-0"]},"type":"conference","_id":"635","date_created":"2018-12-11T11:47:37Z","conference":{"location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2017-05-04","start_date":"2017-04-30"},"ec_funded":1,"author":[{"first_name":"Joel F","last_name":"Alwen","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Chen","first_name":"Binchi","full_name":"Chen, Binchi"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654"},{"last_name":"Reyzin","first_name":"Leonid","full_name":"Reyzin, Leonid"},{"first_name":"Stefano","last_name":"Tessaro","full_name":"Tessaro, Stefano"}],"oa_version":"Submitted Version","quality_controlled":"1","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"volume":10212,"language":[{"iso":"eng"}],"month":"01","year":"2017","page":"33 - 62","doi":"10.1007/978-3-319-56617-7_2","day":"01","oa":1,"publist_id":"7154","intvolume":"     10212","editor":[{"full_name":"Coron, Jean-Sébastien","last_name":"Coron","first_name":"Jean-Sébastien"},{"full_name":"Buus Nielsen, Jesper","last_name":"Buus Nielsen","first_name":"Jesper"}],"scopus_import":1,"alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">https://doi.org/10.1007/978-3-319-56617-7_2</a>.","ama":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. Scrypt is maximally memory hard. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:33-62. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">10.1007/978-3-319-56617-7_2</a>","ista":"Alwen JF, Chen B, Pietrzak KZ, Reyzin L, Tessaro S. 2017. Scrypt is maximally memory hard. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 33–62.","apa":"Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., &#38; Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron &#38; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">https://doi.org/10.1007/978-3-319-56617-7_2</a>","ieee":"J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.","short":"J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.","mla":"Alwen, Joel F., et al. <i>Scrypt Is Maximally Memory Hard</i>. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_2\">10.1007/978-3-319-56617-7_2</a>."},"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:10Z","title":"Scrypt is maximally memory hard","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","publication_status":"published","abstract":[{"lang":"eng","text":"Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries."}]},{"editor":[{"full_name":"Abate, Alessandro","last_name":"Abate","first_name":"Alessandro"},{"full_name":"Geeraerts, Gilles","last_name":"Geeraerts","first_name":"Gilles"}],"scopus_import":1,"intvolume":"     10419","publist_id":"7152","oa":1,"day":"03","year":"2017","doi":"10.1007/978-3-319-65765-3_11","page":"189 - 206","abstract":[{"lang":"eng","text":"Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems."}],"publication_status":"published","title":"On the quantitative semantics of regular expressions over real-valued signals","date_published":"2017-08-03T00:00:00Z","publisher":"Springer","citation":{"ieee":"A. Bakhirkin, T. Ferrere, O. Maler, and D. Ulus, “On the quantitative semantics of regular expressions over real-valued signals,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 189–206.","apa":"Bakhirkin, A., Ferrere, T., Maler, O., &#38; Ulus, D. (2017). On the quantitative semantics of regular expressions over real-valued signals. In A. Abate &#38; G. Geeraerts (Eds.) (Vol. 10419, pp. 189–206). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>","ista":"Bakhirkin A, Ferrere T, Maler O, Ulus D. 2017. On the quantitative semantics of regular expressions over real-valued signals. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 189–206.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Oded Maler, and Dogan Ulus. “On the Quantitative Semantics of Regular Expressions over Real-Valued Signals.” edited by Alessandro Abate and Gilles Geeraerts, 10419:189–206. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">https://doi.org/10.1007/978-3-319-65765-3_11</a>.","ama":"Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>","mla":"Bakhirkin, Alexey, et al. <i>On the Quantitative Semantics of Regular Expressions over Real-Valued Signals</i>. Edited by Alessandro Abate and Gilles Geeraerts, vol. 10419, Springer, 2017, pp. 189–206, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_11\">10.1007/978-3-319-65765-3_11</a>.","short":"A. Bakhirkin, T. Ferrere, O. Maler, D. Ulus, in:, A. Abate, G. Geeraerts (Eds.), Springer, 2017, pp. 189–206."},"date_updated":"2021-01-12T08:07:14Z","department":[{"_id":"ToHe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"conference":{"end_date":"2017-09-07","start_date":"2017-09-05","location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems"},"_id":"636","type":"conference","date_created":"2018-12-11T11:47:38Z","publication_identifier":{"isbn":["978-331965764-6"]},"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01552132"}],"status":"public","month":"08","volume":10419,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","project":[{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"full_name":"Ferrere, Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","first_name":"Thomas","last_name":"Ferrere"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"first_name":"Dogan","last_name":"Ulus","full_name":"Ulus, Dogan"}]},{"conference":{"start_date":"2017-07-20","end_date":"2017-07-24","name":"CRYPTO: Cryptology","location":"Santa Barbara, CA, United States"},"ec_funded":1,"type":"conference","_id":"637","date_created":"2018-12-11T11:47:38Z","status":"public","publication_identifier":{"isbn":["978-331963687-0"]},"main_file_link":[{"url":"https://eprint.iacr.org/2017/515","open_access":"1"}],"month":"01","volume":10401,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"quality_controlled":"1","author":[{"full_name":"Jafargholi, Zahra","first_name":"Zahra","last_name":"Jafargholi"},{"last_name":"Kamath Hosdurg","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein","first_name":"Karen"},{"full_name":"Komargodski, Ilan","first_name":"Ilan","last_name":"Komargodski"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wichs, Daniel","last_name":"Wichs","first_name":"Daniel"}],"editor":[{"full_name":"Katz, Jonathan","first_name":"Jonathan","last_name":"Katz"},{"last_name":"Shacham","first_name":"Hovav","full_name":"Shacham, Hovav"}],"scopus_import":1,"related_material":{"record":[{"status":"public","id":"10035","relation":"dissertation_contains"}]},"publist_id":"7151","intvolume":"     10401","oa":1,"page":"133 - 163","year":"2017","doi":"10.1007/978-3-319-63688-7_5","day":"01","publication_status":"published","abstract":[{"text":"For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs.","lang":"eng"}],"title":"Be adaptive avoid overcommitting","publisher":"Springer","date_published":"2017-01-01T00:00:00Z","citation":{"apa":"Jafargholi, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., &#38; Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &#38; H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">https://doi.org/10.1007/978-3-319-63688-7_5</a>","ama":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:<a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">10.1007/978-3-319-63688-7_5</a>","ista":"Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. 2017. Be adaptive avoid overcommitting. CRYPTO: Cryptology, LNCS, vol. 10401, 133–163.","chicago":"Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">https://doi.org/10.1007/978-3-319-63688-7_5</a>.","ieee":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.","mla":"Jafargholi, Zahra, et al. <i>Be Adaptive Avoid Overcommitting</i>. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-63688-7_5\">10.1007/978-3-319-63688-7_5</a>.","short":"Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163."},"department":[{"_id":"KrPi"}],"date_updated":"2023-09-07T13:32:11Z","alternative_title":["LNCS"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"page":"41 - 63","year":"2017","doi":"10.1007/978-3-319-63390-9_3","day":"01","editor":[{"full_name":"Majumdar, Rupak","first_name":"Rupak","last_name":"Majumdar"},{"full_name":"Kunčak, Viktor","last_name":"Kunčak","first_name":"Viktor"}],"scopus_import":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"},{"status":"public","relation":"later_version","id":"7014"}]},"publist_id":"7149","arxiv":1,"intvolume":"     10427","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Non-Polynomial Worst Case Analysis of Recursive Programs</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10427, Springer, 2017, pp. 41–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>.","short":"K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.","apa":"Chatterjee, K., Fu, H., &#38; Goharshady, A. K. (2017). Non-polynomial worst case analysis of recursive programs. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10427, pp. 41–63). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst case analysis of recursive programs. In: Majumdar R, Kunčak V, eds. Vol 10427. Springer; 2017:41-63. doi:<a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">10.1007/978-3-319-63390-9_3</a>","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63390-9_3\">https://doi.org/10.1007/978-3-319-63390-9_3</a>.","ista":"Chatterjee K, Fu H, Goharshady AK. 2017. Non-polynomial worst case analysis of recursive programs. CAV: Computer Aided Verification, LNCS, vol. 10427, 41–63."},"department":[{"_id":"KrCh"}],"date_updated":"2025-06-02T08:53:47Z","external_id":{"arxiv":["1705.00317"]},"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm."}],"title":"Non-polynomial worst case analysis of recursive programs","publisher":"Springer","date_published":"2017-01-01T00:00:00Z","_id":"639","type":"conference","date_created":"2018-12-11T11:47:39Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"publication_identifier":{"isbn":["978-331963389-3"]},"status":"public","conference":{"name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany","start_date":"2017-07-24","end_date":"2017-07-28"},"ec_funded":1,"oa_version":"Submitted Version","quality_controlled":"1","project":[{"call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"full_name":"Goharshady, Amir","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","last_name":"Goharshady","first_name":"Amir"}],"month":"01","volume":10427,"article_processing_charge":"No","language":[{"iso":"eng"}]},{"date_updated":"2021-01-12T08:07:22Z","department":[{"_id":"KrPi"}],"citation":{"ieee":"J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.","apa":"Alwen, J. F., Blocki, J., &#38; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &#38; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>","ama":"Alwen JF, Blocki J, Pietrzak KZ. Depth-robust graphs and their cumulative memory complexity. In: Coron J-S, Buus Nielsen J, eds. Vol 10212. Springer; 2017:3-32. doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>","chicago":"Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">https://doi.org/10.1007/978-3-319-56617-7_1</a>.","ista":"Alwen JF, Blocki J, Pietrzak KZ. 2017. Depth-robust graphs and their cumulative memory complexity. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 10212, 3–32.","short":"J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.","mla":"Alwen, Joel F., et al. <i>Depth-Robust Graphs and Their Cumulative Memory Complexity</i>. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-56617-7_1\">10.1007/978-3-319-56617-7_1</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions."}],"publication_status":"published","date_published":"2017-04-01T00:00:00Z","publisher":"Springer","title":"Depth-robust graphs and their cumulative memory complexity","oa":1,"year":"2017","page":"3 - 32","day":"01","doi":"10.1007/978-3-319-56617-7_1","scopus_import":1,"editor":[{"last_name":"Coron","first_name":"Jean-Sébastien","full_name":"Coron, Jean-Sébastien"},{"first_name":"Jesper","last_name":"Buus Nielsen","full_name":"Buus Nielsen, Jesper"}],"intvolume":"     10212","publist_id":"7148","project":[{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"quality_controlled":"1","oa_version":"Submitted Version","author":[{"last_name":"Alwen","first_name":"Joel F","full_name":"Alwen, Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jeremiah","last_name":"Blocki","full_name":"Blocki, Jeremiah"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak"}],"month":"04","language":[{"iso":"eng"}],"volume":10212,"date_created":"2018-12-11T11:47:39Z","_id":"640","type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2016/875","open_access":"1"}],"status":"public","publication_identifier":{"isbn":["978-331956616-0"]},"ec_funded":1,"conference":{"end_date":"2017-05-04","start_date":"2017-04-30","location":"Paris, France","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques"}},{"oa":1,"day":"01","year":"2017","page":"2373 - 2397","doi":"10.1090/mcom/3201","scopus_import":1,"publication":"Mathematics of Computation","intvolume":"        86","publist_id":"7144","citation":{"short":"M. Gerencser, I. Gyöngy, Mathematics of Computation 86 (2017) 2373–2397.","mla":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>, vol. 86, no. 307, American Mathematical Society, 2017, pp. 2373–97, doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>.","ieee":"M. Gerencser and I. Gyöngy, “Localization errors in solving stochastic partial differential equations in the whole space,” <i>Mathematics of Computation</i>, vol. 86, no. 307. American Mathematical Society, pp. 2373–2397, 2017.","apa":"Gerencser, M., &#38; Gyöngy, I. (2017). Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>","ista":"Gerencser M, Gyöngy I. 2017. Localization errors in solving stochastic partial differential equations in the whole space. Mathematics of Computation. 86(307), 2373–2397.","chicago":"Gerencser, Mate, and István Gyöngy. “Localization Errors in Solving Stochastic Partial Differential Equations in the Whole Space.” <i>Mathematics of Computation</i>. American Mathematical Society, 2017. <a href=\"https://doi.org/10.1090/mcom/3201\">https://doi.org/10.1090/mcom/3201</a>.","ama":"Gerencser M, Gyöngy I. Localization errors in solving stochastic partial differential equations in the whole space. <i>Mathematics of Computation</i>. 2017;86(307):2373-2397. doi:<a href=\"https://doi.org/10.1090/mcom/3201\">10.1090/mcom/3201</a>"},"date_updated":"2021-01-12T08:07:26Z","department":[{"_id":"JaMa"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable."}],"publication_status":"published","title":"Localization errors in solving stochastic partial differential equations in the whole space","publisher":"American Mathematical Society","date_published":"2017-01-01T00:00:00Z","_id":"642","type":"journal_article","date_created":"2018-12-11T11:47:40Z","main_file_link":[{"url":"https://arxiv.org/abs/1508.05535","open_access":"1"}],"publication_identifier":{"issn":["00255718"]},"status":"public","oa_version":"Submitted Version","quality_controlled":"1","author":[{"last_name":"Gerencser","first_name":"Mate","full_name":"Gerencser, Mate","id":"44ECEDF2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gyöngy","first_name":"István","full_name":"Gyöngy, István"}],"issue":"307","month":"01","volume":86,"language":[{"iso":"eng"}]},{"related_material":{"record":[{"id":"133","relation":"later_version","status":"public"}]},"oa":1,"date_created":"2019-05-13T08:15:55Z","_id":"6426","type":"technical_report","page":"28","day":"04","year":"2017","status":"public","doi":"10.15479/AT:IST-2018-853-v2-2","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","month":"08","file":[{"file_name":"main(1).pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:30Z","date_created":"2019-05-13T08:14:44Z","creator":"dernst","checksum":"b48d42725182d7ca10107a118815f4cf","file_id":"6431","file_size":971347,"access_level":"open_access","relation":"main_file"}],"ddc":["000"],"file_date_updated":"2020-07-14T12:47:30Z","date_published":"2017-08-04T00:00:00Z","language":[{"iso":"eng"}],"publisher":"IST Austria","title":"Synchronizing the asynchronous","date_updated":"2023-02-21T16:59:21Z","department":[{"_id":"ToHe"}],"oa_version":"Published Version","citation":{"ieee":"T. A. Henzinger, B. Kragl, and S. Qadeer, <i>Synchronizing the asynchronous</i>. IST Austria, 2017.","apa":"Henzinger, T. A., Kragl, B., &#38; Qadeer, S. (2017). <i>Synchronizing the asynchronous</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>","chicago":"Henzinger, Thomas A, Bernhard Kragl, and Shaz Qadeer. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017. <a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">https://doi.org/10.15479/AT:IST-2018-853-v2-2</a>.","ista":"Henzinger TA, Kragl B, Qadeer S. 2017. Synchronizing the asynchronous, IST Austria, 28p.","ama":"Henzinger TA, Kragl B, Qadeer S. <i>Synchronizing the Asynchronous</i>. IST Austria; 2017. doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>","short":"T.A. Henzinger, B. Kragl, S. Qadeer, Synchronizing the Asynchronous, IST Austria, 2017.","mla":"Henzinger, Thomas A., et al. <i>Synchronizing the Asynchronous</i>. IST Austria, 2017, doi:<a href=\"https://doi.org/10.15479/AT:IST-2018-853-v2-2\">10.15479/AT:IST-2018-853-v2-2</a>."},"author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"last_name":"Kragl","first_name":"Bernhard","orcid":"0000-0001-7745-9117","id":"320FC952-F248-11E8-B48F-1D18A9856A87","full_name":"Kragl, Bernhard"},{"full_name":"Qadeer, Shaz","first_name":"Shaz","last_name":"Qadeer"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["IST Austria Technical Report"]},{"page":"1087 - 1110","doi":"10.1137/16M1091836","day":"29","year":"2017","oa":1,"publication":"SIAM Journal on Computing","intvolume":"        46","publist_id":"7138","related_material":{"record":[{"status":"public","id":"1637","relation":"other"}]},"scopus_import":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” <i>SIAM Journal on Computing</i>. SIAM, 2017. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>.","ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. 2017;46(3):1087-1110. doi:<a href=\"https://doi.org/10.1137/16M1091836\">10.1137/16M1091836</a>","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.","apa":"Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2017). The complexity of general-valued CSPs. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/16M1091836\">https://doi.org/10.1137/16M1091836</a>","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” <i>SIAM Journal on Computing</i>, vol. 46, no. 3. SIAM, pp. 1087–1110, 2017."},"date_updated":"2023-02-23T10:07:49Z","department":[{"_id":"VlKo"}],"title":"The complexity of general-valued CSPs","date_published":"2017-06-29T00:00:00Z","publisher":"SIAM","abstract":[{"text":"An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.","lang":"eng"}],"publication_status":"published","status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.07327"}],"_id":"644","type":"journal_article","date_created":"2018-12-11T11:47:40Z","ec_funded":1,"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir"},{"first_name":"Andrei","last_name":"Krokhin","full_name":"Krokhin, Andrei"},{"first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","full_name":"Rolinek, Michal"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"volume":46,"language":[{"iso":"eng"}],"issue":"3","month":"06"},{"intvolume":"     10426","publist_id":"7135","scopus_import":1,"editor":[{"full_name":"Majumdar, Rupak","last_name":"Majumdar","first_name":"Rupak"},{"full_name":"Kunčak, Viktor","first_name":"Viktor","last_name":"Kunčak"}],"year":"2017","day":"13","page":"201 - 221","doi":"10.1007/978-3-319-63387-9_10","oa":1,"date_published":"2017-07-13T00:00:00Z","publisher":"Springer","title":"Value iteration for long run average reward in markov decision processes","abstract":[{"text":"Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.","lang":"eng"}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:32Z","department":[{"_id":"KrCh"}],"citation":{"chicago":"Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>.","ama":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. Value iteration for long run average reward in markov decision processes. In: Majumdar R, Kunčak V, eds. Vol 10426. Springer; 2017:201-221. doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>","ista":"Ashok P, Chatterjee K, Daca P, Kretinsky J, Meggendorfer T. 2017. Value iteration for long run average reward in markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 10426, 201–221.","apa":"Ashok, P., Chatterjee, K., Daca, P., Kretinsky, J., &#38; Meggendorfer, T. (2017). Value iteration for long run average reward in markov decision processes. In R. Majumdar &#38; V. Kunčak (Eds.) (Vol. 10426, pp. 201–221). Presented at the CAV: Computer Aided Verification, Heidelberg, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">https://doi.org/10.1007/978-3-319-63387-9_10</a>","ieee":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, and T. Meggendorfer, “Value iteration for long run average reward in markov decision processes,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10426, pp. 201–221.","short":"P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.","mla":"Ashok, Pranav, et al. <i>Value Iteration for Long Run Average Reward in Markov Decision Processes</i>. Edited by Rupak Majumdar and Viktor Kunčak, vol. 10426, Springer, 2017, pp. 201–21, doi:<a href=\"https://doi.org/10.1007/978-3-319-63387-9_10\">10.1007/978-3-319-63387-9_10</a>."},"ec_funded":1,"conference":{"end_date":"2017-07-28","start_date":"2017-07-24","name":"CAV: Computer Aided Verification","location":"Heidelberg, Germany"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.02326"}],"publication_identifier":{"isbn":["978-331963386-2"]},"status":"public","date_created":"2018-12-11T11:47:41Z","_id":"645","type":"conference","language":[{"iso":"eng"}],"volume":10426,"month":"07","author":[{"first_name":"Pranav","last_name":"Ashok","full_name":"Ashok, Pranav"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw"},{"first_name":"Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan"},{"full_name":"Meggendorfer, Tobias","first_name":"Tobias","last_name":"Meggendorfer"}],"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"}],"quality_controlled":"1","oa_version":"Submitted Version"},{"ec_funded":1,"conference":{"location":"Kolding, Denmark","name":"SSVM: Scale Space and Variational Methods in Computer Vision","end_date":"2017-06-08","start_date":"2017-06-04"},"status":"public","publication_identifier":{"isbn":["978-331958770-7"]},"main_file_link":[{"url":"https://arxiv.org/abs/1703.03769","open_access":"1"}],"date_created":"2018-12-11T11:47:41Z","_id":"646","type":"conference","language":[{"iso":"eng"}],"volume":10302,"month":"06","author":[{"full_name":"Kuske, Jan","first_name":"Jan","last_name":"Kuske"},{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"full_name":"Petra, Stefanie","first_name":"Stefanie","last_name":"Petra"}],"quality_controlled":"1","project":[{"call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice"}],"oa_version":"Submitted Version","intvolume":"     10302","publist_id":"7132","editor":[{"full_name":"Lauze, François","first_name":"François","last_name":"Lauze"},{"full_name":"Dong, Yiqiu","last_name":"Dong","first_name":"Yiqiu"},{"full_name":"Bjorholm Dahl, Anders","last_name":"Bjorholm Dahl","first_name":"Anders"}],"scopus_import":1,"year":"2017","page":"235 - 246","doi":"10.1007/978-3-319-58771-4_19","day":"01","oa":1,"publisher":"Springer","date_published":"2017-06-01T00:00:00Z","title":"A novel convex relaxation for non binary discrete tomography","abstract":[{"lang":"eng","text":"We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations."}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:34Z","department":[{"_id":"VlKo"}],"citation":{"short":"J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.","mla":"Kuske, Jan, et al. <i>A Novel Convex Relaxation for Non Binary Discrete Tomography</i>. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>.","apa":"Kuske, J., Swoboda, P., &#38; Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, &#38; A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>","chicago":"Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">https://doi.org/10.1007/978-3-319-58771-4_19</a>.","ista":"Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.","ama":"Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:<a href=\"https://doi.org/10.1007/978-3-319-58771-4_19\">10.1007/978-3-319-58771-4_19</a>","ieee":"J. Kuske, P. Swoboda, and S. Petra, “A novel convex relaxation for non binary discrete tomography,” presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark, 2017, vol. 10302, pp. 235–246."}},{"conference":{"location":"Berlin, Germany","name":"FORMATS: Formal Modelling and Analysis of Timed Systems","end_date":"2017-09-07","start_date":"2017-09-05"},"pubrep_id":"831","publication_identifier":{"isbn":["978-331965764-6"]},"status":"public","date_created":"2018-12-11T11:47:41Z","type":"conference","_id":"647","language":[{"iso":"eng"}],"volume":"10419 ","has_accepted_license":"1","month":"09","file":[{"file_name":"IST-2017-831-v1+1_main.pdf","date_updated":"2020-07-14T12:47:31Z","date_created":"2018-12-12T10:12:38Z","content_type":"application/pdf","file_size":3806864,"access_level":"open_access","creator":"system","file_id":"4956","checksum":"faf546914ba29bcf9974ee36b6b16750","relation":"main_file"}],"author":[{"last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","full_name":"Bogomolov, Sergiy"},{"first_name":"Mirco","last_name":"Giacobbe","orcid":"0000-0001-8180-0904","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0002-3066-6941","last_name":"Kong","first_name":"Hui","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"quality_controlled":"1","oa_version":"Submitted Version","publist_id":"7129","scopus_import":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"day":"01","doi":"10.1007/978-3-319-65765-3_7","page":"116 - 132","year":"2017","oa":1,"date_published":"2017-09-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:31Z","publisher":"Springer","title":"Conic abstractions for hybrid systems","publication_status":"published","abstract":[{"lang":"eng","text":"Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems."}],"ddc":["005"],"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"date_updated":"2023-09-07T12:53:00Z","citation":{"ieee":"S. Bogomolov, M. Giacobbe, T. A. Henzinger, and H. Kong, “Conic abstractions for hybrid systems,” presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany, 2017, vol. 10419, pp. 116–132.","apa":"Bogomolov, S., Giacobbe, M., Henzinger, T. A., &#38; Kong, H. (2017). Conic abstractions for hybrid systems (Vol. 10419, pp. 116–132). Presented at the FORMATS: Formal Modelling and Analysis of Timed Systems, Berlin, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>","chicago":"Bogomolov, Sergiy, Mirco Giacobbe, Thomas A Henzinger, and Hui Kong. “Conic Abstractions for Hybrid Systems,” 10419:116–32. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">https://doi.org/10.1007/978-3-319-65765-3_7</a>.","ama":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. Conic abstractions for hybrid systems. In: Vol 10419. Springer; 2017:116-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>","ista":"Bogomolov S, Giacobbe M, Henzinger TA, Kong H. 2017. Conic abstractions for hybrid systems. FORMATS: Formal Modelling and Analysis of Timed Systems, LNCS, vol. 10419, 116–132.","mla":"Bogomolov, Sergiy, et al. <i>Conic Abstractions for Hybrid Systems</i>. Vol. 10419, Springer, 2017, pp. 116–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-65765-3_7\">10.1007/978-3-319-65765-3_7</a>.","short":"S. Bogomolov, M. Giacobbe, T.A. Henzinger, H. Kong, in:, Springer, 2017, pp. 116–132."}},{"date_published":"2017-04-01T00:00:00Z","publisher":"Springer","title":"On the complexity of breaking pseudoentropy","abstract":[{"lang":"eng","text":"Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method."}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"date_updated":"2021-01-12T08:07:39Z","department":[{"_id":"KrPi"}],"citation":{"ista":"Skórski M. 2017. On the complexity of breaking pseudoentropy. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 600–613.","chicago":"Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>.","ama":"Skórski M. On the complexity of breaking pseudoentropy. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:600-613. doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>","apa":"Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &#38; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">https://doi.org/10.1007/978-3-319-55911-7_43</a>","ieee":"M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.","mla":"Skórski, Maciej. <i>On the Complexity of Breaking Pseudoentropy</i>. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_43\">10.1007/978-3-319-55911-7_43</a>.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613."},"intvolume":"     10185","publist_id":"7125","editor":[{"full_name":"Jäger, Gerhard","last_name":"Jäger","first_name":"Gerhard"},{"full_name":"Steila, Silvia","last_name":"Steila","first_name":"Silvia"}],"scopus_import":1,"page":"600 - 613","doi":"10.1007/978-3-319-55911-7_43","year":"2017","day":"01","oa":1,"language":[{"iso":"eng"}],"volume":10185,"month":"04","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","first_name":"Maciej","last_name":"Skórski"}],"quality_controlled":"1","oa_version":"Submitted Version","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","start_date":"2017-04-20","end_date":"2017-04-22"},"status":"public","publication_identifier":{"isbn":["978-331955910-0"]},"main_file_link":[{"url":"https://eprint.iacr.org/2016/1186.pdf","open_access":"1"}],"date_created":"2018-12-11T11:47:42Z","type":"conference","_id":"648"},{"doi":"10.1007/978-3-319-55911-7_42","page":"586 - 599","day":"01","year":"2017","oa":1,"publist_id":"7119","intvolume":"     10185","editor":[{"full_name":"Jäger, Gerhard","last_name":"Jäger","first_name":"Gerhard"},{"full_name":"Steila, Silvia","last_name":"Steila","first_name":"Silvia"}],"scopus_import":1,"alternative_title":["LNCS"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Skórski, Maciej. <i>A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds</i>. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">10.1007/978-3-319-55911-7_42</a>.","short":"M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.","apa":"Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger &#38; S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">https://doi.org/10.1007/978-3-319-55911-7_42</a>","ista":"Skórski M. 2017. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. TAMC: Theory and Applications of Models of Computation, LNCS, vol. 10185, 586–599.","chicago":"Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">https://doi.org/10.1007/978-3-319-55911-7_42</a>.","ama":"Skórski M. A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In: Jäger G, Steila S, eds. Vol 10185. Springer; 2017:586-599. doi:<a href=\"https://doi.org/10.1007/978-3-319-55911-7_42\">10.1007/978-3-319-55911-7_42</a>","ieee":"M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599."},"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:46Z","title":"A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds","date_published":"2017-01-01T00:00:00Z","publisher":"Springer","publication_status":"published","abstract":[{"text":"In this work we present a short and unified proof for the Strong and Weak Regularity Lemma, based on the cryptographic tech-nique called low-complexity approximations. In short, both problems reduce to a task of finding constructively an approximation for a certain target function under a class of distinguishers (test functions), where dis-tinguishers are combinations of simple rectangle-indicators. In our case these approximations can be learned by a simple iterative procedure, which yields a unified and simple proof, achieving for any graph with density d and any approximation parameter the partition size. The novelty in our proof is: (a) a simple approach which yields both strong and weaker variant, and (b) improvements when d = o(1). At an abstract level, our proof can be seen a refinement and simplification of the “analytic” proof given by Lovasz and Szegedy.","lang":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2016/965.pdf","open_access":"1"}],"status":"public","publication_identifier":{"issn":["03029743"]},"type":"conference","_id":"650","date_created":"2018-12-11T11:47:42Z","conference":{"name":"TAMC: Theory and Applications of Models of Computation","location":"Bern, Switzerland","end_date":"2017-04-22","start_date":"2017-04-20"},"author":[{"full_name":"Skórski, Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","first_name":"Maciej","last_name":"Skórski"}],"oa_version":"Submitted Version","quality_controlled":"1","volume":10185,"language":[{"iso":"eng"}],"month":"01"},{"abstract":[{"lang":"eng","text":"A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle."}],"publication_status":"published","ddc":["510"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2017-12-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:33Z","title":"Embedding graphs into embedded graphs","date_updated":"2021-01-12T08:07:51Z","department":[{"_id":"UlWa"}],"citation":{"short":"R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","mla":"Fulek, Radoslav. <i>Embedding Graphs into Embedded Graphs</i>. Vol. 92, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">10.4230/LIPICS.ISAAC.2017.34</a>.","ieee":"R. Fulek, “Embedding graphs into embedded graphs,” presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand, 2017, vol. 92.","apa":"Fulek, R. (2017). Embedding graphs into embedded graphs (Vol. 92). Presented at the ISAAC: International Symposium on Algorithms and Computation, Phuket, Thailand: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">https://doi.org/10.4230/LIPICS.ISAAC.2017.34</a>","ama":"Fulek R. Embedding graphs into embedded graphs. In: Vol 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">10.4230/LIPICS.ISAAC.2017.34</a>","ista":"Fulek R. 2017. Embedding graphs into embedded graphs. ISAAC: International Symposium on Algorithms and Computation vol. 92, 34.","chicago":"Fulek, Radoslav. “Embedding Graphs into Embedded Graphs,” Vol. 92. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ISAAC.2017.34\">https://doi.org/10.4230/LIPICS.ISAAC.2017.34</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"intvolume":"        92","oa":1,"year":"2017","day":"01","doi":"10.4230/LIPICS.ISAAC.2017.34","has_accepted_license":"1","month":"12","file":[{"file_name":"2017_LIPIcs-Fulek.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:33Z","date_created":"2019-06-04T12:20:35Z","creator":"kschuh","checksum":"fc7a643e29621c8bbe49d36b39081f31","file_id":"6518","file_size":588982,"access_level":"open_access","relation":"main_file"}],"article_number":"34","language":[{"iso":"eng"}],"volume":92,"quality_controlled":"1","project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"},{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425","grant_number":"M02281"}],"oa_version":"Published Version","author":[{"orcid":"0000-0001-8485-1774","last_name":"Fulek","first_name":"Radoslav","full_name":"Fulek, Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"conference":{"location":"Phuket, Thailand","name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2017-12-09","end_date":"2017-12-22"},"date_created":"2019-06-04T12:11:52Z","_id":"6517","type":"conference","status":"public"},{"license":"https://creativecommons.org/licenses/by/3.0/","status":"public","type":"conference","_id":"6519","date_created":"2019-06-04T12:42:43Z","ec_funded":1,"conference":{"location":"Stockholm, Sweden","name":"CSL: Conference on Computer Science Logic","start_date":"2017-08-20","end_date":"2017-08-24"},"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"oa_version":"Published Version","project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"quality_controlled":"1","article_processing_charge":"No","volume":82,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_created":"2019-06-04T12:56:52Z","date_updated":"2020-07-14T12:47:33Z","file_name":"2017_LIPIcs-Chatterjee.pdf","relation":"main_file","checksum":"7c2c9d09970af79026d7e37d9b632ef8","file_id":"6520","creator":"kschuh","access_level":"open_access","file_size":710185}],"article_number":"18","has_accepted_license":"1","month":"08","day":"01","doi":"10.4230/LIPICS.CSL.2017.18","year":"2017","oa":1,"intvolume":"        82","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"citation":{"short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.","mla":"Chatterjee, Krishnendu, et al. <i>Improved Set-Based Symbolic Algorithms for Parity Games</i>. Vol. 82, 18, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">10.4230/LIPICS.CSL.2017.18</a>.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Improved set-based symbolic algorithms for parity games. In: Vol 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">10.4230/LIPICS.CSL.2017.18</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">https://doi.org/10.4230/LIPICS.CSL.2017.18</a>.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2017. Improved set-based symbolic algorithms for parity games. CSL: Conference on Computer Science Logic vol. 82, 18.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2017). Improved set-based symbolic algorithms for parity games (Vol. 82). Presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden: Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik. <a href=\"https://doi.org/10.4230/LIPICS.CSL.2017.18\">https://doi.org/10.4230/LIPICS.CSL.2017.18</a>"},"date_updated":"2025-06-02T08:53:46Z","department":[{"_id":"KrCh"}],"title":"Improved set-based symbolic algorithms for parity games","date_published":"2017-08-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:33Z","publisher":"Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik","ddc":["004"],"abstract":[{"text":"Graph games with omega-regular winning conditions provide a mathematical framework to analyze a wide range of problems in the analysis of reactive systems and programs (such as the synthesis of reactive systems, program repair, and the verification of branching time properties). Parity conditions are canonical forms to specify omega-regular winning conditions. Graph games with parity conditions are equivalent to mu-calculus model checking, and thus a very important algorithmic problem. Symbolic algorithms are of great significance because they provide scalable algorithms for the analysis of large finite-state systems, as well as algorithms for the analysis of infinite-state systems with finite quotient. A set-based symbolic algorithm uses the basic set operations and the one-step predecessor operators. We consider graph games with n vertices and parity conditions with c priorities (equivalently, a mu-calculus formula with c alternations of least and greatest fixed points). While many explicit algorithms exist for graph games with parity conditions, for set-based symbolic algorithms there are only two algorithms (notice that we use space to refer to the number of sets stored by a symbolic algorithm): (a) the basic algorithm that requires O(n^c) symbolic operations and linear space; and (b) an improved algorithm that requires O(n^{c/2+1}) symbolic operations but also O(n^{c/2+1}) space (i.e., exponential space). In this work we present two set-based symbolic algorithms for parity games: (a) our first algorithm requires O(n^{c/2+1}) symbolic operations and only requires linear space; and (b) developing on our first algorithm, we present an algorithm that requires O(n^{c/3+1}) symbolic operations and only linear space. We also present the first linear space set-based symbolic algorithm for parity games that requires at most a sub-exponential number of symbolic operations. ","lang":"eng"}],"publication_status":"published"},{"title":"On the complexity of estimating Rènyi divergences","publisher":"IEEE","date_published":"2017-08-09T00:00:00Z","publication_status":"published","abstract":[{"text":"This paper studies the complexity of estimating Rényi divergences of discrete distributions: p observed from samples and the baseline distribution q known a priori. Extending the results of Acharya et al. (SODA'15) on estimating Rényi entropy, we present improved estimation techniques together with upper and lower bounds on the sample complexity. We show that, contrarily to estimating Rényi entropy where a sublinear (in the alphabet size) number of samples suffices, the sample complexity is heavily dependent on events occurring unlikely in q, and is unbounded in general (no matter what an estimation technique is used). For any divergence of integer order bigger than 1, we provide upper and lower bounds on the number of samples dependent on probabilities of p and q (the lower bounds hold for non-integer orders as well). We conclude that the worst-case sample complexity is polynomial in the alphabet size if and only if the probabilities of q are non-negligible. This gives theoretical insights into heuristics used in the applied literature to handle numerical instability, which occurs for small probabilities of q. Our result shows that they should be handled with care not only because of numerical issues, but also because of a blow up in the sample complexity.","lang":"eng"}],"external_id":{"arxiv":["1702.01666"]},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. Aachen, Germany: IEEE. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>","chicago":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/isit.2017.8006529\">https://doi.org/10.1109/isit.2017.8006529</a>.","ista":"Skórski M. 2017. On the complexity of estimating Rènyi divergences. 2017 IEEE International Symposium on Information Theory (ISIT). ISIT: International Symposium on Information Theory, 8006529.","ama":"Skórski M. On the complexity of estimating Rènyi divergences. In: <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>","ieee":"M. Skórski, “On the complexity of estimating Rènyi divergences,” in <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, Aachen, Germany, 2017.","short":"M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.","mla":"Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” <i>2017 IEEE International Symposium on Information Theory (ISIT)</i>, 8006529, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/isit.2017.8006529\">10.1109/isit.2017.8006529</a>."},"department":[{"_id":"KrPi"}],"date_updated":"2021-01-12T08:07:53Z","publication":"2017 IEEE International Symposium on Information Theory (ISIT)","arxiv":1,"scopus_import":1,"day":"09","year":"2017","doi":"10.1109/isit.2017.8006529","oa":1,"language":[{"iso":"eng"}],"article_number":"8006529","month":"08","author":[{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","full_name":"Skórski, Maciej","last_name":"Skórski","first_name":"Maciej"}],"oa_version":"Preprint","quality_controlled":"1","project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"}],"conference":{"name":"ISIT: International Symposium on Information Theory","location":"Aachen, Germany","start_date":"2017-06-25","end_date":"2017-06-30"},"ec_funded":1,"publication_identifier":{"isbn":["9781509040964"]},"main_file_link":[{"url":"https://arxiv.org/abs/1702.01666","open_access":"1"}],"status":"public","_id":"6526","type":"conference","date_created":"2019-06-06T12:53:09Z"},{"oa_version":"Submitted Version","citation":{"ieee":"J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, Dallas, TX, USA, 2017, pp. 1001–1017.","ama":"Alwen JF, Blocki J, Harsha B. Practical graphs for optimal side-channel resistant memory-hard functions. In: <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>. ACM Press; 2017:1001-1017. doi:<a href=\"https://doi.org/10.1145/3133956.3134031\">10.1145/3133956.3134031</a>","ista":"Alwen JF, Blocki J, Harsha B. 2017. Practical graphs for optimal side-channel resistant memory-hard functions. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS: Conference on Computer and Communications Security, 1001–1017.","chicago":"Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, 1001–17. ACM Press, 2017. <a href=\"https://doi.org/10.1145/3133956.3134031\">https://doi.org/10.1145/3133956.3134031</a>.","apa":"Alwen, J. F., Blocki, J., &#38; Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i> (pp. 1001–1017). Dallas, TX, USA: ACM Press. <a href=\"https://doi.org/10.1145/3133956.3134031\">https://doi.org/10.1145/3133956.3134031</a>","short":"J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.","mla":"Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” <i>Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security</i>, ACM Press, 2017, pp. 1001–17, doi:<a href=\"https://doi.org/10.1145/3133956.3134031\">10.1145/3133956.3134031</a>."},"date_updated":"2021-01-12T08:07:53Z","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"quality_controlled":"1","department":[{"_id":"KrPi"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F"},{"full_name":"Blocki, Jeremiah","first_name":"Jeremiah","last_name":"Blocki"},{"last_name":"Harsha","first_name":"Ben","full_name":"Harsha, Ben"}],"abstract":[{"lang":"eng","text":"A memory-hard function (MHF) ƒn with parameter n can be computed in sequential time and space n. Simultaneously, a high amortized parallel area-time complexity (aAT) is incurred per evaluation. In practice, MHFs are used to limit the rate at which an adversary (using a custom computational device) can evaluate a security sensitive function that still occasionally needs to be evaluated by honest users (using an off-the-shelf general purpose device). The most prevalent examples of such sensitive functions are Key Derivation Functions (KDFs) and password hashing algorithms where rate limits help mitigate off-line dictionary attacks. As the honest users' inputs to these functions are often (low-entropy) passwords special attention is given to a class of side-channel resistant MHFs called iMHFs.\r\n\r\nEssentially all iMHFs can be viewed as some mode of operation (making n calls to some round function) given by a directed acyclic graph (DAG) with very low indegree. Recently, a combinatorial property of a DAG has been identified (called \"depth-robustness\") which results in good provable security for an iMHF based on that DAG. Depth-robust DAGs have also proven useful in other cryptographic applications. Unfortunately, up till now, all known very depth-robust DAGs are impractically complicated and little is known about their exact (i.e. non-asymptotic) depth-robustness both in theory and in practice.\r\n\r\nIn this work we build and analyze (both formally and empirically) several exceedingly simple and efficient to navigate practical DAGs for use in iMHFs and other applications. For each DAG we:\r\n*Prove that their depth-robustness is asymptotically maximal.\r\n*Prove bounds of at least 3 orders of magnitude better on their exact depth-robustness compared to known bounds for other practical iMHF.\r\n*Implement and empirically evaluate their depth-robustness and aAT against a variety of state-of-the art (and several new) depth-reduction and low aAT attacks. \r\nWe find that, against all attacks, the new DAGs perform significantly better in practice than Argon2i, the most widely deployed iMHF in practice.\r\n\r\nAlong the way we also improve the best known empirical attacks on the aAT of Argon2i by implementing and testing several heuristic versions of a (hitherto purely theoretical) depth-reduction attack. Finally, we demonstrate practicality of our constructions by modifying the Argon2i code base to use one of the new high aAT DAGs. Experimental benchmarks on a standard off-the-shelf CPU show that the new modifications do not adversely affect the impressive throughput of Argon2i (despite seemingly enjoying significantly higher aAT).\r\n"}],"publication_status":"published","month":"10","title":"Practical graphs for optimal side-channel resistant memory-hard functions","language":[{"iso":"eng"}],"publisher":"ACM Press","date_published":"2017-10-30T00:00:00Z","_id":"6527","type":"conference","date_created":"2019-06-06T13:21:29Z","oa":1,"status":"public","day":"30","year":"2017","publication_identifier":{"isbn":["9781450349468"]},"page":"1001-1017","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/443"}],"doi":"10.1145/3133956.3134031","scopus_import":1,"publication":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","ec_funded":1,"conference":{"end_date":"2017-11-03","start_date":"2017-10-30","name":"CCS: Conference on Computer and Communications Security","location":"Dallas, TX, USA"}},{"department":[{"_id":"KrCh"}],"date_updated":"2022-06-10T09:55:08Z","citation":{"mla":"Makohon Moore, Alvin, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” <i>Nature Genetics</i>, vol. 49, no. 3, Nature Publishing Group, 2017, pp. 358–66, doi:<a href=\"https://doi.org/10.1038/ng.3764\">10.1038/ng.3764</a>.","short":"A. Makohon Moore, M. Zhang, J. Reiter, I. Božić, B. Allen, D. Kundu, K. Chatterjee, F. Wong, Y. Jiao, Z. Kohutek, J. Hong, M. Attiyeh, B. Javier, L. Wood, R. Hruban, M. Nowak, N. Papadopoulos, K. Kinzler, B. Vogelstein, C. Iacobuzio Donahue, Nature Genetics 49 (2017) 358–366.","ieee":"A. Makohon Moore <i>et al.</i>, “Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer,” <i>Nature Genetics</i>, vol. 49, no. 3. Nature Publishing Group, pp. 358–366, 2017.","chicago":"Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Božić, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.” <i>Nature Genetics</i>. Nature Publishing Group, 2017. <a href=\"https://doi.org/10.1038/ng.3764\">https://doi.org/10.1038/ng.3764</a>.","ama":"Makohon Moore A, Zhang M, Reiter J, et al. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. <i>Nature Genetics</i>. 2017;49(3):358-366. doi:<a href=\"https://doi.org/10.1038/ng.3764\">10.1038/ng.3764</a>","ista":"Makohon Moore A, Zhang M, Reiter J, Božić I, Allen B, Kundu D, Chatterjee K, Wong F, Jiao Y, Kohutek Z, Hong J, Attiyeh M, Javier B, Wood L, Hruban R, Nowak M, Papadopoulos N, Kinzler K, Vogelstein B, Iacobuzio Donahue C. 2017. Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. Nature Genetics. 49(3), 358–366.","apa":"Makohon Moore, A., Zhang, M., Reiter, J., Božić, I., Allen, B., Kundu, D., … Iacobuzio Donahue, C. (2017). Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer. <i>Nature Genetics</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ng.3764\">https://doi.org/10.1038/ng.3764</a>"},"external_id":{"pmid":["28092682"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"The extent of heterogeneity among driver gene mutations present in naturally occurring metastases - that is, treatment-naive metastatic disease - is largely unknown. To address this issue, we carried out 60× whole-genome sequencing of 26 metastases from four patients with pancreatic cancer. We found that identical mutations in known driver genes were present in every metastatic lesion for each patient studied. Passenger gene mutations, which do not have known or predicted functional consequences, accounted for all intratumoral heterogeneity. Even with respect to these passenger mutations, our analysis suggests that the genetic similarity among the founding cells of metastases was higher than that expected for any two cells randomly taken from a normal tissue. The uniformity of known driver gene mutations among metastases in the same patient has critical and encouraging implications for the success of future targeted therapies in advanced-stage disease."}],"ddc":["000"],"pmid":1,"file_date_updated":"2020-07-14T12:47:33Z","publisher":"Nature Publishing Group","date_published":"2017-03-01T00:00:00Z","title":"Limited heterogeneity of known driver gene mutations among the metastases of individual patients with pancreatic cancer","oa":1,"acknowledgement":"We thank the Memorial Sloan Kettering Cancer Center Molecular Cytology core facility for immunohistochemistry staining. This work was supported by Office of Naval Research grant N00014-16-1-2914, the Bill and Melinda Gates Foundation (OPP1148627), and a gift from B. Wu and E. Larson (M.A.N.), National Institutes of Health grants CA179991 (C.A.I.-D. and I.B.), F31 CA180682 (A.P.M.-M.), CA43460 (B.V.), and P50 CA62924, the Monastra Foundation, the Virginia and D.K. Ludwig Fund for Cancer Research, the Lustgarten Foundation for Pancreatic Cancer Research, the Sol Goldman Center for Pancreatic Cancer Research, the Sol Goldman Sequencing Center, ERC Start grant 279307: Graph Games (J.G.R., D.K., and C.K.), Austrian Science Fund (FWF) grant P23499-N23 (J.G.R., D.K., and C.K.), and FWF NFN grant S11407-N23 RiSE/SHiNE (J.G.R., D.K., and C.K.).","year":"2017","doi":"10.1038/ng.3764","page":"358 - 366","day":"01","scopus_import":"1","publist_id":"7092","intvolume":"        49","publication":"Nature Genetics","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"}],"oa_version":"Submitted Version","author":[{"first_name":"Alvin","last_name":"Makohon Moore","full_name":"Makohon Moore, Alvin"},{"full_name":"Zhang, Ming","last_name":"Zhang","first_name":"Ming"},{"id":"4A918E98-F248-11E8-B48F-1D18A9856A87","full_name":"Reiter, Johannes","last_name":"Reiter","first_name":"Johannes","orcid":"0000-0002-0170-7353"},{"full_name":"Božić, Ivana","last_name":"Božić","first_name":"Ivana"},{"first_name":"Benjamin","last_name":"Allen","full_name":"Allen, Benjamin"},{"full_name":"Kundu, Deepanjan","id":"1d4c0f4f-e8a3-11ec-a351-e36772758c45","first_name":"Deepanjan","last_name":"Kundu"},{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Wong, Fay","first_name":"Fay","last_name":"Wong"},{"last_name":"Jiao","first_name":"Yuchen","full_name":"Jiao, Yuchen"},{"last_name":"Kohutek","first_name":"Zachary","full_name":"Kohutek, Zachary"},{"full_name":"Hong, Jungeui","last_name":"Hong","first_name":"Jungeui"},{"first_name":"Marc","last_name":"Attiyeh","full_name":"Attiyeh, Marc"},{"full_name":"Javier, Breanna","first_name":"Breanna","last_name":"Javier"},{"first_name":"Laura","last_name":"Wood","full_name":"Wood, Laura"},{"first_name":"Ralph","last_name":"Hruban","full_name":"Hruban, Ralph"},{"first_name":"Martin","last_name":"Nowak","full_name":"Nowak, Martin"},{"last_name":"Papadopoulos","first_name":"Nickolas","full_name":"Papadopoulos, Nickolas"},{"full_name":"Kinzler, Kenneth","first_name":"Kenneth","last_name":"Kinzler"},{"last_name":"Vogelstein","first_name":"Bert","full_name":"Vogelstein, Bert"},{"full_name":"Iacobuzio Donahue, Christine","first_name":"Christine","last_name":"Iacobuzio Donahue"}],"month":"03","has_accepted_license":"1","file":[{"date_created":"2019-11-19T08:13:50Z","date_updated":"2020-07-14T12:47:33Z","content_type":"application/pdf","file_name":"2017_NatureGenetics_Makohon.pdf","relation":"main_file","access_level":"open_access","file_size":908099,"checksum":"e442dc3b7420a36ec805e9bb45cc1a2e","file_id":"7050","creator":"dernst"}],"issue":"3","language":[{"iso":"eng"}],"volume":49,"article_processing_charge":"No","date_created":"2018-12-11T11:47:43Z","article_type":"original","_id":"653","type":"journal_article","status":"public","publication_identifier":{"issn":["10614036"]},"ec_funded":1},{"ec_funded":1,"pubrep_id":"987","status":"public","publication_identifier":{"issn":["09501991"]},"_id":"654","type":"journal_article","date_created":"2018-12-11T11:47:44Z","volume":144,"language":[{"iso":"eng"}],"issue":"5","file":[{"file_name":"IST-2018-987-v1+1_2017_KichevaRivron__Creating_to.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:15:20Z","date_updated":"2020-07-14T12:47:33Z","file_id":"5139","checksum":"eef22a0f42a55b232cb2d1188a2322cb","creator":"system","access_level":"open_access","file_size":228206,"relation":"main_file"}],"has_accepted_license":"1","month":"03","author":[{"orcid":"0000-0003-4509-4998","first_name":"Anna","last_name":"Kicheva","full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicolas","last_name":"Rivron","full_name":"Rivron, Nicolas"}],"oa_version":"Submitted Version","project":[{"call_identifier":"H2020","name":"Coordination of Patterning And Growth In the Spinal Cord","_id":"B6FC0238-B512-11E9-945C-1524E6697425","grant_number":"680037"}],"quality_controlled":"1","publication":"Development","intvolume":"       144","publist_id":"7089","scopus_import":1,"day":"01","year":"2017","page":"733 - 736","doi":"10.1242/dev.144915","oa":1,"title":"Creating to understand – developmental biology meets engineering in Paris","publisher":"Company of Biologists","date_published":"2017-03-01T00:00:00Z","file_date_updated":"2020-07-14T12:47:33Z","ddc":["571"],"abstract":[{"lang":"eng","text":"In November 2016, developmental biologists, synthetic biologists and engineers gathered in Paris for a meeting called ‘Engineering the embryo’. The participants shared an interest in exploring how synthetic systems can reveal new principles of embryonic development, and how the in vitro manipulation and modeling of development using stem cells can be used to integrate ideas and expertise from physics, developmental biology and tissue engineering. As we review here, the conference pinpointed some of the challenges arising at the intersection of these fields, along with great enthusiasm for finding new approaches and collaborations."}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"A. Kicheva and N. Rivron, “Creating to understand – developmental biology meets engineering in Paris,” <i>Development</i>, vol. 144, no. 5. Company of Biologists, pp. 733–736, 2017.","chicago":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” <i>Development</i>. Company of Biologists, 2017. <a href=\"https://doi.org/10.1242/dev.144915\">https://doi.org/10.1242/dev.144915</a>.","ista":"Kicheva A, Rivron N. 2017. Creating to understand – developmental biology meets engineering in Paris. Development. 144(5), 733–736.","ama":"Kicheva A, Rivron N. Creating to understand – developmental biology meets engineering in Paris. <i>Development</i>. 2017;144(5):733-736. doi:<a href=\"https://doi.org/10.1242/dev.144915\">10.1242/dev.144915</a>","apa":"Kicheva, A., &#38; Rivron, N. (2017). Creating to understand – developmental biology meets engineering in Paris. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.144915\">https://doi.org/10.1242/dev.144915</a>","short":"A. Kicheva, N. Rivron, Development 144 (2017) 733–736.","mla":"Kicheva, Anna, and Nicolas Rivron. “Creating to Understand – Developmental Biology Meets Engineering in Paris.” <i>Development</i>, vol. 144, no. 5, Company of Biologists, 2017, pp. 733–36, doi:<a href=\"https://doi.org/10.1242/dev.144915\">10.1242/dev.144915</a>."},"date_updated":"2021-01-12T08:07:54Z","department":[{"_id":"AnKi"}]},{"author":[{"last_name":"Renault","first_name":"Thibaud","full_name":"Renault, Thibaud"},{"first_name":"Anthony","last_name":"Abraham","full_name":"Abraham, Anthony"},{"last_name":"Bergmiller","first_name":"Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","full_name":"Bergmiller, Tobias"},{"full_name":"Paradis, Guillaume","first_name":"Guillaume","last_name":"Paradis"},{"full_name":"Rainville, Simon","last_name":"Rainville","first_name":"Simon"},{"first_name":"Emmanuelle","last_name":"Charpentier","full_name":"Charpentier, Emmanuelle"},{"first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"},{"first_name":"Yuhai","last_name":"Tu","full_name":"Tu, Yuhai"},{"full_name":"Namba, Keiichi","first_name":"Keiichi","last_name":"Namba"},{"full_name":"Keener, James","first_name":"James","last_name":"Keener"},{"full_name":"Minamino, Tohru","first_name":"Tohru","last_name":"Minamino"},{"full_name":"Erhardt, Marc","first_name":"Marc","last_name":"Erhardt"}],"oa_version":"Published Version","quality_controlled":"1","volume":6,"language":[{"iso":"eng"}],"article_number":"e23136","file":[{"date_created":"2018-12-12T10:08:53Z","date_updated":"2020-07-14T12:47:33Z","content_type":"application/pdf","file_name":"IST-2017-904-v1+1_elife-23136-v2.pdf","relation":"main_file","access_level":"open_access","file_size":5520359,"checksum":"39e1c3e82ddac83a30422fa72fa1a383","file_id":"4716","creator":"system"},{"relation":"main_file","file_size":11242920,"access_level":"open_access","creator":"system","checksum":"a6d542253028f52e00aa29739ddffe8f","file_id":"4717","date_updated":"2020-07-14T12:47:33Z","date_created":"2018-12-12T10:08:54Z","content_type":"application/pdf","file_name":"IST-2017-904-v1+2_elife-23136-figures-v2.pdf"}],"month":"03","has_accepted_license":"1","status":"public","publication_identifier":{"issn":["2050084X"]},"type":"journal_article","_id":"655","date_created":"2018-12-11T11:47:44Z","pubrep_id":"904","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"T. Renault, A. Abraham, T. Bergmiller, G. Paradis, S. Rainville, E. Charpentier, C.C. Guet, Y. Tu, K. Namba, J. Keener, T. Minamino, M. Erhardt, ELife 6 (2017).","mla":"Renault, Thibaud, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” <i>ELife</i>, vol. 6, e23136, eLife Sciences Publications, 2017, doi:<a href=\"https://doi.org/10.7554/eLife.23136\">10.7554/eLife.23136</a>.","ieee":"T. Renault <i>et al.</i>, “Bacterial flagella grow through an injection diffusion mechanism,” <i>eLife</i>, vol. 6. eLife Sciences Publications, 2017.","apa":"Renault, T., Abraham, A., Bergmiller, T., Paradis, G., Rainville, S., Charpentier, E., … Erhardt, M. (2017). Bacterial flagella grow through an injection diffusion mechanism. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.23136\">https://doi.org/10.7554/eLife.23136</a>","ama":"Renault T, Abraham A, Bergmiller T, et al. Bacterial flagella grow through an injection diffusion mechanism. <i>eLife</i>. 2017;6. doi:<a href=\"https://doi.org/10.7554/eLife.23136\">10.7554/eLife.23136</a>","chicago":"Renault, Thibaud, Anthony Abraham, Tobias Bergmiller, Guillaume Paradis, Simon Rainville, Emmanuelle Charpentier, Calin C Guet, et al. “Bacterial Flagella Grow through an Injection Diffusion Mechanism.” <i>ELife</i>. eLife Sciences Publications, 2017. <a href=\"https://doi.org/10.7554/eLife.23136\">https://doi.org/10.7554/eLife.23136</a>.","ista":"Renault T, Abraham A, Bergmiller T, Paradis G, Rainville S, Charpentier E, Guet CC, Tu Y, Namba K, Keener J, Minamino T, Erhardt M. 2017. Bacterial flagella grow through an injection diffusion mechanism. eLife. 6, e23136."},"date_updated":"2021-01-12T08:07:55Z","department":[{"_id":"CaGu"}],"title":"Bacterial flagella grow through an injection diffusion mechanism","date_published":"2017-03-06T00:00:00Z","file_date_updated":"2020-07-14T12:47:33Z","publisher":"eLife Sciences Publications","ddc":["579"],"abstract":[{"text":"The bacterial flagellum is a self-assembling nanomachine. The external flagellar filament, several times longer than a bacterial cell body, is made of a few tens of thousands subunits of a single protein: flagellin. A fundamental problem concerns the molecular mechanism of how the flagellum grows outside the cell, where no discernible energy source is available. Here, we monitored the dynamic assembly of individual flagella using in situ labelling and real-time immunostaining of elongating flagellar filaments. We report that the rate of flagellum growth, initially ~1,700 amino acids per second, decreases with length and that the previously proposed chain mechanism does not contribute to the filament elongation dynamics. Inhibition of the proton motive force-dependent export apparatus revealed a major contribution of substrate injection in driving filament elongation. The combination of experimental and mathematical evidence demonstrates that a simple, injection-diffusion mechanism controls bacterial flagella growth outside the cell.","lang":"eng"}],"publication_status":"published","doi":"10.7554/eLife.23136","year":"2017","day":"06","oa":1,"publication":"eLife","intvolume":"         6","publist_id":"7082","scopus_import":1}]