Latest Past Events

Lindström’s Theorems II

Facultatea de Matematica si Informatica, sala 202

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

Verifying security protocols using BAN logic

Facultatea de Matematica si Informatica, sala 202

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

Fully Homomorphic Encryption (FHE)

Facultatea de Matematica si Informatica, sala 219

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.