The Practical Training options for first year SAL students has been published!
SAL 2022 summer admission registration open!
We announce that the registration for the summer admission process is now open!
Those interested in attending the Security and Applied Logic Master Program should register here until the 15th of July 2022.
Follow the Faculty’s Admission webpage here for more information and updates!
Logic and LOS seminars are now hybrid
The weekly Logic Seminar (Thu 10-12) and LOS Research Center Seminar (Tue 14-16) will now also take place physically in the Google Room. Students of the SAL Master are strongly encouraged to participate and engage in the research activities.
Practical Training for First Year Students
The Practical Training options for first year SAL students has been posted at the address:
https://sal.cs.unibuc.ro/en/practical-training-for-first-year-sal-students-2021-2022/
Unbreakable Romania 2021
UNbreakable Romania starts the registration for the autumn-winter season of the national cybersecurity contest. Check the official website: https://unbreakable.ro/stiri/au-inceput-inscrierile-la-unbreakable-romania-sezonul-de-toamna-iarna-2021/
Unbreakable Romania – Teams – Winners
A team of the University of Bucharest placed first in the Competition Unbreakable Romania (season spring-summer 2021). Congratulations to Dragos Albastroiu, Mihail Feraru (undergraduates at Faculty of Mathematics and Computer Science), and Andrei Ciobanu (master student enrolled at our Security and Applied Logic master program) for finishing the team competition on the first place! More information available here.
Unbreakable Romania – Winners
The University of Bucharest is placed in the top for the best score at the Individual Competition Unbreakable Romania (season spring-summer 2021). Congratulations to Dragos Albastroiu, undergraduate at Faculty of Mathematics and Computer Science, for finishing the individual competition on the first place! More information available here.
Active Defense in Cybersecurity
Title: Active Defense in Cybersecurity
Speaker: Sergiu Bogdan Meseșan & Andreea Drugă, Cybersecurity Specialists at ENEA
Agenda:
- Active Defense Mechanisms – Notions, principles and Active Defense mechanisms (ca.1h)
- Practical Application for Honeypot Analytics and Attacks Data Collection – Presentation of a platform implemented by ENEA specially for this lecture, a practical demo of Active Defense (ca.1h)
- Active Defense DIY – Workshop installation, running, Internet access for a Honeypot type VM using an open source platform (Telekom Tpot CE) (ca.1h-1.5h)
For the students interested to attend the meeting: please contact Ruxandra Olimid (ruxandra.olimid@fmi.unibuc.ro)
Kernelization, Proof Complexity and Social Choice
Title: Kernelization, Proof Complexity and Social Choice
Speaker: Gabriel Istrate (West University of Timișoara)
Abstract:
We display an application of the notions of kernelization and data reduction from parameterized complexity to proof complexity: Specifically, we show that the existence of data reduction rules for a parameterized problem having (a) a small-length reduction chain, and (b) small-size (extended) Frege proofs certifying the soundness of reduction steps implies the existence of subexponential size (extended) Frege proofs for propositional formalizations of the given problem. We apply our result to infer the existence of subexponential Frege and extended Frege proofs for a variety of problems. Improving earlier results of Aisenberg et al. (ICALP 2015), we show that propositional formulas expressing (a stronger form of) the Kneser-Lovasz Theorem have polynomial size Frege proofs for each constant value of the parameter k. Previously only quasipolynomial bounds were known (and only for the ordinary Kneser-Lovasz Theorem). Another notable application of our framework is to impossibility results in computational social choice: we show that, for any fixed number of agents, propositional translations of the Arrow and Gibbard-Satterthwaite impossibility theorems have subexponential size Frege proofs.
This is joint work with Cosmin Bonchiș and Adrian Crăciun.
An Introduction to Protocols in Dynamic Epistemic Logic
Title: An Introduction to Protocols in Dynamic Epistemic Logic
Speaker: Alexandru Dragomir (University of Bucharest)
Abstract:
References: