[{"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","call_identifier":"H2020"}],"department":[{"_id":"KrCh"}],"acknowledgement":"Ismaël Jecker: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411. Karoliina Lehtinen: Funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 892704.","ec_funded":1,"article_number":"53","scopus_import":"1","external_id":{"arxiv":["2105.02611"]},"author":[{"first_name":"Shibashis","full_name":"Guha, Shibashis","last_name":"Guha"},{"full_name":"Jecker, Ismael R","last_name":"Jecker","first_name":"Ismael R","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425"},{"full_name":"Lehtinen, Karoliina","last_name":"Lehtinen","first_name":"Karoliina"},{"first_name":"Martin","full_name":"Zimmermann, Martin","last_name":"Zimmermann"}],"day":"18","file_date_updated":"2021-10-06T12:44:05Z","intvolume":" 202","article_processing_charge":"No","type":"conference","oa":1,"citation":{"apa":"Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53","ista":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. 2021. A bit of nondeterminism makes pushdown automata expressive and succinct. 46th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 202, 53.","mla":"Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” 46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.","ieee":"S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.","ama":"Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53","short":"S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","chicago":"Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.” In 46th International Symposium on Mathematical Foundations of Computer Science, Vol. 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.MFCS.2021.53."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_created":"2021-10-03T22:01:23Z","doi":"10.4230/LIPIcs.MFCS.2021.53","abstract":[{"lang":"eng","text":"We study the expressiveness and succinctness of good-for-games pushdown automata (GFG-PDA) over finite words, that is, pushdown automata whose nondeterminism can be resolved based on the run constructed so far, but independently of the remainder of the input word. We prove that GFG-PDA recognise more languages than deterministic PDA (DPDA) but not all context-free languages (CFL). This class is orthogonal to unambiguous CFL. We further show that GFG-PDA can be exponentially more succinct than DPDA, while PDA can be double-exponentially more succinct than GFG-PDA. We also study GFGness in visibly pushdown automata (VPA), which enjoy better closure properties than PDA, and for which we show GFGness to be ExpTime-complete. GFG-VPA can be exponentially more succinct than deterministic VPA, while VPA can be exponentially more succinct than GFG-VPA. Both of these lower bounds are tight. Finally, we study the complexity of resolving nondeterminism in GFG-PDA. Every GFG-PDA has a positional resolver, a function that resolves nondeterminism and that is only dependant on the current configuration. Pushdown transducers are sufficient to implement the resolvers of GFG-VPA, but not those of GFG-PDA. GFG-PDA with finite-state resolvers are determinisable."}],"publication":"46th International Symposium on Mathematical Foundations of Computer Science","file":[{"creator":"cchlebak","file_id":"10097","date_updated":"2021-10-06T12:44:05Z","checksum":"f4d407d43a97330c3fb11e6a7a6fbfb2","success":1,"file_name":"2021_LIPIcs_Guha.pdf","file_size":825567,"date_created":"2021-10-06T12:44:05Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access"}],"publication_status":"published","oa_version":"Published Version","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-9597-7201-3"]},"title":"A bit of nondeterminism makes pushdown automata expressive and succinct","volume":202,"status":"public","arxiv":1,"year":"2021","ddc":["000"],"conference":{"end_date":"2021-08-27","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2021-08-23","location":"Tallinn, Estonia"},"month":"08","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"alternative_title":["LIPIcs"],"_id":"10075","date_published":"2021-08-18T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2025-05-14T10:54:50Z","quality_controlled":"1"},{"language":[{"iso":"eng"}],"date_updated":"2025-07-10T11:49:40Z","quality_controlled":"1","alternative_title":["LNCS"],"_id":"10076","main_file_link":[{"open_access":"1","url":"https://research.fb.com/publications/reactive-key-loss-protection-in-blockchains/"}],"date_published":"2021-09-17T00:00:00Z","month":"09","year":"2021","conference":{"end_date":"2021-03-05","name":"FC: Financial Cryptography and Data Security","start_date":"2021-03-01","location":"Virtual"},"page":"431-450","status":"public","title":"Reactive key-loss protection in blockchains","volume":"12676 ","oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"isbn":["978-3-6626-3957-3"],"eisbn":["978-3-662-63958-0"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-662-63958-0_34","publication":"FC 2021 Workshops","abstract":[{"lang":"eng","text":"We present a novel approach for blockchain asset owners to reclaim their funds in case of accidental private-key loss or transfer to a mistyped address. Our solution can be deployed upon failure or absence of proactively implemented backup mechanisms, such as secret sharing and cold storage. The main advantages against previous proposals is it does not require any prior action from users and works with both single-key and multi-sig accounts. We achieve this by a 3-phase Commit()→Reveal()→Claim()−or−Challenge() smart contract that enables accessing funds of addresses for which the spending key is not available. We provide an analysis of the threat and incentive models and formalize the concept of reactive KEy-Loss Protection (KELP)."}],"publication_status":"published","publisher":"Springer Nature","date_created":"2021-10-03T22:01:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","type":"conference","oa":1,"citation":{"ama":"Blackshear S, Chalkias K, Chatzigiannis P, et al. Reactive key-loss protection in blockchains. In: FC 2021 Workshops. Vol 12676. Springer Nature; 2021:431-450. doi:10.1007/978-3-662-63958-0_34","short":"S. Blackshear, K. Chalkias, P. Chatzigiannis, R. Faizullabhoy, I. Khaburzaniya, E. Kokoris Kogias, J. Lind, D. Wong, T. Zakian, in:, FC 2021 Workshops, Springer Nature, 2021, pp. 431–450.","chicago":"Blackshear, Sam, Konstantinos Chalkias, Panagiotis Chatzigiannis, Riyaz Faizullabhoy, Irakliy Khaburzaniya, Eleftherios Kokoris Kogias, Joshua Lind, David Wong, and Tim Zakian. “Reactive Key-Loss Protection in Blockchains.” In FC 2021 Workshops, 12676:431–50. Springer Nature, 2021. https://doi.org/10.1007/978-3-662-63958-0_34.","ista":"Blackshear S, Chalkias K, Chatzigiannis P, Faizullabhoy R, Khaburzaniya I, Kokoris Kogias E, Lind J, Wong D, Zakian T. 2021. Reactive key-loss protection in blockchains. FC 2021 Workshops. FC: Financial Cryptography and Data Security, LNCS, vol. 12676, 431–450.","apa":"Blackshear, S., Chalkias, K., Chatzigiannis, P., Faizullabhoy, R., Khaburzaniya, I., Kokoris Kogias, E., … Zakian, T. (2021). Reactive key-loss protection in blockchains. In FC 2021 Workshops (Vol. 12676, pp. 431–450). Virtual: Springer Nature. https://doi.org/10.1007/978-3-662-63958-0_34","mla":"Blackshear, Sam, et al. “Reactive Key-Loss Protection in Blockchains.” FC 2021 Workshops, vol. 12676, Springer Nature, 2021, pp. 431–50, doi:10.1007/978-3-662-63958-0_34.","ieee":"S. Blackshear et al., “Reactive key-loss protection in blockchains,” in FC 2021 Workshops, Virtual, 2021, vol. 12676, pp. 431–450."},"day":"17","scopus_import":"1","isi":1,"external_id":{"isi":["000713005000034"]},"author":[{"first_name":"Sam","full_name":"Blackshear, Sam","last_name":"Blackshear"},{"full_name":"Chalkias, Konstantinos","last_name":"Chalkias","first_name":"Konstantinos"},{"full_name":"Chatzigiannis, Panagiotis","last_name":"Chatzigiannis","first_name":"Panagiotis"},{"first_name":"Riyaz","last_name":"Faizullabhoy","full_name":"Faizullabhoy, Riyaz"},{"first_name":"Irakliy","last_name":"Khaburzaniya","full_name":"Khaburzaniya, Irakliy"},{"last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"last_name":"Lind","full_name":"Lind, Joshua","first_name":"Joshua"},{"first_name":"David","full_name":"Wong, David","last_name":"Wong"},{"first_name":"Tim","full_name":"Zakian, Tim","last_name":"Zakian"}],"acknowledgement":"The authors would like to thank all anonymous reviewers of FC21 WTSC workshop for comments and suggestions that greatly improved the quality of this paper.","department":[{"_id":"ElKo"}]},{"title":"Differential monitoring","volume":12974,"corr_author":"1","page":"231-243","status":"public","related_material":{"record":[{"id":"9946","relation":"extended_version","status":"public"}]},"month":"10","has_accepted_license":"1","year":"2021","ddc":["005"],"conference":{"location":"Virtual","end_date":"2021-10-14","name":"RV: Runtime Verification","start_date":"2021-10-11"},"language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:26:12Z","quality_controlled":"1","alternative_title":["LNCS"],"_id":"10108","date_published":"2021-10-06T00:00:00Z","scopus_import":"1","isi":1,"external_id":{"isi":["000719383800012"]},"author":[{"first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian","last_name":"Mühlböck"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A"}],"project":[{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"acknowledgement":"The authors would like to thank Borzoo Bonakdarpour, Derek Dreyer, Adrian Francalanza, Owolabi Legunsen, Mae Milano, Manuel Rigger, Cesar Sanchez, and the members of the IST Verification Seminar for their helpful comments and insights on various stages of this work, as well as the reviewers of RV’21 for their helpful suggestions on the actual paper.","department":[{"_id":"ToHe"}],"type":"conference","article_processing_charge":"No","oa":1,"citation":{"mla":"Mühlböck, Fabian, and Thomas A. Henzinger. “Differential Monitoring.” International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 231–43, doi:10.1007/978-3-030-88494-9_12.","ista":"Mühlböck F, Henzinger TA. 2021. Differential monitoring. International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 231–243.","apa":"Mühlböck, F., & Henzinger, T. A. (2021). Differential monitoring. In International Conference on Runtime Verification (Vol. 12974, pp. 231–243). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_12","ieee":"F. Mühlböck and T. A. Henzinger, “Differential monitoring,” in International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 231–243.","ama":"Mühlböck F, Henzinger TA. Differential monitoring. In: International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:231-243. doi:10.1007/978-3-030-88494-9_12","short":"F. Mühlböck, T.A. Henzinger, in:, International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 231–243.","chicago":"Mühlböck, Fabian, and Thomas A Henzinger. “Differential Monitoring.” In International Conference on Runtime Verification, 12974:231–43. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_12."},"day":"06","file_date_updated":"2021-10-07T23:32:18Z","keyword":["run-time verification","software engineering","implicit specification"],"intvolume":" 12974","publisher":"Springer Nature","date_created":"2021-10-07T23:30:10Z","place":"Cham","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"],"isbn":["978-3-030-88493-2"]},"oa_version":"Preprint","doi":"10.1007/978-3-030-88494-9_12","file":[{"file_size":350632,"date_created":"2021-10-07T23:32:18Z","content_type":"application/pdf","relation":"main_file","access_level":"open_access","creator":"fmuehlbo","file_id":"10109","date_updated":"2021-10-07T23:32:18Z","checksum":"554c7fdb259eda703a8b6328a6dad55a","file_name":"differentialmonitoring-cameraready-openaccess.pdf","success":1}],"abstract":[{"text":"We argue that the time is ripe to investigate differential monitoring, in which the specification of a program's behavior is implicitly given by a second program implementing the same informal specification. Similar ideas have been proposed before, and are currently implemented in restricted form for testing and specialized run-time analyses, aspects of which we combine. We discuss the challenges of implementing differential monitoring as a general-purpose, black-box run-time monitoring framework, and present promising results of a preliminary implementation, showing low monitoring overheads for diverse programs.","lang":"eng"}],"publication":"International Conference on Runtime Verification","publication_status":"published"},{"volume":12,"title":"PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC","status":"public","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"month":"10","related_material":{"link":[{"description":"Preprint ","url":"https://www.biorxiv.org/content/10.1101/2020.02.11.943159","relation":"earlier_version"}]},"ddc":["610"],"year":"2021","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-10-21T06:02:05Z","date_published":"2021-10-19T00:00:00Z","_id":"10163","author":[{"full_name":"Appel, Lisa-Marie","last_name":"Appel","first_name":"Lisa-Marie"},{"first_name":"Vedran","last_name":"Franke","full_name":"Franke, Vedran"},{"last_name":"Bruno","full_name":"Bruno, Melania","first_name":"Melania"},{"first_name":"Irina","full_name":"Grishkovskaya, Irina","last_name":"Grishkovskaya"},{"last_name":"Kasiliauskaite","full_name":"Kasiliauskaite, Aiste","first_name":"Aiste"},{"full_name":"Kaufmann, Tanja","last_name":"Kaufmann","first_name":"Tanja"},{"first_name":"Ursula E.","last_name":"Schoeberl","full_name":"Schoeberl, Ursula E."},{"full_name":"Puchinger, Martin G.","last_name":"Puchinger","first_name":"Martin G."},{"first_name":"Sebastian","full_name":"Kostrhon, Sebastian","last_name":"Kostrhon"},{"last_name":"Ebenwaldner","full_name":"Ebenwaldner, Carmen","first_name":"Carmen"},{"first_name":"Marek","last_name":"Sebesta","full_name":"Sebesta, Marek"},{"first_name":"Etienne","last_name":"Beltzung","full_name":"Beltzung, Etienne"},{"first_name":"Karl","last_name":"Mechtler","full_name":"Mechtler, Karl"},{"first_name":"Gen","last_name":"Lin","full_name":"Lin, Gen"},{"full_name":"Vlasova, Anna","last_name":"Vlasova","first_name":"Anna"},{"full_name":"Leeb, Martin","last_name":"Leeb","first_name":"Martin"},{"last_name":"Pavri","full_name":"Pavri, Rushad","first_name":"Rushad"},{"first_name":"Alexander","full_name":"Stark, Alexander","last_name":"Stark"},{"full_name":"Akalin, Altuna","last_name":"Akalin","first_name":"Altuna"},{"first_name":"Richard","last_name":"Stefl","full_name":"Stefl, Richard"},{"orcid":"0000-0003-0893-7036","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","first_name":"Carrie A","last_name":"Bernecky","full_name":"Bernecky, Carrie A"},{"last_name":"Djinovic-Carugo","full_name":"Djinovic-Carugo, Kristina","first_name":"Kristina"},{"first_name":"Dea","full_name":"Slade, Dea","last_name":"Slade"}],"isi":1,"external_id":{"isi":["000709050300001"]},"article_number":"6078","scopus_import":"1","acknowledgement":"D.S. thanks Claudine Kraft, Renée Schroeder, Verena Jantsch, Franz Klein and Peter Schlögelhofer for support. We thank Anita Testa Salmazo for help with purifying Pol II; Matthias Geyer and Robert Düster for sharing DYRK1A kinase; Felix Hartmann and Clemens Plaschka for help with mass photometry; Goran Kokic for design of the arrest assay sequences; Petra van der Lelij for help with generating mESC KO; Maximilian Freilinger for help with the purification of mEGFP-CTD; Stefan Ameres, Nina Fasching and Brian Reichholf for advice on SLAM-seq and for sharing reagents; Laura Gallego Valle for advice regarding LLPS assays; Krzysztof Chylinski for advice regarding CRISPR/Cas9 methodology; VBCF Protein Technologies facility for purifying PHF3 and providing gRNAs and Cas9; VBCF NGS facility for sequencing; Monoclonal antibody facility at the Helmholtz center for Pol II antibodies; Friedrich Propst and Elzbieta Kowalska for advice and for sharing materials; Egon Ogris for sharing materials; Martin Eilers for recommending a ChIP-grade TFIIS antibody; Susanne Opravil, Otto Hudecz, Markus Hartl and Natascha Hartl for mass spectrometry analysis; staff of the X-ray beamlines at the ESRF in Grenoble for their excellent support; Christa Bücker, Anton Meinhart, Clemens Plaschka and members of the Slade lab for critical comments on the manuscript; Life Science Editors for editing assistance. M.B. and D.S. acknowledge support by the FWF-funded DK ‘Chromosome Dynamics’. T.K. is a recipient of the DOC fellowship from the Austrian Academy of Sciences. U.S. is supported by the L’Oreal for Women in Science Austria Fellowship and the Austrian Science Fund (FWF T 795-B30). M.L is supported by the Vienna Science and Technology Fund (WWTF, VRG14-006). R.S. is supported by the Czech Science Foundation (15-17670 S and 21-24460 S), Ministry of Education, Youths and Sports of the Czech Republic (CEITEC 2020 project (LQ1601)), and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement no. 649030); this publication reflects only the author’s view and the Research Executive Agency is not responsible for any use that may be made of the information it contains. M.S. is supported by the Czech Science Foundation (GJ20-21581Y). K.D.C. research is supported by the Austrian Science Fund (FWF) Projects I525 and I1593, P22276, P19060, and W1221, Federal Ministry of Economy, Family and Youth through the initiative ‘Laura Bassi Centres of Expertise’, funding from the Centre of Optimized Structural Studies No. 253275, the Wellcome Trust Collaborative Award (201543/Z/16), COST action BM1405 Non-globular proteins - from sequence to structure, function and application in molecular physiopathology (NGP-NET), the Vienna Science and Technology Fund (WWTF LS17-008), and by the University of Vienna. This project was funded by the MFPL start-up grant, the Vienna Science and Technology Fund (WWTF LS14-001), and the Austrian Science Fund (P31546-B28 and W1258 “DK: Integrative Structural Biology”) to D.S.","department":[{"_id":"CaBe"}],"issue":"1","citation":{"short":"L.-M. Appel, V. Franke, M. Bruno, I. Grishkovskaya, A. Kasiliauskaite, T. Kaufmann, U.E. Schoeberl, M.G. Puchinger, S. Kostrhon, C. Ebenwaldner, M. Sebesta, E. Beltzung, K. Mechtler, G. Lin, A. Vlasova, M. Leeb, R. Pavri, A. Stark, A. Akalin, R. Stefl, C. Bernecky, K. Djinovic-Carugo, D. Slade, Nature Communications 12 (2021).","ama":"Appel L-M, Franke V, Bruno M, et al. PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-26360-2","chicago":"Appel, Lisa-Marie, Vedran Franke, Melania Bruno, Irina Grishkovskaya, Aiste Kasiliauskaite, Tanja Kaufmann, Ursula E. Schoeberl, et al. “PHF3 Regulates Neuronal Gene Expression through the Pol II CTD Reader Domain SPOC.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-26360-2.","ista":"Appel L-M, Franke V, Bruno M, Grishkovskaya I, Kasiliauskaite A, Kaufmann T, Schoeberl UE, Puchinger MG, Kostrhon S, Ebenwaldner C, Sebesta M, Beltzung E, Mechtler K, Lin G, Vlasova A, Leeb M, Pavri R, Stark A, Akalin A, Stefl R, Bernecky C, Djinovic-Carugo K, Slade D. 2021. PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. Nature Communications. 12(1), 6078.","apa":"Appel, L.-M., Franke, V., Bruno, M., Grishkovskaya, I., Kasiliauskaite, A., Kaufmann, T., … Slade, D. (2021). PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-26360-2","mla":"Appel, Lisa-Marie, et al. “PHF3 Regulates Neuronal Gene Expression through the Pol II CTD Reader Domain SPOC.” Nature Communications, vol. 12, no. 1, 6078, Springer Nature, 2021, doi:10.1038/s41467-021-26360-2.","ieee":"L.-M. Appel et al., “PHF3 regulates neuronal gene expression through the Pol II CTD reader domain SPOC,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021."},"oa":1,"type":"journal_article","article_processing_charge":"No","intvolume":" 12","file_date_updated":"2021-10-21T13:51:49Z","keyword":["general physics and astronomy","general biochemistry","genetics and molecular biology","general chemistry"],"day":"19","date_created":"2021-10-20T14:40:32Z","article_type":"original","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Published Version","publication_identifier":{"eissn":["2041-1723"]},"publication_status":"published","publication":"Nature Communications","file":[{"file_size":5111706,"date_created":"2021-10-21T13:51:49Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access","creator":"cchlebak","file_id":"10169","date_updated":"2021-10-21T13:51:49Z","checksum":"d99fcd51aebde19c21314e3de0148007","success":1,"file_name":"2021_NatComm_Appel.pdf"}],"abstract":[{"lang":"eng","text":"The C-terminal domain (CTD) of the largest subunit of RNA polymerase II (Pol II) is a regulatory hub for transcription and RNA processing. Here, we identify PHD-finger protein 3 (PHF3) as a regulator of transcription and mRNA stability that docks onto Pol II CTD through its SPOC domain. We characterize SPOC as a CTD reader domain that preferentially binds two phosphorylated Serine-2 marks in adjacent CTD repeats. PHF3 drives liquid-liquid phase separation of phosphorylated Pol II, colocalizes with Pol II clusters and tracks with Pol II across the length of genes. PHF3 knock-out or SPOC deletion in human cells results in increased Pol II stalling, reduced elongation rate and an increase in mRNA stability, with marked derepression of neuronal genes. Key neuronal genes are aberrantly expressed in Phf3 knock-out mouse embryonic stem cells, resulting in impaired neuronal differentiation. Our data suggest that PHF3 acts as a prominent effector of neuronal gene regulation by bridging transcription with mRNA decay."}],"doi":"10.1038/s41467-021-26360-2"},{"publication_status":"published","abstract":[{"text":"Single photon emitters in atomically-thin semiconductors can be deterministically positioned using strain induced by underlying nano-structures. Here, we couple monolayer WSe2 to high-refractive-index gallium phosphide dielectric nano-antennas providing both optical enhancement and monolayer deformation. For single photon emitters formed on such nano-antennas, we find very low (femto-Joule) saturation pulse energies and up to 104 times brighter photoluminescence than in WSe2 placed on low-refractive-index SiO2 pillars. We show that the key to these observations is the increase on average by a factor of 5 of the quantum efficiency of the emitters coupled to the nano-antennas. This further allows us to gain new insights into their photoluminescence dynamics, revealing the roles of the dark exciton reservoir and Auger processes. We also find that the coherence time of such emitters is limited by intrinsic dephasing processes. Our work establishes dielectric nano-antennas as a platform for high-efficiency quantum light generation in monolayer semiconductors.","lang":"eng"}],"file":[{"file_id":"10212","creator":"cchlebak","date_updated":"2021-11-03T11:31:24Z","file_name":"2021_NatComm_Sortino.pdf","success":1,"checksum":"8580d128389860f732028c521cd5949e","date_created":"2021-11-03T11:31:24Z","file_size":1434201,"access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publication":"Nature Communications","doi":"10.1038/s41467-021-26262-3","oa_version":"Published Version","publication_identifier":{"eissn":["2041-1723"]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2021-10-31T23:01:30Z","publisher":"Springer Nature","article_type":"original","intvolume":" 12","file_date_updated":"2021-11-03T11:31:24Z","day":"18","citation":{"short":"L. Sortino, P.G. Zotev, C.L. Phillips, A.J. Brash, J. Cambiasso, E. Marensi, A.M. Fox, S.A. Maier, R. Sapienza, A.I. Tartakovskii, Nature Communications 12 (2021).","ama":"Sortino L, Zotev PG, Phillips CL, et al. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. Nature Communications. 2021;12. doi:10.1038/s41467-021-26262-3","chicago":"Sortino, Luca, Panaiot G. Zotev, Catherine L. Phillips, Alistair J. Brash, Javier Cambiasso, Elena Marensi, A. Mark Fox, Stefan A. Maier, Riccardo Sapienza, and Alexander I. Tartakovskii. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-26262-3.","apa":"Sortino, L., Zotev, P. G., Phillips, C. L., Brash, A. J., Cambiasso, J., Marensi, E., … Tartakovskii, A. I. (2021). Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-26262-3","ista":"Sortino L, Zotev PG, Phillips CL, Brash AJ, Cambiasso J, Marensi E, Fox AM, Maier SA, Sapienza R, Tartakovskii AI. 2021. Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas. Nature Communications. 12, 6063.","mla":"Sortino, Luca, et al. “Bright Single Photon Emitters with Enhanced Quantum Efficiency in a Two-Dimensional Semiconductor Coupled with Dielectric Nano-Antennas.” Nature Communications, vol. 12, 6063, Springer Nature, 2021, doi:10.1038/s41467-021-26262-3.","ieee":"L. Sortino et al., “Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas,” Nature Communications, vol. 12. Springer Nature, 2021."},"oa":1,"article_processing_charge":"No","type":"journal_article","department":[{"_id":"BjHo"}],"acknowledgement":"L.S., P.G.Z., and A.I.T. thank the financial support of the European Graphene Flagship Project under grant agreements 881603 and EPSRC grant EP/S030751/1. L.S. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN Spin-NANO Marie Sklodowska-Curie grant agreement no. 676108. P.G.Z. and A.I.T. thank the European Union’s Horizon 2020 research and innovation programme under ITN 4PHOTON Marie Sklodowska-Curie grant agreement no. 721394. J.C., S.A.M., and R.S. acknowledge funding by EPSRC (EP/P033369 and EP/M013812). C.L.P., A.J.B., A.I.T., and A.M.F. acknowledge funding by EPSRC Programme Grant EP/N031776/1. S.A.M. acknowledges the Lee-Lucas Chair in Physics, the Solar Energies go Hybrid (SolTech) programme, and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - EXC 2089/1 - 390776260.","author":[{"first_name":"Luca","last_name":"Sortino","full_name":"Sortino, Luca"},{"last_name":"Zotev","full_name":"Zotev, Panaiot G.","first_name":"Panaiot G."},{"last_name":"Phillips","full_name":"Phillips, Catherine L.","first_name":"Catherine L."},{"full_name":"Brash, Alistair J.","last_name":"Brash","first_name":"Alistair J."},{"first_name":"Javier","last_name":"Cambiasso","full_name":"Cambiasso, Javier"},{"last_name":"Marensi","full_name":"Marensi, Elena","first_name":"Elena","orcid":"0000-0001-7173-4923","id":"0BE7553A-1004-11EA-B805-18983DDC885E"},{"first_name":"A. Mark","last_name":"Fox","full_name":"Fox, A. Mark"},{"full_name":"Maier, Stefan A.","last_name":"Maier","first_name":"Stefan A."},{"first_name":"Riccardo","last_name":"Sapienza","full_name":"Sapienza, Riccardo"},{"first_name":"Alexander I.","last_name":"Tartakovskii","full_name":"Tartakovskii, Alexander I."}],"external_id":{"isi":["000708601800015"],"arxiv":["2103.16986"]},"isi":1,"scopus_import":"1","article_number":"6063","date_published":"2021-10-18T00:00:00Z","_id":"10203","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2023-08-14T08:12:12Z","year":"2021","ddc":["530"],"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"month":"10","status":"public","arxiv":1,"volume":12,"title":"Bright single photon emitters with enhanced quantum efficiency in a two-dimensional semiconductor coupled with dielectric nano-antennas"},{"ec_funded":1,"acknowledgement":"We thank Christoph Lampert and Alex Greengold for fruitful discussions. This research was supported in part by the Simons Institute for the Theory of Computing, the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein Award), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","department":[{"_id":"ToHe"}],"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"}],"author":[{"last_name":"Lukina","full_name":"Lukina, Anna","first_name":"Anna","id":"CBA4D1A8-0FE8-11E9-BDE6-07BFE5697425"},{"first_name":"Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","last_name":"Schilling","full_name":"Schilling, Christian"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2009.06429"],"isi":["000719383800003"]},"isi":1,"scopus_import":"1","keyword":["monitoring","neural networks","novelty detection"],"day":"06","citation":{"ieee":"A. Lukina, C. Schilling, and T. A. Henzinger, “Into the unknown: active monitoring of neural networks,” in 21st International Conference on Runtime Verification, Virtual, 2021, vol. 12974, pp. 42–61.","apa":"Lukina, A., Schilling, C., & Henzinger, T. A. (2021). Into the unknown: active monitoring of neural networks. In 21st International Conference on Runtime Verification (Vol. 12974, pp. 42–61). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-88494-9_3","ista":"Lukina A, Schilling C, Henzinger TA. 2021. Into the unknown: active monitoring of neural networks. 21st International Conference on Runtime Verification. RV: Runtime Verification, LNCS, vol. 12974, 42–61.","mla":"Lukina, Anna, et al. “Into the Unknown: Active Monitoring of Neural Networks.” 21st International Conference on Runtime Verification, vol. 12974, Springer Nature, 2021, pp. 42–61, doi:10.1007/978-3-030-88494-9_3.","chicago":"Lukina, Anna, Christian Schilling, and Thomas A Henzinger. “Into the Unknown: Active Monitoring of Neural Networks.” In 21st International Conference on Runtime Verification, 12974:42–61. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-88494-9_3.","short":"A. Lukina, C. Schilling, T.A. Henzinger, in:, 21st International Conference on Runtime Verification, Springer Nature, Cham, 2021, pp. 42–61.","ama":"Lukina A, Schilling C, Henzinger TA. Into the unknown: active monitoring of neural networks. In: 21st International Conference on Runtime Verification. Vol 12974. Cham: Springer Nature; 2021:42-61. doi:10.1007/978-3-030-88494-9_3"},"oa":1,"type":"conference","article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","place":"Cham","date_created":"2021-10-31T23:01:31Z","publisher":"Springer Nature","publication_status":"published","publication":"21st International Conference on Runtime Verification","abstract":[{"text":"Neural-network classifiers achieve high accuracy when predicting the class of an input that they were trained to identify. Maintaining this accuracy in dynamic environments, where inputs frequently fall outside the fixed set of initially known classes, remains a challenge. The typical approach is to detect inputs from novel classes and retrain the classifier on an augmented dataset. However, not only the classifier but also the detection mechanism needs to adapt in order to distinguish between newly learned and yet unknown input classes. To address this challenge, we introduce an algorithmic framework for active monitoring of a neural network. A monitor wrapped in our framework operates in parallel with the neural network and interacts with a human user via a series of interpretable labeling queries for incremental adaptation. In addition, we propose an adaptive quantitative monitor to improve precision. An experimental evaluation on a diverse set of benchmarks with varying numbers of classes confirms the benefits of our active monitoring framework in dynamic scenarios.","lang":"eng"}],"doi":"10.1007/978-3-030-88494-9_3","oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"isbn":["9-783-0308-8493-2"],"eissn":["1611-3349"],"eisbn":["978-3-030-88494-9"]},"volume":"12974 ","title":"Into the unknown: active monitoring of neural networks","status":"public","page":"42-61","arxiv":1,"corr_author":"1","conference":{"start_date":"2021-10-11","name":"RV: Runtime Verification","end_date":"2021-10-14","location":"Virtual"},"year":"2021","month":"10","related_material":{"record":[{"id":"13234","relation":"extended_version","status":"public"}]},"date_published":"2021-10-06T00:00:00Z","main_file_link":[{"url":"https://arxiv.org/abs/2009.06429","open_access":"1"}],"_id":"10206","alternative_title":["LNCS"],"quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-15T06:26:14Z"},{"related_material":{"record":[{"id":"9308","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"8183"}]},"month":"10","year":"2021","language":[{"iso":"eng"}],"date_updated":"2025-07-02T10:54:52Z","quality_controlled":"1","date_published":"2021-10-30T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.03501"}],"_id":"10220","title":"Eliminating higher-multiplicity intersections. III. Codimension 2","volume":245,"page":"501–534 ","arxiv":1,"corr_author":"1","status":"public","article_type":"original","publisher":"Springer Nature","date_created":"2021-11-07T23:01:24Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","oa_version":"Preprint","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"doi":"10.1007/s11856-021-2216-z","publication_status":"published","publication":"Israel Journal of Mathematics","abstract":[{"lang":"eng","text":"We study conditions under which a finite simplicial complex K can be mapped to ℝd without higher-multiplicity intersections. An almost r-embedding is a map f: K → ℝd such that the images of any r pairwise disjoint simplices of K do not have a common point. We show that if r is not a prime power and d ≥ 2r + 1, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost r-embedding of the (d +1)(r − 1)-simplex in ℝd. This improves on previous constructions of counterexamples (for d ≥ 3r) based on a series of papers by M. Özaydin, M. Gromov, P. Blagojević, F. Frick, G. Ziegler, and the second and fourth present authors.\r\n\r\nThe counterexamples are obtained by proving the following algebraic criterion in codimension 2: If r ≥ 3 and if K is a finite 2(r − 1)-complex, then there exists an almost r-embedding K → ℝ2r if and only if there exists a general position PL map f: K → ℝ2r such that the algebraic intersection number of the f-images of any r pairwise disjoint simplices of K is zero. This result can be restated in terms of a cohomological obstruction and extends an analogous codimension 3 criterion by the second and fourth authors. As another application, we classify ornaments f: S3 ⊔ S3 ⊔ S3 → ℝ5 up to ornament concordance.\r\n\r\nIt follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for r = 2 is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample."}],"external_id":{"isi":["000712942100013"],"arxiv":["1511.03501"]},"isi":1,"scopus_import":"1","author":[{"full_name":"Avvakumov, Sergey","last_name":"Avvakumov","orcid":"0000-0002-7840-5062","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","first_name":"Sergey"},{"id":"32BF9DAA-F248-11E8-B48F-1D18A9856A87","first_name":"Isaac","full_name":"Mabillard, Isaac","last_name":"Mabillard"},{"full_name":"Skopenkov, Arkadiy B.","last_name":"Skopenkov","first_name":"Arkadiy B."},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","orcid":"0000-0002-1494-0568","last_name":"Wagner","full_name":"Wagner, Uli"}],"acknowledgement":"Research supported by the Swiss National Science Foundation (Project SNSF-PP00P2-138948), by the Austrian Science Fund (FWF Project P31312-N35), by the Russian Foundation for Basic Research (Grants No. 15-01-06302 and 19-01-00169), by a Simons-IUM Fellowship, and by the D. Zimin Dynasty Foundation Grant. We would like to thank E. Alkin, A. Klyachko, V. Krushkal, S. Melikhov, M. Tancer, P. Teichner and anonymous referees for helpful comments and discussions.","department":[{"_id":"UlWa"}],"project":[{"grant_number":"P31312","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","call_identifier":"FWF"}],"oa":1,"type":"journal_article","article_processing_charge":"No","citation":{"short":"S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.","ama":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 2021;245:501–534. doi:10.1007/s11856-021-2216-z","chicago":"Avvakumov, Sergey, Isaac Mabillard, Arkadiy B. Skopenkov, and Uli Wagner. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” Israel Journal of Mathematics. Springer Nature, 2021. https://doi.org/10.1007/s11856-021-2216-z.","mla":"Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections. III. Codimension 2.” Israel Journal of Mathematics, vol. 245, Springer Nature, 2021, pp. 501–534, doi:10.1007/s11856-021-2216-z.","apa":"Avvakumov, S., Mabillard, I., Skopenkov, A. B., & Wagner, U. (2021). Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-021-2216-z","ista":"Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. 2021. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 245, 501–534.","ieee":"S. Avvakumov, I. Mabillard, A. B. Skopenkov, and U. Wagner, “Eliminating higher-multiplicity intersections. III. Codimension 2,” Israel Journal of Mathematics, vol. 245. Springer Nature, pp. 501–534, 2021."},"day":"30","intvolume":" 245"},{"date_created":"2021-11-07T23:01:25Z","article_type":"original","publisher":"Taylor and Francis","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","publication_identifier":{"eissn":["1944-950X"],"issn":["1058-6458"]},"publication":"Experimental Mathematics","abstract":[{"text":"Consider a random set of points on the unit sphere in ℝd, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the case d = 3, for which there are elementary proofs and fascinating formulas for metric properties. In particular, we study the fraction of acute facets, the expected intrinsic volumes, the total edge length, and the distance to a fixed point. Finally we generalize the results to the ellipsoid with homeoid density.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_size":1966019,"date_created":"2023-08-14T11:55:10Z","checksum":"3514382e3a1eb87fa6c61ad622874415","file_name":"2023_ExperimentalMath_Akopyan.pdf","success":1,"date_updated":"2023-08-14T11:55:10Z","creator":"dernst","file_id":"14053"}],"publication_status":"published","doi":"10.1080/10586458.2021.1980459","author":[{"first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","full_name":"Akopyan, Arseniy","last_name":"Akopyan"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","last_name":"Nikitenko","full_name":"Nikitenko, Anton"}],"scopus_import":"1","external_id":{"arxiv":["2007.07783"],"isi":["000710893500001"]},"isi":1,"ec_funded":1,"project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"},{"_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887","name":"Persistent Homology, Algorithms and Stochastic Geometry"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.\r\nWe are grateful to Dmitry Zaporozhets and Christoph Thäle for valuable comments and for directing us to relevant references. We also thank to Anton Mellit for a useful discussion on Bessel functions.","department":[{"_id":"HeEd"}],"citation":{"ieee":"A. Akopyan, H. Edelsbrunner, and A. Nikitenko, “The beauty of random polytopes inscribed in the 2-sphere,” Experimental Mathematics. Taylor and Francis, pp. 1–15, 2021.","ista":"Akopyan A, Edelsbrunner H, Nikitenko A. 2021. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics., 1–15.","apa":"Akopyan, A., Edelsbrunner, H., & Nikitenko, A. (2021). The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics. Taylor and Francis. https://doi.org/10.1080/10586458.2021.1980459","mla":"Akopyan, Arseniy, et al. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” Experimental Mathematics, Taylor and Francis, 2021, pp. 1–15, doi:10.1080/10586458.2021.1980459.","chicago":"Akopyan, Arseniy, Herbert Edelsbrunner, and Anton Nikitenko. “The Beauty of Random Polytopes Inscribed in the 2-Sphere.” Experimental Mathematics. Taylor and Francis, 2021. https://doi.org/10.1080/10586458.2021.1980459.","ama":"Akopyan A, Edelsbrunner H, Nikitenko A. The beauty of random polytopes inscribed in the 2-sphere. Experimental Mathematics. 2021:1-15. doi:10.1080/10586458.2021.1980459","short":"A. Akopyan, H. Edelsbrunner, A. Nikitenko, Experimental Mathematics (2021) 1–15."},"article_processing_charge":"Yes (via OA deal)","type":"journal_article","oa":1,"day":"25","file_date_updated":"2023-08-14T11:55:10Z","month":"10","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","ddc":["510"],"year":"2021","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2025-04-15T07:45:32Z","_id":"10222","date_published":"2021-10-25T00:00:00Z","title":"The beauty of random polytopes inscribed in the 2-sphere","arxiv":1,"corr_author":"1","page":"1-15","status":"public"},{"arxiv":1,"page":"209-230","status":"public","volume":"12675 ","title":"Brick: Asynchronous incentive-compatible payment channels","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2023-08-14T12:59:58Z","_id":"10324","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1905.11360"}],"date_published":"2021-10-23T00:00:00Z","alternative_title":["LNCS"],"month":"10","year":"2021","conference":{"location":"Virtual","end_date":"2021-03-05","name":"FC: Financial Cryptography","start_date":"2021-03-01"},"citation":{"chicago":"Avarikioti, Zeta, Eleftherios Kokoris Kogias, Roger Wattenhofer, and Dionysis Zindros. “Brick: Asynchronous Incentive-Compatible Payment Channels.” In 25th International Conference on Financial Cryptography and Data Security, 12675:209–30. Springer Nature, 2021. https://doi.org/10.1007/978-3-662-64331-0_11.","short":"Z. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, D. Zindros, in:, 25th International Conference on Financial Cryptography and Data Security, Springer Nature, 2021, pp. 209–230.","ama":"Avarikioti Z, Kokoris Kogias E, Wattenhofer R, Zindros D. Brick: Asynchronous incentive-compatible payment channels. In: 25th International Conference on Financial Cryptography and Data Security. Vol 12675. Springer Nature; 2021:209-230. doi:10.1007/978-3-662-64331-0_11","ieee":"Z. Avarikioti, E. Kokoris Kogias, R. Wattenhofer, and D. Zindros, “Brick: Asynchronous incentive-compatible payment channels,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 209–230.","apa":"Avarikioti, Z., Kokoris Kogias, E., Wattenhofer, R., & Zindros, D. (2021). Brick: Asynchronous incentive-compatible payment channels. In 25th International Conference on Financial Cryptography and Data Security (Vol. 12675, pp. 209–230). Virtual: Springer Nature. https://doi.org/10.1007/978-3-662-64331-0_11","ista":"Avarikioti Z, Kokoris Kogias E, Wattenhofer R, Zindros D. 2021. Brick: Asynchronous incentive-compatible payment channels. 25th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 12675, 209–230.","mla":"Avarikioti, Zeta, et al. “Brick: Asynchronous Incentive-Compatible Payment Channels.” 25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 209–30, doi:10.1007/978-3-662-64331-0_11."},"type":"conference","article_processing_charge":"No","oa":1,"day":"23","author":[{"first_name":"Zeta","last_name":"Avarikioti","full_name":"Avarikioti, Zeta"},{"full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios"},{"last_name":"Wattenhofer","full_name":"Wattenhofer, Roger","first_name":"Roger"},{"last_name":"Zindros","full_name":"Zindros, Dionysis","first_name":"Dionysis"}],"scopus_import":"1","external_id":{"arxiv":["1905.11360"],"isi":["000712016200011"]},"isi":1,"department":[{"_id":"ElKo"}],"acknowledgement":"We would like to thank Kaoutar Elkhiyaoui for her valuable feedback as well as Jakub Sliwinski for his impactful contribution to this work.","publication_identifier":{"issn":["0302-9743"],"isbn":["9-783-6626-4330-3"],"eissn":["1611-3349"],"eisbn":["978-3-662-64331-0"]},"oa_version":"Preprint","publication":"25th International Conference on Financial Cryptography and Data Security","abstract":[{"lang":"eng","text":"Off-chain protocols (channels) are a promising solution to the scalability and privacy challenges of blockchain payments. Current proposals, however, require synchrony assumptions to preserve the safety of a channel, leaking to an adversary the exact amount of time needed to control the network for a successful attack. In this paper, we introduce Brick, the first payment channel that remains secure under network asynchrony and concurrently provides correct incentives. The core idea is to incorporate the conflict resolution process within the channel by introducing a rational committee of external parties, called wardens. Hence, if a party wants to close a channel unilaterally, it can only get the committee’s approval for the last valid state. Additionally, Brick provides sub-second latency because it does not employ heavy-weight consensus. Instead, Brick uses consistent broadcast to announce updates and close the channel, a light-weight abstraction that is powerful enough to preserve safety and liveness to any rational parties. We formally define and prove for Brick the properties a payment channel construction should fulfill. We also design incentives for Brick such that honest and rational behavior aligns. Finally, we provide a reference implementation of the smart contracts in Solidity."}],"publication_status":"published","doi":"10.1007/978-3-662-64331-0_11","date_created":"2021-11-21T23:01:29Z","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"title":"SoK: Communication across distributed ledgers","volume":"12675 ","status":"public","page":"3-36","year":"2021","conference":{"location":"Virtual","end_date":"2021-03-05","name":"FC: Financial Cryptography","start_date":"2021-03-01"},"month":"10","alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/1128"}],"_id":"10325","date_published":"2021-10-23T00:00:00Z","date_updated":"2023-08-14T12:59:26Z","language":[{"iso":"eng"}],"quality_controlled":"1","department":[{"_id":"ElKo"}],"acknowledgement":"We would like express our gratitude to Georgia Avarikioti, Daniel Perez and Dominik Harz for helpful comments and feedback on earlier versions of this manuscript. We also thank Nicholas Stifter, Aljosha Judmayer, Philipp Schindler, Edgar Weippl, and Alistair Stewart for insightful discussions during the early stages of this research. We also wish to thank the anonymous reviewers for their valuable comments that helped improve the presentation of our results. This research was funded by Bridge 1 858561 SESC; Bridge 1 864738 PR4DLT (all FFG); the Christian Doppler Laboratory for Security and Quality Improvement in the Production System Lifecycle (CDL-SQI); the competence center SBA-K1 funded by COMET; Chaincode Labs through the project SLN: Scalability for the Lightning Network; and by the Austrian Science Fund (FWF) through the Meitner program (project M-2608). Mustafa Al-Bassam is funded by a scholarship from the Alan Turing Institute. Alexei Zamyatin conducted the early stages of this work during his time at SBA Research, and was supported by a Binance Research Fellowship.","scopus_import":"1","isi":1,"external_id":{"isi":["000712016200001"]},"author":[{"first_name":"Alexei","last_name":"Zamyatin","full_name":"Zamyatin, Alexei"},{"full_name":"Al-Bassam, Mustafa","last_name":"Al-Bassam","first_name":"Mustafa"},{"full_name":"Zindros, Dionysis","last_name":"Zindros","first_name":"Dionysis"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","last_name":"Kokoris Kogias","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Pedro","full_name":"Moreno-Sanchez, Pedro","last_name":"Moreno-Sanchez"},{"full_name":"Kiayias, Aggelos","last_name":"Kiayias","first_name":"Aggelos"},{"full_name":"Knottenbelt, William J.","last_name":"Knottenbelt","first_name":"William J."}],"day":"23","article_processing_charge":"No","type":"conference","oa":1,"citation":{"chicago":"Zamyatin, Alexei, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, and William J. Knottenbelt. “SoK: Communication across Distributed Ledgers.” In 25th International Conference on Financial Cryptography and Data Security, 12675:3–36. Springer Nature, 2021. https://doi.org/10.1007/978-3-662-64331-0_1.","ama":"Zamyatin A, Al-Bassam M, Zindros D, et al. SoK: Communication across distributed ledgers. In: 25th International Conference on Financial Cryptography and Data Security. Vol 12675. Springer Nature; 2021:3-36. doi:10.1007/978-3-662-64331-0_1","short":"A. Zamyatin, M. Al-Bassam, D. Zindros, E. Kokoris Kogias, P. Moreno-Sanchez, A. Kiayias, W.J. Knottenbelt, in:, 25th International Conference on Financial Cryptography and Data Security, Springer Nature, 2021, pp. 3–36.","ieee":"A. Zamyatin et al., “SoK: Communication across distributed ledgers,” in 25th International Conference on Financial Cryptography and Data Security, Virtual, 2021, vol. 12675, pp. 3–36.","mla":"Zamyatin, Alexei, et al. “SoK: Communication across Distributed Ledgers.” 25th International Conference on Financial Cryptography and Data Security, vol. 12675, Springer Nature, 2021, pp. 3–36, doi:10.1007/978-3-662-64331-0_1.","ista":"Zamyatin A, Al-Bassam M, Zindros D, Kokoris Kogias E, Moreno-Sanchez P, Kiayias A, Knottenbelt WJ. 2021. SoK: Communication across distributed ledgers. 25th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography, LNCS, vol. 12675, 3–36.","apa":"Zamyatin, A., Al-Bassam, M., Zindros, D., Kokoris Kogias, E., Moreno-Sanchez, P., Kiayias, A., & Knottenbelt, W. J. (2021). SoK: Communication across distributed ledgers. In 25th International Conference on Financial Cryptography and Data Security (Vol. 12675, pp. 3–36). Virtual: Springer Nature. https://doi.org/10.1007/978-3-662-64331-0_1"},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer Nature","date_created":"2021-11-21T23:01:29Z","doi":"10.1007/978-3-662-64331-0_1","publication":"25th International Conference on Financial Cryptography and Data Security","abstract":[{"text":"Since the inception of Bitcoin, a plethora of distributed ledgers differing in design and purpose has been created. While by design, blockchains provide no means to securely communicate with external systems, numerous attempts towards trustless cross-chain communication have been proposed over the years. Today, cross-chain communication (CCC) plays a fundamental role in cryptocurrency exchanges, scalability efforts via sharding, extension of existing systems through sidechains, and bootstrapping of new blockchains. Unfortunately, existing proposals are designed ad-hoc for specific use-cases, making it hard to gain confidence in their correctness and composability. We provide the first systematic exposition of cross-chain communication protocols. We formalize the underlying research problem and show that CCC is impossible without a trusted third party, contrary to common beliefs in the blockchain community. With this result in mind, we develop a framework to design new and evaluate existing CCC protocols, focusing on the inherent trust assumptions thereof, and derive a classification covering the field of cross-chain communication to date. We conclude by discussing open challenges for CCC research and the implications of interoperability on the security and privacy of blockchains.","lang":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9-783-6626-4330-3"],"eissn":["1611-3349"],"eisbn":["978-3-662-64331-0"],"issn":["0302-9743"]},"oa_version":"Preprint"},{"citation":{"mla":"Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.","ista":"Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. 2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference, LNCS, vol. 13043, 397–428.","apa":"Chakraborty, S., Dziembowski, S., Gałązka, M., Lizurej, T., Pietrzak, K. Z., & Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp. 397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_14","ieee":"S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K. Z. Pietrzak, and M. X. Yeo, “Trojan-resilience without cryptography,” presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 397–428.","ama":"Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. Trojan-resilience without cryptography. In: Vol 13043. Springer Nature; 2021:397-428. doi:10.1007/978-3-030-90453-1_14","short":"S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K.Z. Pietrzak, M.X. Yeo, in:, Springer Nature, 2021, pp. 397–428.","chicago":"Chakraborty, Suvradip, Stefan Dziembowski, Małgorzata Gałązka, Tomasz Lizurej, Krzysztof Z Pietrzak, and Michelle X Yeo. “Trojan-Resilience without Cryptography,” 13043:397–428. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_14."},"oa":1,"type":"conference","article_processing_charge":"No","intvolume":" 13043","day":"04","author":[{"first_name":"Suvradip","id":"B9CD0494-D033-11E9-B219-A439E6697425","full_name":"Chakraborty, Suvradip","last_name":"Chakraborty"},{"first_name":"Stefan","full_name":"Dziembowski, Stefan","last_name":"Dziembowski"},{"first_name":"Małgorzata","full_name":"Gałązka, Małgorzata","last_name":"Gałązka"},{"first_name":"Tomasz","last_name":"Lizurej","full_name":"Lizurej, Tomasz"},{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Michelle X","orcid":"0009-0001-3676-4809","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","full_name":"Yeo, Michelle X","last_name":"Yeo"}],"external_id":{"isi":["000728364000014"]},"isi":1,"scopus_import":"1","ec_funded":1,"department":[{"_id":"KrPi"}],"project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"],"issn":["0302-9743"]},"oa_version":"Preprint","publication_status":"published","abstract":[{"lang":"eng","text":"Digital hardware Trojans are integrated circuits whose implementation differ from the specification in an arbitrary and malicious way. For example, the circuit can differ from its specified input/output behavior after some fixed number of queries (known as “time bombs”) or on some particular input (known as “cheat codes”). To detect such Trojans, countermeasures using multiparty computation (MPC) or verifiable computation (VC) have been proposed. On a high level, to realize a circuit with specification F one has more sophisticated circuits F⋄ manufactured (where F⋄ specifies a MPC or VC of F ), and then embeds these F⋄ ’s into a master circuit which must be trusted but is relatively simple compared to F . Those solutions impose a significant overhead as F⋄ is much more complex than F , also the master circuits are not exactly trivial. In this work, we show that in restricted settings, where F has no evolving state and is queried on independent inputs, we can achieve a relaxed security notion using very simple constructions. In particular, we do not change the specification of the circuit at all (i.e., F=F⋄ ). Moreover the master circuit basically just queries a subset of its manufactured circuits and checks if they’re all the same. The security we achieve guarantees that, if the manufactured circuits are initially tested on up to T inputs, the master circuit will catch Trojans that try to deviate on significantly more than a 1/T fraction of the inputs. This bound is optimal for the type of construction considered, and we provably achieve it using a construction where 12 instantiations of F need to be embedded into the master. We also discuss an extremely simple construction with just 2 instantiations for which we conjecture that it already achieves the optimal bound."}],"doi":"10.1007/978-3-030-90453-1_14","date_created":"2021-12-05T23:01:42Z","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"397-428","status":"public","volume":13043,"title":"Trojan-resilience without cryptography","quality_controlled":"1","date_updated":"2025-04-14T07:22:05Z","language":[{"iso":"eng"}],"date_published":"2021-11-04T00:00:00Z","_id":"10407","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1224"}],"alternative_title":["LNCS"],"month":"11","conference":{"name":"TCC: Theory of Cryptography Conference","start_date":"2021-11-08","end_date":"2021-11-11","location":"Raleigh, NC, United States"},"year":"2021"},{"citation":{"ama":"Alwen JF, Auerbach B, Baig MA, et al. Grafting key trees: Efficient key management for overlapping groups. In: 19th International Conference. Vol 13044. Springer Nature; 2021:222-253. doi:10.1007/978-3-030-90456-2_8","short":"J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.","chicago":"Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” In 19th International Conference, 13044:222–53. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90456-2_8.","ista":"Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13044, 222–253.","apa":"Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G., … Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90456-2_8","mla":"Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.","ieee":"J. F. Alwen et al., “Grafting key trees: Efficient key management for overlapping groups,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13044, pp. 222–253."},"type":"conference","article_processing_charge":"No","oa":1,"intvolume":" 13044","day":"04","author":[{"full_name":"Alwen, Joel F","last_name":"Alwen","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","first_name":"Joel F"},{"full_name":"Auerbach, Benedikt","last_name":"Auerbach","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","first_name":"Benedikt","orcid":"0000-0002-7553-6606"},{"last_name":"Baig","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad"},{"orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen","last_name":"Klein"},{"last_name":"Pascual Perez","full_name":"Pascual Perez, Guillermo","orcid":"0000-0001-8630-415X","first_name":"Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"last_name":"Walter","full_name":"Walter, Michael","orcid":"0000-0003-3186-2482","first_name":"Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","isi":1,"external_id":{"isi":["000728363700008"]},"ec_funded":1,"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"}],"acknowledgement":"B. Auerbach, M.A. Baig and K. Pietrzak—received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Karen Klein was supported in part by ERC CoG grant 724307 and conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT); Guillermo Pascual-Perez was funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385; Michael Walter conducted part of this work at IST Austria, funded by the ERC under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","department":[{"_id":"KrPi"}],"oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["978-3-030-90456-2"],"isbn":["9-783-0309-0455-5"]},"publication":"19th International Conference","abstract":[{"text":"Key trees are often the best solution in terms of transmission cost and storage requirements for managing keys in a setting where a group needs to share a secret key, while being able to efficiently rotate the key material of users (in order to recover from a potential compromise, or to add or remove users). Applications include multicast encryption protocols like LKH (Logical Key Hierarchies) or group messaging like the current IETF proposal TreeKEM. A key tree is a (typically balanced) binary tree, where each node is identified with a key: leaf nodes hold users’ secret keys while the root is the shared group key. For a group of size N, each user just holds log(N) keys (the keys on the path from its leaf to the root) and its entire key material can be rotated by broadcasting 2log(N) ciphertexts (encrypting each fresh key on the path under the keys of its parents). In this work we consider the natural setting where we have many groups with partially overlapping sets of users, and ask if we can find solutions where the cost of rotating a key is better than in the trivial one where we have a separate key tree for each group. We show that in an asymptotic setting (where the number m of groups is fixed while the number N of users grows) there exist more general key graphs whose cost converges to the cost of a single group, thus saving a factor linear in the number of groups over the trivial solution. As our asymptotic “solution” converges very slowly and performs poorly on concrete examples, we propose an algorithm that uses a natural heuristic to compute a key graph for any given group structure. Our algorithm combines two greedy algorithms, and is thus very efficient: it first converts the group structure into a “lattice graph”, which is then turned into a key graph by repeatedly applying the algorithm for constructing a Huffman code. To better understand how far our proposal is from an optimal solution, we prove lower bounds on the update cost of continuous group-key agreement and multicast encryption in a symbolic model admitting (asymmetric) encryption, pseudorandom generators, and secret sharing as building blocks.","lang":"eng"}],"publication_status":"published","doi":"10.1007/978-3-030-90456-2_8","date_created":"2021-12-05T23:01:42Z","publisher":"Springer Nature","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","page":"222-253","status":"public","volume":13044,"title":"Grafting key trees: Efficient key management for overlapping groups","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2026-04-07T13:01:26Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1158"}],"_id":"10408","date_published":"2021-11-04T00:00:00Z","alternative_title":["LNCS"],"month":"11","related_material":{"record":[{"relation":"dissertation_contains","id":"18088","status":"public"}]},"year":"2021","conference":{"end_date":"2021-11-11","name":"TCC: Theory of Cryptography","start_date":"2021-11-08","location":"Raleigh, NC, United States"}},{"page":"486-517","status":"public","title":"On treewidth, separators and Yao’s garbling","volume":"13043 ","language":[{"iso":"eng"}],"date_updated":"2025-04-15T08:32:06Z","quality_controlled":"1","alternative_title":["LNCS"],"date_published":"2021-11-04T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/926"}],"_id":"10409","related_material":{"record":[{"relation":"earlier_version","id":"10044","status":"public"}]},"month":"11","conference":{"end_date":"2021-11-11","start_date":"2021-11-08","name":"TCC: Theory of Cryptography","location":"Raleigh, NC, United States"},"year":"2021","oa":1,"type":"conference","article_processing_charge":"No","citation":{"short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference, Springer Nature, 2021, pp. 486–517.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th International Conference. Vol 13043. Springer Nature; 2021:486-517. doi:10.1007/978-3-030-90453-1_17","chicago":"Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th International Conference, 13043:486–517. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_17.","apa":"Kamath Hosdurg, C., Klein, K., & Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th International Conference (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_17","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 486–517.","mla":"Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.","ieee":"C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 486–517."},"day":"04","isi":1,"external_id":{"isi":["000728364000017"]},"scopus_import":"1","author":[{"first_name":"Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","last_name":"Kamath Hosdurg","full_name":"Kamath Hosdurg, Chethan"},{"last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"department":[{"_id":"KrPi"}],"acknowledgement":"We are grateful to Daniel Wichs for helpful discussions on the landscape of adaptive security of Yao’s garbling. We would also like to thank Crypto 2021 and TCC 2021 reviewers for their detailed review and suggestions, which helped improve presentation considerably.","project":[{"call_identifier":"H2020","grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks"}],"ec_funded":1,"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"]},"oa_version":"Preprint","doi":"10.1007/978-3-030-90453-1_17","publication_status":"published","abstract":[{"text":"We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size S and treewidth w with only a SO(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(δwlog(S)) , δ being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity. with only a SO(w) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss. This (partially) complements a negative result of Applebaum et al. (Crypto 2013), which showed (assuming one-way functions) that Yao’s garbling scheme cannot be adaptively simulatable. As main technical contributions, we introduce a new pebble game that abstracts out our security reduction and then present a pebbling strategy for this game where the number of pebbles used is roughly O(δwlog(S)) , δ being the fan-out of the circuit. The design of the strategy relies on separators, a graph-theoretic notion with connections to circuit complexity.","lang":"eng"}],"publication":"19th International Conference","publisher":"Springer Nature","date_created":"2021-12-05T23:01:43Z","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2021-12-05T23:01:43Z","publisher":"Springer Nature","abstract":[{"text":"The security of cryptographic primitives and protocols against adversaries that are allowed to make adaptive choices (e.g., which parties to corrupt or which queries to make) is notoriously difficult to establish. A broad theoretical framework was introduced by Jafargholi et al. [Crypto’17] for this purpose. In this paper we initiate the study of lower bounds on loss in adaptive security for certain cryptographic protocols considered in the framework. We prove lower bounds that almost match the upper bounds (proven using the framework) for proxy re-encryption, prefix-constrained PRFs and generalized selective decryption, a security game that captures the security of certain group messaging and broadcast encryption schemes. Those primitives have in common that their security game involves an underlying graph that can be adaptively built by the adversary. Some of our lower bounds only apply to a restricted class of black-box reductions which we term “oblivious” (the existing upper bounds are of this restricted type), some apply to the broader but still restricted class of non-rewinding reductions, while our lower bound for proxy re-encryption applies to all black-box reductions. The fact that some of our lower bounds seem to crucially rely on obliviousness or at least a non-rewinding reduction hints to the exciting possibility that the existing upper bounds can be improved by using more sophisticated reductions. Our main conceptual contribution is a two-player multi-stage game called the Builder-Pebbler Game. We can translate bounds on the winning probabilities for various instantiations of this game into cryptographic lower bounds for the above-mentioned primitives using oracle separation techniques.","lang":"eng"}],"publication":"19th International Conference","publication_status":"published","doi":"10.1007/978-3-030-90453-1_19","publication_identifier":{"eissn":["1611-3349"],"isbn":["9-783-0309-0452-4"],"issn":["0302-9743"]},"oa_version":"Preprint","ec_funded":1,"project":[{"name":"Teaching Old Crypto New Tricks","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","call_identifier":"H2020"}],"department":[{"_id":"KrPi"}],"acknowledgement":"C. Kamath—Supported by Azrieli International Postdoctoral Fellowship. Most of the work was done while the author was at Northeastern University and Charles University, funded by the IARPA grant IARPA/2019-19-020700009 and project PRIMUS/17/SCI/9, respectively. K. Klein—Supported in part by ERC CoG grant 724307. Most of the work was done while the author was at IST Austria funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT). K. Pietrzak—Funded by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","author":[{"full_name":"Kamath Hosdurg, Chethan","last_name":"Kamath Hosdurg","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87","first_name":"Chethan"},{"full_name":"Klein, Karen","last_name":"Klein","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","first_name":"Karen"},{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","first_name":"Michael","orcid":"0000-0003-3186-2482","last_name":"Walter","full_name":"Walter, Michael"}],"scopus_import":"1","external_id":{"isi":["000728364000019"]},"isi":1,"intvolume":" 13043","day":"04","citation":{"chicago":"Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th International Conference, 13043:550–81. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90453-1_19.","short":"C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 550–581.","ama":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th International Conference. Vol 13043. Springer Nature; 2021:550-581. doi:10.1007/978-3-030-90453-1_19","ieee":"C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 550–581.","mla":"Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.","ista":"Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.","apa":"Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., & Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th International Conference (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature. https://doi.org/10.1007/978-3-030-90453-1_19"},"article_processing_charge":"No","type":"conference","oa":1,"year":"2021","conference":{"end_date":"2021-11-11","start_date":"2021-11-08","name":"TCC: Theory of Cryptography","location":"Raleigh, NC, United States"},"month":"11","related_material":{"record":[{"relation":"earlier_version","id":"10048","status":"public"}]},"_id":"10410","main_file_link":[{"url":"https://ia.cr/2021/059","open_access":"1"}],"date_published":"2021-11-04T00:00:00Z","alternative_title":["LNCS"],"quality_controlled":"1","date_updated":"2025-04-14T07:22:05Z","language":[{"iso":"eng"}],"volume":13043,"title":"The cost of adaptivity in security games on graphs","status":"public","page":"550-581"},{"citation":{"ieee":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33","ista":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. 2021. On lexicographic proof rules for probabilistic termination. 24th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 13047, 619–639.","mla":"Chatterjee, Krishnendu, et al. “On Lexicographic Proof Rules for Probabilistic Termination.” 24th International Symposium on Formal Methods, vol. 13047, Springer Nature, 2021, pp. 619–39, doi:10.1007/978-3-030-90870-6_33.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, Jiří Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.” In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-90870-6_33.","ama":"Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33","short":"K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639."},"article_processing_charge":"No","type":"conference","oa":1,"intvolume":" 13047","day":"10","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Ehsan","orcid":"0000-0002-8595-0587","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","full_name":"Kafshdar Goharshadi, Ehsan","last_name":"Kafshdar Goharshadi"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","full_name":"Novotný, Petr","last_name":"Novotný"},{"last_name":"Zárevúcky","full_name":"Zárevúcky, Jiří","first_name":"Jiří"},{"first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"scopus_import":"1","external_id":{"arxiv":["2108.02188"],"isi":["000758218600033"]},"isi":1,"ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","grant_number":"665385"}],"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt), the Czech Science Foundation grant No. GJ19-15134Y, and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.","department":[{"_id":"KrCh"}],"oa_version":"Preprint","publication_identifier":{"issn":["0302-9743"],"isbn":["9-783-0309-0869-0"],"eisbn":["978-3-030-90870-6"],"eissn":["1611-3349"]},"publication":"24th International Symposium on Formal Methods","abstract":[{"lang":"eng","text":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in LexRSM not existing even for simple terminating programs. Our contributions are twofold: First, we introduce a generalization of LexRSMs which allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs."}],"publication_status":"published","doi":"10.1007/978-3-030-90870-6_33","date_created":"2021-12-05T23:01:45Z","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"page":"619-639","status":"public","volume":13047,"title":"On lexicographic proof rules for probabilistic termination","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2026-04-07T13:27:55Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.02188"}],"_id":"10414","date_published":"2021-11-10T00:00:00Z","alternative_title":["LNCS"],"month":"11","related_material":{"record":[{"status":"public","id":"14778","relation":"later_version"},{"status":"public","id":"14539","relation":"dissertation_contains"}]},"year":"2021","conference":{"name":"FM: Formal Methods","start_date":"2021-11-20","end_date":"2021-11-26","location":"Virtual"}},{"department":[{"_id":"TiBr"}],"author":[{"full_name":"Browning, Timothy D","last_name":"Browning","first_name":"Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177"}],"volume":343,"title":"Cubic Forms and the Circle Method","scopus_import":"1","intvolume":" 343","status":"public","day":"01","page":"XIV, 166","citation":{"chicago":"Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343. Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-86872-7.","ama":"Browning TD. Cubic Forms and the Circle Method. Vol 343. Cham: Springer Nature; 2021. doi:10.1007/978-3-030-86872-7","short":"T.D. Browning, Cubic Forms and the Circle Method, Springer Nature, Cham, 2021.","ieee":"T. D. Browning, Cubic Forms and the Circle Method, vol. 343. Cham: Springer Nature, 2021.","mla":"Browning, Timothy D. Cubic Forms and the Circle Method. Vol. 343, Springer Nature, 2021, doi:10.1007/978-3-030-86872-7.","apa":"Browning, T. D. (2021). Cubic Forms and the Circle Method (Vol. 343). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-86872-7","ista":"Browning TD. 2021. Cubic Forms and the Circle Method, Cham: Springer Nature, XIV, 166p."},"corr_author":"1","type":"book","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","date_created":"2021-12-05T23:01:46Z","place":"Cham","month":"12","publisher":"Springer Nature","publication_status":"published","date_published":"2021-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"The Hardy–Littlewood circle method was invented over a century ago to study integer solutions to special Diophantine equations, but it has since proven to be one of the most successful all-purpose tools available to number theorists. Not only is it capable of handling remarkably general systems of polynomial equations defined over arbitrary global fields, but it can also shed light on the space of rational curves that lie on algebraic varieties. This book, in which the arithmetic of cubic polynomials takes centre stage, is aimed at bringing beginning graduate students into contact with some of the many facets of the circle method, both classical and modern. This monograph is the winner of the 2021 Ferran Sunyer i Balaguer Prize, a prestigious award for books of expository nature presenting the latest developments in an active area of research in mathematics."}],"_id":"10415","alternative_title":["Progress in Mathematics"],"doi":"10.1007/978-3-030-86872-7","oa_version":"None","publication_identifier":{"issn":["0743-1643"],"isbn":["978-3-030-86871-0"],"eisbn":["978-3-030-86872-7"],"eissn":["2296-505X"]},"quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2024-10-09T21:01:16Z"},{"arxiv":1,"status":"public","volume":104,"title":"Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT)","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2026-04-07T12:43:22Z","_id":"10545","main_file_link":[{"url":"https://arxiv.org/abs/2106.06344","open_access":"1"}],"date_published":"2021-12-14T00:00:00Z","month":"12","related_material":{"record":[{"status":"public","id":"17208","relation":"dissertation_contains"}]},"year":"2021","citation":{"mla":"Medina Ramos, Raimel A., and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” Physical Review A, vol. 104, no. 6, 062423, American Physical Society, 2021, doi:10.1103/physreva.104.062423.","apa":"Medina Ramos, R. A., & Serbyn, M. (2021). Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review A. American Physical Society. https://doi.org/10.1103/physreva.104.062423","ista":"Medina Ramos RA, Serbyn M. 2021. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review A. 104(6), 062423.","ieee":"R. A. Medina Ramos and M. Serbyn, “Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT),” Physical Review A, vol. 104, no. 6. American Physical Society, 2021.","ama":"Medina Ramos RA, Serbyn M. Duality approach to quantum annealing of the 3-variable exclusive-or satisfiability problem (3-XORSAT). Physical Review A. 2021;104(6). doi:10.1103/physreva.104.062423","short":"R.A. Medina Ramos, M. Serbyn, Physical Review A 104 (2021).","chicago":"Medina Ramos, Raimel A, and Maksym Serbyn. “Duality Approach to Quantum Annealing of the 3-Variable Exclusive-or Satisfiability Problem (3-XORSAT).” Physical Review A. American Physical Society, 2021. https://doi.org/10.1103/physreva.104.062423."},"article_processing_charge":"No","type":"journal_article","oa":1,"intvolume":" 104","day":"14","author":[{"last_name":"Medina Ramos","full_name":"Medina Ramos, Raimel A","first_name":"Raimel A","orcid":"0000-0002-5383-2869","id":"CE680B90-D85A-11E9-B684-C920E6697425"},{"first_name":"Maksym","orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn","full_name":"Serbyn, Maksym"}],"scopus_import":"1","article_number":"062423","isi":1,"external_id":{"isi":["000753659200004"],"arxiv":["2106.06344"]},"ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"850899","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E"}],"department":[{"_id":"MaSe"}],"issue":"6","acknowledgement":"We would like to thank S. De Nicola, A. Michaidilis, T. Gulden, Y. Nez-Fernndez, P. Brighi, and S. Sack for fruitful discussions and valuable feedback on the manuscript. M.S. acknowledges useful discussions with E. Altman, L. Cugliandolo, and C. Laumann. We acknowledge support from the European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme Grant Agreement No. 850899.","oa_version":"Preprint","publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"abstract":[{"text":"Classical models with complex energy landscapes represent a perspective avenue for the near-term application of quantum simulators. Until now, many theoretical works studied the performance of quantum algorithms for models with a unique ground state. However, when the classical problem is in a so-called clustering phase, the ground state manifold is highly degenerate. As an example, we consider a 3-XORSAT model defined on simple hypergraphs. The degeneracy of classical ground state manifold translates into the emergence of an extensive number of Z2 symmetries, which remain intact even in the presence of a quantum transverse magnetic field. We establish a general duality approach that restricts the quantum problem to a given sector of conserved Z2 charges and use it to study how the outcome of the quantum adiabatic algorithm depends on the hypergraph geometry. We show that the tree hypergraph which corresponds to a classically solvable instance of the 3-XORSAT problem features a constant gap, whereas the closed hypergraph encounters a second-order phase transition with a gap vanishing as a power-law in the problem size. The duality developed in this work provides a practical tool for studies of quantum models with classically degenerate energy manifold and reveals potential connections between glasses and gauge theories.","lang":"eng"}],"publication":"Physical Review A","publication_status":"published","doi":"10.1103/physreva.104.062423","date_created":"2021-12-14T20:46:07Z","article_type":"original","publisher":"American Physical Society","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"},{"_id":"10549","date_published":"2021-06-30T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_updated":"2023-08-17T06:23:21Z","ddc":["530"],"year":"2021","month":"06","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","status":"public","arxiv":1,"page":"343-452","volume":242,"title":"Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems","publication":"Archive for Rational Mechanics and Analysis","file":[{"date_created":"2021-12-16T14:58:08Z","file_size":1640121,"access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_id":"10558","creator":"cchlebak","date_updated":"2021-12-16T14:58:08Z","success":1,"file_name":"2021_ArchRatMechAnalysis_Fischer.pdf","checksum":"cc830b739aed83ca2e32c4e0ce266a4c"}],"abstract":[{"lang":"eng","text":"We derive optimal-order homogenization rates for random nonlinear elliptic PDEs with monotone nonlinearity in the uniformly elliptic case. More precisely, for a random monotone operator on \\mathbb {R}^d with stationary law (that is spatially homogeneous statistics) and fast decay of correlations on scales larger than the microscale \\varepsilon >0, we establish homogenization error estimates of the order \\varepsilon in case d\\geqq 3, and of the order \\varepsilon |\\log \\varepsilon |^{1/2} in case d=2. Previous results in nonlinear stochastic homogenization have been limited to a small algebraic rate of convergence \\varepsilon ^\\delta . We also establish error estimates for the approximation of the homogenized operator by the method of representative volumes of the order (L/\\varepsilon )^{-d/2} for a representative volume of size L. Our results also hold in the case of systems for which a (small-scale) C^{1,\\alpha } regularity theory is available."}],"publication_status":"published","doi":"10.1007/s00205-021-01686-9","publication_identifier":{"eissn":["1432-0673"],"issn":["0003-9527"]},"oa_version":"Published Version","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2021-12-16T12:12:33Z","article_type":"original","publisher":"Springer Nature","intvolume":" 242","day":"30","file_date_updated":"2021-12-16T14:58:08Z","keyword":["Mechanical Engineering","Mathematics (miscellaneous)","Analysis"],"citation":{"ieee":"J. L. Fischer and S. Neukamm, “Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems,” Archive for Rational Mechanics and Analysis, vol. 242, no. 1. Springer Nature, pp. 343–452, 2021.","mla":"Fischer, Julian L., and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” Archive for Rational Mechanics and Analysis, vol. 242, no. 1, Springer Nature, 2021, pp. 343–452, doi:10.1007/s00205-021-01686-9.","ista":"Fischer JL, Neukamm S. 2021. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics and Analysis. 242(1), 343–452.","apa":"Fischer, J. L., & Neukamm, S. (2021). Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics and Analysis. Springer Nature. https://doi.org/10.1007/s00205-021-01686-9","chicago":"Fischer, Julian L, and Stefan Neukamm. “Optimal Homogenization Rates in Stochastic Homogenization of Nonlinear Uniformly Elliptic Equations and Systems.” Archive for Rational Mechanics and Analysis. Springer Nature, 2021. https://doi.org/10.1007/s00205-021-01686-9.","ama":"Fischer JL, Neukamm S. Optimal homogenization rates in stochastic homogenization of nonlinear uniformly elliptic equations and systems. Archive for Rational Mechanics and Analysis. 2021;242(1):343-452. doi:10.1007/s00205-021-01686-9","short":"J.L. Fischer, S. Neukamm, Archive for Rational Mechanics and Analysis 242 (2021) 343–452."},"article_processing_charge":"Yes (via OA deal)","type":"journal_article","oa":1,"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). SN acknowledges partial support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 405009441.","department":[{"_id":"JuFi"}],"issue":"1","author":[{"full_name":"Fischer, Julian L","last_name":"Fischer","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","first_name":"Julian L"},{"first_name":"Stefan","full_name":"Neukamm, Stefan","last_name":"Neukamm"}],"scopus_import":"1","isi":1,"external_id":{"isi":["000668431200001"],"arxiv":["1908.02273"]}},{"title":"Enhancement of proximity-induced superconductivity in a planar Ge hole gas","volume":3,"arxiv":1,"corr_author":"1","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"status":"public","related_material":{"record":[{"relation":"research_data","id":"8834","status":"public"},{"id":"8831","relation":"earlier_version","status":"public"}]},"month":"04","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"has_accepted_license":"1","ddc":["620"],"year":"2021","date_updated":"2025-04-15T08:38:16Z","language":[{"iso":"eng"}],"quality_controlled":"1","_id":"10559","date_published":"2021-04-15T00:00:00Z","article_number":"L022005","scopus_import":"1","external_id":{"arxiv":["2012.00322"]},"author":[{"full_name":"Aggarwal, Kushagra","last_name":"Aggarwal","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","first_name":"Kushagra","orcid":"0000-0001-9985-9293"},{"first_name":"Andrea C","id":"340F461A-F248-11E8-B48F-1D18A9856A87","full_name":"Hofmann, Andrea C","last_name":"Hofmann"},{"full_name":"Jirovec, Daniel","last_name":"Jirovec","first_name":"Daniel","id":"4C473F58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7197-4801"},{"first_name":"Ivan","orcid":"0000-0002-7370-5357","id":"2A307FE2-F248-11E8-B48F-1D18A9856A87","last_name":"Prieto Gonzalez","full_name":"Prieto Gonzalez, Ivan"},{"first_name":"Amir","last_name":"Sammak","full_name":"Sammak, Amir"},{"last_name":"Botifoll","full_name":"Botifoll, Marc","first_name":"Marc"},{"last_name":"Martí-Sánchez","full_name":"Martí-Sánchez, Sara","first_name":"Sara"},{"last_name":"Veldhorst","full_name":"Veldhorst, Menno","first_name":"Menno"},{"last_name":"Arbiol","full_name":"Arbiol, Jordi","first_name":"Jordi"},{"first_name":"Giordano","full_name":"Scappucci, Giordano","last_name":"Scappucci"},{"full_name":"Danon, Jeroen","last_name":"Danon","first_name":"Jeroen"},{"full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X"}],"project":[{"call_identifier":"H2020","_id":"26A151DA-B435-11E9-9278-68D0E5697425","grant_number":"844511","name":"Majorana bound states in Ge/SiGe heterostructures"},{"_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","grant_number":"862046","call_identifier":"H2020"}],"issue":"2","department":[{"_id":"GeKa"}],"acknowledgement":"This research and related results were made possible with the support of the NOMIS Foundation. This research was supported by the Scientific Service Units of IST Austria through resources provided by the MIBA Machine Shop and the nanofabrication facility, the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant agreement No. 844511 Grant Agreement No. 862046. ICN2 acknowledge funding from Generalitat de Catalunya 2017 SGR 327. ICN2 is supported by the Severo Ochoa program from Spanish MINECO (Grant No. SEV-2017-0706) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autnoma de Barcelona Materials Science PhD program. The HAADF-STEM microscopy was conducted in the Laboratorio de Microscopias Avanzadas at Instituto de Nanociencia de Aragon-Universidad de Zaragoza. Authors acknowledge the LMA-INA for offering access to their instruments and expertise. We acknowledge support from CSIC Research Platform on Quantum Technologies PTI-001. This project has received funding from the European Union's Horizon 2020 research and innovation programme under Grant Agreement No. 823717 ESTEEM3. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. G.S. and M.V. acknowledge support through a projectruimte grant associated with the Netherlands Organization of Scientific Research (NWO). J.D. acknowledges support through FRIPRO-project 274853, which is funded by the Research Council of Norway.","ec_funded":1,"article_processing_charge":"No","type":"journal_article","oa":1,"citation":{"chicago":"Aggarwal, Kushagra, Andrea C Hofmann, Daniel Jirovec, Ivan Prieto Gonzalez, Amir Sammak, Marc Botifoll, Sara Martí-Sánchez, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” Physical Review Research. American Physical Society, 2021. https://doi.org/10.1103/physrevresearch.3.l022005.","ama":"Aggarwal K, Hofmann AC, Jirovec D, et al. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical Review Research. 2021;3(2). doi:10.1103/physrevresearch.3.l022005","short":"K. Aggarwal, A.C. Hofmann, D. Jirovec, I. Prieto Gonzalez, A. Sammak, M. Botifoll, S. Martí-Sánchez, M. Veldhorst, J. Arbiol, G. Scappucci, J. Danon, G. Katsaros, Physical Review Research 3 (2021).","ieee":"K. Aggarwal et al., “Enhancement of proximity-induced superconductivity in a planar Ge hole gas,” Physical Review Research, vol. 3, no. 2. American Physical Society, 2021.","ista":"Aggarwal K, Hofmann AC, Jirovec D, Prieto Gonzalez I, Sammak A, Botifoll M, Martí-Sánchez S, Veldhorst M, Arbiol J, Scappucci G, Danon J, Katsaros G. 2021. Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical Review Research. 3(2), L022005.","apa":"Aggarwal, K., Hofmann, A. C., Jirovec, D., Prieto Gonzalez, I., Sammak, A., Botifoll, M., … Katsaros, G. (2021). Enhancement of proximity-induced superconductivity in a planar Ge hole gas. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.3.l022005","mla":"Aggarwal, Kushagra, et al. “Enhancement of Proximity-Induced Superconductivity in a Planar Ge Hole Gas.” Physical Review Research, vol. 3, no. 2, L022005, American Physical Society, 2021, doi:10.1103/physrevresearch.3.l022005."},"day":"15","keyword":["general engineering"],"file_date_updated":"2021-12-17T08:12:37Z","intvolume":" 3","article_type":"original","publisher":"American Physical Society","date_created":"2021-12-16T18:50:57Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_identifier":{"issn":["2643-1564"]},"oa_version":"Published Version","doi":"10.1103/physrevresearch.3.l022005","file":[{"creator":"cchlebak","file_id":"10561","date_updated":"2021-12-17T08:12:37Z","checksum":"60a1bc9c9b616b1b155044bb8cfc6484","file_name":"2021_PhysRevResearch_Aggarwal.pdf","success":1,"file_size":1917512,"date_created":"2021-12-17T08:12:37Z","relation":"main_file","content_type":"application/pdf","access_level":"open_access"}],"abstract":[{"text":"Hole gases in planar germanium can have high mobilities in combination with strong spin-orbit interaction and electrically tunable g factors, and are therefore emerging as a promising platform for creating hybrid superconductor-semiconductor devices. A key challenge towards hybrid Ge-based quantum technologies is the design of high-quality interfaces and superconducting contacts that are robust against magnetic fields. In this work, by combining the assets of aluminum, which provides good contact to the Ge, and niobium, which has a significant superconducting gap, we demonstrate highly transparent low-disordered JoFETs with relatively large ICRN products that are capable of withstanding high magnetic fields. We furthermore demonstrate the ability of phase-biasing individual JoFETs, opening up an avenue to explore topological superconductivity in planar Ge. The persistence of superconductivity in the reported hybrid devices beyond 1.8 T paves the way towards integrating spin qubits and proximity-induced superconductivity on the same chip.","lang":"eng"}],"publication":"Physical Review Research","publication_status":"published"},{"day":"22","intvolume":" 184","type":"journal_article","article_processing_charge":"No","oa":1,"citation":{"chicago":"Munjal, Akankshi, Edouard B Hannezo, Tony Y.C. Tsai, Timothy J. Mitchison, and Sean G. Megason. “Extracellular Hyaluronate Pressure Shaped by Cellular Tethers Drives Tissue Morphogenesis.” Cell. Elsevier, 2021. https://doi.org/10.1016/j.cell.2021.11.025.","short":"A. Munjal, E.B. Hannezo, T.Y.C. Tsai, T.J. Mitchison, S.G. Megason, Cell 184 (2021) 6313–6325.e18.","ama":"Munjal A, Hannezo EB, Tsai TYC, Mitchison TJ, Megason SG. Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. Cell. 2021;184(26):6313-6325.e18. doi:10.1016/j.cell.2021.11.025","ieee":"A. Munjal, E. B. Hannezo, T. Y. C. Tsai, T. J. Mitchison, and S. G. Megason, “Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis,” Cell, vol. 184, no. 26. Elsevier, p. 6313–6325.e18, 2021.","mla":"Munjal, Akankshi, et al. “Extracellular Hyaluronate Pressure Shaped by Cellular Tethers Drives Tissue Morphogenesis.” Cell, vol. 184, no. 26, Elsevier, 2021, p. 6313–6325.e18, doi:10.1016/j.cell.2021.11.025.","apa":"Munjal, A., Hannezo, E. B., Tsai, T. Y. C., Mitchison, T. J., & Megason, S. G. (2021). Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. Cell. Elsevier. https://doi.org/10.1016/j.cell.2021.11.025","ista":"Munjal A, Hannezo EB, Tsai TYC, Mitchison TJ, Megason SG. 2021. Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis. Cell. 184(26), 6313–6325.e18."},"department":[{"_id":"EdHa"}],"issue":"26","acknowledgement":"We thank Ian Swinburne, Sandy Nandagopal, and Toru Kawanishi for support, discussions, and reagents. We thank Vanessa Barone, Joseph Nasser, and members of the Megason lab for useful comments on the manuscript and general feedback. We are grateful to the Heisenberg and Knaut labs for transgenic fish. Diagrams on the right in the graphical abstract were created using BioRender. This work was supported by NIH R01DC015478 and NIH R01GM107733 to S.G.M. A.M. was supported by Human Frontiers Science Program LTF and NIH K99HD098918.","scopus_import":"1","external_id":{"isi":["000735387500002"]},"isi":1,"author":[{"first_name":"Akankshi","last_name":"Munjal","full_name":"Munjal, Akankshi"},{"last_name":"Hannezo","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","orcid":"0000-0001-6005-1561"},{"last_name":"Tsai","full_name":"Tsai, Tony Y.C.","first_name":"Tony Y.C."},{"first_name":"Timothy J.","last_name":"Mitchison","full_name":"Mitchison, Timothy J."},{"last_name":"Megason","full_name":"Megason, Sean G.","first_name":"Sean G."}],"doi":"10.1016/j.cell.2021.11.025","publication":"Cell","abstract":[{"text":"How tissues acquire complex shapes is a fundamental question in biology and regenerative medicine. Zebrafish semicircular canals form from invaginations in the otic epithelium (buds) that extend and fuse to form the hubs of each canal. We find that conventional actomyosin-driven behaviors are not required. Instead, local secretion of hyaluronan, made by the enzymes uridine 5′-diphosphate dehydrogenase (ugdh) and hyaluronan synthase 3 (has3), drives canal morphogenesis. Charged hyaluronate polymers osmotically swell with water and generate isotropic extracellular pressure to deform the overlying epithelium into buds. The mechanical anisotropy needed to shape buds into tubes is conferred by a polarized distribution of actomyosin and E-cadherin-rich membrane tethers, which we term cytocinches. Most work on tissue morphogenesis ascribes actomyosin contractility as the driving force, while the extracellular matrix shapes tissues through differential stiffness. Our work inverts this expectation. Hyaluronate pressure shaped by anisotropic tissue stiffness may be a widespread mechanism for powering morphological change in organogenesis and tissue engineering.","lang":"eng"}],"publication_status":"published","oa_version":"Preprint","publication_identifier":{"eissn":["1097-4172"],"issn":["0092-8674"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","publisher":"Elsevier","date_created":"2021-12-26T23:01:26Z","status":"public","page":"6313-6325.e18","title":"Extracellular hyaluronate pressure shaped by cellular tethers drives tissue morphogenesis","volume":184,"_id":"10573","main_file_link":[{"open_access":"1","url":"https://www.biorxiv.org/content/10.1101/2020.09.28.316042"}],"date_published":"2021-12-22T00:00:00Z","date_updated":"2025-05-14T11:26:20Z","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2021","month":"12"}]