Lindström’s Theorems

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 sentences is recursively enumerable (Lindström 2). We sketch the proof that uses partial isomorphisms.

References:
[1] H.-D. Ebbinghaus, J. Flum, W. Thomas, Mathematical Logic. Second edition, Undergraduate Texts in Mathematics, Springer, 1996.

Functional Encryption (FE)

Speaker:  Radu Titiu


Abstract:

Functional Encryption (FE) este o primitiva criptografica moderna care generalizeaza notiunea de criptografie cu cheie publica in felul urmator. In mod normal algoritmul de decriptare se foloseste de cheia secreta pentru a recupera intreg mesajul criptat cu cheia publica. FE permite o decriptare controlata a mesajului: detinatorul cheii secrete K poate sa produca alta cheie secreta K_f asociata unei functionalitati f. Folosind cheia K_f un utilizator poate sa obtina f(mesaj) si nimic mai mult. O astfel de primitiva criptografica ar putea fi utilizata de un spital care tine datele pacientilor criptate dar care poate totusi oferi acces cercetatorilor la anumite statistici care ar putea ajuta la intelegerea anumitor boli. Toate acestea sunt posibile fara a divulga informatii despre pacienti.
In aceasta prezentare Radu va explica detaliat ce inseamna Functional Encryption si posibile aplicatii. De asemenea, va exemplifica conceptul printr-o constructie pentru o clasa restransa de functionalitati [2] si va vorbi despre cerintele de securitate pe care le satisface aceasta constructie.
Referinte:
[1] https://link.springer.com/chapter/10.1007%2F978-3-319-70500-2_8
[2] https://eprint.iacr.org/2015/608.pdf

An introduction to BAN logic (a logic of authentication)

Speaker: Alexandru Dragomir (University of Bucharest)


Abstract: One of the first and most discussed logical approaches to the problem of verifying security protocols is the one proposed in BAN logic (Burrows, Abadi & Needham 1989), a many-sorted modal logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s beliefs, trust and message exchange. My presentation will focus on (1) presenting the language and inference rules of BAN logic, (2) following the original paper’s analysis of the Otway-Rees protocol, (3) presenting some objections to using BAN, and (4) discussing the problem of offering a semantics of BAN logic.

The hybridization of many-sorted polyadic modal logic

Speaker: Natalia Moangă (University of Bucharest).

Abstract: Hybrid logics are obtained by enriching modal logics with nominals and state variables, that directly refer the individual points in a Kripke model. In the present work we develop a hybrid version on top of our many-sorted polyadic logic, previously defined. Our system has nominals and state variables on each sort, as well as binders that act like the universal and the existential quantfiers on state variables. In doing this, we follow various approaches for hybrid modal logic, especially the work of Blackburn and Tsakova.

Security aspects for blockchain

Speaker: Andreea Elena Panait (University of Bucharest).


Abstract: The presentation will include introductive notions about blockchain, the main types of attacks on the blockchain network and possible countermeasures, attack examples that occurred during the years, blockchain implementation examples and possible domains where blockchain can be used.

Security via user behavior

Speaker: Cezara Benegui (University of Bucharest).


Abstract: The presentation will be based on earlier research done on user behaviour understanding and detection, learning it using machine learning and artificial intelligence and further information about how user behaviour can be used to improve the security of software applications. Also, the presentation will include information about biometrics like keystroke timings, mouse dynamics, scrolling and tapping behaviour, software usage behaviour, what is their importance and how can they be used for anomaly/intrusion detection or for identifying and targeting users on a wide variety of other applications.

Burse Bitdefender

Bursieri anul II: Adriana Stancu.

Bursierii din anul I vor fi anuntați după ce primim informațiile necesare de la secretariat.