An introduction to BAN logic (a logic of authentication)

Facultatea de Matematica si Informatica, sala 202

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 . BAN logic is a many-sorted modal logic used for its intuitive and compelling set of inference rules devised for reasoning about an agent’s beliefs,

ManyVal 2019

In perioada 1-3 noiembrie organizam workshop-ul international ManyVal 2019, dedicat in special cercetarilor in logica cu mai multe valori. Editia actuala beneficiaza si de participarea unor filozofi-logicieni de marca. Pentru mai multe detalii puteti consulta pagina manifestarii: https://cs.unibuc.ro/events/manyval2019/ Persoanele inregistrate vor primi kit-ul workshop-ului si vor putea participa la mesele si activitatile sociale anuntate. Participarea

Anomaly Detection Reading Group: Anomaly Detection by Unmasking

Facultatea de Matematica si Informatica, sala Google

Speaker: Marius Popescu (University of Bucharest) Abstract: We continue our adventure by investigating existing natural language processing results that deal with unmasking authorship and their application to anomaly detection. Required reading: M. Koppel, J. Schler, and E. Bonchek-Dokow. Measuring Differentiability: Unmasking Pseudonymous Authors. Journal of Machine Learning Research, 8:1261–1276,  2007. T.R. Ionescu, S. Smeureanu, B.

Operational Semantics of Security Protocols

Facultatea de Matematica si Informatica, sala 202

Speaker:  Ioana Leustean (University of Bucharest) Abstract: After a brief overview of the formal methods used for analyzing security protocols, we will focus on the operational semantics developed in: C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.  

Executarea, detecţia și prevenţia atacurilor de tip R.O.P

Facultatea de Matematica si Informatica, sala Google

Speaker: Sorin-Gabriel Radu (University of Bucharest) Abstract: Va fi prezentată o versiune extinsă a lucrări de licență ce va prezenta concepte de Return Orientated Programming, o tehnică de reciclare și combinare a bucăților de cod existent, curat, astfel încât cod nou, nedorit, în general de tip malware, să fie executat.

Operational Semantics of Security Protocols II

Facultatea de Matematica si Informatica, sala 202

Speaker: Ioana Leustean (University of Bucharest) Abstract:  We continue our presentation on operational semantics of  security protocols, as developed in: C. Cremers, S. Mauw, Operational Semantics and Verification of Security Protocols, Springer, 2012.

First-order logic and vagueness

Facultatea de Matematica si Informatica, sala 202

Speaker: Marian Calborean (University of Bucharest) Abstract: The Sorites paradox is usually studied as a propositional paradox. However, the general form of the Sorites is second-order, with three main features. It doesn’t contain any arbitrary parameters. It can be used to generate the propositional Sorites by appropriate replacement of the second-order premise with arbitrary clauses.

Off-the-Record Communication (OTR) si CryptoGo (joc de carti de criptografie)

Facultatea de Matematica si Informatica, amf.2 (Pompei)

Title: Off-the-Record Communication (OTR) Speaker: Mihail-Iulian Plesa Abstract:  Off-the-Record Communication (OTR) este un protocol care modealeaza o discutie dintre doua entitati, care ar trebui sa satisfaca anumite proprietati de securitate. Vom vorbi despre proprietatile acestui tip de comunicatie si despre cum pot fi acestea implementate in mediul online. Vom discuta apoi despre protocolul OTR integrat

Challenges in Banking

Facultatea de Matematica si Informatica, sala Google

Speaker: Horia Velicu (BRD - Groupe Societe Generale) Abstract: Presentation of topics of interest for 2020, objectives and data available at BRD. Proposals for the themes for the applied research institute that will be sponsored this year. Presentation of the new BRD AI Hub.

A quantitative analysis of the “Lion-Man” game

Facultatea de Matematica si Informatica, sala Google

Speaker: Ulrich Kohlenbach (Technische Universität Darmstadt) Title: A quantitative analysis of the “Lion-Man” game Abstract: We analyze, based on an interplay between ideas and techniques from logic and geometric analysis, a pursuit-evasion game. More precisely, we focus on a discrete lion and man game with an ε-capture criterion. We prove that in uniformly convex bounded domains the lion always