[{"month":"12","ec_funded":1,"status":"public","publication_identifier":{"isbn":["978-3-662-48970-3"]},"oa":1,"_id":"1636","abstract":[{"lang":"eng","text":"Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism R→ΓΓ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for the fixed template CSPs where the right side ΓΓ is fixed and the left side R is unconstrained.\r\n\r\nFar fewer results are known for the hybrid setting that restricts both sides simultaneously. It assumes that R belongs to a certain class of relational structures (called a structural restriction in this paper). We study which structural restrictions are effective, i.e. there exists a fixed template ΓΓ (from a certain class of languages) for which the problem is tractable when R is restricted, and NP-hard otherwise. We provide a characterization for structural restrictions that are closed under inverse homomorphisms. The criterion is based on the chromatic number of a relational structure defined in this paper; it generalizes the standard chromatic number of a graph.\r\n\r\nAs our main tool, we use the algebraic machinery developed for fixed template CSPs. To apply it to our case, we introduce a new construction called a “lifted language”. We also give a characterization for structural restrictions corresponding to minor-closed families of graphs, extend results to certain Valued CSPs (namely conservative valued languages), and state implications for (valued) CSPs with ordered variables and for the maximum weight independent set problem on some restricted families of graphs."}],"arxiv":1,"date_updated":"2022-02-01T15:12:35Z","year":"2015","citation":{"apa":"Kolmogorov, V., Rolinek, M., &#38; Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. In <i>26th International Symposium</i> (Vol. 9472, pp. 566–577). Nagoya, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">https://doi.org/10.1007/978-3-662-48971-0_48</a>","mla":"Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for Hybrid CSPs.” <i>26th International Symposium</i>, vol. 9472, Springer Nature, 2015, pp. 566–77, doi:<a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">10.1007/978-3-662-48971-0_48</a>.","ista":"Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.","chicago":"Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” In <i>26th International Symposium</i>, 9472:566–77. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">https://doi.org/10.1007/978-3-662-48971-0_48</a>.","ama":"Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. In: <i>26th International Symposium</i>. Vol 9472. Springer Nature; 2015:566-577. doi:<a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">10.1007/978-3-662-48971-0_48</a>","ieee":"V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” in <i>26th International Symposium</i>, Nagoya, Japan, 2015, vol. 9472, pp. 566–577.","short":"V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium, Springer Nature, 2015, pp. 566–577."},"intvolume":"      9472","main_file_link":[{"url":"http://arxiv.org/abs/1504.07067","open_access":"1"}],"scopus_import":"1","oa_version":"Preprint","date_published":"2015-12-01T00:00:00Z","doi":"10.1007/978-3-662-48971-0_48","publication_status":"published","conference":{"start_date":"2015-12-09","name":"ISAAC: International Symposium on Algorithms and Computation","end_date":"2015-12-11","location":"Nagoya, Japan"},"alternative_title":["LNCS"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Springer Nature","title":"Effectiveness of structural restrictions for hybrid CSPs","author":[{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek","first_name":"Michal","full_name":"Rolinek, Michal"},{"full_name":"Takhanov, Rustem","last_name":"Takhanov","first_name":"Rustem"}],"project":[{"_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"day":"01","quality_controlled":"1","volume":9472,"external_id":{"arxiv":["1504.07067"]},"article_processing_charge":"No","publist_id":"5519","type":"conference","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"publication":"26th International Symposium","page":"566 - 577","date_created":"2018-12-11T11:53:10Z"},{"ec_funded":1,"month":"12","oa":1,"status":"public","_id":"1637","year":"2015","abstract":[{"lang":"eng","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 ≠ 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 {0, ∞} 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 NP-hard. The case when all allowed functions take only finite values corresponds to finite-valued 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 Zivny. 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."}],"date_updated":"2023-02-23T12:44:26Z","citation":{"ama":"Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:<a href=\"https://doi.org/10.1109/FOCS.2015.80\">10.1109/FOCS.2015.80</a>","ieee":"V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.","short":"V. Kolmogorov, A. Krokhin, M. Rolinek, in:, IEEE, 2015, pp. 1246–1258.","apa":"Kolmogorov, V., Krokhin, A., &#38; Rolinek, M. (2015). The complexity of general-valued CSPs (pp. 1246–1258). Presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/FOCS.2015.80\">https://doi.org/10.1109/FOCS.2015.80</a>","mla":"Kolmogorov, Vladimir, et al. <i>The Complexity of General-Valued CSPs</i>. IEEE, 2015, pp. 1246–58, doi:<a href=\"https://doi.org/10.1109/FOCS.2015.80\">10.1109/FOCS.2015.80</a>.","ista":"Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, , 1246–1258.","chicago":"Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. <a href=\"https://doi.org/10.1109/FOCS.2015.80\">https://doi.org/10.1109/FOCS.2015.80</a>."},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.07327"}],"scopus_import":1,"date_published":"2015-12-01T00:00:00Z","oa_version":"Preprint","doi":"10.1109/FOCS.2015.80","conference":{"start_date":"2015-10-18","name":"FOCS: Foundations of Computer Science","end_date":"2015-10-20","location":"Berkeley, CA, United States"},"publication_status":"published","alternative_title":["56th Annual Symposium on Foundations of Computer Science"],"title":"The complexity of general-valued CSPs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","author":[{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"last_name":"Krokhin","first_name":"Andrei","full_name":"Krokhin, Andrei"},{"full_name":"Rolinek, Michal","first_name":"Michal","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87","last_name":"Rolinek"}],"project":[{"grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425","name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7"}],"day":"01","related_material":{"record":[{"relation":"other","status":"public","id":"644"}]},"quality_controlled":"1","publist_id":"5518","department":[{"_id":"VlKo"}],"language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T11:53:10Z","page":"1246 - 1258"},{"author":[{"full_name":"Sazanov, Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","orcid":"0000-0002-0977-7989"}],"_id":"1638","date_updated":"2021-01-12T06:52:10Z","abstract":[{"lang":"eng","text":"The mitochondrial respiratory chain, also known as the electron transport chain (ETC), is crucial to life, and energy production in the form of ATP is the main mitochondrial function. Three proton-translocating enzymes of the ETC, namely complexes I, III and IV, generate proton motive force, which in turn drives ATP synthase (complex V). The atomic structures and basic mechanisms of most respiratory complexes have previously been established, with the exception of complex I, the largest complex in the ETC. Recently, the crystal structure of the entire complex I was solved using a bacterial enzyme. The structure provided novel insights into the core architecture of the complex, the electron transfer and proton translocation pathways, as well as the mechanism that couples these two processes."}],"issue":"6","day":"22","year":"2015","month":"05","status":"public","publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A giant molecular proton pump: structure and mechanism of respiratory complex I","oa_version":"None","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"LeSa"}],"date_published":"2015-05-22T00:00:00Z","publication_status":"published","doi":"10.1038/nrm3997","page":"375 - 388","date_created":"2018-12-11T11:53:11Z","publication":"Nature Reviews Molecular Cell Biology","intvolume":"        16","citation":{"chicago":"Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism of Respiratory Complex I.” <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/nrm3997\">https://doi.org/10.1038/nrm3997</a>.","mla":"Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism of Respiratory Complex I.” <i>Nature Reviews Molecular Cell Biology</i>, vol. 16, no. 6, Nature Publishing Group, 2015, pp. 375–88, doi:<a href=\"https://doi.org/10.1038/nrm3997\">10.1038/nrm3997</a>.","apa":"Sazanov, L. A. (2015). A giant molecular proton pump: structure and mechanism of respiratory complex I. <i>Nature Reviews Molecular Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nrm3997\">https://doi.org/10.1038/nrm3997</a>","ista":"Sazanov LA. 2015. A giant molecular proton pump: structure and mechanism of respiratory complex I. Nature Reviews Molecular Cell Biology. 16(6), 375–388.","short":"L.A. Sazanov, Nature Reviews Molecular Cell Biology 16 (2015) 375–388.","ieee":"L. A. Sazanov, “A giant molecular proton pump: structure and mechanism of respiratory complex I,” <i>Nature Reviews Molecular Cell Biology</i>, vol. 16, no. 6. Nature Publishing Group, pp. 375–388, 2015.","ama":"Sazanov LA. A giant molecular proton pump: structure and mechanism of respiratory complex I. <i>Nature Reviews Molecular Cell Biology</i>. 2015;16(6):375-388. doi:<a href=\"https://doi.org/10.1038/nrm3997\">10.1038/nrm3997</a>"},"quality_controlled":"1","volume":16,"publist_id":"5517","scopus_import":1},{"page":"1745 - 1769","date_created":"2018-12-11T11:53:11Z","publication":"ESAIM: Mathematical Modelling and Numerical Analysis","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"publist_id":"5514","external_id":{"arxiv":["1504.01988"]},"quality_controlled":"1","volume":49,"acknowledgement":"The authors acknowledge support of the Collaborative Research Centre 1060 funded by the German Science foundation. This work is further supported by the King Abdullah University for Science and Technology (KAUST) Award No. KUK-I1-007-43 and the EPSRC grant Nr. EP/M00483X/1.","day":"01","author":[{"full_name":"Maas, Jan","last_name":"Maas","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan"},{"full_name":"Rumpf, Martin","first_name":"Martin","last_name":"Rumpf"},{"first_name":"Carola","last_name":"Schönlieb","full_name":"Schönlieb, Carola"},{"first_name":"Stefan","last_name":"Simon","full_name":"Simon, Stefan"}],"publisher":"EDP Sciences","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A generalized model for optimal transport of images including dissipation and density modulation","publication_status":"published","doi":"10.1051/m2an/2015043","oa_version":"Preprint","date_published":"2015-11-01T00:00:00Z","scopus_import":1,"main_file_link":[{"url":"http://arxiv.org/abs/1504.01988","open_access":"1"}],"intvolume":"        49","citation":{"chicago":"Maas, Jan, Martin Rumpf, Carola Schönlieb, and Stefan Simon. “A Generalized Model for Optimal Transport of Images Including Dissipation and Density Modulation.” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. EDP Sciences, 2015. <a href=\"https://doi.org/10.1051/m2an/2015043\">https://doi.org/10.1051/m2an/2015043</a>.","ista":"Maas J, Rumpf M, Schönlieb C, Simon S. 2015. A generalized model for optimal transport of images including dissipation and density modulation. ESAIM: Mathematical Modelling and Numerical Analysis. 49(6), 1745–1769.","apa":"Maas, J., Rumpf, M., Schönlieb, C., &#38; Simon, S. (2015). A generalized model for optimal transport of images including dissipation and density modulation. <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/m2an/2015043\">https://doi.org/10.1051/m2an/2015043</a>","mla":"Maas, Jan, et al. “A Generalized Model for Optimal Transport of Images Including Dissipation and Density Modulation.” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>, vol. 49, no. 6, EDP Sciences, 2015, pp. 1745–69, doi:<a href=\"https://doi.org/10.1051/m2an/2015043\">10.1051/m2an/2015043</a>.","short":"J. Maas, M. Rumpf, C. Schönlieb, S. Simon, ESAIM: Mathematical Modelling and Numerical Analysis 49 (2015) 1745–1769.","ama":"Maas J, Rumpf M, Schönlieb C, Simon S. A generalized model for optimal transport of images including dissipation and density modulation. <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>. 2015;49(6):1745-1769. doi:<a href=\"https://doi.org/10.1051/m2an/2015043\">10.1051/m2an/2015043</a>","ieee":"J. Maas, M. Rumpf, C. Schönlieb, and S. Simon, “A generalized model for optimal transport of images including dissipation and density modulation,” <i>ESAIM: Mathematical Modelling and Numerical Analysis</i>, vol. 49, no. 6. EDP Sciences, pp. 1745–1769, 2015."},"date_updated":"2021-01-12T06:52:10Z","arxiv":1,"issue":"6","abstract":[{"lang":"eng","text":"In this paper the optimal transport and the metamorphosis perspectives are combined. For a pair of given input images geodesic paths in the space of images are defined as minimizers of a resulting path energy. To this end, the underlying Riemannian metric measures the rate of transport cost and the rate of viscous dissipation. Furthermore, the model is capable to deal with strongly varying image contrast and explicitly allows for sources and sinks in the transport equations which are incorporated in the metric related to the metamorphosis approach by Trouvé and Younes. In the non-viscous case with source term existence of geodesic paths is proven in the space of measures. The proposed model is explored on the range from merely optimal transport to strongly dissipative dynamics. For this model a robust and effective variational time discretization of geodesic paths is proposed. This requires to minimize a discrete path energy consisting of a sum of consecutive image matching functionals. These functionals are defined on corresponding pairs of intensity functions and on associated pairwise matching deformations. Existence of time discrete geodesics is demonstrated. Furthermore, a finite element implementation is proposed and applied to instructive test cases and to real images. In the non-viscous case this is compared to the algorithm proposed by Benamou and Brenier including a discretization of the source term. Finally, the model is generalized to define discrete weighted barycentres with applications to textures and objects."}],"year":"2015","_id":"1639","status":"public","oa":1,"month":"11"},{"title":"Cytokinin response factors regulate PIN-FORMED auxin transporters","publisher":"Nature Publishing Group","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","acknowledgement":"This work was supported by the European Research Council Starting Independent Research grant (ERC-2007-Stg-207362-HCPO to E.B., M.S., C.C.), by the Ghent University Multidisciplinary Research Partnership ‘Biotechnology for a Sustainable Economy’ no.01MRB510W, by the Research Foundation—Flanders (grant 3G033711 to J.-A.O.), by the Austrian Science Fund (FWF01_I1774S) to K.Ö.,E.B., and by the Interuniversity Attraction Poles Programme (IUAP P7/29 ‘MARS’) initiated by the Belgian Science Policy Office. I.D.C. and S.V. are post-doctoral fellows of the Research Foundation—Flanders (FWO). This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Bioimaging Facility (BIF), the Life Science Facility (LSF).","file":[{"file_size":1471217,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"system","file_id":"5358","checksum":"c2c84bca37401435fedf76bad0ba0579","date_created":"2018-12-12T10:18:36Z","date_updated":"2020-07-14T12:45:08Z","file_name":"IST-2018-1020-v1+1_Simaskova_et_al_NatCom_2015.pdf"}],"project":[{"name":"Hormonal cross-talk in plant organogenesis","call_identifier":"FP7","_id":"253FCA6A-B435-11E9-9278-68D0E5697425","grant_number":"207362"},{"call_identifier":"FWF","name":"Hormone cross-talk drives nutrient dependent plant development","_id":"2542D156-B435-11E9-9278-68D0E5697425","grant_number":"I 1774-B16"}],"author":[{"full_name":"Šimášková, Mária","last_name":"Šimášková","first_name":"Mária"},{"first_name":"José","last_name":"O'Brien","full_name":"O'Brien, José"},{"id":"391B5BBC-F248-11E8-B48F-1D18A9856A87","last_name":"Khan-Djamei","first_name":"Mamoona","full_name":"Khan-Djamei, Mamoona"},{"full_name":"Van Noorden, Giel","first_name":"Giel","last_name":"Van Noorden"},{"full_name":"Ötvös, Krisztina","orcid":"0000-0002-5503-4983","first_name":"Krisztina","id":"29B901B0-F248-11E8-B48F-1D18A9856A87","last_name":"Ötvös"},{"last_name":"Vieten","first_name":"Anne","full_name":"Vieten, Anne"},{"full_name":"De Clercq, Inge","first_name":"Inge","last_name":"De Clercq"},{"full_name":"Van Haperen, Johanna","first_name":"Johanna","last_name":"Van Haperen"},{"full_name":"Cuesta, Candela","first_name":"Candela","orcid":"0000-0003-1923-2410","last_name":"Cuesta","id":"33A3C818-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hoyerová","first_name":"Klára","full_name":"Hoyerová, Klára"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"},{"id":"3F45B078-F248-11E8-B48F-1D18A9856A87","last_name":"Marhavy","first_name":"Peter","orcid":"0000-0001-5227-5741","full_name":"Marhavy, Peter"},{"first_name":"Krzysztof T","orcid":"0000-0001-7263-0560","last_name":"Wabnik","id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","full_name":"Wabnik, Krzysztof T"},{"first_name":"Frank","last_name":"Van Breusegem","full_name":"Van Breusegem, Frank"},{"full_name":"Nowack, Moritz","last_name":"Nowack","first_name":"Moritz"},{"last_name":"Murphy","first_name":"Angus","full_name":"Murphy, Angus"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596","first_name":"Jiřĺ","full_name":"Friml, Jiřĺ"},{"first_name":"Dolf","last_name":"Weijers","full_name":"Weijers, Dolf"},{"first_name":"Tom","last_name":"Beeckman","full_name":"Beeckman, Tom"},{"full_name":"Benková, Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","orcid":"0000-0002-8510-9739"}],"publist_id":"5513","pubrep_id":"1020","volume":6,"quality_controlled":"1","date_created":"2018-12-11T11:53:12Z","publication":"Nature Communications","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"EvBe"},{"_id":"JiFr"}],"type":"journal_article","oa":1,"status":"public","ec_funded":1,"month":"01","year":"2015","date_updated":"2021-01-12T06:52:11Z","abstract":[{"lang":"eng","text":"Auxin and cytokinin are key endogenous regulators of plant development. Although cytokinin-mediated modulation of auxin distribution is a developmentally crucial hormonal interaction, its molecular basis is largely unknown. Here we show a direct regulatory link between cytokinin signalling and the auxin transport machinery uncovering a mechanistic framework for cytokinin-auxin cross-talk. We show that the CYTOKININ RESPONSE FACTORS (CRFs), transcription factors downstream of cytokinin perception, transcriptionally control genes encoding PIN-FORMED (PIN) auxin transporters at a specific PIN CYTOKININ RESPONSE ELEMENT (PCRE) domain. Removal of this cis-regulatory element effectively uncouples PIN transcription from the CRF-mediated cytokinin regulation and attenuates plant cytokinin sensitivity. We propose that CRFs represent a missing cross-talk component that fine-tunes auxin transport capacity downstream of cytokinin signalling to control plant development."}],"_id":"1640","article_number":"8717","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"ddc":["580"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:08Z","intvolume":"         6","citation":{"chicago":"Šimášková, Mária, José O’Brien, Mamoona Khan-Djamei, Giel Van Noorden, Krisztina Ötvös, Anne Vieten, Inge De Clercq, et al. “Cytokinin Response Factors Regulate PIN-FORMED Auxin Transporters.” <i>Nature Communications</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/ncomms9717\">https://doi.org/10.1038/ncomms9717</a>.","mla":"Šimášková, Mária, et al. “Cytokinin Response Factors Regulate PIN-FORMED Auxin Transporters.” <i>Nature Communications</i>, vol. 6, 8717, Nature Publishing Group, 2015, doi:<a href=\"https://doi.org/10.1038/ncomms9717\">10.1038/ncomms9717</a>.","apa":"Šimášková, M., O’Brien, J., Khan-Djamei, M., Van Noorden, G., Ötvös, K., Vieten, A., … Benková, E. (2015). Cytokinin response factors regulate PIN-FORMED auxin transporters. <i>Nature Communications</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncomms9717\">https://doi.org/10.1038/ncomms9717</a>","ista":"Šimášková M, O’Brien J, Khan-Djamei M, Van Noorden G, Ötvös K, Vieten A, De Clercq I, Van Haperen J, Cuesta C, Hoyerová K, Vanneste S, Marhavý P, Wabnik KT, Van Breusegem F, Nowack M, Murphy A, Friml J, Weijers D, Beeckman T, Benková E. 2015. Cytokinin response factors regulate PIN-FORMED auxin transporters. Nature Communications. 6, 8717.","short":"M. Šimášková, J. O’Brien, M. Khan-Djamei, G. Van Noorden, K. Ötvös, A. Vieten, I. De Clercq, J. Van Haperen, C. Cuesta, K. Hoyerová, S. Vanneste, P. Marhavý, K.T. Wabnik, F. Van Breusegem, M. Nowack, A. Murphy, J. Friml, D. Weijers, T. Beeckman, E. Benková, Nature Communications 6 (2015).","ieee":"M. Šimášková <i>et al.</i>, “Cytokinin response factors regulate PIN-FORMED auxin transporters,” <i>Nature Communications</i>, vol. 6. Nature Publishing Group, 2015.","ama":"Šimášková M, O’Brien J, Khan-Djamei M, et al. Cytokinin response factors regulate PIN-FORMED auxin transporters. <i>Nature Communications</i>. 2015;6. doi:<a href=\"https://doi.org/10.1038/ncomms9717\">10.1038/ncomms9717</a>"},"publication_status":"published","doi":"10.1038/ncomms9717","date_published":"2015-01-01T00:00:00Z","oa_version":"Submitted Version"},{"citation":{"short":"R. Fulek, J. Kynčl, I. Malinovič, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015).","ama":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. Clustered planarity testing revisited. <i>Electronic Journal of Combinatorics</i>. 2015;22(4). doi:<a href=\"https://doi.org/10.37236/5002\">10.37236/5002</a>","ieee":"R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing revisited,” <i>Electronic Journal of Combinatorics</i>, vol. 22, no. 4. Electronic Journal of Combinatorics, 2015.","ista":"Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing revisited. Electronic Journal of Combinatorics. 22(4), P4.24.","mla":"Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” <i>Electronic Journal of Combinatorics</i>, vol. 22, no. 4, P4.24, Electronic Journal of Combinatorics, 2015, doi:<a href=\"https://doi.org/10.37236/5002\">10.37236/5002</a>.","apa":"Fulek, R., Kynčl, J., Malinovič, I., &#38; Pálvölgyi, D. (2015). Clustered planarity testing revisited. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/5002\">https://doi.org/10.37236/5002</a>","chicago":"Fulek, Radoslav, Jan Kynčl, Igor Malinovič, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2015. <a href=\"https://doi.org/10.37236/5002\">https://doi.org/10.37236/5002</a>."},"intvolume":"        22","ddc":["514","516"],"file_date_updated":"2020-07-14T12:45:08Z","scopus_import":"1","date_published":"2015-11-13T00:00:00Z","oa_version":"Published Version","doi":"10.37236/5002","publication_status":"published","ec_funded":1,"month":"11","publication_identifier":{"eissn":["1077-8926"]},"oa":1,"status":"public","_id":"1642","article_number":"P4.24 ","year":"2015","issue":"4","abstract":[{"text":"The Hanani-Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three or more disjoint clusters is not possible. For general clustered graphs we show a variant of the Hanani-Tutte theorem in the case when each cluster induces a connected subgraph. Di Battista and Frati proved that clustered planarity of embedded clustered graphs whose every face is incident to at most five vertices can be tested in polynomial time. We give a new and short proof of this result, using the matroid intersection algorithm.","lang":"eng"}],"arxiv":1,"date_updated":"2023-02-21T16:03:02Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10793"}]},"quality_controlled":"1","volume":22,"external_id":{"arxiv":["1305.4519"]},"article_processing_charge":"No","pubrep_id":"714","article_type":"original","publist_id":"5511","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Electronic Journal of Combinatorics","date_created":"2018-12-11T11:53:12Z","has_accepted_license":"1","title":"Clustered planarity testing revisited","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Electronic Journal of Combinatorics","file":[{"date_created":"2018-12-12T10:15:03Z","date_updated":"2020-07-14T12:45:08Z","file_name":"IST-2016-714-v1+1_5002-15499-3-PB.pdf","access_level":"open_access","file_id":"5120","checksum":"40b5920b49ee736694f59f39588ee206","creator":"system","file_size":443655,"relation":"main_file","content_type":"application/pdf"}],"author":[{"last_name":"Fulek","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","first_name":"Radoslav","orcid":"0000-0001-8485-1774","full_name":"Fulek, Radoslav"},{"first_name":"Jan","last_name":"Kynčl","full_name":"Kynčl, Jan"},{"first_name":"Igor","last_name":"Malinovič","full_name":"Malinovič, Igor"},{"last_name":"Pálvölgyi","first_name":"Dömötör","full_name":"Pálvölgyi, Dömötör"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"day":"13","acknowledgement":"e research leading to these results has received funding fromthe People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme(FP7/2007-2013) under REA grant agreement no [291734], and ESF Eurogiga project GraDR as GAˇCRGIG/11/E023."},{"month":"01","ec_funded":1,"status":"public","oa":1,"_id":"1644","date_updated":"2021-01-12T06:52:13Z","abstract":[{"text":"Increasing the computational complexity of evaluating a hash function, both for the honest users as well as for an adversary, is a useful technique employed for example in password-based cryptographic schemes to impede brute-force attacks, and also in so-called proofs of work (used in protocols like Bitcoin) to show that a certain amount of computation was performed by a legitimate user. A natural approach to adjust the complexity of a hash function is to iterate it c times, for some parameter c, in the hope that any query to the scheme requires c evaluations of the underlying hash function. However, results by Dodis et al. (Crypto 2012) imply that plain iteration falls short of achieving this goal, and designing schemes which provably have such a desirable property remained an open problem. This paper formalizes explicitly what it means for a given scheme to amplify the query complexity of a hash function. In the random oracle model, the goal of a secure query-complexity amplifier (QCA) scheme is captured as transforming, in the sense of indifferentiability, a random oracle allowing R queries (for the adversary) into one provably allowing only r &lt; R queries. Turned around, this means that making r queries to the scheme requires at least R queries to the actual random oracle. Second, a new scheme, called collision-free iteration, is proposed and proven to achieve c-fold QCA for both the honest parties and the adversary, for any fixed parameter c.","lang":"eng"}],"year":"2015","citation":{"ama":"Demay G, Gazi P, Maurer U, Tackmann B. Query-complexity amplification for random oracles. In: Vol 9063. Springer; 2015:159-180. doi:<a href=\"https://doi.org/10.1007/978-3-319-17470-9_10\">10.1007/978-3-319-17470-9_10</a>","ieee":"G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Query-complexity amplification for random oracles,” presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland, 2015, vol. 9063, pp. 159–180.","short":"G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, Springer, 2015, pp. 159–180.","apa":"Demay, G., Gazi, P., Maurer, U., &#38; Tackmann, B. (2015). Query-complexity amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-17470-9_10\">https://doi.org/10.1007/978-3-319-17470-9_10</a>","ista":"Demay G, Gazi P, Maurer U, Tackmann B. 2015. Query-complexity amplification for random oracles. ICITS: International Conference on Information Theoretic Security, LNCS, vol. 9063, 159–180.","mla":"Demay, Grégory, et al. <i>Query-Complexity Amplification for Random Oracles</i>. Vol. 9063, Springer, 2015, pp. 159–80, doi:<a href=\"https://doi.org/10.1007/978-3-319-17470-9_10\">10.1007/978-3-319-17470-9_10</a>.","chicago":"Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Query-Complexity Amplification for Random Oracles,” 9063:159–80. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-17470-9_10\">https://doi.org/10.1007/978-3-319-17470-9_10</a>."},"intvolume":"      9063","main_file_link":[{"url":"http://eprint.iacr.org/2015/315","open_access":"1"}],"scopus_import":1,"oa_version":"Submitted Version","date_published":"2015-01-01T00:00:00Z","conference":{"end_date":"2015-05-05","location":"Lugano, Switzerland","start_date":"2015-05-02","name":"ICITS: International Conference on Information Theoretic Security"},"publication_status":"published","doi":"10.1007/978-3-319-17470-9_10","alternative_title":["LNCS"],"publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Query-complexity amplification for random oracles","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"author":[{"full_name":"Demay, Grégory","last_name":"Demay","first_name":"Grégory"},{"full_name":"Gazi, Peter","first_name":"Peter","last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Maurer, Ueli","first_name":"Ueli","last_name":"Maurer"},{"first_name":"Björn","last_name":"Tackmann","full_name":"Tackmann, Björn"}],"day":"01","quality_controlled":"1","volume":9063,"publist_id":"5507","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"page":"159 - 180","date_created":"2018-12-11T11:53:13Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","status":"public","title":"Secret-key cryptography from ideal primitives: A systematic verview","month":"06","ec_funded":1,"abstract":[{"lang":"eng","text":"Secret-key constructions are often proved secure in a model where one or more underlying components are replaced by an idealized oracle accessible to the attacker. This model gives rise to information-theoretic security analyses, and several advances have been made in this area over the last few years. This paper provides a systematic overview of what is achievable in this model, and how existing works fit into this view."}],"date_updated":"2021-01-12T06:52:13Z","year":"2015","day":"24","author":[{"last_name":"Gazi","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Gazi, Peter"},{"first_name":"Stefano","last_name":"Tessaro","full_name":"Tessaro, Stefano"}],"article_number":"7133163","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"_id":"1645","scopus_import":1,"publist_id":"5506","quality_controlled":"1","citation":{"ieee":"P. Gazi and S. Tessaro, “Secret-key cryptography from ideal primitives: A systematic verview,” in <i>2015 IEEE Information Theory Workshop</i>, Jerusalem, Israel, 2015.","ama":"Gazi P, Tessaro S. Secret-key cryptography from ideal primitives: A systematic verview. In: <i>2015 IEEE Information Theory Workshop</i>. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/ITW.2015.7133163\">10.1109/ITW.2015.7133163</a>","short":"P. Gazi, S. Tessaro, in:, 2015 IEEE Information Theory Workshop, IEEE, 2015.","mla":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” <i>2015 IEEE Information Theory Workshop</i>, 7133163, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/ITW.2015.7133163\">10.1109/ITW.2015.7133163</a>.","ista":"Gazi P, Tessaro S. 2015. Secret-key cryptography from ideal primitives: A systematic verview. 2015 IEEE Information Theory Workshop. ITW 2015: IEEE Information Theory Workshop, 7133163.","apa":"Gazi, P., &#38; Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In <i>2015 IEEE Information Theory Workshop</i>. Jerusalem, Israel: IEEE. <a href=\"https://doi.org/10.1109/ITW.2015.7133163\">https://doi.org/10.1109/ITW.2015.7133163</a>","chicago":"Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.” In <i>2015 IEEE Information Theory Workshop</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/ITW.2015.7133163\">https://doi.org/10.1109/ITW.2015.7133163</a>."},"doi":"10.1109/ITW.2015.7133163","conference":{"location":"Jerusalem, Israel","end_date":"2015-05-01","name":"ITW 2015: IEEE Information Theory Workshop","start_date":"2015-04-26"},"publication_status":"published","publication":"2015 IEEE Information Theory Workshop","date_created":"2018-12-11T11:53:13Z","type":"conference","oa_version":"None","department":[{"_id":"KrPi"}],"date_published":"2015-06-24T00:00:00Z","language":[{"iso":"eng"}]},{"ec_funded":1,"month":"03","oa":1,"publication_identifier":{"isbn":["978-3-662-46496-0"]},"status":"public","_id":"1646","year":"2015","abstract":[{"text":"A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for a random key k ∈ K, the function F(k, ·) is indistinguishable from a uniformly random function, given black-box access. A key-homomorphic PRF has the additional feature that for any keys k, k' and any input x, we have F(k+k', x) = F(k, x)⊕F(k', x) for some group operations +,⊕ on K and Y, respectively. A constrained PRF for a family of setsS ⊆ P(X) has the property that, given any key k and set S ∈ S, one can efficiently compute a “constrained” key kS that enables evaluation of F(k, x) on all inputs x ∈ S, while the values F(k, x) for x /∈ S remain pseudorandom even given kS. In this paper we construct PRFs that are simultaneously constrained and key homomorphic, where the homomorphic property holds even for constrained keys. We first show that the multilinear map-based bit-fixing and circuit-constrained PRFs of Boneh and Waters (Asiacrypt 2013) can be modified to also be keyhomomorphic. We then show that the LWE-based key-homomorphic PRFs of Banerjee and Peikert (Crypto 2014) are essentially already prefix-constrained PRFs, using a (non-obvious) definition of constrained keys and associated group operation. Moreover, the constrained keys themselves are pseudorandom, and the constraining and evaluation functions can all be computed in low depth. As an application of key-homomorphic constrained PRFs,we construct a proxy re-encryption schemewith fine-grained access control. This scheme allows storing encrypted data on an untrusted server, where each file can be encrypted relative to some attributes, so that only parties whose constrained keys match the attributes can decrypt. Moreover, the server can re-key (arbitrary subsets of) the ciphertexts without learning anything about the plaintexts, thus permitting efficient and finegrained revocation.","lang":"eng"}],"date_updated":"2022-02-03T08:41:46Z","intvolume":"      9015","citation":{"ieee":"A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic constrained pseudorandom functions,” in <i>12th Theory of Cryptography Conference</i>, Warsaw, Poland, 2015, vol. 9015, pp. 31–60.","ama":"Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. Key-homomorphic constrained pseudorandom functions. In: <i>12th Theory of Cryptography Conference</i>. Vol 9015. Springer Nature; 2015:31-60. doi:<a href=\"https://doi.org/10.1007/978-3-662-46497-7_2\">10.1007/978-3-662-46497-7_2</a>","short":"A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, in:, 12th Theory of Cryptography Conference, Springer Nature, 2015, pp. 31–60.","chicago":"Banerjee, Abishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Z Pietrzak, and Sophie Stevens. “Key-Homomorphic Constrained Pseudorandom Functions.” In <i>12th Theory of Cryptography Conference</i>, 9015:31–60. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46497-7_2\">https://doi.org/10.1007/978-3-662-46497-7_2</a>.","mla":"Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.” <i>12th Theory of Cryptography Conference</i>, vol. 9015, Springer Nature, 2015, pp. 31–60, doi:<a href=\"https://doi.org/10.1007/978-3-662-46497-7_2\">10.1007/978-3-662-46497-7_2</a>.","ista":"Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic constrained pseudorandom functions. 12th Theory of Cryptography Conference. TCC: Theory of Cryptography Conference, LNCS, vol. 9015, 31–60.","apa":"Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., &#38; Stevens, S. (2015). Key-homomorphic constrained pseudorandom functions. In <i>12th Theory of Cryptography Conference</i> (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-46497-7_2\">https://doi.org/10.1007/978-3-662-46497-7_2</a>"},"ddc":["000","004"],"scopus_import":"1","main_file_link":[{"url":"https://eprint.iacr.org/2015/180","open_access":"1"}],"file_date_updated":"2020-07-14T12:45:08Z","date_published":"2015-03-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/978-3-662-46497-7_2","publication_status":"published","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2015-03-23","location":"Warsaw, Poland","end_date":"2015-03-25"},"alternative_title":["LNCS"],"title":"Key-homomorphic constrained pseudorandom functions","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Springer Nature","file":[{"creator":"system","file_id":"5136","checksum":"3c5093bda5783c89beaacabf1aa0e60e","access_level":"open_access","file_name":"IST-2016-679-v1+1_180.pdf","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:15:17Z","relation":"main_file","content_type":"application/pdf","file_size":450665}],"author":[{"last_name":"Banerjee","first_name":"Abishek","full_name":"Banerjee, Abishek"},{"last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Fuchsbauer, Georg"},{"full_name":"Peikert, Chris","last_name":"Peikert","first_name":"Chris"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Stevens, Sophie","first_name":"Sophie","last_name":"Stevens"}],"project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"day":"01","volume":9015,"quality_controlled":"1","article_processing_charge":"No","pubrep_id":"679","publist_id":"5505","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","publication":"12th Theory of Cryptography Conference","page":"31 - 60","date_created":"2018-12-11T11:53:14Z","has_accepted_license":"1"},{"department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","page":"233 - 253","date_created":"2018-12-11T11:53:14Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"1225"}]},"volume":9216,"quality_controlled":"1","article_processing_charge":"No","publist_id":"5503","author":[{"full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg"},{"full_name":"Hanser, Christian","last_name":"Hanser","first_name":"Christian"},{"full_name":"Slamanig, Daniel","last_name":"Slamanig","first_name":"Daniel"}],"project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"day":"01","alternative_title":["LNCS"],"title":"Practical round-optimal blind signatures in the standard model","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","date_published":"2015-08-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/978-3-662-48000-7_12","publication_status":"published","conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","location":"Santa Barbara, CA, United States","end_date":"2015-08-20"},"intvolume":"      9216","citation":{"short":"G. Fuchsbauer, C. Hanser, D. Slamanig, in:, Springer, 2015, pp. 233–253.","ama":"Fuchsbauer G, Hanser C, Slamanig D. Practical round-optimal blind signatures in the standard model. In: Vol 9216. Springer; 2015:233-253. doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_12\">10.1007/978-3-662-48000-7_12</a>","ieee":"G. Fuchsbauer, C. Hanser, and D. Slamanig, “Practical round-optimal blind signatures in the standard model,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 233–253.","chicago":"Fuchsbauer, Georg, Christian Hanser, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model,” 9216:233–53. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_12\">https://doi.org/10.1007/978-3-662-48000-7_12</a>.","ista":"Fuchsbauer G, Hanser C, Slamanig D. 2015. Practical round-optimal blind signatures in the standard model. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 233–253.","apa":"Fuchsbauer, G., Hanser, C., &#38; Slamanig, D. (2015). Practical round-optimal blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48000-7_12\">https://doi.org/10.1007/978-3-662-48000-7_12</a>","mla":"Fuchsbauer, Georg, et al. <i>Practical Round-Optimal Blind Signatures in the Standard Model</i>. Vol. 9216, Springer, 2015, pp. 233–53, doi:<a href=\"https://doi.org/10.1007/978-3-662-48000-7_12\">10.1007/978-3-662-48000-7_12</a>."},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/626.pdf"}],"scopus_import":1,"_id":"1647","year":"2015","abstract":[{"lang":"eng","text":"Round-optimal blind signatures are notoriously hard to construct in the standard model, especially in the malicious-signer model, where blindness must hold under adversarially chosen keys. This is substantiated by several impossibility results. The only construction that can be termed theoretically efficient, by Garg and Gupta (Eurocrypt’14), requires complexity leveraging, inducing an exponential security loss. We present a construction of practically efficient round-optimal blind signatures in the standard model. It is conceptually simple and builds on the recent structure-preserving signatures on equivalence classes (SPSEQ) from Asiacrypt’14. While the traditional notion of blindness follows from standard assumptions, we prove blindness under adversarially chosen keys under an interactive variant of DDH. However, we neither require non-uniform assumptions nor complexity leveraging. We then show how to extend our construction to partially blind signatures and to blind signatures on message vectors, which yield a construction of one-show anonymous credentials à la “anonymous credentials light” (CCS’13) in the standard model. Furthermore, we give the first SPS-EQ construction under noninteractive assumptions and show how SPS-EQ schemes imply conventional structure-preserving signatures, which allows us to apply optimality results for the latter to SPS-EQ."}],"date_updated":"2023-02-21T16:44:51Z","ec_funded":1,"month":"08","oa":1,"status":"public"},{"citation":{"short":"G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.","ama":"Fuchsbauer G, Jafargholi Z, Pietrzak KZ. A quasipolynomial reduction for generalized selective decryption on trees. In: Vol 9215. Springer; 2015:601-620. doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_29\">10.1007/978-3-662-47989-6_29</a>","ieee":"G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction for generalized selective decryption on trees,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.","mla":"Fuchsbauer, Georg, et al. <i>A Quasipolynomial Reduction for Generalized Selective Decryption on Trees</i>. Vol. 9215, Springer, 2015, pp. 601–20, doi:<a href=\"https://doi.org/10.1007/978-3-662-47989-6_29\">10.1007/978-3-662-47989-6_29</a>.","ista":"Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction for generalized selective decryption on trees. CRYPTO: International Cryptology Conference, LNCS, vol. 9215, 601–620.","apa":"Fuchsbauer, G., Jafargholi, Z., &#38; Pietrzak, K. Z. (2015). A quasipolynomial reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_29\">https://doi.org/10.1007/978-3-662-47989-6_29</a>","chicago":"Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial Reduction for Generalized Selective Decryption on Trees,” 9215:601–20. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47989-6_29\">https://doi.org/10.1007/978-3-662-47989-6_29</a>."},"intvolume":"      9215","ddc":["004"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:08Z","date_published":"2015-08-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/978-3-662-47989-6_29","conference":{"name":"CRYPTO: International Cryptology Conference","start_date":"2015-08-16","location":"Santa Barbara, CA, USA","end_date":"2015-08-20"},"publication_status":"published","ec_funded":1,"month":"08","oa":1,"status":"public","_id":"1648","year":"2015","abstract":[{"lang":"eng","text":"Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is a game for a symmetric encryption scheme Enc that captures the difficulty of proving adaptive security of certain protocols, most notably the Logical Key Hierarchy (LKH) multicast encryption protocol. In the GSD game there are n keys k1,..., kn, which the adversary may adaptively corrupt (learn); moreover, it can ask for encryptions Encki (kj) of keys under other keys. The adversary’s task is to distinguish keys (which it cannot trivially compute) from random. Proving the hardness of GSD assuming only IND-CPA security of Enc is surprisingly hard. Using “complexity leveraging” loses a factor exponential in n, which makes the proof practically meaningless. We can think of the GSD game as building a graph on n vertices, where we add an edge i → j when the adversary asks for an encryption of kj under ki. If restricted to graphs of depth ℓ, Panjwani gave a reduction that loses only a factor exponential in ℓ (not n). To date, this is the only non-trivial result known for GSD. In this paper we give almost-polynomial reductions for large classes of graphs. Most importantly, we prove the security of the GSD game restricted to trees losing only a quasi-polynomial factor n3 log n+5. Trees are an important special case capturing real-world protocols like the LKH protocol. Our new bound improves upon Panjwani’s on some LKH variants proposed in the literature where the underlying tree is not balanced. Our proof builds on ideas from the “nested hybrids” technique recently introduced by Fuchsbauer et al. [Asiacrypt’14] for proving the adaptive security of constrained PRFs."}],"date_updated":"2021-01-12T06:52:14Z","quality_controlled":"1","volume":9215,"pubrep_id":"674","publist_id":"5502","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","page":"601 - 620","date_created":"2018-12-11T11:53:14Z","has_accepted_license":"1","license":"https://creativecommons.org/licenses/by/4.0/","alternative_title":["LNCS"],"title":"A quasipolynomial reduction for generalized selective decryption on trees","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","file":[{"file_size":505618,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"99b76b3263d5082554d0a9cbdeca3a22","creator":"system","file_id":"5015","date_created":"2018-12-12T10:13:31Z","file_name":"IST-2016-674-v1+1_389.pdf","date_updated":"2020-07-14T12:45:08Z"}],"author":[{"full_name":"Fuchsbauer, Georg","first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer"},{"last_name":"Jafargholi","first_name":"Zahra","full_name":"Jafargholi, Zahra"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01"},{"pubrep_id":"678","publist_id":"5501","quality_controlled":"1","volume":9326,"has_accepted_license":"1","page":"305 - 325","date_created":"2018-12-11T11:53:15Z","type":"conference","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"Efficient zero-knowledge proofs for commitments from learning with errors over rings","alternative_title":["LNCS"],"license":"https://creativecommons.org/licenses/by-nc/4.0/","series_title":"Lecture Notes in Computer Science","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"day":"01","author":[{"full_name":"Benhamouda, Fabrice","first_name":"Fabrice","last_name":"Benhamouda"},{"full_name":"Krenn, Stephan","first_name":"Stephan","last_name":"Krenn"},{"first_name":"Vadim","last_name":"Lyubashevsky","full_name":"Lyubashevsky, Vadim"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"file":[{"content_type":"application/pdf","relation":"main_file","file_size":494239,"date_updated":"2020-07-14T12:45:08Z","file_name":"IST-2016-678-v1+1_889.pdf","date_created":"2018-12-12T10:11:28Z","file_id":"4883","checksum":"6eac4a485b2aa644b2d3f753ed0b280b","creator":"system","access_level":"open_access"}],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:08Z","ddc":["000","004"],"intvolume":"      9326","citation":{"ieee":"F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge proofs for commitments from learning with errors over rings,” vol. 9326. Springer, pp. 305–325, 2015.","ama":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 2015;9326:305-325. doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">10.1007/978-3-319-24174-6_16</a>","short":"F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.","chicago":"Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">https://doi.org/10.1007/978-3-319-24174-6_16</a>.","mla":"Benhamouda, Fabrice, et al. <i>Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings</i>. Vol. 9326, Springer, 2015, pp. 305–25, doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">10.1007/978-3-319-24174-6_16</a>.","apa":"Benhamouda, F., Krenn, S., Lyubashevsky, V., &#38; Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-319-24174-6_16\">https://doi.org/10.1007/978-3-319-24174-6_16</a>","ista":"Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge proofs for commitments from learning with errors over rings. 9326, 305–325."},"doi":"10.1007/978-3-319-24174-6_16","conference":{"end_date":"2015-09-25","location":"Vienna, Austria","start_date":"2015-09-21","name":"ESORICS: European Symposium on Research in Computer Security"},"publication_status":"published","oa_version":"Published Version","date_published":"2015-01-01T00:00:00Z","status":"public","oa":1,"month":"01","ec_funded":1,"abstract":[{"text":"We extend a commitment scheme based on the learning with errors over rings (RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge. Our scheme maps elements from the ring (or equivalently, n elements from ","lang":"eng"}],"date_updated":"2021-01-12T06:52:14Z","year":"2015","_id":"1649"},{"file":[{"content_type":"application/pdf","relation":"main_file","file_size":525503,"file_name":"IST-2016-675-v1+1_384.pdf","date_updated":"2020-07-14T12:45:08Z","date_created":"2018-12-12T10:08:32Z","checksum":"e808c7eecb631336fc9f9bf2e8d4ecae","file_id":"4693","creator":"system","access_level":"open_access"}],"author":[{"full_name":"Skórski, Maciej","last_name":"Skórski","first_name":"Maciej"},{"first_name":"Alexander","last_name":"Golovnev","full_name":"Golovnev, Alexander"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7","name":"Provable Security for Physical Cryptography"}],"day":"20","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"alternative_title":["LNCS"],"title":"Condensed unpredictability ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","page":"1046 - 1057","date_created":"2018-12-11T11:53:15Z","has_accepted_license":"1","quality_controlled":"1","volume":9134,"pubrep_id":"675","publist_id":"5500","_id":"1650","year":"2015","abstract":[{"lang":"eng","text":"We consider the task of deriving a key with high HILL entropy (i.e., being computationally indistinguishable from a key with high min-entropy) from an unpredictable source.\r\n\r\nPrevious to this work, the only known way to transform unpredictability into a key that was ϵ indistinguishable from having min-entropy was via pseudorandomness, for example by Goldreich-Levin (GL) hardcore bits. This approach has the inherent limitation that from a source with k bits of unpredictability entropy one can derive a key of length (and thus HILL entropy) at most k−2log(1/ϵ) bits. In many settings, e.g. when dealing with biometric data, such a 2log(1/ϵ) bit entropy loss in not an option. Our main technical contribution is a theorem that states that in the high entropy regime, unpredictability implies HILL entropy. Concretely, any variable K with |K|−d bits of unpredictability entropy has the same amount of so called metric entropy (against real-valued, deterministic distinguishers), which is known to imply the same amount of HILL entropy. The loss in circuit size in this argument is exponential in the entropy gap d, and thus this result only applies for small d (i.e., where the size of distinguishers considered is exponential in d).\r\n\r\nTo overcome the above restriction, we investigate if it’s possible to first “condense” unpredictability entropy and make the entropy gap small. We show that any source with k bits of unpredictability can be condensed into a source of length k with k−3 bits of unpredictability entropy. Our condenser simply “abuses&quot; the GL construction and derives a k bit key from a source with k bits of unpredicatibily. The original GL theorem implies nothing when extracting that many bits, but we show that in this regime, GL still behaves like a “condenser&quot; for unpredictability. This result comes with two caveats (1) the loss in circuit size is exponential in k and (2) we require that the source we start with has no HILL entropy (equivalently, one can efficiently check if a guess is correct). We leave it as an intriguing open problem to overcome these restrictions or to prove they’re inherent."}],"date_updated":"2021-01-12T06:52:15Z","ec_funded":1,"month":"06","oa":1,"status":"public","date_published":"2015-06-20T00:00:00Z","oa_version":"Published Version","doi":"10.1007/978-3-662-47672-7_85","publication_status":"published","conference":{"name":"ICALP: Automata, Languages and Programming","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"intvolume":"      9134","citation":{"short":"M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.","ieee":"M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability ,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 1046–1057.","ama":"Skórski M, Golovnev A, Pietrzak KZ. Condensed unpredictability . In: Vol 9134. Springer; 2015:1046-1057. doi:<a href=\"https://doi.org/10.1007/978-3-662-47672-7_85\">10.1007/978-3-662-47672-7_85</a>","mla":"Skórski, Maciej, et al. <i>Condensed Unpredictability </i>. Vol. 9134, Springer, 2015, pp. 1046–57, doi:<a href=\"https://doi.org/10.1007/978-3-662-47672-7_85\">10.1007/978-3-662-47672-7_85</a>.","ista":"Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP: Automata, Languages and Programming, LNCS, vol. 9134, 1046–1057.","apa":"Skórski, M., Golovnev, A., &#38; Pietrzak, K. Z. (2015). Condensed unpredictability  (Vol. 9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer. <a href=\"https://doi.org/10.1007/978-3-662-47672-7_85\">https://doi.org/10.1007/978-3-662-47672-7_85</a>","chicago":"Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed Unpredictability ,” 9134:1046–57. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47672-7_85\">https://doi.org/10.1007/978-3-662-47672-7_85</a>."},"ddc":["000","005"],"scopus_import":1,"file_date_updated":"2020-07-14T12:45:08Z"},{"publication_status":"published","conference":{"location":"Gaithersburg, MD, United States","end_date":"2015-04-01","name":"PKC: Public Key Crypography","start_date":"2015-03-30"},"doi":"10.1007/978-3-662-46447-2_5","date_published":"2015-03-17T00:00:00Z","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1007/978-3-662-46447-2_5","open_access":"1"}],"scopus_import":"1","intvolume":"      9020","citation":{"chicago":"Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.” In <i>Public-Key Cryptography - PKC 2015</i>, 9020:101–24. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>.","ista":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS, vol. 9020, 101–124.","apa":"Baldimtsi, F., Chase, M., Fuchsbauer, G., &#38; Kohlweiss, M. (2015). Anonymous transferable e-cash. In <i>Public-Key Cryptography - PKC 2015</i> (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">https://doi.org/10.1007/978-3-662-46447-2_5</a>","mla":"Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” <i>Public-Key Cryptography - PKC 2015</i>, vol. 9020, Springer, 2015, pp. 101–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>.","ama":"Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash. In: <i>Public-Key Cryptography - PKC 2015</i>. Vol 9020. Springer; 2015:101-124. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_5\">10.1007/978-3-662-46447-2_5</a>","ieee":"F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable e-cash,” in <i>Public-Key Cryptography - PKC 2015</i>, Gaithersburg, MD, United States, 2015, vol. 9020, pp. 101–124.","short":"F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography - PKC 2015, Springer, 2015, pp. 101–124."},"year":"2015","date_updated":"2022-05-23T10:08:37Z","abstract":[{"text":"Cryptographic e-cash allows off-line electronic transactions between a bank, users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions has been proposed in the literature; however, these traditional e-cash schemes only allow coins to be transferred once between users and merchants. Ideally, we would like users to be able to transfer coins between each other multiple times before deposit, as happens with physical cash. “Transferable” e-cash schemes are the solution to this problem. Unfortunately, the currently proposed schemes are either completely impractical or do not achieve the desirable anonymity properties without compromises, such as assuming the existence of a trusted “judge” who can trace all coins and users in the system. This paper presents the first efficient and fully anonymous transferable e-cash scheme without any trusted third parties. We start by revising the security and anonymity properties of transferable e-cash to capture issues that were previously overlooked. For our construction we use the recently proposed malleable signatures by Chase et al. to allow the secure and anonymous transfer of coins, combined with a new efficient double-spending detection mechanism. Finally, we discuss an instantiation of our construction.","lang":"eng"}],"_id":"1651","publication_identifier":{"isbn":["978-3-662-46446-5"]},"oa":1,"status":"public","ec_funded":1,"month":"03","page":"101 - 124","date_created":"2018-12-11T11:53:15Z","publication":"Public-Key Cryptography - PKC 2015","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"type":"conference","publist_id":"5499","article_processing_charge":"No","quality_controlled":"1","volume":9020,"day":"17","acknowledgement":"Work done as an intern in Microsoft Research Redmond and as a student at Brown University, where supported by NSF grant 0964379. Supported by the European Research Council, ERC Starting Grant (259668-PSPC).","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"author":[{"last_name":"Baldimtsi","first_name":"Foteini","full_name":"Baldimtsi, Foteini"},{"full_name":"Chase, Melissa","last_name":"Chase","first_name":"Melissa"},{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg"},{"full_name":"Kohlweiss, Markulf","last_name":"Kohlweiss","first_name":"Markulf"}],"title":"Anonymous transferable e-cash","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"]},{"abstract":[{"text":"We develop new theoretical tools for proving lower-bounds on the (amortized) complexity of certain functions in models of parallel computation. We apply the tools to construct a class of functions with high amortized memory complexity in the parallel Random Oracle Model (pROM); a variant of the standard ROM allowing for batches of simultaneous queries. In particular we obtain a new, more robust, type of Memory-Hard Functions (MHF); a security primitive which has recently been gaining acceptance in practice as an effective means of countering brute-force attacks on security relevant functions. Along the way we also demonstrate an important shortcoming of previous definitions of MHFs and give a new definition addressing the problem. The tools we develop represent an adaptation of the powerful pebbling paradigm (initially introduced by Hewitt and Paterson [HP70] and Cook [Coo73]) to a simple and intuitive parallel setting. We define a simple pebbling game Gp over graphs which aims to abstract parallel computation in an intuitive way. As a conceptual contribution we define a measure of pebbling complexity for graphs called cumulative complexity (CC) and show how it overcomes a crucial shortcoming (in the parallel setting) exhibited by more traditional complexity measures used in the past. As a main technical contribution we give an explicit construction of a constant in-degree family of graphs whose CC in Gp approaches maximality to within a polylogarithmic factor for any graph of equal size (analogous to the graphs of Tarjan et. al. [PTC76, LT82] for sequential pebbling games). Finally, for a given graph G and related function fG, we derive a lower-bound on the amortized memory complexity of fG in the pROM in terms of the CC of G in the game Gp.","lang":"eng"}],"date_updated":"2021-01-12T06:52:16Z","year":"2015","day":"01","author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"full_name":"Serbinenko, Vladimir","first_name":"Vladimir","last_name":"Serbinenko"}],"project":[{"grant_number":"259668","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"_id":"1652","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"ACM","oa":1,"title":"High parallel complexity graphs and memory-hard functions","month":"06","ec_funded":1,"doi":"10.1145/2746539.2746622","conference":{"location":"Portland, OR, United States","end_date":"2015-06-17","name":"STOC: Symposium on the Theory of Computing","start_date":"2015-06-14"},"publication_status":"published","publication":"Proceedings of the 47th annual ACM symposium on Theory of computing","date_created":"2018-12-11T11:53:16Z","page":"595 - 603","oa_version":"Submitted Version","type":"conference","department":[{"_id":"KrPi"}],"date_published":"2015-06-01T00:00:00Z","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/238"}],"publist_id":"5498","scopus_import":1,"quality_controlled":"1","citation":{"mla":"Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>, ACM, 2015, pp. 595–603, doi:<a href=\"https://doi.org/10.1145/2746539.2746622\">10.1145/2746539.2746622</a>.","ista":"Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard functions. Proceedings of the 47th annual ACM symposium on Theory of computing. STOC: Symposium on the Theory of Computing, 595–603.","apa":"Alwen, J. F., &#38; Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In <i>Proceedings of the 47th annual ACM symposium on Theory of computing</i> (pp. 595–603). Portland, OR, United States: ACM. <a href=\"https://doi.org/10.1145/2746539.2746622\">https://doi.org/10.1145/2746539.2746622</a>","chicago":"Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.” In <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>, 595–603. ACM, 2015. <a href=\"https://doi.org/10.1145/2746539.2746622\">https://doi.org/10.1145/2746539.2746622</a>.","ieee":"J. F. Alwen and V. Serbinenko, “High parallel complexity graphs and memory-hard functions,” in <i>Proceedings of the 47th annual ACM symposium on Theory of computing</i>, Portland, OR, United States, 2015, pp. 595–603.","ama":"Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions. In: <i>Proceedings of the 47th Annual ACM Symposium on Theory of Computing</i>. ACM; 2015:595-603. doi:<a href=\"https://doi.org/10.1145/2746539.2746622\">10.1145/2746539.2746622</a>","short":"J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603."}},{"date_published":"2015-12-30T00:00:00Z","oa_version":"Submitted Version","doi":"10.1007/978-3-662-48800-3_4","publication_status":"published","conference":{"end_date":"2015-12-03","location":"Auckland, New Zealand","start_date":"2015-11-29","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"citation":{"chicago":"Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security of NMAC and HMAC with Input Whitening.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">https://doi.org/10.1007/978-3-662-48800-3_4</a>.","apa":"Gazi, P., Pietrzak, K. Z., &#38; Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. <a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">https://doi.org/10.1007/978-3-662-48800-3_4</a>","ista":"Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with input whitening. 9453, 85–109.","mla":"Gazi, Peter, et al. <i>Generic Security of NMAC and HMAC with Input Whitening</i>. Vol. 9453, Springer, 2015, pp. 85–109, doi:<a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">10.1007/978-3-662-48800-3_4</a>.","short":"P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.","ieee":"P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.","ama":"Gazi P, Pietrzak KZ, Tessaro S. Generic security of NMAC and HMAC with input whitening. 2015;9453:85-109. doi:<a href=\"https://doi.org/10.1007/978-3-662-48800-3_4\">10.1007/978-3-662-48800-3_4</a>"},"intvolume":"      9453","ddc":["004","005"],"file_date_updated":"2020-07-14T12:45:08Z","scopus_import":1,"_id":"1654","year":"2015","abstract":[{"lang":"eng","text":"HMAC and its variant NMAC are the most popular approaches to deriving a MAC (and more generally, a PRF) from a cryptographic hash function. Despite nearly two decades of research, their exact security still remains far from understood in many different contexts. Indeed, recent works have re-surfaced interest for {\\em generic} attacks, i.e., attacks that treat the compression function of the underlying hash function as a black box.\r\n\r\nGeneric security can be proved in a model where the underlying compression function is modeled as a random function -- yet, to date, the question of proving tight, non-trivial bounds on the generic security of HMAC/NMAC even as a PRF remains a challenging open question.\r\n\r\nIn this paper, we ask the question of whether a small modification to HMAC and NMAC can allow us to exactly characterize the security of the resulting constructions, while only incurring little penalty with respect to efficiency. To this end, we present simple variants of NMAC and HMAC, for which we prove tight bounds on the generic PRF security, expressed in terms of numbers of construction and compression function queries necessary to break the construction. All of our constructions are obtained via a (near) {\\em black-box} modification of NMAC and HMAC, which can be interpreted as an initial step of key-dependent message pre-processing.\r\n\r\nWhile our focus is on PRF security, a further attractive feature of our new constructions is that they clearly defeat all recent generic attacks against properties such as state recovery and universal forgery. These exploit properties of the so-called ``functional graph'' which are not directly accessible in our new constructions. "}],"date_updated":"2021-01-12T06:52:16Z","ec_funded":1,"month":"12","oa":1,"status":"public","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}],"type":"conference","date_created":"2018-12-11T11:53:17Z","page":"85 - 109","has_accepted_license":"1","quality_controlled":"1","volume":9453,"pubrep_id":"676","publist_id":"5496","file":[{"file_size":512071,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"system","checksum":"d1e53203db2d8573a560995ccdffac62","file_id":"4732","date_created":"2018-12-12T10:09:09Z","file_name":"IST-2016-676-v1+1_881.pdf","date_updated":"2020-07-14T12:45:08Z"}],"author":[{"full_name":"Gazi, Peter","first_name":"Peter","id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","last_name":"Gazi"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"day":"30","series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"title":"Generic security of NMAC and HMAC with input whitening","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer"},{"acknowledgement":"This work was supported by the DFG priority program 1527 (Autonomous Learning) and by the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 318723 (MatheMACS) and from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734.","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"23","author":[{"full_name":"Martius, Georg S","id":"3A276B68-F248-11E8-B48F-1D18A9856A87","last_name":"Martius","first_name":"Georg S"},{"last_name":"Olbrich","first_name":"Eckehard","full_name":"Olbrich, Eckehard"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"file":[{"date_updated":"2020-07-14T12:45:08Z","file_name":"IST-2016-464-v1+1_entropy-17-07266.pdf","date_created":"2018-12-12T10:12:25Z","file_id":"4943","creator":"system","checksum":"945d99631a96e0315acb26dc8541dcf9","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":6455007}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"MDPI","title":"Quantifying emergent behavior of autonomous robots","has_accepted_license":"1","publication":"Entropy","date_created":"2018-12-11T11:53:17Z","page":"7266 - 7297","type":"journal_article","department":[{"_id":"ChLa"},{"_id":"GaTk"}],"language":[{"iso":"eng"}],"pubrep_id":"464","article_processing_charge":"No","publist_id":"5495","volume":17,"quality_controlled":"1","issue":"10","abstract":[{"text":"Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration.","lang":"eng"}],"date_updated":"2023-10-17T11:42:00Z","year":"2015","_id":"1655","status":"public","oa":1,"month":"10","ec_funded":1,"doi":"10.3390/e17107266","publication_status":"published","oa_version":"Published Version","date_published":"2015-10-23T00:00:00Z","scopus_import":"1","file_date_updated":"2020-07-14T12:45:08Z","ddc":["000"],"intvolume":"        17","citation":{"apa":"Martius, G. S., &#38; Olbrich, E. (2015). Quantifying emergent behavior of autonomous robots. <i>Entropy</i>. MDPI. <a href=\"https://doi.org/10.3390/e17107266\">https://doi.org/10.3390/e17107266</a>","mla":"Martius, Georg S., and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” <i>Entropy</i>, vol. 17, no. 10, MDPI, 2015, pp. 7266–97, doi:<a href=\"https://doi.org/10.3390/e17107266\">10.3390/e17107266</a>.","ista":"Martius GS, Olbrich E. 2015. Quantifying emergent behavior of autonomous robots. Entropy. 17(10), 7266–7297.","chicago":"Martius, Georg S, and Eckehard Olbrich. “Quantifying Emergent Behavior of Autonomous Robots.” <i>Entropy</i>. MDPI, 2015. <a href=\"https://doi.org/10.3390/e17107266\">https://doi.org/10.3390/e17107266</a>.","ieee":"G. S. Martius and E. Olbrich, “Quantifying emergent behavior of autonomous robots,” <i>Entropy</i>, vol. 17, no. 10. MDPI, pp. 7266–7297, 2015.","ama":"Martius GS, Olbrich E. Quantifying emergent behavior of autonomous robots. <i>Entropy</i>. 2015;17(10):7266-7297. doi:<a href=\"https://doi.org/10.3390/e17107266\">10.3390/e17107266</a>","short":"G.S. Martius, E. Olbrich, Entropy 17 (2015) 7266–7297."}},{"status":"public","month":"07","ec_funded":1,"abstract":[{"lang":"eng","text":"Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties."}],"arxiv":1,"date_updated":"2023-02-23T12:26:19Z","year":"2015","article_number":"7174926","_id":"1656","scopus_import":1,"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” In <i>Proceedings - Symposium on Logic in Computer Science</i>, Vol. 2015–July. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.72\">https://doi.org/10.1109/LICS.2015.72</a>.","ista":"Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174926.","mla":"Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” <i>Proceedings - Symposium on Logic in Computer Science</i>, vol. 2015–July, 7174926, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/LICS.2015.72\">10.1109/LICS.2015.72</a>.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2015). Nested weighted automata. In <i>Proceedings - Symposium on Logic in Computer Science</i> (Vol. 2015–July). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.72\">https://doi.org/10.1109/LICS.2015.72</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. In: <i>Proceedings - Symposium on Logic in Computer Science</i>. Vol 2015-July. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/LICS.2015.72\">10.1109/LICS.2015.72</a>","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in <i>Proceedings - Symposium on Logic in Computer Science</i>, Kyoto, Japan, 2015, vol. 2015–July.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015."},"doi":"10.1109/LICS.2015.72","publication_status":"published","conference":{"name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10"},"oa_version":"None","date_published":"2015-07-31T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"IEEE","title":"Nested weighted automata","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE), Z211-N23 (Wittgenstein Award), FWF Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.\r\nA Technical Report of the paper is available at: \r\nhttps://repository.ist.ac.at/331/\r\n","day":"31","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Otop","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Otop, Jan"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"publist_id":"5494","quality_controlled":"1","volume":"2015-July","external_id":{"arxiv":["1606.03598"]},"related_material":{"record":[{"relation":"later_version","status":"public","id":"467"},{"status":"public","relation":"earlier_version","id":"5415"},{"status":"public","relation":"earlier_version","id":"5436"}]},"publication":"Proceedings - Symposium on Logic in Computer Science","date_created":"2018-12-11T11:53:17Z","type":"conference","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"language":[{"iso":"eng"}]},{"series_title":"LICS","alternative_title":["LICS"],"title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","publisher":"IEEE","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Zuzana","last_name":"Komárková","full_name":"Komárková, Zuzana"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","first_name":"Jan","orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan"}],"day":"01","acknowledgement":"A Technical Report of this paper is available at:  https://repository.ist.ac.at/327\r\n","related_material":{"record":[{"id":"466","relation":"later_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5429"},{"id":"5435","relation":"earlier_version","status":"public"}]},"quality_controlled":"1","publist_id":"5493","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","page":"244 - 256","date_created":"2018-12-11T11:53:18Z","ec_funded":1,"month":"07","status":"public","_id":"1657","year":"2015","date_updated":"2023-02-23T12:26:16Z","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. ","lang":"eng"}],"citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","apa":"Chatterjee, K., Komárková, Z., &#38; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IEEE, 2015, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>.","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256."},"scopus_import":1,"date_published":"2015-07-01T00:00:00Z","oa_version":"None","publication_status":"published","conference":{"end_date":"2015-07-10","location":"Kyoto, Japan","start_date":"2015-07-06","name":"LICS: Logic in Computer Science"},"doi":"10.1109/LICS.2015.32"},{"ec_funded":1,"month":"09","status":"public","_id":"1658","year":"2015","abstract":[{"text":"Continuous-time Markov chain (CTMC) models have become a central tool for understanding the dynamics of complex reaction networks and the importance of stochasticity in the underlying biochemical processes. When such models are employed to answer questions in applications, in order to ensure that the model provides a sufficiently accurate representation of the real system, it is of vital importance that the model parameters are inferred from real measured data. This, however, is often a formidable task and all of the existing methods fail in one case or the other, usually because the underlying CTMC model is high-dimensional and computationally difficult to analyze. The parameter inference methods that tend to scale best in the dimension of the CTMC are based on so-called moment closure approximations. However, there exists a large number of different moment closure approximations and it is typically hard to say a priori which of the approximations is the most suitable for the inference procedure. Here, we propose a moment-based parameter inference method that automatically chooses the most appropriate moment closure method. Accordingly, contrary to existing methods, the user is not required to be experienced in moment closure techniques. In addition to that, our method adaptively changes the approximation during the parameter inference to ensure that always the best approximation is used, even in cases where different approximations are best in different regions of the parameter space.","lang":"eng"}],"date_updated":"2023-02-21T16:17:24Z","intvolume":"      9308","citation":{"ieee":"S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive moment closure for parameter inference of biochemical reaction networks,” vol. 9308. Springer, pp. 77–89, 2015.","ama":"Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. Adaptive moment closure for parameter inference of biochemical reaction networks. 2015;9308:77-89. doi:<a href=\"https://doi.org/10.1007/978-3-319-23401-4_8\">10.1007/978-3-319-23401-4_8</a>","short":"S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, C. Schilling, 9308 (2015) 77–89.","mla":"Bogomolov, Sergiy, et al. <i>Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks</i>. Vol. 9308, Springer, 2015, pp. 77–89, doi:<a href=\"https://doi.org/10.1007/978-3-319-23401-4_8\">10.1007/978-3-319-23401-4_8</a>.","ista":"Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. 2015. Adaptive moment closure for parameter inference of biochemical reaction networks. 9308, 77–89.","apa":"Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., &#38; Schilling, C. (2015). Adaptive moment closure for parameter inference of biochemical reaction networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-23401-4_8\">https://doi.org/10.1007/978-3-319-23401-4_8</a>","chicago":"Bogomolov, Sergiy, Thomas A Henzinger, Andreas Podelski, Jakob Ruess, and Christian Schilling. “Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-23401-4_8\">https://doi.org/10.1007/978-3-319-23401-4_8</a>."},"scopus_import":1,"date_published":"2015-09-01T00:00:00Z","oa_version":"None","doi":"10.1007/978-3-319-23401-4_8","publication_status":"published","conference":{"start_date":"2015-09-16","name":"CMSB: Computational Methods in Systems Biology","end_date":"2015-09-18","location":"Nantes, France"},"series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"title":"Adaptive moment closure for parameter inference of biochemical reaction networks","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","author":[{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","first_name":"Sergiy","orcid":"0000-0002-0686-0365"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Podelski","first_name":"Andreas","full_name":"Podelski, Andreas"},{"orcid":"0000-0003-1615-3282","first_name":"Jakob","last_name":"Ruess","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","full_name":"Ruess, Jakob"},{"full_name":"Schilling, Christian","last_name":"Schilling","first_name":"Christian"}],"project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme"}],"day":"01","related_material":{"record":[{"status":"public","relation":"later_version","id":"1148"}]},"volume":9308,"quality_controlled":"1","publist_id":"5492","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"language":[{"iso":"eng"}],"type":"conference","page":"77 - 89","date_created":"2018-12-11T11:53:18Z"}]