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
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.
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.
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.
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.
Bursieri anul II: Adriana Stancu.
Bursierii din anul I vor fi anuntați după ce primim informațiile necesare de la secretariat.
Pentru desfășurarea activitaților de practică din anul I, semestrul I, studenții SLA au la dispoziție următoarele opțiuni:
- FACULTATE
Activitatea se desfășoară în facultate, profesor îndrumător: Mihăiță Drăgan.
- FACULTATE – PREGATIRE pentru CESC 2019
Se adreseaza studentilor care doresc sa participe la Campionatul European de Securitate Cibernetică, profesor îndrumător: Ruxandra Olimid.
Mai multe detalii pe pagina moodle a masterului.
- CERCETARE
Studenții aleg dintre temele de cercetare propuse, activitatea este supervizată de profesorul care a propus tema. Studenții pot propune teme de cercetare, în acest caz ei trebuie sa îsi gaseasca un profesor coordonator.
- COLABORARE
Studenții îsi gasesc singuri firma la care vor desfăsura activitatea de practică. In acest caz firma trebuie să semneze acordul de practică cu facultatea, iar activitatea trebuie sa fie supervizată de dl. prof. Silviu Laurențiu Vasile.
Mai multe detalii pe pagina moodle a masterului.
Speaker: Vlad Dragoi (Univ. Aurel Vlaicu Arad)
Abstract:
Aceasta prezentare are ca scop descrierea principalelor solutii de criptare asimetrica cu ajutorul codurilor corectoare de erori. Vom incerca sa discutam cat mai multe aspecte legate de aceste protocoale, cum ar fi: natura codurilor folosite in acest context, complexitatea algoritmilor de criptare si decriptare, securitatea protocolului (distinguisher, message recovery attacks, key recovery attacks). Daca timpul ne permite vom incerca sa detaliem una dintre variante, de exemplu McEliece textbook cu codurile Goppa binare.
Speaker: Catalin Dima (Université Paris-Est Créteil)
Abstract:
We report on the verification of anonymity and coercion-freeness properties of the Prêt-À-Voter electronic voting protocol using the Tamarin tool for symbolic verification of security properties. Our approach is to generate many models corresponding with each choice of attacker actions (i.e. attacker strategies) and check, on each model, a “trace equivalence” lemma modeling the fact that the attacker does not distinguish between a trace in which the coerced voter has obeyed the orders, from a trace in which the voter has ignored the coercion. This seems to be the only approach available in Tamarin for modeling epistemic knowledge, a notion necessary for encoding anonymity. The results are far from encouraging since many false negatives or positives are obtained, necessitating model adaptations which cannot be done automatically, and when correct results are obtained the running times are prohibitive. Our conclusions point the need for theory and tool improvement in which equational and rewriting logics be combined with strategy logics.
Speaker: Catalin Dima (Université Paris-Est Créteil.)
Abstract:
The last 15-20 years have seen a number of logical formalisms that focus on strategic reasoning. These logics aim at giving specification languages for various multi-agent game structures, in which agents have adversarial or cooperative objectives which may be qualitative or quantitative and may have various types of imperfect information. The presence of imperfect information raises a particular difficulty in that many games cannot be solved algorithmically, as well as their corresponding logical formalisms. In this tutorial I will review some techniques for proving that the Alternating-time Temporal Logic has an undecidable model-checking problem, but this problem becomes decidable when considering memoryless strategies, coalitions with distributed knowledge, hierarchical knowledge and public or coalition-public announcements. I will also give a short introduction to the model-checking tool MCMAS which relies on the memoryless semantics for ATL with imperfect information, and the problems that arise when implementing the model-checking algorithms for this case.
