[{"day":"30","type":"dissertation","publisher":"Institute of Science and Technology Austria","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"164","date_published":"2020-09-30T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:24:28Z","article_processing_charge":"No","citation":{"ista":"Han H. 2020. Novel insights into PIN polarity regulation during Arabidopsis development. Institute of Science and Technology Austria.","chicago":"Han, Huibin. “Novel Insights into PIN Polarity Regulation during Arabidopsis Development.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>.","apa":"Han, H. (2020). <i>Novel insights into PIN polarity regulation during Arabidopsis development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8589\">https://doi.org/10.15479/AT:ISTA:8589</a>","ama":"Han H. Novel insights into PIN polarity regulation during Arabidopsis development. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>","ieee":"H. Han, “Novel insights into PIN polarity regulation during Arabidopsis development,” Institute of Science and Technology Austria, 2020.","short":"H. Han, Novel Insights into PIN Polarity Regulation during Arabidopsis Development, Institute of Science and Technology Austria, 2020.","mla":"Han, Huibin. <i>Novel Insights into PIN Polarity Regulation during Arabidopsis Development</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8589\">10.15479/AT:ISTA:8589</a>."},"related_material":{"record":[{"id":"7643","status":"public","relation":"part_of_dissertation"}]},"_id":"8589","title":"Novel insights into PIN polarity regulation during Arabidopsis development","month":"09","doi":"10.15479/AT:ISTA:8589","OA_place":"publisher","alternative_title":["ISTA Thesis"],"ddc":["580"],"file":[{"access_level":"closed","relation":"source_file","creator":"dernst","file_name":"2020_Han_Thesis.docx","date_created":"2020-09-30T14:50:20Z","file_id":"8590","file_size":49198118,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"c4bda1947d4c09c428ac9ce667b02327","date_updated":"2020-09-30T14:50:20Z"},{"relation":"main_file","access_level":"open_access","date_updated":"2021-10-01T13:33:02Z","content_type":"application/pdf","checksum":"3f4f5d1718c2230adf30639ecaf8a00b","file_size":15513963,"date_created":"2020-09-30T14:49:59Z","file_id":"8591","creator":"dernst","file_name":"2020_Han_Thesis.pdf"}],"acknowledgement":"I also want to thank the China Scholarship Council for supporting my study during the year from 2015 to 2019. I also want to thank IST facilities – the Bioimaging facility, the media kitchen, the plant facility and all of the campus services, for their support.","oa":1,"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2021-10-01T13:33:02Z","author":[{"first_name":"Huibin","id":"31435098-F248-11E8-B48F-1D18A9856A87","full_name":"Han, Huibin","last_name":"Han"}],"abstract":[{"text":"The plant hormone auxin plays indispensable roles in plant growth and development. An essential level of regulation in auxin action is the directional auxin transport within cells. The establishment of auxin gradient in plant tissue has been attributed to local auxin biosynthesis and directional intercellular auxin transport, which both are controlled by various environmental and developmental signals. It is well established that asymmetric auxin distribution in cells is achieved by polarly localized PIN-FORMED (PIN) auxin efflux transporters. Despite the initial insights into cellular mechanisms of PIN polarization obtained from the last decades, the molecular mechanism and specific regulators mediating PIN polarization remains elusive. In this thesis, we aim to find novel players in PIN subcellular polarity regulation during Arabidopsis development. We first characterize the physiological effect of piperonylic acid (PA) on Arabidopsis hypocotyl gravitropic bending and PIN polarization. Secondly, we reveal the importance of SCFTIR1/AFB auxin signaling pathway in shoot gravitropism bending termination. In addition, we also explore the role of myosin XI complex, and actin cytoskeleton in auxin feedback regulation on PIN polarity. In Chapter 1, we give an overview of the current knowledge about PIN-mediated auxin fluxes in various plant tropic responses. In Chapter 2, we study the physiological effect of PA on shoot gravitropic bending. Our results show that PA treatment inhibits auxin-mediated PIN3 repolarization by interfering with PINOID and PIN3 phosphorylation status, ultimately leading to hyperbending hypocotyls. In Chapter 3, we provide evidence to show that the SCFTIR1/AFB nuclear auxin signaling pathway is crucial and required for auxin-mediated PIN3 repolarization and shoot gravitropic bending termination. In Chapter 4, we perform a phosphoproteomics approach and identify the motor protein Myosin XI and its binding protein, the MadB2 family, as an essential regulator of PIN polarity for auxin-canalization related developmental processes. In Chapter 5, we demonstrate the vital role of actin cytoskeleton in auxin feedback on PIN polarity by regulating PIN subcellular trafficking. Overall, the data presented in this PhD thesis brings novel insights into the PIN polar localization regulation that resulted in the (re)establishment of the polar auxin flow and gradient in response to environmental stimuli during plant development.","lang":"eng"}],"supervisor":[{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"department":[{"_id":"JiFr"}],"date_created":"2020-09-30T14:50:51Z","corr_author":"1","language":[{"iso":"eng"}],"degree_awarded":"PhD","publication_status":"published"},{"article_processing_charge":"No","citation":{"ieee":"R. Guseinov, “Computational design of curved thin shells: From glass façades to programmable matter,” Institute of Science and Technology Austria, 2020.","mla":"Guseinov, Ruslan. <i>Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>.","short":"R. Guseinov, Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter, Institute of Science and Technology Austria, 2020.","chicago":"Guseinov, Ruslan. “Computational Design of Curved Thin Shells: From Glass Façades to Programmable Matter.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>.","ista":"Guseinov R. 2020. Computational design of curved thin shells: From glass façades to programmable matter. Institute of Science and Technology Austria.","ama":"Guseinov R. Computational design of curved thin shells: From glass façades to programmable matter. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8366\">10.15479/AT:ISTA:8366</a>","apa":"Guseinov, R. (2020). <i>Computational design of curved thin shells: From glass façades to programmable matter</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8366\">https://doi.org/10.15479/AT:ISTA:8366</a>"},"related_material":{"record":[{"id":"8562","relation":"part_of_dissertation","status":"public"},{"id":"8375","relation":"research_data","status":"public"},{"id":"7151","relation":"research_data","status":"deleted"},{"id":"1001","status":"public","relation":"part_of_dissertation"},{"id":"7262","status":"public","relation":"part_of_dissertation"}]},"_id":"8366","title":"Computational design of curved thin shells: From glass façades to programmable matter","month":"09","OA_place":"publisher","doi":"10.15479/AT:ISTA:8366","alternative_title":["ISTA Thesis"],"ddc":["000"],"day":"21","publisher":"Institute of Science and Technology Austria","type":"dissertation","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"118","has_accepted_license":"1","date_published":"2020-09-21T00:00:00Z","project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"oa_version":"Published Version","year":"2020","date_updated":"2026-04-08T07:25:22Z","abstract":[{"lang":"eng","text":"Fabrication of curved shells plays an important role in modern design, industry, and science. Among their remarkable properties are, for example, aesthetics of organic shapes, ability to evenly distribute loads, or efficient flow separation. They find applications across vast length scales ranging from sky-scraper architecture to microscopic devices. But, at\r\nthe same time, the design of curved shells and their manufacturing process pose a variety of challenges. In this thesis, they are addressed from several perspectives. In particular, this thesis presents approaches based on the transformation of initially flat sheets into the target curved surfaces. This involves problems of interactive design of shells with nontrivial mechanical constraints, inverse design of complex structural materials, and data-driven modeling of delicate and time-dependent physical properties. At the same time, two newly-developed self-morphing mechanisms targeting flat-to-curved transformation are presented.\r\nIn architecture, doubly curved surfaces can be realized as cold bent glass panelizations. Originally flat glass panels are bent into frames and remain stressed. This is a cost-efficient fabrication approach compared to hot bending, when glass panels are shaped plastically. However such constructions are prone to breaking during bending, and it is highly\r\nnontrivial to navigate the design space, keeping the panels fabricable and aesthetically pleasing at the same time. We introduce an interactive design system for cold bent glass façades, while previously even offline optimization for such scenarios has not been sufficiently developed. Our method is based on a deep learning approach providing quick\r\nand high precision estimation of glass panel shape and stress while handling the shape\r\nmultimodality.\r\nFabrication of smaller objects of scales below 1 m, can also greatly benefit from shaping originally flat sheets. In this respect, we designed new self-morphing shell mechanisms transforming from an initial flat state to a doubly curved state with high precision and detail. Our so-called CurveUps demonstrate the encodement of the geometric information\r\ninto the shell. Furthermore, we explored the frontiers of programmable materials and showed how temporal information can additionally be encoded into a flat shell. This allows prescribing deformation sequences for doubly curved surfaces and, thus, facilitates self-collision avoidance enabling complex shapes and functionalities otherwise impossible.\r\nBoth of these methods include inverse design tools keeping the user in the design loop."}],"supervisor":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"department":[{"_id":"BeBi"}],"date_created":"2020-09-10T16:19:55Z","language":[{"iso":"eng"}],"corr_author":"1","degree_awarded":"PhD","publication_status":"published","file":[{"file_size":70950442,"file_id":"8367","date_created":"2020-09-10T16:11:49Z","file_name":"thesis_rguseinov.pdf","creator":"rguseino","date_updated":"2020-09-10T16:11:49Z","checksum":"f8da89553da36037296b0a80f14ebf50","content_type":"application/pdf","success":1,"relation":"main_file","access_level":"open_access"},{"relation":"source_file","access_level":"closed","date_updated":"2020-09-16T15:11:01Z","content_type":"application/x-zip-compressed","checksum":"e8fd944c960c20e0e27e6548af69121d","file_size":76207597,"file_id":"8374","date_created":"2020-09-11T09:39:48Z","file_name":"thesis_source.zip","creator":"rguseino"}],"acknowledgement":"During the work on this thesis, I received substantial support from IST Austria’s scientific service units. A big thank you to Todor Asenov and other Miba Machine Shop team members for their help with fabrication of experimental prototypes. In addition, I would like to thank Scientific Computing team for the support with high performance computing.\r\nFinancial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling, which I gratefully acknowledge.","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-010-7"]},"oa":1,"file_date_updated":"2020-09-16T15:11:01Z","author":[{"orcid":"0000-0001-9819-5077","last_name":"Guseinov","full_name":"Guseinov, Ruslan","id":"3AB45EE2-F248-11E8-B48F-1D18A9856A87","first_name":"Ruslan"}],"keyword":["computer-aided design","shape modeling","self-morphing","mechanical engineering"],"ec_funded":1},{"license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"lang":"eng","text":"During bacterial cell division, the tubulin-homolog FtsZ forms a ring-like structure at the center of the cell. This so-called Z-ring acts as a scaffold recruiting several division-related proteins to mid-cell and plays a key role in distributing proteins at the division site, a feature driven by the treadmilling motion of FtsZ filaments around the septum. What regulates the architecture, dynamics and stability of the Z-ring is still poorly understood, but FtsZ-associated proteins (Zaps) are known to play an important role. \r\nAdvances in fluorescence microscopy and in vitro reconstitution experiments have helped to shed light into some of the dynamic properties of these complex systems, but methods that allow to collect and analyze large quantitative data sets of the underlying polymer dynamics are still missing.\r\nHere, using an in vitro reconstitution approach, we studied how different Zaps affect FtsZ filament dynamics and organization into large-scale patterns, giving special emphasis to the role of the well-conserved protein ZapA. For this purpose, we use high-resolution fluorescence microscopy combined with novel image analysis workfows to study pattern organization and polymerization dynamics of active filaments. We quantified the influence of Zaps on FtsZ on three diferent spatial scales: the large-scale organization of the membrane-bound filament network, the underlying\r\npolymerization dynamics and the behavior of single molecules.\r\nWe found that ZapA cooperatively increases the spatial order of the filament network, binds only transiently to FtsZ filaments and has no effect on filament length and treadmilling velocity. Our data provides a model for how FtsZ-associated proteins can increase the precision and stability of the bacterial cell division machinery in a\r\nswitch-like manner, without compromising filament dynamics. Furthermore, we believe that our automated quantitative methods can be used to analyze a large variety of dynamic cytoskeletal systems, using standard time-lapse\r\nmovies of homogeneously labeled proteins obtained from experiments in vitro or even inside the living cell.\r\n"}],"supervisor":[{"orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Loose, Martin","last_name":"Loose"}],"acknowledged_ssus":[{"_id":"Bio"}],"degree_awarded":"PhD","publication_status":"published","department":[{"_id":"MaLo"}],"date_created":"2020-09-10T09:26:49Z","language":[{"iso":"eng"}],"corr_author":"1","acknowledgement":"I should also express my gratitude to the bioimaging facility at IST Austria, for their assistance with the TIRF setup over the years, and especially to Christoph Sommer, who gave me a lot of input when I was starting to dive into programming.","file":[{"file_size":141602462,"file_id":"8364","date_created":"2020-09-10T12:11:29Z","file_name":"phd_thesis_pcaldas.pdf","creator":"pcaldas","date_updated":"2020-09-10T12:11:29Z","content_type":"application/pdf","checksum":"882f93fe9c351962120e2669b84bf088","success":1,"relation":"main_file","access_level":"open_access"},{"content_type":"application/x-zip-compressed","checksum":"70cc9e399c4e41e6e6ac445ae55e8558","date_updated":"2020-09-11T07:48:10Z","creator":"pcaldas","file_name":"phd_thesis_latex_pcaldas.zip","file_id":"8365","date_created":"2020-09-10T12:18:17Z","file_size":450437458,"access_level":"closed","relation":"source_file"}],"oa":1,"publication_identifier":{"isbn":["978-3-99078-009-1"],"issn":["2663-337X"]},"file_date_updated":"2020-09-11T07:48:10Z","author":[{"orcid":"0000-0001-6730-4461","first_name":"Paulo R","id":"38FCDB4C-F248-11E8-B48F-1D18A9856A87","full_name":"Dos Santos Caldas, Paulo R","last_name":"Dos Santos Caldas"}],"_id":"8358","title":"Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers","month":"09","article_processing_charge":"No","citation":{"ista":"Dos Santos Caldas PR. 2020. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. Institute of Science and Technology Austria.","chicago":"Dos Santos Caldas, Paulo R. “Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>.","apa":"Dos Santos Caldas, P. R. (2020). <i>Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8358\">https://doi.org/10.15479/AT:ISTA:8358</a>","ama":"Dos Santos Caldas PR. Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>","ieee":"P. R. Dos Santos Caldas, “Organization and dynamics of treadmilling filaments in cytoskeletal networks of FtsZ and its crosslinkers,” Institute of Science and Technology Austria, 2020.","mla":"Dos Santos Caldas, Paulo R. <i>Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8358\">10.15479/AT:ISTA:8358</a>.","short":"P.R. Dos Santos Caldas, Organization and Dynamics of Treadmilling Filaments in Cytoskeletal Networks of FtsZ and Its Crosslinkers, Institute of Science and Technology Austria, 2020."},"related_material":{"record":[{"id":"7197","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"dissertation_contains","id":"7572"}]},"ddc":["572"],"OA_place":"publisher","doi":"10.15479/AT:ISTA:8358","alternative_title":["ISTA Thesis"],"status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Institute of Science and Technology Austria","type":"dissertation","day":"10","date_published":"2020-09-10T00:00:00Z","has_accepted_license":"1","year":"2020","oa_version":"Published Version","date_updated":"2026-04-08T07:26:30Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"135"},{"_id":"8390","title":"Leveraging structure in Computer Vision tasks for flexible Deep Learning models","month":"09","article_processing_charge":"No","citation":{"ama":"Royer A. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>","apa":"Royer, A. (2020). <i>Leveraging structure in Computer Vision tasks for flexible Deep Learning models</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>","chicago":"Royer, Amélie. “Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8390\">https://doi.org/10.15479/AT:ISTA:8390</a>.","ista":"Royer A. 2020. Leveraging structure in Computer Vision tasks for flexible Deep Learning models. Institute of Science and Technology Austria.","short":"A. Royer, Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models, Institute of Science and Technology Austria, 2020.","mla":"Royer, Amélie. <i>Leveraging Structure in Computer Vision Tasks for Flexible Deep Learning Models</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8390\">10.15479/AT:ISTA:8390</a>.","ieee":"A. Royer, “Leveraging structure in Computer Vision tasks for flexible Deep Learning models,” Institute of Science and Technology Austria, 2020."},"related_material":{"record":[{"id":"7936","relation":"part_of_dissertation","status":"public"},{"id":"8092","relation":"part_of_dissertation","status":"public"},{"id":"911","status":"public","relation":"part_of_dissertation"},{"id":"8193","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"7937"}]},"ddc":["000"],"doi":"10.15479/AT:ISTA:8390","OA_place":"publisher","alternative_title":["ISTA Thesis"],"status":"public","tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"day":"14","type":"dissertation","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","date_published":"2020-09-14T00:00:00Z","year":"2020","oa_version":"Published Version","date_updated":"2026-04-08T07:26:44Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"197","abstract":[{"text":"Deep neural networks have established a new standard for data-dependent feature extraction pipelines in the Computer Vision literature. Despite their remarkable performance in the standard supervised learning scenario, i.e. when models are trained with labeled data and tested on samples that follow a similar distribution, neural networks have been shown to struggle with more advanced generalization abilities, such as transferring knowledge across visually different domains, or generalizing to new unseen combinations of known concepts. In this thesis we argue that, in contrast to the usual black-box behavior of neural networks, leveraging more structured internal representations is a promising direction\r\nfor tackling such problems. In particular, we focus on two forms of structure. First, we tackle modularity: We show that (i) compositional architectures are a natural tool for modeling reasoning tasks, in that they efficiently capture their combinatorial nature, which is key for generalizing beyond the compositions seen during training. We investigate how to to learn such models, both formally and experimentally, for the task of abstract visual reasoning. Then, we show that (ii) in some settings, modularity allows us to efficiently break down complex tasks into smaller, easier, modules, thereby improving computational efficiency; We study this behavior in the context of generative models for colorization, as well as for small objects detection. Secondly, we investigate the inherently layered structure of representations learned by neural networks, and analyze its role in the context of transfer learning and domain adaptation across visually\r\ndissimilar domains. ","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","supervisor":[{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887"}],"acknowledged_ssus":[{"_id":"CampIT"},{"_id":"ScienComp"}],"degree_awarded":"PhD","publication_status":"published","department":[{"_id":"ChLa"}],"date_created":"2020-09-14T13:42:09Z","corr_author":"1","language":[{"iso":"eng"}],"acknowledgement":"Last but not least, I would like to acknowledge the support of the IST IT and scientific computing team for helping provide a great work environment.","file":[{"success":1,"access_level":"open_access","relation":"main_file","file_size":30224591,"creator":"dernst","file_name":"2020_Thesis_Royer.pdf","date_created":"2020-09-14T13:39:14Z","file_id":"8391","date_updated":"2020-09-14T13:39:14Z","checksum":"c914d2f88846032f3d8507734861b6ee","content_type":"application/pdf"},{"checksum":"ae98fb35d912cff84a89035ae5794d3c","content_type":"application/x-zip-compressed","date_updated":"2020-09-14T13:39:17Z","file_name":"thesis_sources.zip","creator":"dernst","date_created":"2020-09-14T13:39:17Z","file_id":"8392","file_size":74227627,"access_level":"closed","relation":"main_file"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-007-7"]},"oa":1,"author":[{"first_name":"Amélie","id":"3811D890-F248-11E8-B48F-1D18A9856A87","full_name":"Royer, Amélie","last_name":"Royer","orcid":"0000-0002-8407-0705"}],"file_date_updated":"2020-09-14T13:39:17Z"},{"publication_status":"published","language":[{"iso":"eng"}],"external_id":{"arxiv":["1711.05139"]},"department":[{"_id":"ChLa"}],"date_created":"2020-07-05T22:00:46Z","quality_controlled":"1","editor":[{"first_name":"Richa","full_name":"Singh, Richa","last_name":"Singh"},{"last_name":"Vatsa","full_name":"Vatsa, Mayank","first_name":"Mayank"},{"first_name":"Vishal M.","full_name":"Patel, Vishal M.","last_name":"Patel"},{"first_name":"Nalini","full_name":"Ratha, Nalini","last_name":"Ratha"}],"abstract":[{"text":"Image translation refers to the task of mapping images from a visual domain to another. Given two unpaired collections of images, we aim to learn a mapping between the corpus-level style of each collection, while preserving semantic content shared across the two domains. We introduce xgan, a dual adversarial auto-encoder, which captures a shared representation of the common domain semantic content in an unsupervised way, while jointly learning the domain-to-domain image translations in both directions. We exploit ideas from the domain adaptation literature and define a semantic consistency loss which encourages the learned embedding to preserve semantics shared across domains. We report promising qualitative results for the task of face-to-cartoon translation. The cartoon dataset we collected for this purpose, “CartoonSet”, is also publicly available as a new benchmark for semantic style transfer at https://google.github.io/cartoonset/index.html.","lang":"eng"}],"scopus_import":"1","author":[{"id":"3811D890-F248-11E8-B48F-1D18A9856A87","first_name":"Amélie","last_name":"Royer","full_name":"Royer, Amélie","orcid":"0000-0002-8407-0705"},{"first_name":"Konstantinos","full_name":"Bousmalis, Konstantinos","last_name":"Bousmalis"},{"first_name":"Stephan","full_name":"Gouws, Stephan","last_name":"Gouws"},{"full_name":"Bertsch, Fred","last_name":"Bertsch","first_name":"Fred"},{"last_name":"Mosseri","full_name":"Mosseri, Inbar","first_name":"Inbar"},{"first_name":"Forrester","last_name":"Cole","full_name":"Cole, Forrester"},{"first_name":"Kevin","last_name":"Murphy","full_name":"Murphy, Kevin"}],"publication":"Domain Adaptation for Visual Understanding","publication_identifier":{"isbn":["9783030306717"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1711.05139"}],"arxiv":1,"doi":"10.1007/978-3-030-30671-7_3","title":"XGAN: Unsupervised image-to-image translation for many-to-many mappings","month":"01","_id":"8092","citation":{"mla":"Royer, Amélie, et al. “XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings.” <i>Domain Adaptation for Visual Understanding</i>, edited by Richa Singh et al., Springer Nature, 2020, pp. 33–49, doi:<a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">10.1007/978-3-030-30671-7_3</a>.","short":"A. Royer, K. Bousmalis, S. Gouws, F. Bertsch, I. Mosseri, F. Cole, K. Murphy, in:, R. Singh, M. Vatsa, V.M. Patel, N. Ratha (Eds.), Domain Adaptation for Visual Understanding, Springer Nature, 2020, pp. 33–49.","ieee":"A. Royer <i>et al.</i>, “XGAN: Unsupervised image-to-image translation for many-to-many mappings,” in <i>Domain Adaptation for Visual Understanding</i>, R. Singh, M. Vatsa, V. M. Patel, and N. Ratha, Eds. Springer Nature, 2020, pp. 33–49.","ama":"Royer A, Bousmalis K, Gouws S, et al. XGAN: Unsupervised image-to-image translation for many-to-many mappings. In: Singh R, Vatsa M, Patel VM, Ratha N, eds. <i>Domain Adaptation for Visual Understanding</i>. Springer Nature; 2020:33-49. doi:<a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">10.1007/978-3-030-30671-7_3</a>","apa":"Royer, A., Bousmalis, K., Gouws, S., Bertsch, F., Mosseri, I., Cole, F., &#38; Murphy, K. (2020). XGAN: Unsupervised image-to-image translation for many-to-many mappings. In R. Singh, M. Vatsa, V. M. Patel, &#38; N. Ratha (Eds.), <i>Domain Adaptation for Visual Understanding</i> (pp. 33–49). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">https://doi.org/10.1007/978-3-030-30671-7_3</a>","chicago":"Royer, Amélie, Konstantinos Bousmalis, Stephan Gouws, Fred Bertsch, Inbar Mosseri, Forrester Cole, and Kevin Murphy. “XGAN: Unsupervised Image-to-Image Translation for Many-to-Many Mappings.” In <i>Domain Adaptation for Visual Understanding</i>, edited by Richa Singh, Mayank Vatsa, Vishal M. Patel, and Nalini Ratha, 33–49. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-30671-7_3\">https://doi.org/10.1007/978-3-030-30671-7_3</a>.","ista":"Royer A, Bousmalis K, Gouws S, Bertsch F, Mosseri I, Cole F, Murphy K. 2020.XGAN: Unsupervised image-to-image translation for many-to-many mappings. In: Domain Adaptation for Visual Understanding. , 33–49."},"related_material":{"record":[{"status":"deleted","relation":"dissertation_contains","id":"8331"},{"id":"8390","relation":"dissertation_contains","status":"public"}]},"article_processing_charge":"No","year":"2020","oa_version":"Preprint","date_updated":"2026-04-08T07:26:44Z","date_published":"2020-01-08T00:00:00Z","page":"33-49","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","type":"book_chapter","day":"08","publisher":"Springer Nature"},{"abstract":[{"lang":"eng","text":"We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit both randomness as well as angelic and demonic non-determinism. Lexicographic order allows to consider multiple objectives with a strict preference order over the satisfaction of the objectives. To the best of our knowledge, stochastic games with lexicographic objectives have not been studied before. We establish determinacy of such games and present strategy and computational complexity results. For strategy complexity, we show that lexicographically optimal strategies exist that are deterministic and memory is only required to remember the already satisfied and violated objectives. For a constant number of objectives, we show that the relevant decision problem is in   NP∩coNP , matching the current known bound for single objectives; and in general the decision problem is   PSPACE -hard and can be solved in   NEXPTIME∩coNEXPTIME . We present an algorithm that computes the lexicographically optimal strategies via a reduction to computation of optimal strategies in a sequence of single-objectives games. We have implemented our algorithm and report experimental results on various case studies."}],"quality_controlled":"1","volume":12225,"language":[{"iso":"eng"}],"date_created":"2020-08-16T22:00:58Z","external_id":{"isi":["000695272500021"],"arxiv":["2005.04018"]},"department":[{"_id":"KrCh"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030532901"]},"oa":1,"file":[{"file_size":625056,"creator":"dernst","file_name":"2020_LNCS_CAV_Chatterjee.pdf","file_id":"8276","date_created":"2020-08-17T11:32:44Z","date_updated":"2020-08-17T11:32:44Z","content_type":"application/pdf","checksum":"093d4788d7d5b2ce0ffe64fbe7820043","success":1,"access_level":"open_access","relation":"main_file"}],"isi":1,"intvolume":"     12225","ec_funded":1,"file_date_updated":"2020-08-17T11:32:44Z","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87","last_name":"Katoen","full_name":"Katoen, Joost P","orcid":"0000-0002-6143-1926"},{"first_name":"Maximilian","full_name":"Weininger, Maximilian","last_name":"Weininger"},{"first_name":"Tobias","last_name":"Winkler","full_name":"Winkler, Tobias"}],"publication":"International Conference on Computer Aided Verification","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"later_version","id":"12738"}]},"citation":{"mla":"Chatterjee, Krishnendu, et al. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” <i>International Conference on Computer Aided Verification</i>, vol. 12225, Springer Nature, 2020, pp. 398–420, doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>.","short":"K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.","ieee":"K. Chatterjee, J. P. Katoen, M. Weininger, and T. Winkler, “Stochastic games with lexicographic reachability-safety objectives,” in <i>International Conference on Computer Aided Verification</i>, 2020, vol. 12225, pp. 398–420.","ama":"Chatterjee K, Katoen JP, Weininger M, Winkler T. Stochastic games with lexicographic reachability-safety objectives. In: <i>International Conference on Computer Aided Verification</i>. Vol 12225. Springer Nature; 2020:398-420. doi:<a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">10.1007/978-3-030-53291-8_21</a>","apa":"Chatterjee, K., Katoen, J. P., Weininger, M., &#38; Winkler, T. (2020). Stochastic games with lexicographic reachability-safety objectives. In <i>International Conference on Computer Aided Verification</i> (Vol. 12225, pp. 398–420). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>","chicago":"Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.” In <i>International Conference on Computer Aided Verification</i>, 12225:398–420. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53291-8_21\">https://doi.org/10.1007/978-3-030-53291-8_21</a>.","ista":"Chatterjee K, Katoen JP, Weininger M, Winkler T. 2020. Stochastic games with lexicographic reachability-safety objectives. International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 12225, 398–420."},"conference":{"name":"CAV: Computer Aided Verification"},"article_processing_charge":"No","month":"07","title":"Stochastic games with lexicographic reachability-safety objectives","_id":"8272","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-53291-8_21","ddc":["000"],"arxiv":1,"type":"conference","publisher":"Springer Nature","day":"14","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","page":"398-420","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T09:31:14Z","year":"2020","oa_version":"Published Version","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"}],"date_published":"2020-07-14T00:00:00Z","has_accepted_license":"1"},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"623-651","date_published":"2020-05-15T00:00:00Z","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"year":"2020","oa_version":"Preprint","date_updated":"2026-04-16T09:32:27Z","type":"conference","day":"15","publisher":"Springer Nature","status":"public","doi":"10.1007/978-3-030-45374-9_21","alternative_title":["LNCS"],"article_processing_charge":"No","conference":{"location":"Edinburgh, United Kingdom","end_date":"2020-05-07","name":"PKC: Public-Key Cryptography","start_date":"2020-05-04"},"citation":{"ama":"Genise N, Micciancio D, Peikert C, Walter M. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In: <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>. Vol 12110. Springer Nature; 2020:623-651. doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>","apa":"Genise, N., Micciancio, D., Peikert, C., &#38; Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i> (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>","chicago":"Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” In <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, 12110:623–51. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">https://doi.org/10.1007/978-3-030-45374-9_21</a>.","ista":"Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.","short":"N. Genise, D. Micciancio, C. Peikert, M. Walter, in:, 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Springer Nature, 2020, pp. 623–651.","mla":"Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_21\">10.1007/978-3-030-45374-9_21</a>.","ieee":"N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in <i>23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography</i>, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651."},"_id":"8339","title":"Improved discrete Gaussian and subgaussian analysis for lattice cryptography","month":"05","publication":"23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography","scopus_import":"1","author":[{"first_name":"Nicholas","last_name":"Genise","full_name":"Genise, Nicholas"},{"first_name":"Daniele","full_name":"Micciancio, Daniele","last_name":"Micciancio"},{"last_name":"Peikert","full_name":"Peikert, Chris","first_name":"Chris"},{"orcid":"0000-0003-3186-2482","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"}],"ec_funded":1,"isi":1,"intvolume":"     12110","main_file_link":[{"url":"https://eprint.iacr.org/2020/337","open_access":"1"}],"oa":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030453732"]},"external_id":{"isi":["001299210200021"]},"department":[{"_id":"KrPi"}],"date_created":"2020-09-06T22:01:13Z","language":[{"iso":"eng"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Discrete Gaussian distributions over lattices are central to lattice-based cryptography, and to the computational and mathematical aspects of lattices more broadly. The literature contains a wealth of useful theorems about the behavior of discrete Gaussians under convolutions and related operations. Yet despite their structural similarities, most of these theorems are formally incomparable, and their proofs tend to be monolithic and written nearly “from scratch,” making them unnecessarily hard to verify, understand, and extend.\r\nIn this work we present a modular framework for analyzing linear operations on discrete Gaussian distributions. The framework abstracts away the particulars of Gaussians, and usually reduces proofs to the choice of appropriate linear transformations and elementary linear algebra. To showcase the approach, we establish several general properties of discrete Gaussians, and show how to obtain all prior convolution theorems (along with some new ones) as straightforward corollaries. As another application, we describe a self-reduction for Learning With Errors (LWE) that uses a fixed number of samples to generate an unlimited number of additional ones (having somewhat larger error). The distinguishing features of our reduction are its simple analysis in our framework, and its exclusive use of discrete Gaussians without any loss in parameters relative to a prior mixed discrete-and-continuous approach.\r\nAs a contribution of independent interest, for subgaussian random matrices we prove a singular value concentration bound with explicitly stated constants, and we give tighter heuristics for specific distributions that are commonly used for generating lattice trapdoors. These bounds yield improvements in the concrete bit-security estimates for trapdoor lattice cryptosystems."}],"volume":12110,"quality_controlled":"1"},{"abstract":[{"lang":"eng","text":"Currently several projects aim at designing and implementing protocols for privacy preserving automated contact tracing to help fight the current pandemic. Those proposal are quite similar, and in their most basic form basically propose an app for mobile phones which broadcasts frequently changing pseudorandom identifiers via (low energy) Bluetooth, and at the same time, the app stores IDs broadcast by phones in its proximity. Only if a user is tested positive, they upload either the beacons they did broadcast (which is the case in decentralized proposals as DP-3T, east and west coast PACT or Covid watch) or received (as in Popp-PT or ROBERT) during the last two weeks or so.\r\n\r\nVaudenay [eprint 2020/399] observes that this basic scheme (he considers the DP-3T proposal) succumbs to relay and even replay attacks, and proposes more complex interactive schemes which prevent those attacks without giving up too many privacy aspects. Unfortunately interaction is problematic for this application for efficiency and security reasons. The countermeasures that have been suggested so far are either not practical or give up on key privacy aspects. We propose a simple non-interactive variant of the basic protocol that\r\n(security) Provably prevents replay and (if location data is available) relay attacks.\r\n(privacy) The data of all parties (even jointly) reveals no information on the location or time where encounters happened.\r\n(efficiency) The broadcasted message can fit into 128 bits and uses only basic crypto (commitments and secret key authentication).\r\n\r\nTowards this end we introduce the concept of “delayed authentication”, which basically is a message authentication code where verification can be done in two steps, where the first doesn’t require the key, and the second doesn’t require the message."}],"volume":12578,"quality_controlled":"1","department":[{"_id":"KrPi"}],"external_id":{"isi":["000927592800001"]},"date_created":"2021-01-03T23:01:23Z","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/418"}],"oa":1,"series_title":"LNCS","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783030652760"]},"author":[{"first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654"}],"publication":"Progress in Cryptology","scopus_import":"1","ec_funded":1,"intvolume":"     12578","isi":1,"article_processing_charge":"No","conference":{"name":"INDOCRYPT: International Conference on Cryptology in India","start_date":"2020-12-13","location":"Bangalore, India","end_date":"2020-12-16"},"citation":{"ieee":"K. Z. Pietrzak, “Delayed authentication: Preventing replay and relay attacks in private contact tracing,” in <i>Progress in Cryptology</i>, Bangalore, India, 2020, vol. 12578, pp. 3–15.","short":"K.Z. Pietrzak, in:, Progress in Cryptology, Springer Nature, 2020, pp. 3–15.","mla":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” <i>Progress in Cryptology</i>, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>.","chicago":"Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” In <i>Progress in Cryptology</i>, 12578:3–15. LNCS. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>.","ista":"Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference on Cryptology in IndiaLNCS vol. 12578, 3–15.","ama":"Pietrzak KZ. Delayed authentication: Preventing replay and relay attacks in private contact tracing. In: <i>Progress in Cryptology</i>. Vol 12578. LNCS. Springer Nature; 2020:3-15. doi:<a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">10.1007/978-3-030-65277-7_1</a>","apa":"Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay attacks in private contact tracing. In <i>Progress in Cryptology</i> (Vol. 12578, pp. 3–15). Bangalore, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-65277-7_1\">https://doi.org/10.1007/978-3-030-65277-7_1</a>"},"_id":"8987","title":"Delayed authentication: Preventing replay and relay attacks in private contact tracing","month":"12","doi":"10.1007/978-3-030-65277-7_1","publisher":"Springer Nature","day":"08","type":"conference","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"3-15","date_published":"2020-12-08T00:00:00Z","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"year":"2020","oa_version":"Preprint","date_updated":"2026-04-16T09:33:26Z"},{"article_processing_charge":"No","conference":{"location":"Santa Barbara, CA, United States","end_date":"2020-08-21","name":"CRYPTO: Annual International Cryptology Conference","start_date":"2020-08-17"},"citation":{"short":"S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.","mla":"Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” <i>Advances in Cryptology – CRYPTO 2020</i>, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>.","ieee":"S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in <i>Advances in Cryptology – CRYPTO 2020</i>, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.","apa":"Chakraborty, S., Dziembowski, S., &#38; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In <i>Advances in Cryptology – CRYPTO 2020</i> (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>","ama":"Chakraborty S, Dziembowski S, Nielsen JB. Reverse firewalls for actively secure MPCs. In: <i>Advances in Cryptology – CRYPTO 2020</i>. Vol 12171. Springer Nature; 2020:732-762. doi:<a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">10.1007/978-3-030-56880-1_26</a>","ista":"Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.” In <i>Advances in Cryptology – CRYPTO 2020</i>, 12171:732–62. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-56880-1_26\">https://doi.org/10.1007/978-3-030-56880-1_26</a>."},"_id":"8322","title":"Reverse firewalls for actively secure MPCs","month":"08","doi":"10.1007/978-3-030-56880-1_26","alternative_title":["LNCS"],"type":"conference","day":"10","publisher":"Springer Nature","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"732-762","date_published":"2020-08-10T00:00:00Z","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"year":"2020","oa_version":"Preprint","date_updated":"2026-04-16T09:31:34Z","abstract":[{"lang":"eng","text":"Reverse firewalls were introduced at Eurocrypt 2015 by Miro-nov and Stephens-Davidowitz, as a method for protecting cryptographic protocols against attacks on the devices of the honest parties. In a nutshell: a reverse firewall is placed outside of a device and its goal is to “sanitize” the messages sent by it, in such a way that a malicious device cannot leak its secrets to the outside world. It is typically assumed that the cryptographic devices are attacked in a “functionality-preserving way” (i.e. informally speaking, the functionality of the protocol remains unchanged under this attacks). In their paper, Mironov and Stephens-Davidowitz construct a protocol for passively-secure two-party computations with firewalls, leaving extension of this result to stronger models as an open question.\r\nIn this paper, we address this problem by constructing a protocol for secure computation with firewalls that has two main advantages over the original protocol from Eurocrypt 2015. Firstly, it is a multiparty computation protocol (i.e. it works for an arbitrary number n of the parties, and not just for 2). Secondly, it is secure in much stronger corruption settings, namely in the active corruption model. More precisely: we consider an adversary that can fully corrupt up to 𝑛−1 parties, while the remaining parties are corrupt in a functionality-preserving way.\r\nOur core techniques are: malleable commitments and malleable non-interactive zero-knowledge, which in particular allow us to create a novel protocol for multiparty augmented coin-tossing into the well with reverse firewalls (that is based on a protocol of Lindell from Crypto 2001)."}],"volume":12171,"quality_controlled":"1","external_id":{"isi":["001415325700026"]},"department":[{"_id":"KrPi"}],"date_created":"2020-08-30T22:01:12Z","language":[{"iso":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1317"}],"acknowledgement":"We would like to thank the anonymous reviewers for their helpful comments and suggestions. The work was initiated while the first author was in IIT Madras, India. Part of this work was done while the author was visiting the University of Warsaw. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT) and from the Foundation for Polish Science under grant TEAM/2016-1/4 founded within the UE 2014–2020 Smart Growth Operational Program. The last author was supported by the Independent Research Fund Denmark project BETHE and the Concordium Blockchain Research Center, Aarhus University, Denmark.","publication_identifier":{"isbn":["9783030568795"],"issn":["0302-9743"],"eissn":["1611-3349"]},"oa":1,"author":[{"full_name":"Chakraborty, Suvradip","last_name":"Chakraborty","first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425"},{"last_name":"Dziembowski","full_name":"Dziembowski, Stefan","first_name":"Stefan"},{"first_name":"Jesper Buus","last_name":"Nielsen","full_name":"Nielsen, Jesper Buus"}],"scopus_import":"1","publication":"Advances in Cryptology – CRYPTO 2020","ec_funded":1,"intvolume":"     12171","isi":1},{"volume":12166,"quality_controlled":"1","abstract":[{"text":"Fixed-point arithmetic is a popular alternative to floating-point arithmetic on embedded systems. Existing work on the verification of fixed-point programs relies on custom formalizations of fixed-point arithmetic, which makes it hard to compare the described techniques or reuse the implementations. In this paper, we address this issue by proposing and formalizing an SMT theory of fixed-point arithmetic. We present an intuitive yet comprehensive syntax of the fixed-point theory, and provide formal semantics for it based on rational arithmetic. We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals. We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created. Finally, we perform a case study of using the theory we propose to verify properties of quantized neural networks.","lang":"eng"}],"publication_status":"published","department":[{"_id":"ToHe"}],"external_id":{"isi":["000884318000002"]},"date_created":"2020-08-02T22:00:59Z","language":[{"iso":"eng"}],"oa":1,"publication_identifier":{"isbn":["9783030510732"],"issn":["0302-9743"],"eissn":["1611-3349"]},"main_file_link":[{"url":"https://doi.org/10.1007/978-3-030-51074-9_2","open_access":"1"}],"scopus_import":"1","author":[{"first_name":"Marek","full_name":"Baranowski, Marek","last_name":"Baranowski"},{"full_name":"He, Shaobo","last_name":"He","first_name":"Shaobo"},{"first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner","full_name":"Lechner, Mathias"},{"first_name":"Thanh Son","last_name":"Nguyen","full_name":"Nguyen, Thanh Son"},{"full_name":"Rakamarić, Zvonimir","last_name":"Rakamarić","first_name":"Zvonimir"}],"publication":"Automated Reasoning","intvolume":"     12166","isi":1,"_id":"8194","title":"An SMT theory of fixed-point arithmetic","month":"06","article_processing_charge":"No","conference":{"location":"Paris, France","end_date":"2020-07-04","name":"IJCAR: International Joint Conference on Automated Reasoning","start_date":"2020-07-01"},"citation":{"ama":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. An SMT theory of fixed-point arithmetic. In: <i>Automated Reasoning</i>. Vol 12166. Springer Nature; 2020:13-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>","apa":"Baranowski, M., He, S., Lechner, M., Nguyen, T. S., &#38; Rakamarić, Z. (2020). An SMT theory of fixed-point arithmetic. In <i>Automated Reasoning</i> (Vol. 12166, pp. 13–31). Paris, France: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>","chicago":"Baranowski, Marek, Shaobo He, Mathias Lechner, Thanh Son Nguyen, and Zvonimir Rakamarić. “An SMT Theory of Fixed-Point Arithmetic.” In <i>Automated Reasoning</i>, 12166:13–31. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">https://doi.org/10.1007/978-3-030-51074-9_2</a>.","ista":"Baranowski M, He S, Lechner M, Nguyen TS, Rakamarić Z. 2020. An SMT theory of fixed-point arithmetic. Automated Reasoning. IJCAR: International Joint Conference on Automated Reasoning, LNCS, vol. 12166, 13–31.","short":"M. Baranowski, S. He, M. Lechner, T.S. Nguyen, Z. Rakamarić, in:, Automated Reasoning, Springer Nature, 2020, pp. 13–31.","mla":"Baranowski, Marek, et al. “An SMT Theory of Fixed-Point Arithmetic.” <i>Automated Reasoning</i>, vol. 12166, Springer Nature, 2020, pp. 13–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-51074-9_2\">10.1007/978-3-030-51074-9_2</a>.","ieee":"M. Baranowski, S. He, M. Lechner, T. S. Nguyen, and Z. Rakamarić, “An SMT theory of fixed-point arithmetic,” in <i>Automated Reasoning</i>, Paris, France, 2020, vol. 12166, pp. 13–31."},"doi":"10.1007/978-3-030-51074-9_2","alternative_title":["LNCS"],"status":"public","publisher":"Springer Nature","type":"conference","day":"24","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"date_published":"2020-06-24T00:00:00Z","year":"2020","oa_version":"Published Version","date_updated":"2026-04-16T09:29:42Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"13-31"},{"abstract":[{"lang":"eng","text":"Quantization converts neural networks into low-bit fixed-point computations which can be carried out by efficient integer-only hardware, and is standard practice for the deployment of neural networks on real-time embedded devices. However, like their real-numbered counterpart, quantized networks are not immune to malicious misclassification caused by adversarial attacks. We investigate how quantization affects a network’s robustness to adversarial attacks, which is a formal verification question. We show that neither robustness nor non-robustness are monotonic with changing the number of bits for the representation and, also, neither are preserved by quantization from a real-numbered network. For this reason, we introduce a verification method for quantized neural networks which, using SMT solving over bit-vectors, accounts for their exact, bit-precise semantics. We built a tool and analyzed the effect of quantization on a classifier for the MNIST dataset. We demonstrate that, compared to our method, existing methods for the analysis of real-numbered networks often derive false conclusions about their quantizations, both when determining robustness and when detecting attacks, and that existing methods for quantized networks often miss attacks. Furthermore, we applied our method beyond robustness, showing how the number of bits in quantization enlarges the gender bias of a predictor for students’ grades."}],"volume":12079,"quality_controlled":"1","department":[{"_id":"ToHe"}],"external_id":{"isi":["001288734300005"]},"date_created":"2020-05-10T22:00:49Z","corr_author":"1","language":[{"iso":"eng"}],"publication_status":"published","file":[{"relation":"main_file","access_level":"open_access","date_updated":"2020-07-14T12:48:03Z","content_type":"application/pdf","checksum":"f19905a42891fe5ce93d69143fa3f6fb","file_size":2744030,"date_created":"2020-05-26T12:48:15Z","file_id":"7893","file_name":"2020_TACAS_Giacobbe.pdf","creator":"dernst"}],"oa":1,"publication_identifier":{"isbn":["9783030452360"],"issn":["0302-9743"],"eissn":["1611-3349"]},"publication":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":[{"orcid":"0000-0001-8180-0904","first_name":"Mirco","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","full_name":"Giacobbe, Mirco","last_name":"Giacobbe"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"},{"full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","first_name":"Mathias"}],"file_date_updated":"2020-07-14T12:48:03Z","scopus_import":"1","intvolume":"     12079","isi":1,"article_processing_charge":"No","conference":{"start_date":"2020-04-25","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2020-04-30","location":"Dublin, Ireland"},"citation":{"ama":"Giacobbe M, Henzinger TA, Lechner M. How many bits does it take to quantize your neural network? In: <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 12079. Springer Nature; 2020:79-97. doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>","apa":"Giacobbe, M., Henzinger, T. A., &#38; Lechner, M. (2020). How many bits does it take to quantize your neural network? In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 12079, pp. 79–97). Dublin, Ireland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>","chicago":"Giacobbe, Mirco, Thomas A Henzinger, and Mathias Lechner. “How Many Bits Does It Take to Quantize Your Neural Network?” In <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 12079:79–97. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">https://doi.org/10.1007/978-3-030-45237-7_5</a>.","ista":"Giacobbe M, Henzinger TA, Lechner M. 2020. How many bits does it take to quantize your neural network? International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12079, 79–97.","short":"M. Giacobbe, T.A. Henzinger, M. Lechner, in:, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2020, pp. 79–97.","mla":"Giacobbe, Mirco, et al. “How Many Bits Does It Take to Quantize Your Neural Network?” <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 12079, Springer Nature, 2020, pp. 79–97, doi:<a href=\"https://doi.org/10.1007/978-3-030-45237-7_5\">10.1007/978-3-030-45237-7_5</a>.","ieee":"M. Giacobbe, T. A. Henzinger, and M. Lechner, “How many bits does it take to quantize your neural network?,” in <i>International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Dublin, Ireland, 2020, vol. 12079, pp. 79–97."},"related_material":{"record":[{"id":"11362","relation":"dissertation_contains","status":"public"}]},"_id":"7808","title":"How many bits does it take to quantize your neural network?","month":"04","doi":"10.1007/978-3-030-45237-7_5","alternative_title":["LNCS"],"ddc":["000"],"day":"17","publisher":"Springer Nature","type":"conference","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"79-97","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"date_published":"2020-04-17T00:00:00Z","has_accepted_license":"1","year":"2020","oa_version":"Published Version","date_updated":"2026-04-16T09:46:07Z"},{"quality_controlled":"1","volume":39,"article_number":"e103358","abstract":[{"text":"CLC chloride/proton exchangers may support acidification of endolysosomes and raise their luminal Cl− concentration. Disruption of endosomal ClC‐3 causes severe neurodegeneration. To assess the importance of ClC‐3 Cl−/H+ exchange, we now generate Clcn3unc/unc mice in which ClC‐3 is converted into a Cl− channel. Unlike Clcn3−/− mice, Clcn3unc/unc mice appear normal owing to compensation by ClC‐4 with which ClC‐3 forms heteromers. ClC‐4 protein levels are strongly reduced in Clcn3−/−, but not in Clcn3unc/unc mice because ClC‐3unc binds and stabilizes ClC‐4 like wild‐type ClC‐3. Although mice lacking ClC‐4 appear healthy, its absence in Clcn3unc/unc/Clcn4−/− mice entails even stronger neurodegeneration than observed in Clcn3−/− mice. A fraction of ClC‐3 is found on synaptic vesicles, but miniature postsynaptic currents and synaptic vesicle acidification are not affected in Clcn3unc/unc or Clcn3−/− mice before neurodegeneration sets in. Both, Cl−/H+‐exchange activity and the stabilizing effect on ClC‐4, are central to the biological function of ClC‐3.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","publication_status":"published","language":[{"iso":"eng"}],"date_created":"2020-03-15T23:00:55Z","department":[{"_id":"GaNo"}],"external_id":{"isi":["000517335000001"],"pmid":["32118314"]},"publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"oa":1,"pmid":1,"acknowledgement":"We thank T. Stauber and T. Breiderhoff for cloning expression constructs; K. Räbel, S. Hohensee, and C. Backhaus for technical assistance; R. Jahn (MPIbpc, Göttingen) for providing the equipment required for SV purification; and A\r\nWoehler (MDC, Berlin) for assistance with SV imaging. Supported, in part, by grants from the Deutsche Forschungsgemeinschaft (JE164/9-2, SFB740 TP C5, FOR 2625 (JE164/14-1), NeuroCure Cluster of Excellence), the European Research Council Advanced Grant CYTOVOLION (ERC 294435) and the Prix Louis-Jeantet de Médecine to TJJ, and Peter and Traudl Engelhorn fellowship to ZF.","file":[{"date_created":"2020-03-23T13:51:11Z","file_id":"7615","file_name":"2020_EMBO_Weinert.pdf","creator":"dernst","file_size":12243278,"content_type":"application/pdf","checksum":"82750a7a93e3740decbce8474004111a","date_updated":"2020-07-14T12:48:00Z","relation":"main_file","access_level":"open_access"}],"intvolume":"        39","isi":1,"file_date_updated":"2020-07-14T12:48:00Z","scopus_import":"1","publication":"EMBO Journal","author":[{"full_name":"Weinert, Stefanie","last_name":"Weinert","first_name":"Stefanie"},{"first_name":"Niclas","last_name":"Gimber","full_name":"Gimber, Niclas"},{"first_name":"Dorothea","full_name":"Deuschel, Dorothea","last_name":"Deuschel"},{"first_name":"Till","full_name":"Stuhlmann, Till","last_name":"Stuhlmann"},{"first_name":"Dmytro","last_name":"Puchkov","full_name":"Puchkov, Dmytro"},{"first_name":"Zohreh","full_name":"Farsi, Zohreh","last_name":"Farsi"},{"first_name":"Carmen F.","full_name":"Ludwig, Carmen F.","last_name":"Ludwig"},{"orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia","last_name":"Novarino","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Karen I.","last_name":"López-Cayuqueo","full_name":"López-Cayuqueo, Karen I."},{"full_name":"Planells-Cases, Rosa","last_name":"Planells-Cases","first_name":"Rosa"},{"first_name":"Thomas J.","full_name":"Jentsch, Thomas J.","last_name":"Jentsch"}],"month":"03","title":"Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration","_id":"7586","citation":{"ieee":"S. Weinert <i>et al.</i>, “Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration,” <i>EMBO Journal</i>, vol. 39. EMBO Press, 2020.","mla":"Weinert, Stefanie, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange Causes Severe Neurodegeneration.” <i>EMBO Journal</i>, vol. 39, e103358, EMBO Press, 2020, doi:<a href=\"https://doi.org/10.15252/embj.2019103358\">10.15252/embj.2019103358</a>.","short":"S. Weinert, N. Gimber, D. Deuschel, T. Stuhlmann, D. Puchkov, Z. Farsi, C.F. Ludwig, G. Novarino, K.I. López-Cayuqueo, R. Planells-Cases, T.J. Jentsch, EMBO Journal 39 (2020).","chicago":"Weinert, Stefanie, Niclas Gimber, Dorothea Deuschel, Till Stuhlmann, Dmytro Puchkov, Zohreh Farsi, Carmen F. Ludwig, et al. “Uncoupling Endosomal CLC Chloride/Proton Exchange Causes Severe Neurodegeneration.” <i>EMBO Journal</i>. EMBO Press, 2020. <a href=\"https://doi.org/10.15252/embj.2019103358\">https://doi.org/10.15252/embj.2019103358</a>.","ista":"Weinert S, Gimber N, Deuschel D, Stuhlmann T, Puchkov D, Farsi Z, Ludwig CF, Novarino G, López-Cayuqueo KI, Planells-Cases R, Jentsch TJ. 2020. Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. EMBO Journal. 39, e103358.","ama":"Weinert S, Gimber N, Deuschel D, et al. Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. <i>EMBO Journal</i>. 2020;39. doi:<a href=\"https://doi.org/10.15252/embj.2019103358\">10.15252/embj.2019103358</a>","apa":"Weinert, S., Gimber, N., Deuschel, D., Stuhlmann, T., Puchkov, D., Farsi, Z., … Jentsch, T. J. (2020). Uncoupling endosomal CLC chloride/proton exchange causes severe neurodegeneration. <i>EMBO Journal</i>. EMBO Press. <a href=\"https://doi.org/10.15252/embj.2019103358\">https://doi.org/10.15252/embj.2019103358</a>"},"article_processing_charge":"No","ddc":["570"],"article_type":"original","doi":"10.15252/embj.2019103358","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"status":"public","publisher":"EMBO Press","type":"journal_article","day":"02","date_updated":"2026-04-16T09:35:48Z","oa_version":"Published Version","year":"2020","date_published":"2020-03-02T00:00:00Z","has_accepted_license":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd"},{"page":"475-506","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T10:21:02Z","year":"2020","oa_version":"Submitted Version","project":[{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"date_published":"2020-05-01T00:00:00Z","day":"01","publisher":"Springer Nature","type":"conference","status":"public","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-45727-3_16","citation":{"chicago":"Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target: Scalability in Public-Key Encryption.” In <i>Advances in Cryptology – EUROCRYPT 2020</i>, 12107:475–506. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45727-3_16\">https://doi.org/10.1007/978-3-030-45727-3_16</a>.","ista":"Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.","ama":"Auerbach B, Giacon F, Kiltz E. Everybody’s a target: Scalability in public-key encryption. In: <i>Advances in Cryptology – EUROCRYPT 2020</i>. Vol 12107. Springer Nature; 2020:475-506. doi:<a href=\"https://doi.org/10.1007/978-3-030-45727-3_16\">10.1007/978-3-030-45727-3_16</a>","apa":"Auerbach, B., Giacon, F., &#38; Kiltz, E. (2020). Everybody’s a target: Scalability in public-key encryption. In <i>Advances in Cryptology – EUROCRYPT 2020</i> (Vol. 12107, pp. 475–506). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45727-3_16\">https://doi.org/10.1007/978-3-030-45727-3_16</a>","ieee":"B. Auerbach, F. Giacon, and E. Kiltz, “Everybody’s a target: Scalability in public-key encryption,” in <i>Advances in Cryptology – EUROCRYPT 2020</i>, 2020, vol. 12107, pp. 475–506.","short":"B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT 2020, Springer Nature, 2020, pp. 475–506.","mla":"Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key Encryption.” <i>Advances in Cryptology – EUROCRYPT 2020</i>, vol. 12107, Springer Nature, 2020, pp. 475–506, doi:<a href=\"https://doi.org/10.1007/978-3-030-45727-3_16\">10.1007/978-3-030-45727-3_16</a>."},"conference":{"end_date":"2020-05-15","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","start_date":"2020-05-11"},"article_processing_charge":"No","month":"05","title":"Everybody’s a target: Scalability in public-key encryption","_id":"7966","isi":1,"intvolume":"     12107","ec_funded":1,"scopus_import":"1","author":[{"orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","first_name":"Benedikt","full_name":"Auerbach, Benedikt","last_name":"Auerbach"},{"first_name":"Federico","last_name":"Giacon","full_name":"Giacon, Federico"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"}],"publication":"Advances in Cryptology – EUROCRYPT 2020","main_file_link":[{"url":"https://eprint.iacr.org/2019/364","open_access":"1"}],"oa":1,"publication_identifier":{"isbn":["9783030457266"],"eisbn":["9783030457273"],"issn":["0302-9743"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"date_created":"2020-06-15T07:13:37Z","department":[{"_id":"KrPi"}],"external_id":{"isi":["000828688000016"]},"publication_status":"published","abstract":[{"lang":"eng","text":"For 1≤m≤n, we consider a natural m-out-of-n multi-instance scenario for a public-key encryption (PKE) scheme. An adversary, given n independent instances of PKE, wins if he breaks at least m out of the n instances. In this work, we are interested in the scaling factor of PKE schemes, SF, which measures how well the difficulty of breaking m out of the n instances scales in m. That is, a scaling factor SF=ℓ indicates that breaking m out of n instances is at least ℓ times more difficult than breaking one single instance. A PKE scheme with small scaling factor hence provides an ideal target for mass surveillance. In fact, the Logjam attack (CCS 2015) implicitly exploited, among other things, an almost constant scaling factor of ElGamal over finite fields (with shared group parameters).\r\n\r\nFor Hashed ElGamal over elliptic curves, we use the generic group model to argue that the scaling factor depends on the scheme's granularity. In low granularity, meaning each public key contains its independent group parameter, the scheme has optimal scaling factor SF=m; In medium and high granularity, meaning all public keys share the same group parameter, the scheme still has a reasonable scaling factor SF=√m. Our findings underline that instantiating ElGamal over elliptic curves should be preferred to finite fields in a multi-instance scenario.\r\n\r\nAs our main technical contribution, we derive new generic-group lower bounds of Ω(√(mp)) on the difficulty of solving both the m-out-of-n Gap Discrete Logarithm and the m-out-of-n Gap Computational Diffie-Hellman problem over groups of prime order p, extending a recent result by Yun (EUROCRYPT 2015). We establish the lower bound by studying the hardness of a related computational problem which we call the search-by-hypersurface problem."}],"quality_controlled":"1","volume":12107},{"oa":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030605070"],"eisbn":["9783030605087"]},"file":[{"date_updated":"2020-10-15T14:28:06Z","content_type":"application/pdf","checksum":"00661f9b7034f52e18bf24fa552b8194","file_size":478148,"date_created":"2020-10-15T14:28:06Z","file_id":"8665","creator":"esarac","file_name":"monitorability.pdf","relation":"main_file","access_level":"open_access","success":1}],"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award).","isi":1,"intvolume":"     12399","publication":"Runtime Verification","file_date_updated":"2020-10-15T14:28:06Z","scopus_import":"1","author":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"abstract":[{"text":"We introduce the monitoring of trace properties under assumptions. An assumption limits the space of possible traces that the monitor may encounter. An assumption may result from knowledge about the system that is being monitored, about the environment, or about another, connected monitor. We define monitorability under assumptions and study its theoretical properties. In particular, we show that for every assumption A, the boolean combinations of properties that are safe or co-safe relative to A are monitorable under A. We give several examples and constructions on how an assumption can make a non-monitorable property monitorable, and how an assumption can make a monitorable property monitorable with fewer resources, such as integer registers.","lang":"eng"}],"quality_controlled":"1","volume":12399,"language":[{"iso":"eng"}],"date_created":"2020-10-07T15:05:37Z","department":[{"_id":"ToHe"}],"external_id":{"isi":["000728160600001"]},"publication_status":"published","publisher":"Springer Nature","type":"conference","day":"02","status":"public","page":"3-18","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-16T10:22:01Z","oa_version":"Submitted Version","year":"2020","date_published":"2020-10-02T00:00:00Z","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems"}],"has_accepted_license":"1","citation":{"ista":"Henzinger TA, Sarac NE. 2020. Monitorability under assumptions. Runtime Verification. RV: Runtime Verification, LNCS, vol. 12399, 3–18.","chicago":"Henzinger, Thomas A, and Naci E Sarac. “Monitorability under Assumptions.” In <i>Runtime Verification</i>, 12399:3–18. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-60508-7_1\">https://doi.org/10.1007/978-3-030-60508-7_1</a>.","apa":"Henzinger, T. A., &#38; Sarac, N. E. (2020). Monitorability under assumptions. In <i>Runtime Verification</i> (Vol. 12399, pp. 3–18). Los Angeles, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-60508-7_1\">https://doi.org/10.1007/978-3-030-60508-7_1</a>","ama":"Henzinger TA, Sarac NE. Monitorability under assumptions. In: <i>Runtime Verification</i>. Vol 12399. Springer Nature; 2020:3-18. doi:<a href=\"https://doi.org/10.1007/978-3-030-60508-7_1\">10.1007/978-3-030-60508-7_1</a>","ieee":"T. A. Henzinger and N. E. Sarac, “Monitorability under assumptions,” in <i>Runtime Verification</i>, Los Angeles, CA, United States, 2020, vol. 12399, pp. 3–18.","mla":"Henzinger, Thomas A., and Naci E. Sarac. “Monitorability under Assumptions.” <i>Runtime Verification</i>, vol. 12399, Springer Nature, 2020, pp. 3–18, doi:<a href=\"https://doi.org/10.1007/978-3-030-60508-7_1\">10.1007/978-3-030-60508-7_1</a>.","short":"T.A. Henzinger, N.E. Sarac, in:, Runtime Verification, Springer Nature, 2020, pp. 3–18."},"conference":{"end_date":"2020-10-09","location":"Los Angeles, CA, United States","start_date":"2020-10-06","name":"RV: Runtime Verification"},"article_processing_charge":"No","month":"10","title":"Monitorability under assumptions","_id":"8623","alternative_title":["LNCS"],"doi":"10.1007/978-3-030-60508-7_1","ddc":["000"]},{"doi":"10.1007/978-3-030-60440-0_26","alternative_title":["LNCS"],"citation":{"chicago":"Arroyo Guevara, Alan M, Fabian Klute, Irene Parada, Raimund Seidel, Birgit Vogtenhuber, and Tilo Wiedera. “Inserting One Edge into a Simple Drawing Is Hard.” In <i>Graph-Theoretic Concepts in Computer Science</i>, 12301:325–38. Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>.","ista":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301, 325–338.","ama":"Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Inserting one edge into a simple drawing is hard. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 12301. Springer Nature; 2020:325-338. doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>","apa":"Arroyo Guevara, A. M., Klute, F., Parada, I., Seidel, R., Vogtenhuber, B., &#38; Wiedera, T. (2020). Inserting one edge into a simple drawing is hard. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 12301, pp. 325–338). Leeds, United Kingdom: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">https://doi.org/10.1007/978-3-030-60440-0_26</a>","ieee":"A. M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, and T. Wiedera, “Inserting one edge into a simple drawing is hard,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Leeds, United Kingdom, 2020, vol. 12301, pp. 325–338.","short":"A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338.","mla":"Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:<a href=\"https://doi.org/10.1007/978-3-030-60440-0_26\">10.1007/978-3-030-60440-0_26</a>."},"article_processing_charge":"No","conference":{"start_date":"2020-06-24","name":"WG: Workshop on Graph-Theoretic Concepts in Computer Science","end_date":"2020-06-26","location":"Leeds, United Kingdom"},"title":"Inserting one edge into a simple drawing is hard","month":"10","_id":"8732","page":"325-338","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","year":"2020","oa_version":"None","date_updated":"2026-04-16T10:22:35Z","date_published":"2020-10-09T00:00:00Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"type":"conference","day":"09","publisher":"Springer Nature","status":"public","language":[{"iso":"eng"}],"external_id":{"isi":["001299688100026"]},"department":[{"_id":"UlWa"}],"date_created":"2020-11-06T08:45:03Z","publication_status":"published","abstract":[{"lang":"eng","text":"A simple drawing D(G) of a graph G is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge e in the complement of G can be inserted into D(G) if there exists a simple drawing of   G+e  extending D(G). As a result of Levi’s Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is   NP -complete to decide whether one edge can be inserted into a simple drawing. This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles   A  and a pseudosegment   σ , it can be decided in polynomial time whether there exists a pseudocircle   Φσ  extending   σ  for which   A∪{Φσ}  is again an arrangement of pseudocircles."}],"quality_controlled":"1","volume":12301,"ec_funded":1,"intvolume":"     12301","isi":1,"scopus_import":"1","publication":"Graph-Theoretic Concepts in Computer Science","author":[{"orcid":"0000-0003-2401-8670","last_name":"Arroyo Guevara","full_name":"Arroyo Guevara, Alan M","first_name":"Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fabian","last_name":"Klute","full_name":"Klute, Fabian"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"last_name":"Seidel","full_name":"Seidel, Raimund","first_name":"Raimund"},{"first_name":"Birgit","full_name":"Vogtenhuber, Birgit","last_name":"Vogtenhuber"},{"last_name":"Wiedera","full_name":"Wiedera, Tilo","first_name":"Tilo"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783030604400"],"isbn":["9783030604394"]}},{"abstract":[{"lang":"eng","text":"We introduce the notion of Witness Maps as a cryptographic notion of a proof system. A Unique Witness Map (UWM) deterministically maps all witnesses for an   NP  statement to a single representative witness, resulting in a computationally sound, deterministic-prover, non-interactive witness independent proof system. A relaxation of UWM, called Compact Witness Map (CWM), maps all the witnesses to a small number of witnesses, resulting in a “lossy” deterministic-prover, non-interactive proof-system. We also define a Dual Mode Witness Map (DMWM) which adds an “extractable” mode to a CWM.\r\nOur main construction is a DMWM for all   NP  relations, assuming sub-exponentially secure indistinguishability obfuscation (  iO ), along with standard cryptographic assumptions. The DMWM construction relies on a CWM and a new primitive called Cumulative All-Lossy-But-One Trapdoor Functions (C-ALBO-TDF), both of which are in turn instantiated based on   iO  and other primitives. Our instantiation of a CWM is in fact a UWM; in turn, we show that a UWM implies Witness Encryption. Along the way to constructing UWM and C-ALBO-TDF, we also construct, from standard assumptions, Puncturable Digital Signatures and a new primitive called Cumulative Lossy Trapdoor Functions (C-LTDF). The former improves up on a construction of Bellare et al. (Eurocrypt 2016), who relied on sub-exponentially secure   iO  and sub-exponentially secure OWF.\r\nAs an application of our constructions, we show how to use a DMWM to construct the first leakage and tamper-resilient signatures with a deterministic signer, thereby solving a decade old open problem posed by Katz and Vaikunthanathan (Asiacrypt 2009), by Boyle, Segev and Wichs (Eurocrypt 2011), as well as by Faonio and Venturi (Asiacrypt 2016). Our construction achieves the optimal leakage rate of   1−o(1) ."}],"editor":[{"last_name":"Kiayias","full_name":"Kiayias, A","first_name":"A"}],"volume":12110,"quality_controlled":"1","date_created":"2022-03-18T11:35:51Z","external_id":{"isi":["001299210200008"]},"language":[{"iso":"eng"}],"corr_author":"1","publication_status":"published","main_file_link":[{"url":"https://eprint.iacr.org/2020/090","open_access":"1"}],"acknowledgement":"We would like to thank the anonymous reviewers of PKC 2019 for their useful comments and suggestions. We thank Omer Paneth for pointing out to us the connection between Unique Witness Maps (UWM) and Witness encryption (WE). The first author would like to acknowledge Pandu Rangan for his involvement during the initial discussion phase of the project.","oa":1,"publication_identifier":{"eisbn":["9783030453749"],"isbn":["9783030453732"],"eissn":["1611-3349"],"issn":["0302-9743"]},"series_title":"LNCS","publication":"Public-Key Cryptography","scopus_import":"1","author":[{"id":"B9CD0494-D033-11E9-B219-A439E6697425","first_name":"Suvradip","last_name":"Chakraborty","full_name":"Chakraborty, Suvradip"},{"last_name":"Prabhakaran","full_name":"Prabhakaran, Manoj","first_name":"Manoj"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"isi":1,"intvolume":"     12110","article_processing_charge":"No","citation":{"chicago":"Chakraborty, Suvradip, Manoj Prabhakaran, and Daniel Wichs. “Witness Maps and Applications.” In <i>Public-Key Cryptography</i>, edited by A Kiayias, 12110:220–46. LNCS. Cham: Springer Nature, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_8\">https://doi.org/10.1007/978-3-030-45374-9_8</a>.","ista":"Chakraborty S, Prabhakaran M, Wichs D. 2020.Witness maps and applications. In: Public-Key Cryptography. vol. 12110, 220–246.","ama":"Chakraborty S, Prabhakaran M, Wichs D. Witness maps and applications. In: Kiayias A, ed. <i>Public-Key Cryptography</i>. Vol 12110. LNCS. Cham: Springer Nature; 2020:220-246. doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_8\">10.1007/978-3-030-45374-9_8</a>","apa":"Chakraborty, S., Prabhakaran, M., &#38; Wichs, D. (2020). Witness maps and applications. In A. Kiayias (Ed.), <i>Public-Key Cryptography</i> (Vol. 12110, pp. 220–246). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-45374-9_8\">https://doi.org/10.1007/978-3-030-45374-9_8</a>","ieee":"S. Chakraborty, M. Prabhakaran, and D. Wichs, “Witness maps and applications,” in <i>Public-Key Cryptography</i>, vol. 12110, A. Kiayias, Ed. Cham: Springer Nature, 2020, pp. 220–246.","mla":"Chakraborty, Suvradip, et al. “Witness Maps and Applications.” <i>Public-Key Cryptography</i>, edited by A Kiayias, vol. 12110, Springer Nature, 2020, pp. 220–46, doi:<a href=\"https://doi.org/10.1007/978-3-030-45374-9_8\">10.1007/978-3-030-45374-9_8</a>.","short":"S. Chakraborty, M. Prabhakaran, D. Wichs, in:, A. Kiayias (Ed.), Public-Key Cryptography, Springer Nature, Cham, 2020, pp. 220–246."},"_id":"10865","month":"04","title":"Witness maps and applications","doi":"10.1007/978-3-030-45374-9_8","type":"book_chapter","day":"29","publisher":"Springer Nature","status":"public","place":"Cham","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"220-246","date_published":"2020-04-29T00:00:00Z","date_updated":"2026-04-16T10:21:31Z","oa_version":"Preprint","year":"2020"},{"oa":1,"publication_identifier":{"eissn":["1477-9137"],"issn":["0021-9533"]},"pmid":1,"acknowledgement":"This work was supported in part by Deutsche Forschungsgemeinschaft (DFG)[GRK2223/1, RO2414/5-1 (to K.R.), FA350/11-1 (to M.F.) and FA330/11-1 (to J.F.)],as well as by intramural funding from the Helmholtz Association (to T.E.B.S. andK.R.). G.D. was additionally funded by the Austrian Science Fund (FWF) LiseMeitner Program [M-2495]. A.C.H. and M.W. are supported by the Francis CrickInstitute, which receives its core funding from Cancer Research UK [FC001209], theMedical Research Council [FC001209] and the Wellcome Trust [FC001209]. M.K. issupported by the Biotechnology and Biological Sciences Research Council [BB/F011431/1, BB/J000590/1, BB/N000226/1]. Deposited in PMC for release after 6months.","file":[{"embargo":"2020-10-10","access_level":"open_access","relation":"main_file","file_name":"2020_JournalCellScience_Dimchev.pdf","creator":"dernst","date_created":"2020-09-17T14:07:51Z","file_id":"8435","file_size":13493302,"content_type":"application/pdf","checksum":"ba917e551acc4ece2884b751434df9ae","date_updated":"2020-10-11T22:30:02Z"}],"intvolume":"       133","isi":1,"publication":"Journal of Cell Science","scopus_import":"1","author":[{"id":"38C393BE-F248-11E8-B48F-1D18A9856A87","first_name":"Georgi A","last_name":"Dimchev","full_name":"Dimchev, Georgi A","orcid":"0000-0001-8370-6161"},{"last_name":"Amiri","full_name":"Amiri, Behnam","first_name":"Behnam"},{"first_name":"Ashley C.","last_name":"Humphries","full_name":"Humphries, Ashley C."},{"first_name":"Matthias","last_name":"Schaks","full_name":"Schaks, Matthias"},{"last_name":"Dimchev","full_name":"Dimchev, Vanessa","first_name":"Vanessa"},{"last_name":"Stradal","full_name":"Stradal, Theresia E. B.","first_name":"Theresia E. B."},{"first_name":"Jan","last_name":"Faix","full_name":"Faix, Jan"},{"first_name":"Matthias","full_name":"Krause, Matthias","last_name":"Krause"},{"full_name":"Way, Michael","last_name":"Way","first_name":"Michael"},{"full_name":"Falcke, Martin","last_name":"Falcke","first_name":"Martin"},{"first_name":"Klemens","full_name":"Rottner, Klemens","last_name":"Rottner"}],"keyword":["Cell Biology"],"file_date_updated":"2020-10-11T22:30:02Z","quality_controlled":"1","volume":133,"article_number":"jcs239020","abstract":[{"lang":"eng","text":"Efficient migration on adhesive surfaces involves the protrusion of lamellipodial actin networks and their subsequent stabilization by nascent adhesions. The actin-binding protein lamellipodin (Lpd) is thought to play a critical role in lamellipodium protrusion, by delivering Ena/VASP proteins onto the growing plus ends of actin filaments and by interacting with the WAVE regulatory complex, an activator of the Arp2/3 complex, at the leading edge. Using B16-F1 melanoma cell lines, we demonstrate that genetic ablation of Lpd compromises protrusion efficiency and coincident cell migration without altering essential parameters of lamellipodia, including their maximal rate of forward advancement and actin polymerization. We also confirmed lamellipodia and migration phenotypes with CRISPR/Cas9-mediated Lpd knockout Rat2 fibroblasts, excluding cell type-specific effects. Moreover, computer-aided analysis of cell-edge morphodynamics on B16-F1 cell lamellipodia revealed that loss of Lpd correlates with reduced temporal protrusion maintenance as a prerequisite of nascent adhesion formation. We conclude that Lpd optimizes protrusion and nascent adhesion formation by counteracting frequent, chaotic retraction and membrane ruffling.This article has an associated First Person interview with the first author of the paper. "}],"publication_status":"published","language":[{"iso":"eng"}],"date_created":"2020-09-17T14:00:33Z","external_id":{"pmid":[" 32094266"],"isi":["000534387800005"]},"department":[{"_id":"FlSc"}],"status":"public","issue":"7","type":"journal_article","day":"09","publisher":"The Company of Biologists","date_updated":"2025-04-15T07:52:13Z","oa_version":"Published Version","year":"2020","project":[{"call_identifier":"FWF","name":"Protein structure and function in filopodia across scales","grant_number":"M02495","_id":"2674F658-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","date_published":"2020-04-09T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","month":"04","title":"Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation","_id":"8434","citation":{"ama":"Dimchev GA, Amiri B, Humphries AC, et al. Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. <i>Journal of Cell Science</i>. 2020;133(7). doi:<a href=\"https://doi.org/10.1242/jcs.239020\">10.1242/jcs.239020</a>","apa":"Dimchev, G. A., Amiri, B., Humphries, A. C., Schaks, M., Dimchev, V., Stradal, T. E. B., … Rottner, K. (2020). Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. <i>Journal of Cell Science</i>. The Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.239020\">https://doi.org/10.1242/jcs.239020</a>","chicago":"Dimchev, Georgi A, Behnam Amiri, Ashley C. Humphries, Matthias Schaks, Vanessa Dimchev, Theresia E. B. Stradal, Jan Faix, et al. “Lamellipodin Tunes Cell Migration by Stabilizing Protrusions and Promoting Adhesion Formation.” <i>Journal of Cell Science</i>. The Company of Biologists, 2020. <a href=\"https://doi.org/10.1242/jcs.239020\">https://doi.org/10.1242/jcs.239020</a>.","ista":"Dimchev GA, Amiri B, Humphries AC, Schaks M, Dimchev V, Stradal TEB, Faix J, Krause M, Way M, Falcke M, Rottner K. 2020. Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation. Journal of Cell Science. 133(7), jcs239020.","short":"G.A. Dimchev, B. Amiri, A.C. Humphries, M. Schaks, V. Dimchev, T.E.B. Stradal, J. Faix, M. Krause, M. Way, M. Falcke, K. Rottner, Journal of Cell Science 133 (2020).","mla":"Dimchev, Georgi A., et al. “Lamellipodin Tunes Cell Migration by Stabilizing Protrusions and Promoting Adhesion Formation.” <i>Journal of Cell Science</i>, vol. 133, no. 7, jcs239020, The Company of Biologists, 2020, doi:<a href=\"https://doi.org/10.1242/jcs.239020\">10.1242/jcs.239020</a>.","ieee":"G. A. Dimchev <i>et al.</i>, “Lamellipodin tunes cell migration by stabilizing protrusions and promoting adhesion formation,” <i>Journal of Cell Science</i>, vol. 133, no. 7. The Company of Biologists, 2020."},"article_processing_charge":"No","ddc":["570"],"article_type":"original","doi":"10.1242/jcs.239020"},{"page":"1247-1255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2020","oa_version":"Submitted Version","date_updated":"2026-04-28T22:30:26Z","date_published":"2020-10-19T00:00:00Z","publisher":"Springer Nature","type":"journal_article","day":"19","status":"public","OA_place":"repository","doi":"10.1038/s41588-020-00712-y","OA_type":"green","article_type":"original","citation":{"chicago":"Galan, Silvia, Nick N Machnik, Kai Kruse, Noelia Díaz, Marc A Marti-Renom, and Juan M Vaquerizas. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” <i>Nature Genetics</i>. Springer Nature, 2020. <a href=\"https://doi.org/10.1038/s41588-020-00712-y\">https://doi.org/10.1038/s41588-020-00712-y</a>.","ista":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. 2020. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. Nature Genetics. 52, 1247–1255.","ama":"Galan S, Machnik NN, Kruse K, Díaz N, Marti-Renom MA, Vaquerizas JM. CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. <i>Nature Genetics</i>. 2020;52:1247-1255. doi:<a href=\"https://doi.org/10.1038/s41588-020-00712-y\">10.1038/s41588-020-00712-y</a>","apa":"Galan, S., Machnik, N. N., Kruse, K., Díaz, N., Marti-Renom, M. A., &#38; Vaquerizas, J. M. (2020). CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction. <i>Nature Genetics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41588-020-00712-y\">https://doi.org/10.1038/s41588-020-00712-y</a>","ieee":"S.  Galan, N. N. Machnik, K. Kruse, N. Díaz, M. A. Marti-Renom, and J. M. Vaquerizas, “CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction,” <i>Nature Genetics</i>, vol. 52. Springer Nature, pp. 1247–1255, 2020.","short":"S.  Galan, N.N. Machnik, K. Kruse, N. Díaz, M.A. Marti-Renom, J.M. Vaquerizas, Nature Genetics 52 (2020) 1247–1255.","mla":"Galan, Silvia, et al. “CHESS Enables Quantitative Comparison of Chromatin Contact Data and Automatic Feature Extraction.” <i>Nature Genetics</i>, vol. 52, Springer Nature, 2020, pp. 1247–55, doi:<a href=\"https://doi.org/10.1038/s41588-020-00712-y\">10.1038/s41588-020-00712-y</a>."},"related_material":{"record":[{"id":"18642","relation":"dissertation_contains","status":"public"}]},"article_processing_charge":"No","title":"CHESS enables quantitative comparison of chromatin contact data and automatic feature extraction","month":"10","_id":"8707","intvolume":"        52","isi":1,"scopus_import":"1","publication":"Nature Genetics","author":[{"full_name":" Galan, Silvia","last_name":" Galan","first_name":"Silvia"},{"orcid":"0000-0001-6617-9742","last_name":"Machnik","full_name":"Machnik, Nick N","first_name":"Nick N","id":"3591A0AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kai","last_name":"Kruse","full_name":"Kruse, Kai"},{"first_name":"Noelia","full_name":"Díaz, Noelia","last_name":"Díaz"},{"last_name":"Marti-Renom","full_name":"Marti-Renom, Marc A","first_name":"Marc A"},{"last_name":"Vaquerizas","full_name":"Vaquerizas, Juan M","first_name":"Juan M"}],"main_file_link":[{"url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC7610641/","open_access":"1"}],"publication_identifier":{"eissn":["1546-1718"],"issn":["1061-4036"]},"oa":1,"acknowledgement":"Work in the Vaquerizas laboratory is funded by the Max Planck Society, the Deutsche Forschungsgemeinschaft (DFG) Priority Programme SPP 2202 ‘Spatial Genome Architecture in Development and Disease’ (project no. 422857230 to J.M.V.), the DFG Clinical Research Unit CRU326 ‘Male Germ Cells: from Genes to Function’ (project no. 329621271 to J.M.V.), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement no. 643062—ZENCODE-ITN to J.M.V.) and the Medical Research Council in the UK. This research was partially funded by the European Union’s H2020 Framework Programme through the European Research Council (grant no. 609989 to M.A.M.-R.). We thank the support of the Spanish Ministerio de Ciencia, Innovación y Universidades through grant no. BFU2017-85926-P to M.A.M.-R. The Centre for Genomic Regulation thanks the support of the Ministerio de Ciencia, Innovación y Universidades to the European Molecular Biology Laboratory partnership, the ‘Centro de Excelencia Severo Ochoa 2013–2017’, agreement no. SEV-2012-0208, the CERCA Programme/Generalitat de Catalunya, Spanish Ministerio de Ciencia, Innovación y Universidades through the Instituto de Salud Carlos III, the Generalitat de Catalunya through the Departament de Salut and Departament d’Empresa i Coneixement and cofinancing by the Spanish Ministerio de Ciencia, Innovación y Universidades with funds from the European Regional Development Fund corresponding to the 2014–2020 Smart Growth Operating Program. S.G. thanks the support from the Company of Biologists (grant no. JCSTF181158) and the European Molecular Biology Organization Short-Term Fellowship programme.","pmid":1,"language":[{"iso":"eng"}],"department":[{"_id":"FyKo"}],"external_id":{"pmid":["33077914"],"isi":["000579693500004"]},"date_created":"2020-10-25T23:01:20Z","publication_status":"published","abstract":[{"text":"Dynamic changes in the three-dimensional (3D) organization of chromatin are associated with central biological processes, such as transcription, replication and development. Therefore, the comprehensive identification and quantification of these changes is fundamental to understanding of evolutionary and regulatory mechanisms. Here, we present Comparison of Hi-C Experiments using Structural Similarity (CHESS), an algorithm for the comparison of chromatin contact maps and automatic differential feature extraction. We demonstrate the robustness of CHESS to experimental variability and showcase its biological applications on (1) interspecies comparisons of syntenic regions in human and mouse models; (2) intraspecies identification of conformational changes in Zelda-depleted Drosophila embryos; (3) patient-specific aberrant chromatin conformation in a diffuse large B-cell lymphoma sample; and (4) the systematic identification of chromatin contact differences in high-resolution Capture-C data. In summary, CHESS is a computationally efficient method for the comparison and classification of changes in chromatin contact data.","lang":"eng"}],"quality_controlled":"1","volume":52},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","year":"2020","date_updated":"2026-04-28T22:30:40Z","project":[{"name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","call_identifier":"H2020","grant_number":"694539","_id":"25CA28EA-B435-11E9-9278-68D0E5697425"},{"_id":"25D32BC0-B435-11E9-9278-68D0E5697425","name":"Mechanism of formation and maintenance of input side-dependent asymmetry in the hippocampus"},{"name":"Human Brain Project Specific Grant Agreement 2","call_identifier":"H2020","_id":"26436750-B435-11E9-9278-68D0E5697425","grant_number":"785907"}],"date_published":"2020-09-14T00:00:00Z","has_accepted_license":"1","publisher":"MDPI","day":"14","type":"journal_article","issue":"18","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","doi":"10.3390/ijms21186737","article_type":"original","ddc":["570"],"citation":{"short":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M.J. Case, Y. Fukazawa, R. Shigemoto, International Journal of Molecular Sciences 21 (2020).","mla":"Kleindienst, David, et al. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” <i>International Journal of Molecular Sciences</i>, vol. 21, no. 18, 6737, MDPI, 2020, doi:<a href=\"https://doi.org/10.3390/ijms21186737\">10.3390/ijms21186737</a>.","ieee":"D. Kleindienst, J.-C. Montanaro-Punzengruber, P. Bhandari, M. J. Case, Y. Fukazawa, and R. Shigemoto, “Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses,” <i>International Journal of Molecular Sciences</i>, vol. 21, no. 18. MDPI, 2020.","apa":"Kleindienst, D., Montanaro-Punzengruber, J.-C., Bhandari, P., Case, M. J., Fukazawa, Y., &#38; Shigemoto, R. (2020). Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. <i>International Journal of Molecular Sciences</i>. MDPI. <a href=\"https://doi.org/10.3390/ijms21186737\">https://doi.org/10.3390/ijms21186737</a>","ama":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. <i>International Journal of Molecular Sciences</i>. 2020;21(18). doi:<a href=\"https://doi.org/10.3390/ijms21186737\">10.3390/ijms21186737</a>","ista":"Kleindienst D, Montanaro-Punzengruber J-C, Bhandari P, Case MJ, Fukazawa Y, Shigemoto R. 2020. Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses. International Journal of Molecular Sciences. 21(18), 6737.","chicago":"Kleindienst, David, Jacqueline-Claire Montanaro-Punzengruber, Pradeep Bhandari, Matthew J Case, Yugo Fukazawa, and Ryuichi Shigemoto. “Deep Learning-Assisted High-Throughput Analysis of Freeze-Fracture Replica Images Applied to Glutamate Receptors and Calcium Channels at Hippocampal Synapses.” <i>International Journal of Molecular Sciences</i>. MDPI, 2020. <a href=\"https://doi.org/10.3390/ijms21186737\">https://doi.org/10.3390/ijms21186737</a>."},"related_material":{"record":[{"id":"9562","relation":"dissertation_contains","status":"public"}]},"article_processing_charge":"No","title":"Deep learning-assisted high-throughput analysis of freeze-fracture replica images applied to glutamate receptors and calcium channels at hippocampal synapses","month":"09","_id":"8532","ec_funded":1,"isi":1,"intvolume":"        21","publication":"International Journal of Molecular Sciences","scopus_import":"1","author":[{"id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Kleindienst, David","last_name":"Kleindienst"},{"id":"3786AB44-F248-11E8-B48F-1D18A9856A87","first_name":"Jacqueline-Claire","last_name":"Montanaro-Punzengruber","full_name":"Montanaro-Punzengruber, Jacqueline-Claire"},{"full_name":"Bhandari, Pradeep","last_name":"Bhandari","id":"45EDD1BC-F248-11E8-B48F-1D18A9856A87","first_name":"Pradeep","orcid":"0000-0003-0863-4481"},{"first_name":"Matthew J","id":"44B7CA5A-F248-11E8-B48F-1D18A9856A87","last_name":"Case","full_name":"Case, Matthew J"},{"first_name":"Yugo","last_name":"Fukazawa","full_name":"Fukazawa, Yugo"},{"orcid":"0000-0001-8761-9444","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi"}],"file_date_updated":"2020-09-21T14:08:58Z","oa":1,"publication_identifier":{"issn":["1661-6596"],"eissn":["1422-0067"]},"acknowledgement":"This research was funded by Austrian Academy of Sciences, DOC fellowship to D.K., European Research\r\nCouncil Advanced Grant 694539 and European Union Human Brain Project (HBP) SGA2 785907 to R.S.\r\nWe acknowledge Elena Hollergschwandtner for technical support.","file":[{"relation":"main_file","access_level":"open_access","success":1,"checksum":"2e4f62f3cfe945b7391fc3070e5a289f","content_type":"application/pdf","date_updated":"2020-09-21T14:08:58Z","date_created":"2020-09-21T14:08:58Z","file_id":"8551","creator":"dernst","file_name":"2020_JournMolecSciences_Kleindienst.pdf","file_size":5748456}],"language":[{"iso":"eng"}],"corr_author":"1","department":[{"_id":"RySh"}],"external_id":{"isi":["000579945300001"]},"date_created":"2020-09-20T22:01:35Z","publication_status":"published","abstract":[{"lang":"eng","text":"The molecular anatomy of synapses defines their characteristics in transmission and plasticity. Precise measurements of the number and distribution of synaptic proteins are important for our understanding of synapse heterogeneity within and between brain regions. Freeze–fracture replica immunogold electron microscopy enables us to analyze them quantitatively on a two-dimensional membrane surface. Here, we introduce Darea software, which utilizes deep learning for analysis of replica images and demonstrate its usefulness for quick measurements of the pre- and postsynaptic areas, density and distribution of gold particles at synapses in a reproducible manner. We used Darea for comparing glutamate receptor and calcium channel distributions between hippocampal CA3-CA1 spine synapses on apical and basal dendrites, which differ in signaling pathways involved in synaptic plasticity. We found that apical synapses express a higher density of α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptors and a stronger increase of AMPA receptors with synaptic size, while basal synapses show a larger increase in N-methyl-D-aspartate (NMDA) receptors with size. Interestingly, AMPA and NMDA receptors are segregated within postsynaptic sites and negatively correlated in density among both apical and basal synapses. In the presynaptic sites, Cav2.1 voltage-gated calcium channels show similar densities in apical and basal synapses with distributions consistent with an exclusion zone model of calcium channel-release site topography."}],"article_number":"6737","quality_controlled":"1","volume":21},{"acknowledgement":"I thank Life Science Facilities for their continuous support with providing top-notch laboratory materials, keeping the devices humming, and coordinating the repairs and building of custom-designed laboratory equipment with the MIBA Machine shop.","file":[{"embargo":"2021-10-06","relation":"main_file","access_level":"open_access","file_size":52636162,"file_id":"8663","date_created":"2020-10-15T06:41:20Z","creator":"bkavcic","file_name":"kavcicB_thesis202009.pdf","date_updated":"2021-10-07T22:30:03Z","checksum":"d708ecd62b6fcc3bc1feb483b8dbe9eb","content_type":"application/pdf"},{"date_updated":"2021-10-07T22:30:03Z","checksum":"bb35f2352a04db19164da609f00501f3","content_type":"application/zip","file_size":321681247,"file_id":"8664","date_created":"2020-10-15T06:41:53Z","file_name":"2020b.zip","creator":"bkavcic","embargo_to":"open_access","relation":"source_file","access_level":"closed"}],"oa":1,"publication_identifier":{"isbn":["978-3-99078-011-4"],"issn":["2663-337X"]},"file_date_updated":"2021-10-07T22:30:03Z","author":[{"orcid":"0000-0001-6041-254X","full_name":"Kavcic, Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","first_name":"Bor"}],"supervisor":[{"orcid":"0000-0002-6699-1455","last_name":"Tkačik","full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper"},{"orcid":"0000-0003-4398-476X","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias"}],"abstract":[{"lang":"eng","text":"Synthesis of proteins – translation – is a fundamental process of life. Quantitative studies anchor translation into the context of bacterial physiology and reveal several mathematical relationships, called “growth laws,” which capture physiological feedbacks between protein synthesis and cell growth. Growth laws describe the dependency of the ribosome abundance as a function of growth rate, which can change depending on the growth conditions. Perturbations of translation reveal that bacteria employ a compensatory strategy in which the reduced translation capability results in increased expression of the translation machinery.\r\nPerturbations of translation are achieved in various ways; clinically interesting is the application of translation-targeting antibiotics – translation inhibitors. The antibiotic effects on bacterial physiology are often poorly understood. Bacterial responses to two or more simultaneously applied antibiotics are even more puzzling. The combined antibiotic effect determines the type of drug interaction, which ranges from synergy (the effect is stronger than expected) to antagonism (the effect is weaker) and suppression (one of the drugs loses its potency).\r\nIn the first part of this work, we systematically measure the pairwise interaction network for translation inhibitors that interfere with different steps in translation. We find that the interactions are surprisingly diverse and tend to be more antagonistic. To explore the underlying mechanisms, we begin with a minimal biophysical model of combined antibiotic action. We base this model on the kinetics of antibiotic uptake and binding together with the physiological response described by the growth laws. The biophysical model explains some drug interactions, but not all; it specifically fails to predict suppression.\r\nIn the second part of this work, we hypothesize that elusive suppressive drug interactions result from the interplay between ribosomes halted in different stages of translation. To elucidate this putative mechanism of drug interactions between translation inhibitors, we generate translation bottlenecks genetically using in- ducible control of translation factors that regulate well-defined translation cycle steps. These perturbations accurately mimic antibiotic action and drug interactions, supporting that the interplay of different translation bottlenecks partially causes these interactions.\r\nWe extend this approach by varying two translation bottlenecks simultaneously. This approach reveals the suppression of translocation inhibition by inhibited translation. We rationalize this effect by modeling dense traffic of ribosomes that move on transcripts in a translation factor-mediated manner. This model predicts a dissolution of traffic jams caused by inhibited translocation when the density of ribosome traffic is reduced by lowered initiation. We base this model on the growth laws and quantitative relationships between different translation and growth parameters.\r\nIn the final part of this work, we describe a set of tools aimed at quantification of physiological and translation parameters. We further develop a simple model that directly connects the abundance of a translation factor with the growth rate, which allows us to extract physiological parameters describing initiation. We demonstrate the development of tools for measuring translation rate.\r\nThis thesis showcases how a combination of high-throughput growth rate mea- surements, genetics, and modeling can reveal mechanisms of drug interactions. Furthermore, by a gradual transition from combinations of antibiotics to precise genetic interventions, we demonstrated the equivalency between genetic and chemi- cal perturbations of translation. These findings tile the path for quantitative studies of antibiotic combinations and illustrate future approaches towards the quantitative description of translation."}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"M-Shop"}],"date_created":"2020-10-13T16:46:14Z","department":[{"_id":"GaTk"}],"corr_author":"1","language":[{"iso":"eng"}],"degree_awarded":"PhD","publication_status":"published","type":"dissertation","day":"14","publisher":"Institute of Science and Technology Austria","status":"public","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"271","has_accepted_license":"1","date_published":"2020-10-14T00:00:00Z","date_updated":"2026-04-08T07:27:48Z","oa_version":"Published Version","year":"2020","article_processing_charge":"No","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"7673"},{"id":"8250","relation":"part_of_dissertation","status":"public"}]},"citation":{"ista":"Kavcic B. 2020. Perturbations of protein synthesis: from antibiotics to genetics and physiology. Institute of Science and Technology Austria.","chicago":"Kavcic, Bor. “Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology.” Institute of Science and Technology Austria, 2020. <a href=\"https://doi.org/10.15479/AT:ISTA:8657\">https://doi.org/10.15479/AT:ISTA:8657</a>.","apa":"Kavcic, B. (2020). <i>Perturbations of protein synthesis: from antibiotics to genetics and physiology</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:8657\">https://doi.org/10.15479/AT:ISTA:8657</a>","ama":"Kavcic B. Perturbations of protein synthesis: from antibiotics to genetics and physiology. 2020. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8657\">10.15479/AT:ISTA:8657</a>","ieee":"B. Kavcic, “Perturbations of protein synthesis: from antibiotics to genetics and physiology,” Institute of Science and Technology Austria, 2020.","mla":"Kavcic, Bor. <i>Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology</i>. Institute of Science and Technology Austria, 2020, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:8657\">10.15479/AT:ISTA:8657</a>.","short":"B. Kavcic, Perturbations of Protein Synthesis: From Antibiotics to Genetics and Physiology, Institute of Science and Technology Austria, 2020."},"_id":"8657","month":"10","title":"Perturbations of protein synthesis: from antibiotics to genetics and physiology","alternative_title":["ISTA Thesis"],"doi":"10.15479/AT:ISTA:8657","OA_place":"publisher","ddc":["571","530","570"]}]