[{"publist_id":"6115","type":"journal_article","status":"public","scopus_import":1,"title":"Bulk universality for deformed wigner matrices","page":"2349 - 2425","issue":"3","ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1405.6634"}],"date_updated":"2021-01-12T06:49:10Z","oa":1,"language":[{"iso":"eng"}],"volume":44,"date_created":"2018-12-11T11:50:47Z","abstract":[{"lang":"eng","text":"We consider N×N random matrices of the form H = W + V where W is a real symmetric or complex Hermitian Wigner matrix and V is a random or deterministic, real, diagonal matrix whose entries are independent of W. We assume subexponential decay for the matrix entries of W, and we choose V so that the eigenvalues ofW and V are typically of the same order. For a large class of diagonal matrices V , we show that the local statistics in the bulk of the spectrum are universal in the limit of large N."}],"department":[{"_id":"LaEr"}],"citation":{"ama":"Lee J, Schnelli K, Stetler B, Yau H. Bulk universality for deformed wigner matrices. <i>Annals of Probability</i>. 2016;44(3):2349-2425. doi:<a href=\"https://doi.org/10.1214/15-AOP1023\">10.1214/15-AOP1023</a>","apa":"Lee, J., Schnelli, K., Stetler, B., &#38; Yau, H. (2016). Bulk universality for deformed wigner matrices. <i>Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/15-AOP1023\">https://doi.org/10.1214/15-AOP1023</a>","short":"J. Lee, K. Schnelli, B. Stetler, H. Yau, Annals of Probability 44 (2016) 2349–2425.","ieee":"J. Lee, K. Schnelli, B. Stetler, and H. Yau, “Bulk universality for deformed wigner matrices,” <i>Annals of Probability</i>, vol. 44, no. 3. Institute of Mathematical Statistics, pp. 2349–2425, 2016.","mla":"Lee, Jioon, et al. “Bulk Universality for Deformed Wigner Matrices.” <i>Annals of Probability</i>, vol. 44, no. 3, Institute of Mathematical Statistics, 2016, pp. 2349–425, doi:<a href=\"https://doi.org/10.1214/15-AOP1023\">10.1214/15-AOP1023</a>.","chicago":"Lee, Jioon, Kevin Schnelli, Ben Stetler, and Horngtzer Yau. “Bulk Universality for Deformed Wigner Matrices.” <i>Annals of Probability</i>. Institute of Mathematical Statistics, 2016. <a href=\"https://doi.org/10.1214/15-AOP1023\">https://doi.org/10.1214/15-AOP1023</a>.","ista":"Lee J, Schnelli K, Stetler B, Yau H. 2016. Bulk universality for deformed wigner matrices. Annals of Probability. 44(3), 2349–2425."},"day":"01","publisher":"Institute of Mathematical Statistics","_id":"1219","doi":"10.1214/15-AOP1023","year":"2016","oa_version":"Preprint","project":[{"name":"Random matrices, universality and disordered quantum systems","grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","publication":"Annals of Probability","date_published":"2016-01-01T00:00:00Z","acknowledgement":"J.C. was supported in part by National Research Foundation of Korea Grant 2011-0013474 and TJ Park Junior Faculty Fellowship.\r\nK.S. was supported by ERC Advanced Grant RANMAT, No. 338804, and the \"Fund for Math.\"\r\nB.S. was supported by NSF GRFP Fellowship DGE-1144152.\r\nH.Y. was supported in part by NSF Grant DMS-13-07444 and Simons investigator fellowship. We thank Paul Bourgade, László Erd ̋os and Antti Knowles for helpful comments. We are grateful to the Taida Institute for Mathematical\r\nSciences and National Taiwan Universality for their hospitality during part of this\r\nresearch. We thank Thomas Spencer and the Institute for Advanced Study for their\r\nhospitality during the academic year 2013–2014.  ","quality_controlled":"1","month":"01","intvolume":"        44","author":[{"first_name":"Jioon","full_name":"Lee, Jioon","last_name":"Lee"},{"id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","last_name":"Schnelli","first_name":"Kevin","full_name":"Schnelli, Kevin","orcid":"0000-0003-0954-3231"},{"full_name":"Stetler, Ben","first_name":"Ben","last_name":"Stetler"},{"full_name":"Yau, Horngtzer","first_name":"Horngtzer","last_name":"Yau"}]},{"day":"03","publisher":"American Physiological Society","_id":"122","citation":{"apa":"Waitukaitis, S. R., &#38; Van Hecke, M. (2016). Origami building blocks: Generic and special four-vertices. <i>Physical Review E - Statistical, Nonlinear, and Soft Matter Physics</i>. American Physiological Society. <a href=\"https://doi.org/10.1103/PhysRevE.93.023003\">https://doi.org/10.1103/PhysRevE.93.023003</a>","ama":"Waitukaitis SR, Van Hecke M. Origami building blocks: Generic and special four-vertices. <i>Physical Review E - Statistical, Nonlinear, and Soft Matter Physics</i>. 2016;93(2). doi:<a href=\"https://doi.org/10.1103/PhysRevE.93.023003\">10.1103/PhysRevE.93.023003</a>","short":"S.R. Waitukaitis, M. Van Hecke, Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 93 (2016).","mla":"Waitukaitis, Scott R., and Martin Van Hecke. “Origami Building Blocks: Generic and Special Four-Vertices.” <i>Physical Review E - Statistical, Nonlinear, and Soft Matter Physics</i>, vol. 93, no. 2, 023003, American Physiological Society, 2016, doi:<a href=\"https://doi.org/10.1103/PhysRevE.93.023003\">10.1103/PhysRevE.93.023003</a>.","ista":"Waitukaitis SR, Van Hecke M. 2016. Origami building blocks: Generic and special four-vertices. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics. 93(2), 023003.","chicago":"Waitukaitis, Scott R, and Martin Van Hecke. “Origami Building Blocks: Generic and Special Four-Vertices.” <i>Physical Review E - Statistical, Nonlinear, and Soft Matter Physics</i>. American Physiological Society, 2016. <a href=\"https://doi.org/10.1103/PhysRevE.93.023003\">https://doi.org/10.1103/PhysRevE.93.023003</a>.","ieee":"S. R. Waitukaitis and M. Van Hecke, “Origami building blocks: Generic and special four-vertices,” <i>Physical Review E - Statistical, Nonlinear, and Soft Matter Physics</i>, vol. 93, no. 2. American Physiological Society, 2016."},"date_created":"2018-12-11T11:44:44Z","volume":93,"abstract":[{"lang":"eng","text":"Four rigid panels connected by hinges that meet at a point form a four-vertex, the fundamental building block of origami metamaterials. Most materials designed so far are based on the same four-vertex geometry, and little is known regarding how different geometries affect folding behavior. Here we systematically categorize and analyze the geometries and resulting folding motions of Euclidean four-vertices. Comparing the relative sizes of sector angles, we identify three types of generic vertices and two accompanying subtypes. We determine which folds can fully close and the possible mountain-valley assignments. Next, we consider what occurs when sector angles or sums thereof are set equal, which results in 16 special vertex types. One of these, flat-foldable vertices, has been studied extensively, but we show that a wide variety of qualitatively different folding motions exist for the other 15 special and 3 generic types. Our work establishes a straightforward set of rules for understanding the folding motion of both generic and special four-vertices and serves as a roadmap for designing origami metamaterials."}],"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1507.08442","open_access":"1"}],"date_updated":"2021-01-12T06:49:10Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","issue":"2","status":"public","title":"Origami building blocks: Generic and special four-vertices","type":"journal_article","publist_id":"7932","extern":"1","intvolume":"        93","author":[{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","last_name":"Waitukaitis"},{"last_name":"Van Hecke","full_name":"Van Hecke, Martin","first_name":"Martin"}],"month":"02","article_number":"023003","quality_controlled":"1","arxiv":1,"acknowledgement":"This work is part of the research programme of the Foundation for Fundamental Research on Matter (FOM), which is part of the Netherlands Organisation for Scientific Research (NWO).","date_published":"2016-02-03T00:00:00Z","external_id":{"arxiv":["1507.08442"]},"publication":"Physical Review E - Statistical, Nonlinear, and Soft Matter Physics","publication_status":"published","oa_version":"Preprint","year":"2016","doi":"10.1103/PhysRevE.93.023003"},{"doi":"10.2514/6.2016-3764","publist_id":"6114","type":"conference","page":"1 - 19","title":"Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency","status":"public","year":"2016","scopus_import":1,"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Theoretical and numerical aspects of aerodynamic efficiency of propulsion systems coupled to the boundary layer of a fuselage are studied. We discuss the effects of local flow fields, which are affected both by conservative flow acceleration as well as total pressure losses, on the efficiency of boundary layer immersed propulsion devices. We introduce the concept of a boundary layer retardation turbine that helps reduce skin friction over the fuselage. We numerically investigate efficiency gains offered by boundary layer and wake interacting devices. We discuss the results in terms of a total energy consumption framework and show that efficiency gains of any device depend on all the other elements of the propulsion system."}],"date_created":"2018-12-11T11:50:47Z","main_file_link":[{"url":"https://ntrs.nasa.gov/search.jsp?R=20160010167&amp;hterms=Fuselage+boundary+layer+ingestion+propulsion+applied+thin+haul+commuter+aircraft+optimal+efficiency&amp;qs=N%3D0%26Ntk%3DAll%26Ntt%3DFuselage%2520boundary%2520layer%2520ingestion%2520propulsion%2520applied%2520to%2520a%2520thin%2520haul%2520commuter%2520aircraft%2520for%2520optimal%2520efficiency%26Ntx%3Dmode%2520matchallpartial%26Nm%3D123%7CCollection%7CNASA%2520STI%7C%7C17%7CCollection%7CNACA","open_access":"1"}],"date_updated":"2023-02-21T10:17:50Z","oa":1,"date_published":"2016-06-01T00:00:00Z","conference":{"start_date":"2016-06-13","end_date":"2016-06-17","name":"AIAA: Aviation Technology, Integration, and Operations Conference","location":"Washington, D.C., USA"},"citation":{"apa":"Mikić, G., Stoll, A., Bevirt, J., Grah, R., &#38; Moore, M. (2016). Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency (pp. 1–19). Presented at the AIAA: Aviation Technology, Integration, and Operations Conference, Washington, D.C., USA: AIAA. <a href=\"https://doi.org/10.2514/6.2016-3764\">https://doi.org/10.2514/6.2016-3764</a>","ama":"Mikić G, Stoll A, Bevirt J, Grah R, Moore M. Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency. In: AIAA; 2016:1-19. doi:<a href=\"https://doi.org/10.2514/6.2016-3764\">10.2514/6.2016-3764</a>","short":"G. Mikić, A. Stoll, J. Bevirt, R. Grah, M. Moore, in:, AIAA, 2016, pp. 1–19.","chicago":"Mikić, Gregor, Alex Stoll, Joe Bevirt, Rok Grah, and Mark Moore. “Fuselage Boundary Layer Ingestion Propulsion Applied to a Thin Haul Commuter Aircraft for Optimal Efficiency,” 1–19. AIAA, 2016. <a href=\"https://doi.org/10.2514/6.2016-3764\">https://doi.org/10.2514/6.2016-3764</a>.","ista":"Mikić G, Stoll A, Bevirt J, Grah R, Moore M. 2016. Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency. AIAA: Aviation Technology, Integration, and Operations Conference, 1–19.","mla":"Mikić, Gregor, et al. <i>Fuselage Boundary Layer Ingestion Propulsion Applied to a Thin Haul Commuter Aircraft for Optimal Efficiency</i>. AIAA, 2016, pp. 1–19, doi:<a href=\"https://doi.org/10.2514/6.2016-3764\">10.2514/6.2016-3764</a>.","ieee":"G. Mikić, A. Stoll, J. Bevirt, R. Grah, and M. Moore, “Fuselage boundary layer ingestion propulsion applied to a thin haul commuter aircraft for optimal efficiency,” presented at the AIAA: Aviation Technology, Integration, and Operations Conference, Washington, D.C., USA, 2016, pp. 1–19."},"month":"06","author":[{"first_name":"Gregor","full_name":"Mikić, Gregor","last_name":"Mikić"},{"last_name":"Stoll","full_name":"Stoll, Alex","first_name":"Alex"},{"first_name":"Joe","full_name":"Bevirt, Joe","last_name":"Bevirt"},{"full_name":"Grah, Rok","first_name":"Rok","orcid":"0000-0003-2539-3560","last_name":"Grah","id":"483E70DE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Moore","full_name":"Moore, Mark","first_name":"Mark"}],"publisher":"AIAA","_id":"1220","day":"01","quality_controlled":"1","department":[{"_id":"CaGu"},{"_id":"GaTk"}]},{"acknowledgement":"This work was supported by ERC Independent Research grant (ERC-2011-StG-20101109-PSDP to JF). JM internship was supported by the grant “Action Austria – Slovakia”. MG was supported by the scholarship \"Stipendien der Stipendienstiftung der Republik Österreich\". Work by EH and CPR were supported by ANR blanc ANR-14-CE11-0018. We would like to thank Mark Estelle and Yunde Zhao for provid\r\n-\r\ning \r\nabp1-c1\r\n, \r\nabp1-TD1 \r\nand \r\nabp1-WTc1 \r\nseeds. We thank Emeline \r\nHuault for technical assistance.","date_published":"2016-01-20T00:00:00Z","publication":"F1000 Research ","month":"01","intvolume":"         5","author":[{"id":"483727CA-F248-11E8-B48F-1D18A9856A87","last_name":"Michalko","first_name":"Jaroslav","full_name":"Michalko, Jaroslav"},{"orcid":"0000-0003-0619-7783","first_name":"Matous","full_name":"Glanc, Matous","id":"1AE1EA24-02D0-11E9-9BAA-DAF4881429F2","last_name":"Glanc"},{"full_name":"Perrot Rechenmann, Catherine","first_name":"Catherine","last_name":"Perrot Rechenmann"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","full_name":"Friml, Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"article_number":"86","quality_controlled":"1","ddc":["581"],"year":"2016","doi":"10.12688/f1000research.7654.1","has_accepted_license":"1","file":[{"file_id":"5154","date_updated":"2020-07-14T12:44:39Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:15:33Z","file_name":"IST-2016-711-v1+1_770cf1e0-612f-4e85-a500-54b6349fbbab_7654_-_jaroslav_michalko.pdf","creator":"system","file_size":2990459,"checksum":"c9e50bb6096a7ba4a832969935820f19"}],"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"article_processing_charge":"No","oa_version":"Published Version","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"The Auxin Binding Protein 1 (ABP1) is one of the most studied proteins in plants. Since decades ago, it has been the prime receptor candidate for the plant hormone auxin with a plethora of described functions in auxin signaling and development. The developmental importance of ABP1 has recently been questioned by identification of Arabidopsis thaliana abp1 knock-out alleles that show no obvious phenotypes under normal growth conditions. In this study, we examined the contradiction between the normal growth and development of the abp1 knock-outs and the strong morphological defects observed in three different ethanol-inducible abp1 knock-down mutants ( abp1-AS, SS12K, SS12S). By analyzing segregating populations of abp1 knock-out vs. abp1 knock-down crosses we show that the strong morphological defects that were believed to be the result of conditional down-regulation of ABP1 can be reproduced also in the absence of the functional ABP1 protein. This data suggests that the phenotypes in abp1 knock-down lines are due to the off-target effects and asks for further reflections on the biological function of ABP1 or alternative explanations for the missing phenotypic defects in the abp1 loss-of-function alleles.","lang":"eng"}],"volume":5,"date_created":"2018-12-11T11:50:47Z","language":[{"iso":"eng"}],"oa":1,"date_updated":"2025-05-07T11:12:30Z","article_type":"original","_id":"1221","pubrep_id":"711","publisher":"F1000 Research","day":"20","citation":{"mla":"Michalko, Jaroslav, et al. “Strong Morphological Defects in Conditional Arabidopsis Abp1 Knock-down Mutants Generated in Absence of Functional ABP1 Protein.” <i>F1000 Research </i>, vol. 5, 86, F1000 Research, 2016, doi:<a href=\"https://doi.org/10.12688/f1000research.7654.1\">10.12688/f1000research.7654.1</a>.","chicago":"Michalko, Jaroslav, Matous Glanc, Catherine Perrot Rechenmann, and Jiří Friml. “Strong Morphological Defects in Conditional Arabidopsis Abp1 Knock-down Mutants Generated in Absence of Functional ABP1 Protein.” <i>F1000 Research </i>. F1000 Research, 2016. <a href=\"https://doi.org/10.12688/f1000research.7654.1\">https://doi.org/10.12688/f1000research.7654.1</a>.","ista":"Michalko J, Glanc M, Perrot Rechenmann C, Friml J. 2016. Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. F1000 Research . 5, 86.","ieee":"J. Michalko, M. Glanc, C. Perrot Rechenmann, and J. Friml, “Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein,” <i>F1000 Research </i>, vol. 5. F1000 Research, 2016.","short":"J. Michalko, M. Glanc, C. Perrot Rechenmann, J. Friml, F1000 Research  5 (2016).","apa":"Michalko, J., Glanc, M., Perrot Rechenmann, C., &#38; Friml, J. (2016). Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. <i>F1000 Research </i>. F1000 Research. <a href=\"https://doi.org/10.12688/f1000research.7654.1\">https://doi.org/10.12688/f1000research.7654.1</a>","ama":"Michalko J, Glanc M, Perrot Rechenmann C, Friml J. Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein. <i>F1000 Research </i>. 2016;5. doi:<a href=\"https://doi.org/10.12688/f1000research.7654.1\">10.12688/f1000research.7654.1</a>"},"department":[{"_id":"JiFr"}],"title":"Strong morphological defects in conditional Arabidopsis abp1 knock-down mutants generated in absence of functional ABP1 protein","scopus_import":"1","status":"public","type":"journal_article","publist_id":"6113","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:44:39Z","ec_funded":1},{"issue":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Optimal packings of congruent circles on a square flat torus","scopus_import":1,"page":"1 - 20","publist_id":"6111","type":"journal_article","department":[{"_id":"HeEd"}],"day":"01","publisher":"Springer","_id":"1222","citation":{"apa":"Musin, O., &#38; Nikitenko, A. (2016). Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>","ama":"Musin O, Nikitenko A. Optimal packings of congruent circles on a square flat torus. <i>Discrete &#38; Computational Geometry</i>. 2016;55(1):1-20. doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>","short":"O. Musin, A. Nikitenko, Discrete &#38; Computational Geometry 55 (2016) 1–20.","mla":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1, Springer, 2016, pp. 1–20, doi:<a href=\"https://doi.org/10.1007/s00454-015-9742-6\">10.1007/s00454-015-9742-6</a>.","chicago":"Musin, Oleg, and Anton Nikitenko. “Optimal Packings of Congruent Circles on a Square Flat Torus.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/s00454-015-9742-6\">https://doi.org/10.1007/s00454-015-9742-6</a>.","ista":"Musin O, Nikitenko A. 2016. Optimal packings of congruent circles on a square flat torus. Discrete &#38; Computational Geometry. 55(1), 1–20.","ieee":"O. Musin and A. Nikitenko, “Optimal packings of congruent circles on a square flat torus,” <i>Discrete &#38; Computational Geometry</i>, vol. 55, no. 1. Springer, pp. 1–20, 2016."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1212.0649"}],"date_updated":"2021-01-12T06:49:11Z","volume":55,"abstract":[{"text":"We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.","lang":"eng"}],"date_created":"2018-12-11T11:50:48Z","language":[{"iso":"eng"}],"oa_version":"Preprint","publication_status":"published","year":"2016","doi":"10.1007/s00454-015-9742-6","quality_controlled":"1","author":[{"last_name":"Musin","first_name":"Oleg","full_name":"Musin, Oleg"},{"id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko","first_name":"Anton","full_name":"Nikitenko, Anton"}],"month":"01","intvolume":"        55","date_published":"2016-01-01T00:00:00Z","publication":"Discrete & Computational Geometry","acknowledgement":"We wish to thank Alexey Tarasov, Vladislav Volkov and Brittany Fasy for some useful comments and remarks, and especially Thom Sulanke for modifying surftri to suit our purposes. Oleg R. Musin was partially supported by the NSF Grant DMS-1400876 and by the RFBR Grant 15-01-99563. Anton V. Nikitenko was supported by the Chebyshev Laboratory (Department of Mathematics and Mechanics, St. Petersburg State University) under RF Government Grant 11.G34.31.0026."},{"issue":"3","oa_version":"Preprint","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"557 - 600","year":"2016","status":"public","title":"Localization for transversally periodic random potentials on binary trees","scopus_import":1,"doi":"10.4171/JST/132","type":"journal_article","publist_id":"6112","department":[{"_id":"LaEr"}],"quality_controlled":"1","_id":"1223","publisher":"European Mathematical Society","day":"01","citation":{"ama":"Froese R, Lee D, Sadel C, Spitzer W, Stolz G. Localization for transversally periodic random potentials on binary trees. <i>Journal of Spectral Theory</i>. 2016;6(3):557-600. doi:<a href=\"https://doi.org/10.4171/JST/132\">10.4171/JST/132</a>","apa":"Froese, R., Lee, D., Sadel, C., Spitzer, W., &#38; Stolz, G. (2016). Localization for transversally periodic random potentials on binary trees. <i>Journal of Spectral Theory</i>. European Mathematical Society. <a href=\"https://doi.org/10.4171/JST/132\">https://doi.org/10.4171/JST/132</a>","short":"R. Froese, D. Lee, C. Sadel, W. Spitzer, G. Stolz, Journal of Spectral Theory 6 (2016) 557–600.","ieee":"R. Froese, D. Lee, C. Sadel, W. Spitzer, and G. Stolz, “Localization for transversally periodic random potentials on binary trees,” <i>Journal of Spectral Theory</i>, vol. 6, no. 3. European Mathematical Society, pp. 557–600, 2016.","mla":"Froese, Richard, et al. “Localization for Transversally Periodic Random Potentials on Binary Trees.” <i>Journal of Spectral Theory</i>, vol. 6, no. 3, European Mathematical Society, 2016, pp. 557–600, doi:<a href=\"https://doi.org/10.4171/JST/132\">10.4171/JST/132</a>.","chicago":"Froese, Richard, Darrick Lee, Christian Sadel, Wolfgang Spitzer, and Günter Stolz. “Localization for Transversally Periodic Random Potentials on Binary Trees.” <i>Journal of Spectral Theory</i>. European Mathematical Society, 2016. <a href=\"https://doi.org/10.4171/JST/132\">https://doi.org/10.4171/JST/132</a>.","ista":"Froese R, Lee D, Sadel C, Spitzer W, Stolz G. 2016. Localization for transversally periodic random potentials on binary trees. Journal of Spectral Theory. 6(3), 557–600."},"author":[{"full_name":"Froese, Richard","first_name":"Richard","last_name":"Froese"},{"full_name":"Lee, Darrick","first_name":"Darrick","last_name":"Lee"},{"last_name":"Sadel","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","full_name":"Sadel, Christian","orcid":"0000-0001-8255-3968"},{"full_name":"Spitzer, Wolfgang","first_name":"Wolfgang","last_name":"Spitzer"},{"full_name":"Stolz, Günter","first_name":"Günter","last_name":"Stolz"}],"intvolume":"         6","month":"01","oa":1,"date_published":"2016-01-01T00:00:00Z","date_updated":"2021-01-12T06:49:12Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1408.3961"}],"publication":"Journal of Spectral Theory","abstract":[{"lang":"eng","text":"We consider a random Schrödinger operator on the binary tree with a random potential which is the sum of a random radially symmetric potential, Qr, and a random transversally periodic potential, κQt, with coupling constant κ. Using a new one-dimensional dynamical systems approach combined with Jensen's inequality in hyperbolic space (our key estimate) we obtain a fractional moment estimate proving localization for small and large κ. Together with a previous result we therefore obtain a model with two Anderson transitions, from localization to delocalization and back to localization, when increasing κ. As a by-product we also have a partially new proof of one-dimensional Anderson localization at any disorder."}],"date_created":"2018-12-11T11:50:48Z","volume":6,"language":[{"iso":"eng"}]},{"department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"citation":{"ieee":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical round-optimal blind signatures in the standard model from weaker assumptions,” presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016, vol. 9841, pp. 391–408.","ista":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal blind signatures in the standard model from weaker assumptions. SCN: Security and Cryptography for Networks, LNCS, vol. 9841, 391–408.","mla":"Fuchsbauer, Georg, et al. <i>Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions</i>. Vol. 9841, Springer, 2016, pp. 391–408, doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>.","chicago":"Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,” 9841:391–408. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>.","ama":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>","apa":"Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., &#38; Slamanig, D. (2016). Practical round-optimal blind signatures in the standard model from weaker assumptions (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>","short":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408."},"day":"11","publisher":"Springer","_id":"1225","date_updated":"2023-02-23T10:08:16Z","main_file_link":[{"url":"https://eprint.iacr.org/2016/662","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"volume":9841,"abstract":[{"lang":"eng","text":"At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient roundoptimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme."}],"date_created":"2018-12-11T11:50:49Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"6109","type":"conference","status":"public","scopus_import":1,"title":"Practical round-optimal blind signatures in the standard model from weaker assumptions","page":"391 - 408","quality_controlled":"1","intvolume":"      9841","author":[{"first_name":"Georg","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer"},{"last_name":"Hanser","full_name":"Hanser, Christian","first_name":"Christian"},{"id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan","first_name":"Chethan"},{"last_name":"Slamanig","full_name":"Slamanig, Daniel","first_name":"Daniel"}],"month":"08","conference":{"end_date":"2016-09-02","start_date":"2016-08-31","name":"SCN: Security and Cryptography for Networks","location":"Amalfi, Italy"},"date_published":"2016-08-11T00:00:00Z","oa_version":"Submitted Version","project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"},{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","grant_number":"682815"}],"publication_status":"published","doi":"10.1007/978-3-319-44618-9_21","year":"2016","related_material":{"record":[{"id":"1647","relation":"earlier_version","status":"public"}]}},{"doi":"10.1038/nature19794","year":"2016","article_processing_charge":"No","publication_status":"published","oa_version":"Submitted Version","project":[{"_id":"2593EBD6-B435-11E9-9278-68D0E5697425","name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (FEBS)"},{"name":"Atomic-Resolution Structures of Mitochondrial Respiratory Chain Supercomplexes (H2020)","grant_number":"701309","call_identifier":"H2020","_id":"2590DB08-B435-11E9-9278-68D0E5697425"}],"pmid":1,"publication":"Nature","external_id":{"pmid":["27595392"]},"date_published":"2016-10-20T00:00:00Z","intvolume":"       538","month":"10","author":[{"first_name":"Karol","full_name":"Fiedorczuk, Karol","id":"5BFF67CE-02D1-11E9-B11A-A5A4D7DFFFD0","last_name":"Fiedorczuk"},{"first_name":"James A","full_name":"Letts, James A","orcid":"0000-0002-9864-3586","last_name":"Letts","id":"322DA418-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Gianluca","full_name":"Degliesposti, Gianluca","last_name":"Degliesposti"},{"first_name":"Karol","full_name":"Kaszuba, Karol","id":"3FDF9472-F248-11E8-B48F-1D18A9856A87","last_name":"Kaszuba"},{"full_name":"Skehel, Mark","first_name":"Mark","last_name":"Skehel"},{"last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0977-7989","first_name":"Leonid A","full_name":"Sazanov, Leonid A"}],"quality_controlled":"1","type":"journal_article","publist_id":"6108","scopus_import":1,"status":"public","title":"Atomic structure of the entire mammalian mitochondrial complex i","page":"406 - 410","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"7625","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:49Z","abstract":[{"lang":"eng","text":"Mitochondrial complex I (also known as NADH:ubiquinone oxidoreductase) contributes to cellular energy production by transferring electrons from NADH to ubiquinone coupled to proton translocation across the membrane. It is the largest protein assembly of the respiratory chain with a total mass of 970 kilodaltons. Here we present a nearly complete atomic structure of ovine (Ovis aries) mitochondrial complex I at 3.9 Å resolution, solved by cryo-electron microscopy with cross-linking and mass-spectrometry mapping experiments. All 14 conserved core subunits and 31 mitochondria-specific supernumerary subunits are resolved within the L-shaped molecule. The hydrophilic matrix arm comprises flavin mononucleotide and 8 iron-sulfur clusters involved in electron transfer, and the membrane arm contains 78 transmembrane helices, mostly contributed by antiporter-like subunits involved in proton translocation. Supernumerary subunits form an interlinked, stabilizing shell around the conserved core. Tightly bound lipids (including cardiolipins) further stabilize interactions between the hydrophobic subunits. Subunits with possible regulatory roles contain additional cofactors, NADPH and two phosphopantetheine molecules, which are shown to be involved in inter-subunit interactions. We observe two different conformations of the complex, which may be related to the conformationally driven coupling mechanism and to the active-deactive transition of the enzyme. Our structure provides insight into the mechanism, assembly, maturation and dysfunction of mitochondrial complex I, and allows detailed molecular analysis of disease-causing mutations."}],"volume":538,"date_updated":"2021-01-12T06:49:13Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5164932/","open_access":"1"}],"article_type":"original","oa":1,"citation":{"ama":"Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. Atomic structure of the entire mammalian mitochondrial complex i. <i>Nature</i>. 2016;538(7625):406-410. doi:<a href=\"https://doi.org/10.1038/nature19794\">10.1038/nature19794</a>","apa":"Fiedorczuk, K., Letts, J. A., Degliesposti, G., Kaszuba, K., Skehel, M., &#38; Sazanov, L. A. (2016). Atomic structure of the entire mammalian mitochondrial complex i. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/nature19794\">https://doi.org/10.1038/nature19794</a>","short":"K. Fiedorczuk, J.A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, L.A. Sazanov, Nature 538 (2016) 406–410.","ieee":"K. Fiedorczuk, J. A. Letts, G. Degliesposti, K. Kaszuba, M. Skehel, and L. A. Sazanov, “Atomic structure of the entire mammalian mitochondrial complex i,” <i>Nature</i>, vol. 538, no. 7625. Nature Publishing Group, pp. 406–410, 2016.","chicago":"Fiedorczuk, Karol, James A Letts, Gianluca Degliesposti, Karol Kaszuba, Mark Skehel, and Leonid A Sazanov. “Atomic Structure of the Entire Mammalian Mitochondrial Complex I.” <i>Nature</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/nature19794\">https://doi.org/10.1038/nature19794</a>.","ista":"Fiedorczuk K, Letts JA, Degliesposti G, Kaszuba K, Skehel M, Sazanov LA. 2016. Atomic structure of the entire mammalian mitochondrial complex i. Nature. 538(7625), 406–410.","mla":"Fiedorczuk, Karol, et al. “Atomic Structure of the Entire Mammalian Mitochondrial Complex I.” <i>Nature</i>, vol. 538, no. 7625, Nature Publishing Group, 2016, pp. 406–10, doi:<a href=\"https://doi.org/10.1038/nature19794\">10.1038/nature19794</a>."},"day":"20","publisher":"Nature Publishing Group","_id":"1226","department":[{"_id":"LeSa"}]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:44:39Z","page":"128 - 144","status":"public","scopus_import":1,"title":"Discrete abstraction of multiaffine systems","publist_id":"6107","type":"conference","_id":"1227","publisher":"Springer","pubrep_id":"781","day":"25","citation":{"chicago":"Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger, Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,” 9957:128–44. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>.","ista":"Kong H, Bartocci E, Bogomolov S, Grosu R, Henzinger TA, Jiang Y, Schilling C. 2016. Discrete abstraction of multiaffine systems. HSB: Hybrid Systems Biology, LNCS, vol. 9957, 128–144.","mla":"Kong, Hui, et al. <i>Discrete Abstraction of Multiaffine Systems</i>. Vol. 9957, Springer, 2016, pp. 128–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>.","ieee":"H. Kong <i>et al.</i>, “Discrete abstraction of multiaffine systems,” presented at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.","apa":"Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang, Y., &#38; Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol. 9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">https://doi.org/10.1007/978-3-319-47151-8_9</a>","ama":"Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine systems. In: Vol 9957. Springer; 2016:128-144. doi:<a href=\"https://doi.org/10.1007/978-3-319-47151-8_9\">10.1007/978-3-319-47151-8_9</a>","short":"H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C. Schilling, in:, Springer, 2016, pp. 128–144."},"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T11:50:49Z","volume":9957,"abstract":[{"lang":"eng","text":"Many biological systems can be modeled as multiaffine hybrid systems. Due to the nonlinearity of multiaffine systems, it is difficult to verify their properties of interest directly. A common strategy to tackle this problem is to construct and analyze a discrete overapproximation of the original system. However, the conservativeness of a discrete abstraction significantly determines the level of confidence we can have in the properties of the original system. In this paper, in order to reduce the conservativeness of a discrete abstraction, we propose a new method based on a sufficient and necessary decision condition for computing discrete transitions between states in the abstract system. We assume the state space partition of a multiaffine system to be based on a set of multivariate polynomials. Hence, a rectangular partition defined in terms of polynomials of the form (xi − c) is just a simple case of multivariate polynomial partition, and the new decision condition applies naturally. We analyze and demonstrate the improvement of our method over the existing methods using some examples."}],"language":[{"iso":"eng"}],"oa":1,"date_updated":"2021-01-12T06:49:13Z","publication_status":"published","project":[{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","ddc":["005"],"year":"2016","doi":"10.1007/978-3-319-47151-8_9","file":[{"checksum":"994e164b558c47bacf8dc066dd27c8fc","file_size":683955,"access_level":"open_access","creator":"system","file_name":"IST-2017-781-v1+1_main.pdf","date_created":"2018-12-12T10:10:49Z","content_type":"application/pdf","file_id":"4840","date_updated":"2020-07-14T12:44:39Z","relation":"main_file"}],"has_accepted_license":"1","month":"09","intvolume":"      9957","author":[{"orcid":"0000-0002-3066-6941","first_name":"Hui","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","orcid":"0000-0002-0686-0365","first_name":"Sergiy"},{"last_name":"Grosu","full_name":"Grosu, Radu","first_name":"Radu"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Jiang, Yu","first_name":"Yu","last_name":"Jiang"},{"full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","first_name":"Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling"}],"quality_controlled":"1","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).","date_published":"2016-09-25T00:00:00Z","conference":{"name":"HSB: Hybrid Systems Biology","location":"Grenoble, France","start_date":"2016-10-20","end_date":"2016-10-21"}},{"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"83"}]},"ddc":["005","600"],"has_accepted_license":"1","file":[{"checksum":"34fa9ce681da845a1ba945ba3dc57867","file_size":515000,"date_updated":"2020-07-14T12:44:39Z","content_type":"application/pdf","file_id":"5273","relation":"main_file","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:17:20Z","file_name":"IST-2017-765-v1+1_838.pdf"}],"doi":"10.1007/978-3-319-39555-5_16","year":"2016","publication_status":"published","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"},{"name":"Teaching Old Crypto New Tricks","grant_number":"682815","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","acknowledgement":"Research  supported  by  the  European  Research  Council,  ERC  starting  grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","conference":{"location":"Guildford, UK","name":"ACNS: Applied Cryptography and Network Security","start_date":"2016-06-19","end_date":"2016-06-22"},"date_published":"2016-06-09T00:00:00Z","month":"06","author":[{"full_name":"Abusalah, Hamza M","first_name":"Hamza M","last_name":"Abusalah","id":"40297222-F248-11E8-B48F-1D18A9856A87"},{"id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","full_name":"Fuchsbauer, Georg","first_name":"Georg"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"      9696","quality_controlled":"1","publist_id":"6105","type":"conference","title":"Offline witness encryption","scopus_import":1,"status":"public","page":"285 - 303","file_date_updated":"2020-07-14T12:44:39Z","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:50Z","volume":9696,"abstract":[{"text":"Witness encryption (WE) was introduced by Garg et al. [GGSW13]. A WE scheme is defined for some NP language L and lets a sender encrypt messages relative to instances x. A ciphertext for x can be decrypted using w witnessing x ∈ L, but hides the message if x ∈ L. Garg et al. construct WE from multilinear maps and give another construction [GGH+13b] using indistinguishability obfuscation (iO) for circuits. Due to the reliance on such heavy tools, WE can cur- rently hardly be implemented on powerful hardware and will unlikely be realizable on constrained devices like smart cards any time soon. We construct a WE scheme where encryption is done by simply computing a Naor-Yung ciphertext (two CPA encryptions and a NIZK proof). To achieve this, our scheme has a setup phase, which outputs public parameters containing an obfuscated circuit (only required for decryption), two encryption keys and a common reference string (used for encryption). This setup need only be run once, and the parame- ters can be used for arbitrary many encryptions. Our scheme can also be turned into a functional WE scheme, where a message is encrypted w.r.t. a statement and a function f, and decryption with a witness w yields f (m, w). Our construction is inspired by the functional encryption scheme by Garg et al. and we prove (selective) security assuming iO and statistically simulation-sound NIZK. We give a construction of the latter in bilinear groups and combining it with ElGamal encryption, our ciphertexts are of size 1.3 kB at a 128-bit security level and can be computed on a smart card.","lang":"eng"}],"date_updated":"2023-09-07T12:30:22Z","oa":1,"citation":{"short":"H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.","ama":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. Offline witness encryption. In: Vol 9696. Springer; 2016:285-303. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>","apa":"Abusalah, H. M., Fuchsbauer, G., &#38; Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>","ieee":"H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.","chicago":"Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline Witness Encryption,” 9696:285–303. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">https://doi.org/10.1007/978-3-319-39555-5_16</a>.","mla":"Abusalah, Hamza M., et al. <i>Offline Witness Encryption</i>. Vol. 9696, Springer, 2016, pp. 285–303, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_16\">10.1007/978-3-319-39555-5_16</a>.","ista":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Offline witness encryption. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 285–303."},"day":"09","publisher":"Springer","_id":"1229","pubrep_id":"765","department":[{"_id":"KrPi"}],"alternative_title":["LNCS"]},{"conference":{"start_date":"2016-01-17","end_date":"2016-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"St. Petersburg, FL, USA"},"date_published":"2016-01-01T00:00:00Z","acknowledgement":"We thank Andrey Kupriyanov for feedback on the manuscript,\r\nand Michael Tautschnig for help with preparing the experiments. This research was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).","quality_controlled":"1","intvolume":"      9583","month":"01","author":[{"id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca","first_name":"Przemyslaw","full_name":"Daca, Przemyslaw"},{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","first_name":"Thomas A"}],"year":"2016","doi":"10.1007/978-3-662-49122-5_16","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"1155"}]},"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"Preprint","publication_status":"published","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1511.02615","open_access":"1"}],"date_updated":"2023-09-07T11:58:33Z","volume":9583,"abstract":[{"text":"Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then the model checker refines its program abstraction to prove more paths infeasible, which reduces the search space for concolic testing. We have implemented our method on top of the concolictesting tool Crest and the model checker CpaChecker. We evaluated our tool on a collection of programs and a category of SvComp benchmarks. In our experiments, we observed an improvement in branch coverage compared to Crest from 48% to 63% in the best case, and from 66% to 71% on average.","lang":"eng"}],"date_created":"2018-12-11T11:50:50Z","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"day":"01","_id":"1230","publisher":"Springer","citation":{"short":"P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347.","ama":"Daca P, Gupta A, Henzinger TA. Abstraction-driven concolic testing. In: Vol 9583. Springer; 2016:328-347. doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>","apa":"Daca, P., Gupta, A., &#38; Henzinger, T. A. (2016). Abstraction-driven concolic testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>","ieee":"P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.","mla":"Daca, Przemyslaw, et al. <i>Abstraction-Driven Concolic Testing</i>. Vol. 9583, Springer, 2016, pp. 328–47, doi:<a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">10.1007/978-3-662-49122-5_16</a>.","ista":"Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583, 328–347.","chicago":"Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven Concolic Testing,” 9583:328–47. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49122-5_16\">https://doi.org/10.1007/978-3-662-49122-5_16</a>."},"title":"Abstraction-driven concolic testing","status":"public","scopus_import":1,"page":"328 - 347","publist_id":"6104","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1},{"acknowledgement":"Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566, CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant CNS-1523467.","date_published":"2016-04-28T00:00:00Z","conference":{"location":"Vienna, Austria","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2016-05-08","end_date":"2016-05-12"},"author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alwen","full_name":"Alwen, Joel F","first_name":"Joel F"},{"full_name":"Chen, Binyi","first_name":"Binyi","last_name":"Chen"},{"first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Tessaro","first_name":"Stefano","full_name":"Tessaro, Stefano"}],"month":"04","intvolume":"      9666","quality_controlled":"1","year":"2016","doi":"10.1007/978-3-662-49896-5_13","publication_status":"published","project":[{"grant_number":"259668","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling)."}],"date_created":"2018-12-11T11:50:51Z","volume":9666,"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/100"}],"date_updated":"2021-01-12T06:49:15Z","publisher":"Springer","_id":"1231","day":"28","citation":{"ama":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>","apa":"Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &#38; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>","short":"J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.","ieee":"J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.","chicago":"Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">https://doi.org/10.1007/978-3-662-49896-5_13</a>.","mla":"Alwen, Joel F., et al. <i>On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model</i>. Vol. 9666, Springer, 2016, pp. 358–87, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_13\">10.1007/978-3-662-49896-5_13</a>.","ista":"Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387."},"alternative_title":["LNCS"],"department":[{"_id":"KrPi"},{"_id":"VlKo"}],"page":"358 - 387","title":"On the complexity of scrypt and proofs of space in the parallel random oracle model","status":"public","scopus_import":1,"type":"conference","publist_id":"6103","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ec_funded":1},{"publication_status":"published","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","doi":"10.1007/978-3-662-49096-9_12","year":"2016","intvolume":"      9562","month":"01","author":[{"last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","full_name":"Fuchsbauer, Georg"},{"last_name":"Heuer","full_name":"Heuer, Felix","first_name":"Felix"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","acknowledgement":"G. Fuchsbauer and K. Pietrzak are supported by the European Research Council, ERC Starting Grant (259668-PSPC). F. Heuer is funded by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and DFG SPP 1736, Algorithms for BIG DATA. E. Kiltz is supported by a Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation, the German Israel Foundation, and ERC Project ERCC (FP7/615074).","conference":{"location":"Tel Aviv, Israel","name":"TCC: Theory of Cryptography Conference","start_date":"2016-01-10","end_date":"2016-01-13"},"date_published":"2016-01-01T00:00:00Z","ec_funded":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"6100","type":"conference","status":"public","scopus_import":1,"title":"Standard security does imply security against selective opening for markov distributions","page":"282 - 305","citation":{"apa":"Fuchsbauer, G., Heuer, F., Kiltz, E., &#38; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>","ama":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. Standard security does imply security against selective opening for markov distributions. In: Vol 9562. Springer; 2016:282-305. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>","short":"G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.","ista":"Fuchsbauer G, Heuer F, Kiltz E, Pietrzak KZ. 2016. Standard security does imply security against selective opening for markov distributions. TCC: Theory of Cryptography Conference, LNCS, vol. 9562, 282–305.","chicago":"Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard Security Does Imply Security against Selective Opening for Markov Distributions,” 9562:282–305. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">https://doi.org/10.1007/978-3-662-49096-9_12</a>.","mla":"Fuchsbauer, Georg, et al. <i>Standard Security Does Imply Security against Selective Opening for Markov Distributions</i>. Vol. 9562, Springer, 2016, pp. 282–305, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_12\">10.1007/978-3-662-49096-9_12</a>.","ieee":"G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305."},"day":"01","_id":"1233","publisher":"Springer","department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:51Z","abstract":[{"lang":"eng","text":"About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard (IND-CPA) security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to IND-CPA security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other. In this paper we give a reduction whose loss is quantified via the dependence graph (where message dependencies correspond to edges) of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial."}],"volume":9562,"date_updated":"2021-01-12T06:49:16Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2015/853"}],"oa":1},{"month":"01","intvolume":"      9636","author":[{"full_name":"Daca, Przemyslaw","first_name":"Przemyslaw","last_name":"Daca","id":"49351290-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"full_name":"Kretinsky, Jan","first_name":"Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Petrov, Tatjana","first_name":"Tatjana","orcid":"0000-0002-9041-0905","last_name":"Petrov","id":"3D5811FC-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant  agreement  267989  (QUAREM),  the  Austrian  Science  Fund  (FWF)  under\r\ngrants project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), the Peo-\r\nple Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734, the SNSF Advanced Postdoc.\r\nMobility Fellowship – grant number P300P2\r\n161067, and the Czech Science Foun-\r\ndation under grant agreement P202/12/G061.","date_published":"2016-01-01T00:00:00Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Eindhoven, The Netherlands","start_date":"2016-04-02","end_date":"2016-04-08"},"publication_status":"published","oa_version":"Preprint","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"Z211","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"471"},{"status":"public","relation":"dissertation_contains","id":"1155"}]},"year":"2016","doi":"10.1007/978-3-662-49674-9_7","_id":"1234","publisher":"Springer","day":"01","citation":{"short":"P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp. 112–129.","ama":"Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking for unbounded temporal properties. In: Vol 9636. Springer; 2016:112-129. doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>","apa":"Daca, P., Henzinger, T. A., Kretinsky, J., &#38; Petrov, T. (2016). Faster statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands: Springer. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>","ieee":"P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical model checking for unbounded temporal properties,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands, 2016, vol. 9636, pp. 112–129.","ista":"Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Faster statistical model checking for unbounded temporal properties. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 9636, 112–129.","mla":"Daca, Przemyslaw, et al. <i>Faster Statistical Model Checking for Unbounded Temporal Properties</i>. Vol. 9636, Springer, 2016, pp. 112–29, doi:<a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">10.1007/978-3-662-49674-9_7</a>.","chicago":"Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov. “Faster Statistical Model Checking for Unbounded Temporal Properties,” 9636:112–29. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49674-9_7\">https://doi.org/10.1007/978-3-662-49674-9_7</a>."},"department":[{"_id":"ToHe"},{"_id":"CaGu"}],"alternative_title":["LNCS"],"date_created":"2018-12-11T11:50:51Z","abstract":[{"text":"We present a new algorithm for the statistical model checking of Markov chains with respect to unbounded temporal properties, including full linear temporal logic. The main idea is that we monitor each simulation run on the fly, in order to detect quickly if a bottom strongly connected component is entered with high probability, in which case the simulation run can be terminated early. As a result, our simulation runs are often much shorter than required by termination bounds that are computed a priori for a desired level of confidence on a large state space. In comparison to previous algorithms for statistical model checking our method is not only faster in many cases but also requires less information about the system, namely, only the minimum transition probability that occurs in the Markov chain. In addition, our method can be generalised to unbounded quantitative properties such as mean-payoff bounds.","lang":"eng"}],"volume":9636,"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.05739"}],"date_updated":"2023-09-07T11:58:33Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"page":"112 - 129","title":"Faster statistical model checking for unbounded temporal properties","scopus_import":1,"status":"public","publist_id":"6099","type":"conference"},{"intvolume":"      9696","month":"01","author":[{"first_name":"Hamza M","full_name":"Abusalah, Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah"},{"first_name":"Georg","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","acknowledgement":"H. Abusalah—Research supported by the European Research Council, ERC starting grant (259668-PSPC) and ERC consolidator grant (682815 - TOCNeT).","date_published":"2016-01-01T00:00:00Z","conference":{"end_date":"2016-06-22","start_date":"2016-06-19","location":"Guildford, UK","name":"ACNS: Applied Cryptography and Network Security"},"publication_status":"published","oa_version":"Submitted Version","project":[{"name":"Provable Security for Physical Cryptography","grant_number":"259668","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"83"}]},"year":"2016","doi":"10.1007/978-3-319-39555-5_24","_id":"1235","publisher":"Springer","day":"01","citation":{"short":"H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.","apa":"Abusalah, H. M., &#38; Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>","ama":"Abusalah HM, Fuchsbauer G. Constrained PRFs for unbounded inputs with short keys. In: Vol 9696. Springer; 2016:445-463. doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>","mla":"Abusalah, Hamza M., and Georg Fuchsbauer. <i>Constrained PRFs for Unbounded Inputs with Short Keys</i>. Vol. 9696, Springer, 2016, pp. 445–63, doi:<a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">10.1007/978-3-319-39555-5_24</a>.","ista":"Abusalah HM, Fuchsbauer G. 2016. Constrained PRFs for unbounded inputs with short keys. ACNS: Applied Cryptography and Network Security, LNCS, vol. 9696, 445–463.","chicago":"Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded Inputs with Short Keys,” 9696:445–63. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39555-5_24\">https://doi.org/10.1007/978-3-319-39555-5_24</a>.","ieee":"H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463."},"alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"volume":9696,"abstract":[{"text":"A constrained pseudorandom function (CPRF) F: K×X → Y for a family T of subsets of χ is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a short constrained key kS, which allows to evaluate F(k, ·) on all inputs x ∈ S, while the outputs on all inputs x /∈ S look random even given kS. Abusalah et al. recently constructed the first constrained PRF for inputs of arbitrary length whose sets S are decided by Turing machines. They use their CPRF to build broadcast encryption and the first ID-based non-interactive key exchange for an unbounded number of users. Their constrained keys are obfuscated circuits and are therefore large. In this work we drastically reduce the key size and define a constrained key for a Turing machine M as a short signature on M. For this, we introduce a new signature primitive with constrained signing keys that let one only sign certain messages, while forging a signature on others is hard even when knowing the coins for key generation.","lang":"eng"}],"date_created":"2018-12-11T11:50:52Z","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/279.pdf"}],"date_updated":"2023-09-07T12:30:22Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"page":"445 - 463","status":"public","scopus_import":1,"title":"Constrained PRFs for unbounded inputs with short keys","publist_id":"6098","type":"conference"},{"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:52Z","volume":9610,"abstract":[{"lang":"eng","text":"A constrained pseudorandom function F: K × X → Y for a family T ⊆ 2X of subsets of X is a function where for any key k ∈ K and set S ∈ T one can efficiently compute a constrained key kS which allows to evaluate F (k, ·) on all inputs x ∈ S, while even given this key, the outputs on all inputs x ∉ S look random. At Asiacrypt’13 Boneh and Waters gave a construction which supports the most general set family so far. Its keys kc are defined for sets decided by boolean circuits C and enable evaluation of the PRF on any x ∈ X where C(x) = 1. In their construction the PRF input length and the size of the circuits C for which constrained keys can be computed must be fixed beforehand during key generation. We construct a constrained PRF that has an unbounded input length and whose constrained keys can be defined for any set recognized by a Turing machine. The only a priori bound we make is on the description size of the machines. We prove our construction secure assuming publiccoin differing-input obfuscation. As applications of our constrained PRF we build a broadcast encryption scheme where the number of potential receivers need not be fixed at setup (in particular, the length of the keys is independent of the number of parties) and the first identity-based non-interactive key exchange protocol with no bound on the number of parties that can agree on a shared key."}],"date_updated":"2023-09-07T12:30:22Z","oa":1,"citation":{"chicago":"Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Constrained PRFs for Unbounded Inputs,” 9610:413–28. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">https://doi.org/10.1007/978-3-319-29485-8_24</a>.","mla":"Abusalah, Hamza M., et al. <i>Constrained PRFs for Unbounded Inputs</i>. Vol. 9610, Springer, 2016, pp. 413–28, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">10.1007/978-3-319-29485-8_24</a>.","ista":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. 2016. Constrained PRFs for unbounded inputs. CT-RSA: Topics in Cryptology, LNCS, vol. 9610, 413–428.","ieee":"H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.","apa":"Abusalah, H. M., Fuchsbauer, G., &#38; Pietrzak, K. Z. (2016). Constrained PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA: Springer. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">https://doi.org/10.1007/978-3-319-29485-8_24</a>","ama":"Abusalah HM, Fuchsbauer G, Pietrzak KZ. Constrained PRFs for unbounded inputs. In: Vol 9610. Springer; 2016:413-428. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_24\">10.1007/978-3-319-29485-8_24</a>","short":"H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428."},"publisher":"Springer","_id":"1236","pubrep_id":"764","day":"02","alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"publist_id":"6097","type":"conference","page":"413 - 428","status":"public","scopus_import":1,"title":"Constrained PRFs for unbounded inputs","ec_funded":1,"file_date_updated":"2020-07-14T12:44:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Supported by the European Research Council, ERC Starting Grant (259668-PSPC).","date_published":"2016-02-02T00:00:00Z","conference":{"end_date":"2016-03-04","start_date":"2016-02-29","location":"San Francisco, CA, USA","name":"CT-RSA: Topics in Cryptology"},"intvolume":"      9610","author":[{"id":"40297222-F248-11E8-B48F-1D18A9856A87","last_name":"Abusalah","full_name":"Abusalah, Hamza M","first_name":"Hamza M"},{"first_name":"Georg","full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer"},{"last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z"}],"month":"02","quality_controlled":"1","related_material":{"record":[{"id":"83","relation":"dissertation_contains","status":"public"}]},"ddc":["005","600"],"doi":"10.1007/978-3-319-29485-8_24","file":[{"file_size":495176,"checksum":"3851cee49933ae13b1272e516f213e13","relation":"main_file","date_updated":"2020-07-14T12:44:41Z","file_id":"4664","content_type":"application/pdf","date_created":"2018-12-12T10:08:05Z","file_name":"IST-2017-764-v1+1_279.pdf","creator":"system","access_level":"open_access"}],"has_accepted_license":"1","year":"2016","publication_status":"published","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"259668","name":"Provable Security for Physical Cryptography"}],"oa_version":"Submitted Version"},{"acknowledgement":"This work was supported by National Program for Sustainability I (grant no. LO1204) provided by the Czech Ministry of Education and by Institutional Fund of Palacký University Olomouc (GK and OŠ).\r\nWe thank Sabine Fischer for help with the statistics.","date_published":"2016-01-29T00:00:00Z","publication":"Frontiers in Plant Science","month":"01","author":[{"full_name":"Von Wangenheim, Daniel","first_name":"Daniel","orcid":"0000-0002-6862-1247","last_name":"Von Wangenheim","id":"49E91952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rosero, Amparo","first_name":"Amparo","last_name":"Rosero"},{"full_name":"Komis, George","first_name":"George","last_name":"Komis"},{"last_name":"Šamajová","full_name":"Šamajová, Olga","first_name":"Olga"},{"first_name":"Miroslav","full_name":"Ovečka, Miroslav","last_name":"Ovečka"},{"last_name":"Voigt","first_name":"Boris","full_name":"Voigt, Boris"},{"last_name":"Šamaj","first_name":"Jozef","full_name":"Šamaj, Jozef"}],"intvolume":"         6","article_number":"1262","quality_controlled":"1","ddc":["581"],"year":"2016","doi":"10.3389/fpls.2015.01262","has_accepted_license":"1","file":[{"date_updated":"2020-07-14T12:44:41Z","content_type":"application/pdf","file_id":"4760","relation":"main_file","access_level":"open_access","date_created":"2018-12-12T10:09:36Z","file_name":"IST-2016-710-v1+1_fpls-06-01262.pdf","creator":"system","checksum":"3127eab844d53564bf47e2b6b42f1ca0","file_size":1640550}],"publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","volume":6,"date_created":"2018-12-11T11:50:53Z","abstract":[{"lang":"eng","text":"The dynamic localization of endosomal compartments labeled with targeted fluorescent protein tags is routinely followed by time lapse fluorescence microscopy approaches and single particle tracking algorithms. In this way trajectories of individual endosomes can be mapped and linked to physiological processes as cell growth. However, other aspects of dynamic behavior including endosomal interactions are difficult to follow in this manner. Therefore, we characterized the localization and dynamic properties of early and late endosomes throughout the entire course of root hair formation by means of spinning disc time lapse imaging and post-acquisition automated multitracking and quantitative analysis. Our results show differential motile behavior of early and late endosomes and interactions of late endosomes that may be specified to particular root hair domains. Detailed data analysis revealed a particular transient interaction between late endosomes—termed herein as dancing-endosomes—which is not concluding to vesicular fusion. Endosomes preferentially located in the root hair tip interacted as dancing-endosomes and traveled short distances during this interaction. Finally, sizes of early and late endosomes were addressed by means of super-resolution structured illumination microscopy (SIM) to corroborate measurements on the spinning disc. This is a first study providing quantitative microscopic data on dynamic spatio-temporal interactions of endosomes during root hair tip growth."}],"language":[{"iso":"eng"}],"oa":1,"date_updated":"2021-01-12T06:49:18Z","publisher":"Frontiers Research Foundation","_id":"1238","pubrep_id":"710","day":"29","citation":{"short":"D. von Wangenheim, A. Rosero, G. Komis, O. Šamajová, M. Ovečka, B. Voigt, J. Šamaj, Frontiers in Plant Science 6 (2016).","apa":"von Wangenheim, D., Rosero, A., Komis, G., Šamajová, O., Ovečka, M., Voigt, B., &#38; Šamaj, J. (2016). Endosomal interactions during root hair growth. <i>Frontiers in Plant Science</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fpls.2015.01262\">https://doi.org/10.3389/fpls.2015.01262</a>","ama":"von Wangenheim D, Rosero A, Komis G, et al. Endosomal interactions during root hair growth. <i>Frontiers in Plant Science</i>. 2016;6(JAN2016). doi:<a href=\"https://doi.org/10.3389/fpls.2015.01262\">10.3389/fpls.2015.01262</a>","chicago":"Wangenheim, Daniel von, Amparo Rosero, George Komis, Olga Šamajová, Miroslav Ovečka, Boris Voigt, and Jozef Šamaj. “Endosomal Interactions during Root Hair Growth.” <i>Frontiers in Plant Science</i>. Frontiers Research Foundation, 2016. <a href=\"https://doi.org/10.3389/fpls.2015.01262\">https://doi.org/10.3389/fpls.2015.01262</a>.","mla":"von Wangenheim, Daniel, et al. “Endosomal Interactions during Root Hair Growth.” <i>Frontiers in Plant Science</i>, vol. 6, no. JAN2016, 1262, Frontiers Research Foundation, 2016, doi:<a href=\"https://doi.org/10.3389/fpls.2015.01262\">10.3389/fpls.2015.01262</a>.","ista":"von Wangenheim D, Rosero A, Komis G, Šamajová O, Ovečka M, Voigt B, Šamaj J. 2016. Endosomal interactions during root hair growth. Frontiers in Plant Science. 6(JAN2016), 1262.","ieee":"D. von Wangenheim <i>et al.</i>, “Endosomal interactions during root hair growth,” <i>Frontiers in Plant Science</i>, vol. 6, no. JAN2016. Frontiers Research Foundation, 2016."},"department":[{"_id":"JiFr"}],"status":"public","title":"Endosomal interactions during root hair growth","scopus_import":1,"publist_id":"6094","type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:44:41Z","issue":"JAN2016"},{"issue":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2020-07-14T12:44:41Z","title":"Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans","status":"public","scopus_import":1,"publist_id":"6093","type":"journal_article","department":[{"_id":"GaNo"}],"_id":"1240","pubrep_id":"709","publisher":"BioMed Central","day":"29","citation":{"apa":"Kornienko, A., Dotter, C., Guenzl, P., Gisslinger, H., Gisslinger, B., Cleary, C., … Barlow, D. (2016). Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans. <i>Genome Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s13059-016-0873-8\">https://doi.org/10.1186/s13059-016-0873-8</a>","ama":"Kornienko A, Dotter C, Guenzl P, et al. Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans. <i>Genome Biology</i>. 2016;17(1). doi:<a href=\"https://doi.org/10.1186/s13059-016-0873-8\">10.1186/s13059-016-0873-8</a>","short":"A. Kornienko, C. Dotter, P. Guenzl, H. Gisslinger, B. Gisslinger, C. Cleary, R. Kralovics, F. Pauler, D. Barlow, Genome Biology 17 (2016).","ista":"Kornienko A, Dotter C, Guenzl P, Gisslinger H, Gisslinger B, Cleary C, Kralovics R, Pauler F, Barlow D. 2016. Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans. Genome Biology. 17(1), 14.","mla":"Kornienko, Aleksandra, et al. “Long Non-Coding RNAs Display Higher Natural Expression Variation than Protein-Coding Genes in Healthy Humans.” <i>Genome Biology</i>, vol. 17, no. 1, 14, BioMed Central, 2016, doi:<a href=\"https://doi.org/10.1186/s13059-016-0873-8\">10.1186/s13059-016-0873-8</a>.","chicago":"Kornienko, Aleksandra, Christoph Dotter, Philipp Guenzl, Heinz Gisslinger, Bettina Gisslinger, Ciara Cleary, Robert Kralovics, Florian Pauler, and Denise Barlow. “Long Non-Coding RNAs Display Higher Natural Expression Variation than Protein-Coding Genes in Healthy Humans.” <i>Genome Biology</i>. BioMed Central, 2016. <a href=\"https://doi.org/10.1186/s13059-016-0873-8\">https://doi.org/10.1186/s13059-016-0873-8</a>.","ieee":"A. Kornienko <i>et al.</i>, “Long non-coding RNAs display higher natural expression variation than protein-coding genes in healthy humans,” <i>Genome Biology</i>, vol. 17, no. 1. BioMed Central, 2016."},"oa":1,"date_updated":"2021-01-12T06:49:20Z","abstract":[{"lang":"eng","text":"Background: Long non-coding RNAs (lncRNAs) are increasingly implicated as gene regulators and may ultimately be more numerous than protein-coding genes in the human genome. Despite large numbers of reported lncRNAs, reference annotations are likely incomplete due to their lower and tighter tissue-specific expression compared to mRNAs. An unexplored factor potentially confounding lncRNA identification is inter-individual expression variability. Here, we characterize lncRNA natural expression variability in human primary granulocytes. Results: We annotate granulocyte lncRNAs and mRNAs in RNA-seq data from 10 healthy individuals, identifying multiple lncRNAs absent from reference annotations, and use this to investigate three known features (higher tissue-specificity, lower expression, and reduced splicing efficiency) of lncRNAs relative to mRNAs. Expression variability was examined in seven individuals sampled three times at 1- or more than 1-month intervals. We show that lncRNAs display significantly more inter-individual expression variability compared to mRNAs. We confirm this finding in two independent human datasets by analyzing multiple tissues from the GTEx project and lymphoblastoid cell lines from the GEUVADIS project. Using the latter dataset we also show that including more human donors into the transcriptome annotation pipeline allows identification of an increasing number of lncRNAs, but minimally affects mRNA gene number. Conclusions: A comprehensive annotation of lncRNAs is known to require an approach that is sensitive to low and tight tissue-specific expression. Here we show that increased inter-individual expression variability is an additional general lncRNA feature to consider when creating a comprehensive annotation of human lncRNAs or proposing their use as prognostic or disease markers."}],"date_created":"2018-12-11T11:50:53Z","volume":17,"language":[{"iso":"eng"}],"oa_version":"Published Version","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"year":"2016","doi":"10.1186/s13059-016-0873-8","has_accepted_license":"1","file":[{"access_level":"open_access","creator":"system","date_created":"2018-12-12T10:10:05Z","file_name":"IST-2016-709-v1+1_s13059-016-0873-8.pdf","file_id":"4789","date_updated":"2020-07-14T12:44:41Z","content_type":"application/pdf","relation":"main_file","file_size":2914601,"checksum":"a268beee1a690801c83ec6729f9ebc5b"}],"ddc":["576"],"article_number":"14","quality_controlled":"1","intvolume":"        17","month":"01","author":[{"first_name":"Aleksandra","full_name":"Kornienko, Aleksandra","last_name":"Kornienko"},{"id":"4C66542E-F248-11E8-B48F-1D18A9856A87","last_name":"Dotter","full_name":"Dotter, Christoph","first_name":"Christoph"},{"full_name":"Guenzl, Philipp","first_name":"Philipp","last_name":"Guenzl"},{"last_name":"Gisslinger","first_name":"Heinz","full_name":"Gisslinger, Heinz"},{"first_name":"Bettina","full_name":"Gisslinger, Bettina","last_name":"Gisslinger"},{"full_name":"Cleary, Ciara","first_name":"Ciara","last_name":"Cleary"},{"first_name":"Robert","full_name":"Kralovics, Robert","last_name":"Kralovics"},{"id":"48EA0138-F248-11E8-B48F-1D18A9856A87","last_name":"Pauler","full_name":"Pauler, Florian","first_name":"Florian"},{"first_name":"Denise","full_name":"Barlow, Denise","last_name":"Barlow"}],"date_published":"2016-01-29T00:00:00Z","publication":"Genome Biology","acknowledgement":"This study was partly funded by the Austrian Science Fund (FWF F43-B09, FWF W1207-B09). PMG is a recipient of a DOC Fellowship of the Austrian Academy of Sciences.\r\nWe thank Ruth Klement, Tomasz Kulinski, Elisangela Valente, Elisabeth Salzer,\r\nand Roland Jäger for technical/bioinformatic assistance and advice, the CeMM\r\nIT department and José Manuel Molero for help and advice on software usage,\r\nthe Biomedical Sequencing Facility (http://biomedical-sequencing.at/) for\r\nsequencing and advice, Jacques Colinge, Daniel Andergassen, and Tomasz\r\nKulinski for discussions, Quanah Hudson and Jörg Menche for reading and\r\ncommenting on the manuscript."},{"oa_version":"Preprint","project":[{"_id":"254E9036-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P28844-B27","name":"Biophysics of information processing in gene regulation"}],"publication_status":"published","doi":"10.1103/PhysRevE.93.022404","year":"2016","quality_controlled":"1","article_number":"022404","intvolume":"        93","month":"02","author":[{"orcid":"0000-0002-1287-3779","full_name":"Sokolowski, Thomas R","first_name":"Thomas R","id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski"},{"first_name":"Aleksandra","full_name":"Walczak, Aleksandra","last_name":"Walczak"},{"last_name":"Bialek","full_name":"Bialek, William","first_name":"William"},{"last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","first_name":"Gasper"}],"publication":"Physical Review E Statistical Nonlinear and Soft Matter Physics","date_published":"2016-02-04T00:00:00Z","acknowledgement":"We thank T. Gregor, A. Prochaintz, and others for\r\nhelpful discussions. This work was supported in part by\r\nGrants No. PHY-1305525 and No. CCF-0939370 from the\r\nUS National Science Foundation and by the W.M. Keck\r\nFoundation. A.M.W. acknowledges the support by European\r\nResearch Council (ERC) Grant No. MCCIG PCIG10–GA-\r\n2011–303561. G.T. and T.R.S. were supported by Austrian\r\nScience Fund (FWF) Grant No. P28844S.","issue":"2","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publist_id":"6088","type":"journal_article","scopus_import":1,"title":"Extending the dynamic range of transcription factor action by translational regulation","status":"public","department":[{"_id":"GaTk"}],"citation":{"apa":"Sokolowski, T. R., Walczak, A., Bialek, W., &#38; Tkačik, G. (2016). Extending the dynamic range of transcription factor action by translational regulation. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics. <a href=\"https://doi.org/10.1103/PhysRevE.93.022404\">https://doi.org/10.1103/PhysRevE.93.022404</a>","ama":"Sokolowski TR, Walczak A, Bialek W, Tkačik G. Extending the dynamic range of transcription factor action by translational regulation. <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. 2016;93(2). doi:<a href=\"https://doi.org/10.1103/PhysRevE.93.022404\">10.1103/PhysRevE.93.022404</a>","short":"T.R. Sokolowski, A. Walczak, W. Bialek, G. Tkačik, Physical Review E Statistical Nonlinear and Soft Matter Physics 93 (2016).","ista":"Sokolowski TR, Walczak A, Bialek W, Tkačik G. 2016. Extending the dynamic range of transcription factor action by translational regulation. Physical Review E Statistical Nonlinear and Soft Matter Physics. 93(2), 022404.","mla":"Sokolowski, Thomas R., et al. “Extending the Dynamic Range of Transcription Factor Action by Translational Regulation.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 93, no. 2, 022404, American Institute of Physics, 2016, doi:<a href=\"https://doi.org/10.1103/PhysRevE.93.022404\">10.1103/PhysRevE.93.022404</a>.","chicago":"Sokolowski, Thomas R, Aleksandra Walczak, William Bialek, and Gašper Tkačik. “Extending the Dynamic Range of Transcription Factor Action by Translational Regulation.” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>. American Institute of Physics, 2016. <a href=\"https://doi.org/10.1103/PhysRevE.93.022404\">https://doi.org/10.1103/PhysRevE.93.022404</a>.","ieee":"T. R. Sokolowski, A. Walczak, W. Bialek, and G. Tkačik, “Extending the dynamic range of transcription factor action by translational regulation,” <i>Physical Review E Statistical Nonlinear and Soft Matter Physics</i>, vol. 93, no. 2. American Institute of Physics, 2016."},"publisher":"American Institute of Physics","_id":"1242","day":"04","date_updated":"2021-01-12T06:49:20Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1507.02562"}],"oa":1,"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:50:54Z","volume":93,"abstract":[{"lang":"eng","text":"A crucial step in the regulation of gene expression is binding of transcription factor (TF) proteins to regulatory sites along the DNA. But transcription factors act at nanomolar concentrations, and noise due to random arrival of these molecules at their binding sites can severely limit the precision of regulation. Recent work on the optimization of information flow through regulatory networks indicates that the lower end of the dynamic range of concentrations is simply inaccessible, overwhelmed by the impact of this noise. Motivated by the behavior of homeodomain proteins, such as the maternal morphogen Bicoid in the fruit fly embryo, we suggest a scheme in which transcription factors also act as indirect translational regulators, binding to the mRNA of other regulatory proteins. Intuitively, each mRNA molecule acts as an independent sensor of the input concentration, and averaging over these multiple sensors reduces the noise. We analyze information flow through this scheme and identify conditions under which it outperforms direct transcriptional regulation. Our results suggest that the dual role of homeodomain proteins is not just a historical accident, but a solution to a crucial physics problem in the regulation of gene expression."}]},{"publication":"PNAS","date_published":"2016-02-16T00:00:00Z","acknowledgement":"We thank Sophie Martin, Ken Sawin, Stephen Huisman,\r\nand Damian Brunner for strains; Julianne\r\nTeapal, Marcel Janson, Sergio Rincon,\r\nand Phong Tran for technical assistance; Andrew Mugler and Bela Mulder for\r\ndiscussions; and Sander Tans, Phong Tran,\r\nand Anne Paoletti for critical reading\r\nof the manuscript. This work is part of the research program of the\r\n“\r\nStichting\r\nvoor Fundamenteel Onderzoek de Materie,\r\n”\r\nwhich is financially supported by\r\nthe\r\n“\r\nNederlandse organisatie voor Wete\r\nnschappelijk Onderzoek (NWO).\r\n”","quality_controlled":"1","month":"02","author":[{"last_name":"Recouvreux","full_name":"Recouvreux, Pierre","first_name":"Pierre"},{"id":"3E999752-F248-11E8-B48F-1D18A9856A87","last_name":"Sokolowski","first_name":"Thomas R","full_name":"Sokolowski, Thomas R","orcid":"0000-0002-1287-3779"},{"first_name":"Aristea","full_name":"Grammoustianou, Aristea","last_name":"Grammoustianou"},{"last_name":"Tenwolde","first_name":"Pieter","full_name":"Tenwolde, Pieter"},{"first_name":"Marileen","full_name":"Dogterom, Marileen","last_name":"Dogterom"}],"intvolume":"       113","doi":"10.1073/pnas.1419248113","year":"2016","oa_version":"Submitted Version","publication_status":"published","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4763754/","open_access":"1"}],"date_updated":"2021-01-12T06:49:21Z","oa":1,"language":[{"iso":"eng"}],"abstract":[{"text":"Cell polarity refers to a functional spatial organization of proteins that is crucial for the control of essential cellular processes such as growth and division. To establish polarity, cells rely on elaborate regulation networks that control the distribution of proteins at the cell membrane. In fission yeast cells, a microtubule-dependent network has been identified that polarizes the distribution of signaling proteins that restricts growth to cell ends and targets the cytokinetic machinery to the middle of the cell. Although many molecular components have been shown to play a role in this network, it remains unknown which molecular functionalities are minimally required to establish a polarized protein distribution in this system. Here we show that a membrane-binding protein fragment, which distributes homogeneously in wild-type fission yeast cells, can be made to concentrate at cell ends by attaching it to a cytoplasmic microtubule end-binding protein. This concentration results in a polarized pattern of chimera proteins with a spatial extension that is very reminiscent of natural polarity patterns in fission yeast. However, chimera levels fluctuate in response to microtubule dynamics, and disruption of microtubules leads to disappearance of the pattern. Numerical simulations confirm that the combined functionality of membrane anchoring and microtubule tip affinity is in principle sufficient to create polarized patterns. Our chimera protein may thus represent a simple molecular functionality that is able to polarize the membrane, onto which additional layers of molecular complexity may be built to provide the temporal robustness that is typical of natural polarity patterns.","lang":"eng"}],"volume":113,"date_created":"2018-12-11T11:50:55Z","department":[{"_id":"GaTk"}],"citation":{"ista":"Recouvreux P, Sokolowski TR, Grammoustianou A, Tenwolde P, Dogterom M. 2016. Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells. PNAS. 113(7), 1811–1816.","mla":"Recouvreux, Pierre, et al. “Chimera Proteins with Affinity for Membranes and Microtubule Tips Polarize in the Membrane of Fission Yeast Cells.” <i>PNAS</i>, vol. 113, no. 7, National Academy of Sciences, 2016, pp. 1811–16, doi:<a href=\"https://doi.org/10.1073/pnas.1419248113\">10.1073/pnas.1419248113</a>.","chicago":"Recouvreux, Pierre, Thomas R Sokolowski, Aristea Grammoustianou, Pieter Tenwolde, and Marileen Dogterom. “Chimera Proteins with Affinity for Membranes and Microtubule Tips Polarize in the Membrane of Fission Yeast Cells.” <i>PNAS</i>. National Academy of Sciences, 2016. <a href=\"https://doi.org/10.1073/pnas.1419248113\">https://doi.org/10.1073/pnas.1419248113</a>.","ieee":"P. Recouvreux, T. R. Sokolowski, A. Grammoustianou, P. Tenwolde, and M. Dogterom, “Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells,” <i>PNAS</i>, vol. 113, no. 7. National Academy of Sciences, pp. 1811–1816, 2016.","short":"P. Recouvreux, T.R. Sokolowski, A. Grammoustianou, P. Tenwolde, M. Dogterom, PNAS 113 (2016) 1811–1816.","apa":"Recouvreux, P., Sokolowski, T. R., Grammoustianou, A., Tenwolde, P., &#38; Dogterom, M. (2016). Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1419248113\">https://doi.org/10.1073/pnas.1419248113</a>","ama":"Recouvreux P, Sokolowski TR, Grammoustianou A, Tenwolde P, Dogterom M. Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells. <i>PNAS</i>. 2016;113(7):1811-1816. doi:<a href=\"https://doi.org/10.1073/pnas.1419248113\">10.1073/pnas.1419248113</a>"},"publisher":"National Academy of Sciences","_id":"1244","day":"16","publist_id":"6085","type":"journal_article","page":"1811 - 1816","title":"Chimera proteins with affinity for membranes and microtubule tips polarize in the membrane of fission yeast cells","status":"public","scopus_import":1,"issue":"7","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"}]