BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.20//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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
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:VEVENT
DTSTART;TZID=Europe/Bucharest:20200312T083000
DTEND;TZID=Europe/Bucharest:20200312T100000
DTSTAMP:20260620T080818
CREATED:20200302T083259Z
LAST-MODIFIED:20200311T122700Z
UID:575-1584001800-1584007200@sal.cs.unibuc.ro
SUMMARY:POSTPONED: Securing Businesses and Critical Infrastructure
DESCRIPTION:POSTPONED UNTIL FURTHER NOTICE. \n  \nSpeaker: Ioan Constantin (Orange Romania) \n\nAbstract: A brief walkthrough some of the challenges in offering advanced cyber security solutions for Business and Critical Infrastructures\, from a Managed Security Services Provider’s standpoint. We’ll talk threat detection and mitigation\, the specifics of OT Security in Critical Infrastructure\, compliance and best practices. We’ll also glance at some of the research and development in these areas.
URL:https://sal.cs.unibuc.ro/event/securing-businesses-and-critical-infrastructure/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20200130T083000
DTEND;TZID=Europe/Bucharest:20200130T100000
DTSTAMP:20260620T080818
CREATED:20200120T083733Z
LAST-MODIFIED:20200122T130127Z
UID:550-1580373000-1580378400@sal.cs.unibuc.ro
SUMMARY:Challenges in Banking
DESCRIPTION:Speaker: Horia Velicu (BRD – Groupe Societe Generale) \n\nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/challenges-in-banking/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20191212T083000
DTEND;TZID=Europe/Bucharest:20191212T110000
DTSTAMP:20260620T080818
CREATED:20191209T092219Z
LAST-MODIFIED:20191209T092219Z
UID:531-1576139400-1576148400@sal.cs.unibuc.ro
SUMMARY:Executarea\, detecţia și prevenţia atacurilor de tip R.O.P
DESCRIPTION:Speaker: Sorin-Gabriel Radu (University of Bucharest) \n\nAbstract: 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.
URL:https://sal.cs.unibuc.ro/event/executarea-detectia-si-preventia-atacurilor-de-tip-r-o-p/
LOCATION:Facultatea de Matematica si Informatica\, sala Google
CATEGORIES:Security Seminar,Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Bucharest:20191121T083000
DTEND;TZID=Europe/Bucharest:20191121T100000
DTSTAMP:20260620T080818
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=Europe/Bucharest:20190920T100000
DTEND;TZID=Europe/Bucharest:20190920T233000
DTSTAMP:20260620T080818
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=Europe/Bucharest:20190830T100000
DTEND;TZID=Europe/Bucharest:20190830T233000
DTSTAMP:20260620T080818
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:20260620T080818
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:20260620T080818
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:20260620T080818
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:20260620T080818
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:20260620T080818
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:20190418T083000
DTEND;TZID=UTC:20190418T100000
DTSTAMP:20260620T080818
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=Europe/Helsinki:20190404T090000
DTEND;TZID=Europe/Helsinki:20190404T100000
DTSTAMP:20260620T080818
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:20260620T080818
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:20190321T083000
DTEND;TZID=UTC:20190321T100000
DTSTAMP:20260620T080818
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:20190307T083000
DTEND;TZID=UTC:20190307T100000
DTSTAMP:20260620T080818
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=Europe/Bucharest:20190221T083000
DTEND;TZID=Europe/Bucharest:20190221T223000
DTSTAMP:20260620T080818
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:20260620T080818
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=UTC:20190207T083000
DTEND;TZID=UTC:20190207T100000
DTSTAMP:20260620T080818
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:20190117T083000
DTEND;TZID=UTC:20190117T100000
DTSTAMP:20260620T080818
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=UTC:20181213T083000
DTEND;TZID=UTC:20181213T100000
DTSTAMP:20260620T080818
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:20181129T083000
DTEND;TZID=Europe/Bucharest:20181129T103000
DTSTAMP:20260620T080818
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