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:20170101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:Europe/Bucharest
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20201025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190530T170000
DTEND;TZID=UTC:20190530T180000
DTSTAMP:20260404T003724
CREATED:20190527T112423Z
LAST-MODIFIED:20190528T055503Z
UID:418-1559235600-1559239200@sal.cs.unibuc.ro
SUMMARY:Dynamic Code Analysis
DESCRIPTION:Speaker:  Radu Velea (BitDefender) \n\nAbstract: Static code analysis methods have the advantage of providing deterministic and reliable results. Malware has evolved beyond the point where simple pattern matching algorithms or signatures can provide adequate levels of protection. To respond to new threats we have to look at other hidden aspects such as execution behavior and fight evasive techniques by performing dynamic code analysis. This presentation discusses how to do this using runtime emulation and describes the existing challenges for the most popular architectures and executable file formats.
URL:https://sal.cs.unibuc.ro/event/dynamic-code-analysis/
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190530T100000
DTEND;TZID=UTC:20190530T120000
DTSTAMP:20260404T003724
CREATED:20190529T063857Z
LAST-MODIFIED:20190529T063857Z
UID:421-1559210400-1559217600@sal.cs.unibuc.ro
SUMMARY:Protocols in Dynamic Epistemic Logic
DESCRIPTION:Speaker:  Alexandru Dragomir (University of Bucharest) \n\nAbstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning (epistemic actions). However\, not all epistemic actions are allowed to be executed in an initial epistemic model\, and this is where the concept of a protocol comes in: a protocol stipulates what epistemic actions are allowed to be performed in a model. The aim of my presentation is to introduce the audience to two accounts of protocols in DEL: one based on [1]\, and the second on [2]. \nReferences:\n[1] T. Hoshi\, Epistemic dynamics and protocol information\, PhD thesis\, Stanford University\, 2009.\n[2] Y. Wang\, Y. Epistemic Modelling and Protocol Dynamics\, PhD thesis\, University of Amsterdam\, 2010.
URL:https://sal.cs.unibuc.ro/event/protocols-in-dynamic-epistemic-logic/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190522T183000
DTEND;TZID=UTC:20190522T193000
DTSTAMP:20260404T003724
CREATED:20190521T040714Z
LAST-MODIFIED:20190521T040714Z
UID:413-1558549800-1558553400@sal.cs.unibuc.ro
SUMMARY:House of clouds – sau cum sa auditezi un sistem in cloud
DESCRIPTION:Speaker: Georgel Gheorghe este absolvent al facultatii de Electronica\, Telecomunicatii si Tehnologia a informatiei. Este membru ISACA si detine certificari precum CISA (Certified Information Systems Auditor)\, CGEIT (Certified in the Governance of Enterprise IT) si CRISC (Certified in Risk and Information Systems Control). \nAre o experienta de peste 11 ani in audit si consultanta in industrii de tipologii diferite (servicii financiare\, retail\, productie\, telecomunicatii\, energie) cu proiecte precum: evaluari ale mediilor IT&IS\, audituri de conformitate\, evaluari ale configurarilor de securitate\, managementul vulnerabilitatilor\, managementul continuitatii afacerii\, managementul schimbarilor. \nDupa mai multi ani petrecuti in Deloitte\, Ericson si Mazars\, s-a alaturat unei noi echipe unde cunostintele si experienta sa sunt o baza solida pentru identificarea unor solutii potrivite pentru noile provocari digitale. \n\nAbstract: Prezentarea propusa\, House of clouds – sau cum sa auditezi un sistem in cloud\, va aborda aspecte relevante ce tin de intelegerea si delimitarea sistemelor in scop\, identificarea riscurilor si selectarea masurilor de control necesare. \nIn introducere\, Gratiela Magdalinoiu (presedinte ISACA Romania) va face o scurta prezentare ISACA Romania.
URL:https://sal.cs.unibuc.ro/event/house-of-clouds-sau-cum-sa-auditezi-un-sistem-in-cloud/
LOCATION:Facultatea de Matematica si Informatica\, sala 219
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190516T100000
DTEND;TZID=UTC:20190516T120000
DTSTAMP:20260404T003724
CREATED:20190506T043334Z
LAST-MODIFIED:20190514T093157Z
UID:406-1558000800-1558008000@sal.cs.unibuc.ro
SUMMARY:An introduction to hybrid-dynamic first-order logic
DESCRIPTION:Speaker:  Ionuţ Ţuţu (Royal Holloway\, University of London) \n\nAbstract: We propose a hybrid-dynamic first-order logic as a formal\nfoundation for specifying and reasoning about reconfigurable\nsystems. As the name suggests\, the formalism we develop extends\n(many-sorted) first-order logic with features that are common to\nhybrid and to dynamic logics. This provides certain key advantages for\ndealing with reconfiguration\, such as: (a) a signature of nominals\,\nincluding operation and relation symbols\, that allows references to\nspecific possible worlds / system configurations – as in the case of\nhybrid logics; (b) distinguished signatures of rigid and flexible\nsymbols\, where the rigid symbols are interpreted uniformly across\npossible worlds – this supports a rigid form of quantification\, which\nensures that variables have the same interpretation regardless of the\npossible world where they are evaluated; (c) hybrid terms\, which\nincrease the expressive power of the logic in the context of rigid\nsymbols; and (d) modal operators over dynamic-logic actions\, which are\ndefined as regular expressions over binary nominal relations. In this\ncontext\, we advance a notion of hybrid-dynamic Horn clause and develop\na series of results that lead to an initial-semantics theorem for the\nHorn-clause fragment of hybrid-dynamic first-order logic.
URL:https://sal.cs.unibuc.ro/event/good-for-a-conclusion-not-good-enough-for-a-premise-natural-language-reasoning-and-the-logic-of-vagueness/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190418T083000
DTEND;TZID=UTC:20190418T100000
DTSTAMP:20260404T003724
CREATED:20190321T112305Z
LAST-MODIFIED:20190415T085625Z
UID:389-1555576200-1555581600@sal.cs.unibuc.ro
SUMMARY:Anti-Malware Machine Learning
DESCRIPTION:Speaker:  Andra Băltoiu (University of Bucharest) \n\nAbstract: In a previous seminar\, we introduced Dictionary Learning (DL)\, a machine learning method capable of handling the requirements of IoT-related tasks\, motivated by its reduced computational complexity\, theoretical guarantees and its applicability to continuous retraining contexts. We now discuss the task of training different machine learning and DL models in order to identify malware and study the adaptability of the resulting models to new types of malware.
URL:https://sal.cs.unibuc.ro/event/anti-malware-machine-learning/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190417T183000
DTEND;TZID=UTC:20190417T193000
DTSTAMP:20260404T003724
CREATED:20190416T183705Z
LAST-MODIFIED:20190416T190054Z
UID:401-1555525800-1555529400@sal.cs.unibuc.ro
SUMMARY:Blockchain - Intro
DESCRIPTION:Speaker:  Ruxandra Olimid (University of Bucharest) \n\nAbstract: Short (crypto) introduction in Blockchain. Mostly a reading group\, discussing the original bitcoin paper: https://bitcoin.org/bitcoin.pdf
URL:https://sal.cs.unibuc.ro/event/blockchain-intro/
LOCATION:Facultatea de Matematica si Informatica\, sala 219
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190411T100000
DTEND;TZID=UTC:20190411T120000
DTSTAMP:20260404T003724
CREATED:20190409T102018Z
LAST-MODIFIED:20190409T102018Z
UID:397-1554976800-1554984000@sal.cs.unibuc.ro
SUMMARY:Around Hilbert's Tenth Problem
DESCRIPTION:Speaker:   Mihai Prunescu (University of Bucharest)  \n\nAbstract: We discuss different implications of the negative answer of Hilbert’s Tenth Problem: the exponential Diophantine equation over ℕ and ℚ\, the minimal number of variables which lead to an undecidable problem over ℤ\, the homogeneous Diophantine problem over ℤ.
URL:https://sal.cs.unibuc.ro/event/around-hilberts-tenth-problem/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20190404T090000
DTEND;TZID=Europe/Helsinki:20190404T100000
DTSTAMP:20260404T003724
CREATED:20190321T112311Z
LAST-MODIFIED:20190401T054857Z
UID:386-1554368400-1554372000@sal.cs.unibuc.ro
SUMMARY:How to find bugs in your (x86) code: Applications that use RIVER
DESCRIPTION:Speaker:  Bogdan Ghimiș (University of Bucharest) \n\nAbstract: From a security perspective\, discovering bugs before shipping a product is crucial. This presentation will be about RIVER\, a tool that can help us to inspect x86 binary code. This lecture will encompass two papers describing methods of finding problematic inputs: a genetic algorithm and a method using taint analysis. The genetic algorithm is used in conjunction with Apache Spark – an engine used for big data and distributed computing – to determine the inputs that provide the best code coverage. The second method uses taint analysis in order to infer which parts of the input are used by the program to determine a model with which we can generate new inputs that adhere to a certain format and that allows us to get better code coverage.
URL:https://sal.cs.unibuc.ro/event/how-to-find-bugs-in-your-x86-code-applications-that-use-river/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20190404T083000
DTEND;TZID=Europe/Helsinki:20190404T090000
DTSTAMP:20260404T003724
CREATED:20190401T054801Z
LAST-MODIFIED:20190401T054843Z
UID:394-1554366600-1554368400@sal.cs.unibuc.ro
SUMMARY:Verifying security protocols using BAN logic - Part 2
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. I will assume knowledge of the basics of BAN logic and focus on presenting and analyzing the Needham-Schroeder and Kerberos protocols using this particular logical framework. Consequently\, I will highlight some of the pros and cons of using BAN logic in verifying security protocols.
URL:https://sal.cs.unibuc.ro/event/verifying-security-protocols-using-ban-logic-part-2/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190328T100000
DTEND;TZID=UTC:20190328T120000
DTSTAMP:20260404T003724
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
BEGIN:VEVENT
DTSTART;TZID=UTC:20190321T083000
DTEND;TZID=UTC:20190321T100000
DTSTAMP:20260404T003724
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:20190320T183000
DTEND;TZID=UTC:20190320T193000
DTSTAMP:20260404T003724
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:20190314T100000
DTEND;TZID=UTC:20190314T100000
DTSTAMP:20260404T003724
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:20190307T083000
DTEND;TZID=UTC:20190307T100000
DTSTAMP:20260404T003724
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:20190306T183000
DTEND;TZID=UTC:20190306T193000
DTSTAMP:20260404T003724
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:20190228T100000
DTEND;TZID=UTC:20190228T120000
DTSTAMP:20260404T003724
CREATED:20190225T044031Z
LAST-MODIFIED:20190225T170129Z
UID:363-1551348000-1551355200@sal.cs.unibuc.ro
SUMMARY:An introduction to BAN logic (a logic of authentication)
DESCRIPTION:Speaker: Alexandru Dragomir (University of Bucharest) \n\nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/an-introduction-to-ban-logic-a-logic-of-authentication/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190228T100000
DTEND;TZID=UTC:20190228T120000
DTSTAMP:20260404T003724
CREATED:20190225T043808Z
LAST-MODIFIED:20190225T043808Z
UID:361-1551348000-1551355200@sal.cs.unibuc.ro
SUMMARY:The hybridization of many-sorted polyadic modal logic
DESCRIPTION:Speaker: Natalia Moangă (University of Bucharest). \nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/the-hybridization-of-many-sorted-polyadic-modal-logic/
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190221T083000
DTEND;TZID=Europe/Bucharest:20190221T223000
DTSTAMP:20260404T003724
CREATED:20190219T114552Z
LAST-MODIFIED:20190219T114943Z
UID:353-1550737800-1550788200@sal.cs.unibuc.ro
SUMMARY:Security via user behavior
DESCRIPTION:Speaker: Cezara Benegui (University of Bucharest). \n\nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/security-via-user-behavior/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190221T083000
DTEND;TZID=Europe/Bucharest:20190221T103000
DTSTAMP:20260404T003724
CREATED:20190219T114757Z
LAST-MODIFIED:20190219T114912Z
UID:355-1550737800-1550745000@sal.cs.unibuc.ro
SUMMARY:Security aspects for blockchain
DESCRIPTION:Speaker: Andreea Elena Panait (University of Bucharest). \n\nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/security-aspects-for-blockchain/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20190218T183000
DTEND;TZID=Europe/Bucharest:20190218T200000
DTSTAMP:20260404T003724
CREATED:20190218T080305Z
LAST-MODIFIED:20190218T080343Z
UID:290-1550514600-1550520000@sal.cs.unibuc.ro
SUMMARY:Criptosistemul lui McEliece\, dupa 40 de ani de criptanaliza
DESCRIPTION:Speaker:  Vlad Dragoi (Univ. Aurel Vlaicu Arad) \n\nAbstract: \nAceasta 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.
URL:https://sal.cs.unibuc.ro/event/criptosistemul-lui-mceliece-dupa-40-de-ani-de-criptanaliza/
LOCATION:Facultatea de Matematica si Informatica\, sala 220\, Strada Academiei 14\, Bucuresti\, Bucuresti\, Romania
CATEGORIES:Cryptography Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190207T083000
DTEND;TZID=UTC:20190207T100000
DTSTAMP:20260404T003724
CREATED:20190205T043140Z
LAST-MODIFIED:20190205T055045Z
UID:287-1549528200-1549533600@sal.cs.unibuc.ro
SUMMARY:Verification of strategic properties for the Prêt-À-Voter protocol using Tamarin  (joint work with Wojtek Jamroga and Damian Kurpiewski)
DESCRIPTION:Speaker:   Catalin Dima (Université Paris-Est Créteil) \n\nAbstract: \nWe 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. \n  \n 
URL:https://sal.cs.unibuc.ro/event/verification-of-strategic-properties-for-the-pret-a-voter-protocol-using-tamarin-joint-work-with-wojtek-jamroga-and-damian-kurpiewski/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190131T100000
DTEND;TZID=UTC:20190131T120000
DTSTAMP:20260404T003724
CREATED:20190127T174249Z
LAST-MODIFIED:20190127T174249Z
UID:284-1548928800-1548936000@sal.cs.unibuc.ro
SUMMARY:The frontier between decidability and undecidability for logics for strategic reasoning in the presence of imperfect information
DESCRIPTION:Speaker:   Catalin Dima (Université Paris-Est Créteil.) \n\nAbstract: \nThe 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.
URL:https://sal.cs.unibuc.ro/event/the-frontier-between-decidability-and-undecidability-for-logics-for-strategic-reasoning-in-the-presence-of-imperfect-information/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20190117T083000
DTEND;TZID=UTC:20190117T100000
DTSTAMP:20260404T003724
CREATED:20190114T100137Z
LAST-MODIFIED:20190114T100208Z
UID:279-1547713800-1547719200@sal.cs.unibuc.ro
SUMMARY:Making Obsolete Malware Viable with Packing
DESCRIPTION:Speaker:  Mihai Stancu \n\nAbstract: \nThe security trend today is to stop security threats even before they\narrive on the target machine or system. \nWith that in mind we will explore\, what packers are and what they do to\ntransform original malicious code in into something that is much harder to\nconfidently mark as a threat. \nThis talk will be focused on executables in the PE format running on the\nWindows platform and during the presentation we will form a basic\nunderstanding of the executable structure\, packing technique\, and other\nanti-dumping and anti-debug techniques work to protect and run the original\npayload.
URL:https://sal.cs.unibuc.ro/event/making-obsolete-malware-viable-with-packing/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181220T180000
DTEND;TZID=Europe/Bucharest:20181220T200000
DTSTAMP:20260404T003724
CREATED:20181214T144459Z
LAST-MODIFIED:20181214T144623Z
UID:264-1545328800-1545336000@sal.cs.unibuc.ro
SUMMARY:Logical Foundations: Simple Imperative Programs - variables and commands
DESCRIPTION:Presenter: Traian Serbanuta. \n\nThis week we continue exploring Coq based on the Logical Foundations volume of Software Foundations\, chapter “IMP: Simple Imperative Programs”
URL:https://sal.cs.unibuc.ro/event/logical-foundations-simple-imperative-programs-variables-and-commands/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Coq Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181220T100000
DTEND;TZID=Europe/Bucharest:20181220T120000
DTSTAMP:20260404T003724
CREATED:20181217T151738Z
LAST-MODIFIED:20181217T151738Z
UID:268-1545300000-1545307200@sal.cs.unibuc.ro
SUMMARY:The finitary content of sunny nonexpansive retractions
DESCRIPTION:Andrei Sipoș (TU Darmstadt & IMAR). \n\nThe goal of proof mining is to extract quantitative information out of proofs in mainstream mathematics which are not necessarily fully constructive. Often\, such proofs make use of strong mathematical principles\, but a preliminary analysis may show that they are not actually needed\, so the proof may be carried out in a system of strength corresponding roughly to first-order arithmetic. Following a number of significant advances in this vein by Kohlenbach in 2011 and by Kohlenbach and Leuștean in 2012\, we now tackle a long-standing open question: the quantitative analysis of the strong convergence of resolvents in classes of Banach spaces more general than Hilbert spaces. \nThis result was proven for the class of uniformly smooth Banach spaces by Reich in 1980. What we do is to analyze a proof given in 1990 by Morales\, showing that adding the hypothesis of the space being uniformly convex\, and thus still covering the case of L^p spaces\, can serve to eliminate the strongest principles used in the proof by way of a modulus of convexity for the squared norm of such spaces. A further procedure of arithmetization brings the proof down to System T so the proper analysis may proceed. After obtaining a non-effective realizer of the metastability statement\, this is majorized in order to obtain the desired rate. Subsequent considerations calibrate this bound to T_1. It particular\, this result completes some analyses that had previously been obtained only partially\, yielding rates of metastability within the above-considered class of Banach spaces for the Halpern and Bruck iterations. \nThese results are joint work with Ulrich Kohlenbach. \n\nReferences:\n[1] U. Kohlenbach\, A. Sipoș\, The finitary content of sunny nonexpansive retractions. arXiv:1812.04940 [math.FA]\, 2018. Preprint. Up-to-date version at: https://www2.mathematik.tu-darmstadt.de/~kohlenbach/resolvent-paper.pdf
URL:https://sal.cs.unibuc.ro/event/the-finitary-content-of-sunny-nonexpansive-retractions/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181213T180000
DTEND;TZID=Europe/Bucharest:20181213T200000
DTSTAMP:20260404T003724
CREATED:20181211T072451Z
LAST-MODIFIED:20181211T072502Z
UID:234-1544724000-1544731200@sal.cs.unibuc.ro
SUMMARY:Logical Foundations: Simple Imperative Programs
DESCRIPTION:Presenter: Traian Serbanuta. \n\nThis week we continue exploring Coq based on the Logical Foundations volume of Software Foundations\, chapter “IMP: Simple Imperative Programs”
URL:https://sal.cs.unibuc.ro/event/logical-foundations-simple-imperative-programs/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Coq Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20181213T083000
DTEND;TZID=UTC:20181213T100000
DTSTAMP:20260404T003724
CREATED:20181209T060341Z
LAST-MODIFIED:20181209T061334Z
UID:226-1544689800-1544695200@sal.cs.unibuc.ro
SUMMARY:How to find bugs in your (x86) code; RIVER tool - current state and future
DESCRIPTION:Speaker: Ciprian Păduraru \n\nAbstract: \nEven with access to the source code of a program\, it is not easy to reverse engineer a program to find inputs for specific programs. This presentation starts with a practical walkthrough over classic methods for automating software testing\, such as fuzz testing\, symbolic and concolic execution. Then\, a tool named RIVER is presented in its current state\, together with the technical plans for improving it to achieve at least the same features set with similar tools such as KLEE. By using its reversible execution capabilities\, and advanced tracing support\, we think that by putting efforts in the implementation plan described in the presentation\, we can obtain improved test coverage in relation to resources consumed. Research ideas for various parts including RIVER symbolic/concolic execution\, tracers improvements\, and combining these techniques with machine learning will be presented.
URL:https://sal.cs.unibuc.ro/event/how-to-find-bugs-in-your-x86-code-river-tool-current-state-and-future/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181206T180000
DTEND;TZID=Europe/Bucharest:20181206T200000
DTSTAMP:20260404T003724
CREATED:20181203T124550Z
LAST-MODIFIED:20181203T124550Z
UID:222-1544119200-1544126400@sal.cs.unibuc.ro
SUMMARY:Logical Foundations: Total and Partial Maps
DESCRIPTION:Speaker: Miriam Costan. \n\nThis week we continue exploring Coq based on the Logical Foundations volume of Software Foundations\, chapter “Total and Partial Maps”
URL:https://sal.cs.unibuc.ro/event/logical-foundations-total-and-partial-maps/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Coq Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181206T100000
DTEND;TZID=Europe/Bucharest:20181206T120000
DTSTAMP:20260404T003724
CREATED:20181126T110006Z
LAST-MODIFIED:20181201T041129Z
UID:208-1544090400-1544097600@sal.cs.unibuc.ro
SUMMARY:Classical and quantum degrees of truth: a new look at the effects of a Hilbert space
DESCRIPTION:Speaker: Roberto Giuntini (University of Cagliari). \n\nWe investigate certain Brouwer-Zadeh lattices that serve as abstract counterparts of lattices of effects in Hilbert spaces under the spectral ordering. These algebras\, called PBZ∗-lattices\, can also be seen as generalisations of orthomodular lattices and are remarkable for the collapse of three notions of “sharpness” that are distinct in general Brouwer-Zadeh lattices. We investigate the structure theory of PBZ∗-lattices and their reducts; in particular\, we prove some embedding results for PBZ∗-lattices and provide an initial description of the lattice of PBZ∗-varieties.
URL:https://sal.cs.unibuc.ro/event/classical-and-quantum-degrees-of-truth-a-new-look-at-the-effects-of-a-hilbert-space/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20181129T083000
DTEND;TZID=Europe/Bucharest:20181129T103000
DTSTAMP:20260404T003724
CREATED:20181126T105140Z
LAST-MODIFIED:20181126T111443Z
UID:200-1543480200-1543487400@sal.cs.unibuc.ro
SUMMARY:Machine Learning Framework for Security Applications
DESCRIPTION:Speaker: Paul Irofti (University of Bucharest). \n\nMachine learning helps us tackle large and apparently intractable optimization problems. Even though neural networks are by far the most popular choice in the field\, we focus on dictionary learning (DL) for sparse representations (SR) instead. Our preference is motivated by the much simpler model that provides faster methods with a solid theoretical background\, understanding and interpretability. \nIn fact it has been recently shown that the forward pass inside neural networks is equivalent to performing sparse representation. Thus performing dictionary learning can be interpreted as a backward pass on a much simpler and smaller model. This relaxation comes with a small performance hit in exchange for the large reduction in algorithm complexity. \nOur talk will focus on adapting DL to Big Data conditions\, DL classification and the problem of malware identification\,  nomaly detection\, online DL and Internet of Things applications.
URL:https://sal.cs.unibuc.ro/event/machine-learning-framework-for-security-applications/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Security Seminar,Seminar
END:VEVENT
END:VCALENDAR