Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
|
M
Mon
|
T
Tue
|
W
Wed
|
T
Thu
|
F
Fri
|
S
Sat
|
S
Sun
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
0 events,
|
2 events,
-
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 …
-
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 … |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
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 … |
1 event,
-
Speaker: Alin Puncioiu (Secureworks) Abstract: In cadrul prezentarii vom prezenta cateva fluxuri de lucru executate manual in momentul de fata pe parcursul fazelor de raspuns la incidente cibernetice. |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
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 … |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
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. |
1 event,
-
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 … |
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
1 event,
-
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 … |
0 events,
|
0 events,
|
0 events,
|