Congratulations to postdoc Katharina Boudgoust, from the Crypto and Security group, who has won the Best early career research paper award at Crypto 2022 for ‘Some Easy Instances of Ideal-SVP and Implications to the Partial Vandermonde Knapsack Problem’. The paper is co-authored with Erell Gachon (Université de Bordeaux) and Alice Pellet-Mary (Université de Bordeaux, CNRS).

Later this month, Katharina will give a presentation of the paper at Crypto 2022, which takes place in Santa Barbara, USA from August 13-18. Crypto 2022 is organized by the International Association for Cryptologic Research (IACR).

From August 13-18, cryptographic researchers from all over the world will gather in Santa Barbara for the Crypto 22 conference. The conference recently announced all accepted papers, and 12 researchers from the department have co-authored 8 of the accepted papers.

This is a remarkable accomplishment as there is great competition at Crypto 22, and certainly underlines the strength and significance of the work done by the Cryptography and Security group.

Congratulations to professor Ioannis Caragiannis, who has won the 2022 𝐀𝐈𝐉 𝐏𝐫𝐨𝐦𝐢𝐧𝐞𝐧𝐭 𝐏𝐚𝐩𝐞𝐫 𝐀𝐰𝐚𝐫𝐝 for the paper "𝑶𝒑𝒕𝒊𝒎𝒂𝒍 𝒔𝒐𝒄𝒊𝒂𝒍 𝒄𝒉𝒐𝒊𝒄𝒆 𝒇𝒖𝒏𝒄𝒕𝒊𝒐𝒏𝒔: 𝑨 𝒖𝒕𝒊𝒍𝒊𝒕𝒂𝒓𝒊𝒂𝒏 𝒗𝒊𝒆𝒘" (Artificial Intelligence, 227:190-213, 2015), which is co-authored with Craig Boutilier, Simi Haber, Tyler Lu, Ariel Procaccia, and Or Sheffet. The AIJ Prominent Paper Award recognizes outstanding papers, published within the past 7 years in the Artificial Intelligence Journal, that are exceptional in their significance and impact.

According to the award certificate: This paper has made outstanding contributions to computational social choice by introducing a fundamentally novel approach to voting, now referred to as implicit utilitarian voting. It also initiated the prolific line of research on distortion, leading to survey and tutorial coverage of the topic as well as inclusion in graduate course material. Among its many contributions, the paper includes breakthrough results such as polynomial-time computability of the optimal randomized voting rule and a near-tight analysis of its distortion. It also provides an average-case analysis and learning-theoretic results, thus opening doors to a multi-faceted treatment of the subject.

Instituttets to bacheloruddannelser – Datalogi og IT-Produktudvikling – modtog i alt 437 ansøgninger, og 217 af ansøgerne vil i dag modtage et tilbud om optag på deres drømmeuddannelse. Sammenlignet med 2021 er dette en stigning på 10% for Datalogi og 16% for IT-Produktudvikling, og det er glædeligt med en stigende interesse for den vigtige og meget efterspurgte IT-faglighed.

Den 21. februar 1972 blev Sven Skyum færdig som den første kandidat i datalogi fra Aarhus University. I sidste uge kunne vi fejre kandidat nummer 2000 - Lasse Rønne Møller. Samtidig kunne vores nyere uddannelse IT-Produktudvikling fejre kandidat nummer 200 - Louise Mathiasen. Ikke blot et stort 𝐭𝐢𝐥𝐥𝐲𝐤𝐤𝐞 til de to 'jubilæums-kandidater' men til hele årgang 2022. Tak for 5 gode år - vi håber, I vil holde kontakten!

Finding out whether a question is too difficult to ever solve efficiently depends on figuring out just how hard it is. Associate professor Srikanth Srinivasan, Nutan Limaye (IT University in Copenhagen) and Sébastien Tavenas (Savoy Mont Blanc University, France) have shown how to do that for a major class of problems. Their results are further elaborated in Quanta Magazine. The research paper also won "Best Paper Award" at the annual IEEE Symposium on Foundations of Computer Science (FOCS) earlier this year.

Congratulations to postdoc Jonathan Sterling, from the Logic and Semantics research group, who has received the highly prestigious Marie Sklodowska-Curie postdoc fellowship. Jonathan will be working on synthetic methods in program verification, and the aim of the project is to extend the successful STC approach to a wider class of programming models, in particular programming languages with effects.

𝐊𝐫𝐲𝐩𝐭𝐨𝐯𝐚𝐥𝐮𝐭𝐚𝐞𝐫 𝐦𝐚𝐧𝐠𝐥𝐞𝐫 𝐨𝐟𝐭𝐞 𝐭𝐢𝐥𝐬𝐭𝐫æ𝐤𝐤𝐞𝐥𝐢𝐠 𝐭𝐲𝐯𝐞𝐫𝐢𝐬𝐢𝐤𝐫𝐢𝐧𝐠 🔒 I et nyt forskningsprojekt skal Carsten Baum sammen med Bernardo David og Jari Kickbusch fra ITU medvirke til at skabe et bedre grundlag for at stoppe de mange virtuelle indbrud, hvor privatpersoner og virksomheder får stjålet for milliarder i kryptovalutaer. Projektet udspringer af et samarbejde på tværs af forskningsverden og den private sektor og inkluderer Aarhus Universitet, Alexandra Instituttet, IT-Universitetet i København og Copenhagen Fintech.