Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
Speaker: Mihai Prunescu (University of Bucharest) Abstract: Regular logic systems which are strictly stronger than the first order predicate calculus cannot satisfy in the same time Löwenheim-Skolem for statements and compacity (Lindström 1). Effectively presented such systems cannot satisfy in the same time Löwenheim-Skolem for statements and the condition that the set of generally valid …
Speaker: Ana Costache Abstract: Fully homomorphic encryption este un tip de criptare care permite manipularea datelor criptate pastrand securitatea acestora. Ana va introduce notiunea de latice, si va defini FHE. De asemenea, va vorbi despre librarii FHE si despre relevanta FHE in lumea comerciala.
Speaker: Alexandru Dragomir (University of Bucharest) Abstract: Epistemic logics - logics aimed at reasoning about knowledge and belief - are widely considered to be suitable for modelling, analyzing and predicting vulnerabilities of security protocols. One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in …
Speaker: Mihai Prunescu (University of Bucharest) Abstract: Regular logic systems which are strictly stronger than the first order predicate calculus cannot satisfy in the same time Löwenheim-Skolem for statements and compacity (Lindström 1). Effectively presented such systems cannot satisfy in the same time Löwenheim-Skolem for statements and the condition that the set of generally valid …
Speaker: Alexandru Dragomir (University of Bucharest) Abstract: Epistemic logics - logics aimed at reasoning about knowledge and belief - are widely considered to be suitable for modelling, analyzing and predicting vulnerabilities of security protocols. One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in …
Speaker: Bogdan Ghimiș (University of Bucharest) Abstract: From a security perspective, discovering bugs before shipping a product is crucial. This presentation will be about RIVER, a tool that can help us to inspect x86 binary code. This lecture will encompass two papers describing methods of finding problematic inputs: a genetic algorithm and a method using …
Speaker: Mihai Prunescu (University of Bucharest) Abstract: We discuss different implications of the negative answer of Hilbert's Tenth Problem: the exponential Diophantine equation over ℕ and ℚ, the minimal number of variables which lead to an undecidable problem over ℤ, the homogeneous Diophantine problem over ℤ.
Speaker: Ruxandra Olimid (University of Bucharest) Abstract: Short (crypto) introduction in Blockchain. Mostly a reading group, discussing the original bitcoin paper: https://bitcoin.org/bitcoin.pdf
Speaker: Andra Băltoiu (University of Bucharest) Abstract: In a previous seminar, we introduced Dictionary Learning (DL), a machine learning method capable of handling the requirements of IoT-related tasks, motivated by its reduced computational complexity, theoretical guarantees and its applicability to continuous retraining contexts. We now discuss the task of training different machine learning and DL …
Speaker: Ionuţ Ţuţu (Royal Holloway, University of London) Abstract: We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are common to hybrid and to dynamic logics. This provides certain key advantages for …