BEGIN:VCALENDAR VERSION:2.0 PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:SECURITY & APPLIED LOGIC X-ORIGINAL-URL:https://sal.cs.unibuc.ro X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC REFRESH-INTERVAL;VALUE=DURATION:PT1H X-Robots-Tag:noindex X-PUBLISHED-TTL:PT1H BEGIN:VTIMEZONE TZID:UTC BEGIN:STANDARD TZOFFSETFROM:+0000 TZOFFSETTO:+0000 TZNAME:UTC DTSTART:20180101T000000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=UTC:20190306T183000 DTEND;TZID=UTC:20190306T193000 DTSTAMP:20260404T140737 CREATED:20190228T153430Z LAST-MODIFIED:20190416T183910Z UID:366-1551897000-1551900600@sal.cs.unibuc.ro SUMMARY:Functional Encryption (FE) DESCRIPTION:Speaker:  Radu Titiu \n\nAbstract: \nFunctional 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.\nIn 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.\nReferinte:\n[1] https://link.springer.com/chapter/10.1007%2F978-3-319-70500-2_8\n[2] https://eprint.iacr.org/2015/608.pdf URL:https://sal.cs.unibuc.ro/event/functional-encryption-fe/ CATEGORIES:Cryptography Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190307T083000 DTEND;TZID=UTC:20190307T100000 DTSTAMP:20260404T140737 CREATED:20190304T152652Z LAST-MODIFIED:20190304T153038Z UID:372-1551947400-1551952800@sal.cs.unibuc.ro SUMMARY:Identificarea metodelor de automatizare a etapelor de analiza cuprinse in cadrul procedurilor de Securitate/ raspuns la incidente cibernetice utilizate in cadrul unui SOC DESCRIPTION:Speaker:  Alin Puncioiu (Secureworks) \n\nAbstract:   In cadrul prezentarii vom prezenta cateva fluxuri de lucru executate manual in momentul de fata pe parcursul fazelor de raspuns la incidente cibernetice. URL:https://sal.cs.unibuc.ro/event/identificarea-metodelor-de-automatizare-a-etapelor-de-analiza-cuprinse-in-cadrul-procedurilor-de-securitate-raspuns-la-incidente-cibernetice-utilizate-in-cadrul-unui-soc/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Security Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190314T100000 DTEND;TZID=UTC:20190314T100000 DTSTAMP:20260404T140737 CREATED:20190311T055525Z LAST-MODIFIED:20190311T055525Z UID:376-1552557600-1552557600@sal.cs.unibuc.ro SUMMARY:Lindström's Theorems DESCRIPTION:Speaker: Mihai Prunescu (University of Bucharest) \n\nAbstract: 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. \nReferences:\n[1] H.-D. Ebbinghaus\, J. Flum\, W. Thomas\, Mathematical Logic. Second edition\, Undergraduate Texts in Mathematics\, Springer\, 1996. URL:https://sal.cs.unibuc.ro/event/lindstroms-theorems/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Logic Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190320T183000 DTEND;TZID=UTC:20190320T193000 DTSTAMP:20260404T140737 CREATED:20190316T182757Z LAST-MODIFIED:20190416T183856Z UID:378-1553106600-1553110200@sal.cs.unibuc.ro SUMMARY:Fully Homomorphic Encryption (FHE) DESCRIPTION:Speaker:  Ana Costache \n\nAbstract: \n\n\n\n\n\n\nFully 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. URL:https://sal.cs.unibuc.ro/event/fully-homomorphic-encryption-fhe/ LOCATION:Facultatea de Matematica si Informatica\, sala 219 CATEGORIES:Cryptography Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190321T083000 DTEND;TZID=UTC:20190321T100000 DTSTAMP:20260404T140737 CREATED:20190318T053703Z LAST-MODIFIED:20190318T053703Z UID:381-1553157000-1553162400@sal.cs.unibuc.ro SUMMARY:Verifying security protocols using BAN logic DESCRIPTION:Speaker: Alexandru Dragomir (University of Bucharest) \n\nAbstract: 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 BAN logic (Burrows\, Abadi & Needham 1989)\, a many-sorted epistemic 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) briefly presenting the language and inference rules of BAN logic\, (2) offering a presentation of the Otway-Rees\, Needham-Schroeder and Kerberos protocols\, and (3) analysing the aforementioned protocols using BAN logic. URL:https://sal.cs.unibuc.ro/event/verifying-security-protocols-using-ban-logic/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Security Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190328T100000 DTEND;TZID=UTC:20190328T120000 DTSTAMP:20260404T140737 CREATED:20190325T165404Z LAST-MODIFIED:20190325T165404Z UID:391-1553767200-1553774400@sal.cs.unibuc.ro SUMMARY:Lindström's Theorems II DESCRIPTION:Speaker: Mihai Prunescu (University of Bucharest) \n\nAbstract: 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. \nReferences:\n[1] H.-D. Ebbinghaus\, J. Flum\, W. Thomas\, Mathematical Logic. Second edition\, Undergraduate Texts in Mathematics\, Springer\, 1996. URL:https://sal.cs.unibuc.ro/event/lindstroms-theorems-ii/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Logic Seminar END:VEVENT END:VCALENDAR