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:Europe/Bucharest 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:UTC BEGIN:STANDARD TZOFFSETFROM:+0000 TZOFFSETTO:+0000 TZNAME:UTC DTSTART:20180101T000000 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:VEVENT DTSTART;TZID=Europe/Bucharest:20191121T083000 DTEND;TZID=Europe/Bucharest:20191121T100000 DTSTAMP:20260403T232622 CREATED:20191118T084219Z LAST-MODIFIED:20191120T180808Z UID:518-1574325000-1574330400@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Anomaly Detection by Unmasking DESCRIPTION:Speaker: Marius Popescu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing natural language processing results that deal with unmasking authorship and their application to anomaly detection. \nRequired reading: \nM. Koppel\, J. Schler\, and E. Bonchek-Dokow. Measuring Differentiability: Unmasking Pseudonymous Authors. Journal of Machine Learning Research\, 8:1261–1276\,  2007. \nT.R. Ionescu\, S. Smeureanu\, B. Alexe\,  and M. Popescu. Unmasking the abnormal events in video. In Proceedings of the IEEE International Conference on Computer Vision (pp. 2895-2903)\, 2017. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-by-unmasking/ LOCATION:Facultatea de Matematica si Informatica\, sala Google CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20191101T093000 DTEND;TZID=UTC:20191103T130000 DTSTAMP:20260403T232622 CREATED:20191031T062011Z LAST-MODIFIED:20191031T062011Z UID:516-1572600600-1572786000@sal.cs.unibuc.ro SUMMARY:ManyVal 2019 DESCRIPTION: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:\n\n\n\n\n\nhttps://cs.unibuc.ro/events/manyval2019/\n\n\n\n\n\nPersoanele inregistrate vor primi kit-ul workshop-ului si vor putea participa la mesele si activitatile sociale anuntate.\n\n\n\n\n\nParticiparea la prezentari NU presupune plata taxei de inregistrare\, iar anumite materiale (program\, carte de abstracte) vor putea fi descarcate de pe pagina ManyVal 2019. URL:https://sal.cs.unibuc.ro/event/manyval-2019/ CATEGORIES:Logic Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20191024T100000 DTEND;TZID=UTC:20191024T120000 DTSTAMP:20260403T232622 CREATED:20191021T122914Z LAST-MODIFIED:20191027T090711Z UID:510-1571911200-1571918400@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 [1]. 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\, 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. \nReferences:\n[1] M. Burrows\, M. Abadi\, R. Needham\, A logic of authentication. Proc. Roy. Soc. London Ser. A 426\, no. 1871\, 233–271\, 1989. URL:https://sal.cs.unibuc.ro/event/an-introduction-to-ban-logic-a-logic-of-authentication-2/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Logic Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Bucharest:20190920T100000 DTEND;TZID=Europe/Bucharest:20190920T233000 DTSTAMP:20260403T232622 CREATED:20190917T073657Z LAST-MODIFIED:20190918T051001Z UID:446-1568973600-1569022200@sal.cs.unibuc.ro SUMMARY:Optimal Transport for (Unsupervised) Machine Learning DESCRIPTION:Speaker: Andra Băltoiu (University of Bucharest) \n\nAbstract: After attending the “Summer School on Applied Harmonic Analysis and Machine Learning” in Genova\,  Andra will give us a short introduction on Optimal Transport in the attempt of finding new prospects for the anomaly detection problem. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-optimal-transport-for-unsupervised-machine-learning/ LOCATION:Facultatea de Matematica si Informatica\, sala Google CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190919T100000 DTEND;TZID=UTC:20190919T120000 DTSTAMP:20260403T232622 CREATED:20190918T215721Z LAST-MODIFIED:20190918T215721Z UID:449-1568887200-1568894400@sal.cs.unibuc.ro SUMMARY:Local Reasoning about Parametric and Reconfigurable Component-based Systems DESCRIPTION:Speaker: Radu Iosif (CNRS – VERIMAG\, France) \n\nAbstract: We introduce a logical framework for the specification and verification of component-based systems\, in which finitely many component instances are active\, but the bound on their number is not known. Besides specifying and verifying parametric systems\, we consider the aspect of dynamic reconfiguration\, in which components can migrate at runtime on a physical map\, whose shape and size may change. We describe such para- metric and reconfigurable architectures using resource logics\, close in spirit to Separation Logic\, used to reason about dynamic pointer structures. These logics support the principle of local reasoning\, which is the key for writing modular specifications and building scalable verification algorithms\, that deal with large industrial-size systems. Joint work with Marius Bozga and Joseph Sifakis. URL:https://sal.cs.unibuc.ro/event/local-reasoning-about-parametric-and-reconfigurable-component-based-systems/ LOCATION:Facultatea de Matematica si Informatica\, sala Google CATEGORIES:Logic Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Bucharest:20190830T100000 DTEND;TZID=Europe/Bucharest:20190830T233000 DTSTAMP:20260403T232622 CREATED:20190827T051705Z LAST-MODIFIED:20190827T053239Z UID:441-1567159200-1567207800@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Gaussian Mixture Models DESCRIPTION:Speaker: Andrei Pătrașcu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing results using Gaussian Mixture Models (GMM) for anomaly detection and their adaptation to existing deep neural networks. \nRequired reading: \nZong\, Bo\, et al. “Deep autoencoding gaussian mixture model for unsupervised anomaly detection.” (2018). \nChapter 11 from Deisenroth\, Marc Peter\, A. Aldo Faisal\, and Cheng Soon Ong. “Mathematics for Machine Learning.” (2018). URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-gaussian-mixture-models/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190821T100000 DTEND;TZID=UTC:20190821T233000 DTSTAMP:20260403T232622 CREATED:20190819T095240Z LAST-MODIFIED:20190819T095240Z UID:439-1566381600-1566430200@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Distributed Online AD DESCRIPTION:Speaker: Paul Irofti (University of Bucharest) \n\nAbstract: We continue our investigation on the task of detecting outliers in networks when dealing with big-data and investigate existing online and distributed solutions. \nRequired reading: \nMiao\, Xuedan\, et al. “Distributed online one-class support vector machine for anomaly detection over networks.” IEEE transactions on cybernetics 49.4 (2018): 1475-1488. \nLiu\, Zhaoting\, Ying Liu\, and Chunguang Li. “Distributed sparse recursive least-squares over networks.” IEEE Transactions on Signal Processing 62.6 (2014): 1386-1395. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-distributed-online-ad/ LOCATION:Facultatea de Matematica si Informatica\, sala Google CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Bucharest:20190808T100000 DTEND;TZID=Europe/Bucharest:20190808T233000 DTSTAMP:20260403T232622 CREATED:20190805T174148Z LAST-MODIFIED:20190805T174714Z UID:437-1565258400-1565307000@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Graph Classification DESCRIPTION:Speaker: Andra Băltoiu (University of Bucharest) \n\nAbstract: We continue our investigation on the task of detecting outliers in networks\, by looking at the concept of signal variation on a graph. \nRequired reading: \nA. Sandryhaila and J. M. F. Moura\, “Classification via regularization on graphs\,” 2013 IEEE Global Conference on Signal and Information Processing\, Austin\, TX\, 2013\, pp. 495-498. \nS. Chen\, A. Sandryhaila\, J. M. F. Moura and J. Kovačević\, “Signal Recovery on Graphs: Variation Minimization\,” in IEEE Transactions on Signal Processing\, vol. 63\, no. 17\, pp. 4609-4624\, Sept.1\, 2015. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-graph-classification/ LOCATION:Facultatea de Matematica si Informatica\, sala Google CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Bucharest:20190801T100000 DTEND;TZID=Europe/Bucharest:20190801T233000 DTSTAMP:20260403T232622 CREATED:20190729T061912Z LAST-MODIFIED:20190729T061912Z UID:435-1564653600-1564702200@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Deep RPCA DESCRIPTION:Speaker: Andrei Pătrașcu (University of Bucharest) \n\nAbstract: We continue our adventure by investigating existing results with Robust Principal Component Analysis (RPCA) and its adaptation to existing deep neural networks. \nRequired reading: \nZHOU\, Chong; PAFFENROTH\, Randy C. Anomaly detection with robust deep autoencoders. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM\, 2017. p. 665-674. \nCANDÈS\, Emmanuel J.\, et al. Robust principal component analysis?. Journal of the ACM (JACM)\, 2011\, 58.3: 11. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-deep-rpca/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Bucharest:20190725T100000 DTEND;TZID=Europe/Bucharest:20190725T233000 DTSTAMP:20260403T232622 CREATED:20190723T083825Z LAST-MODIFIED:20190723T083855Z UID:433-1564048800-1564097400@sal.cs.unibuc.ro SUMMARY:Anomaly Detection Reading Group: Deep OC-SVM DESCRIPTION:Speaker: Andrei Pătrașcu (University of Bucharest) \n\nAbstract: Recent empirical results confirm that one-class (OC) classification methods remain among the most important learning strategies for anomaly detection. In this seminar\, we will technically describe in detail multiple basic OC schemes such as OC-SVM and SVDD and their deep variants\, in order to identify room of improvements or generalization directions towards the graph anomaly detection context. URL:https://sal.cs.unibuc.ro/event/anomaly-detection-reading-group-deep-oc-svm/ LOCATION:Facultatea de Matematica si Informatica\, sala 202 CATEGORIES:Security Seminar,Seminar END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190530T170000 DTEND;TZID=UTC:20190530T180000 DTSTAMP:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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:20260403T232622 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 END:VCALENDAR