BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN: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:VEVENT
DTSTART;TZID=UTC:20190207T083000
DTEND;TZID=UTC:20190207T100000
DTSTAMP:20260404T151757
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=Europe/Bucharest:20190218T183000
DTEND;TZID=Europe/Bucharest:20190218T200000
DTSTAMP:20260404T151757
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=Europe/Bucharest:20190221T083000
DTEND;TZID=Europe/Bucharest:20190221T103000
DTSTAMP:20260404T151757
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:20190221T083000
DTEND;TZID=Europe/Bucharest:20190221T223000
DTSTAMP:20260404T151757
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=UTC:20190228T100000
DTEND;TZID=UTC:20190228T120000
DTSTAMP:20260404T151757
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=UTC:20190228T100000
DTEND;TZID=UTC:20190228T120000
DTSTAMP:20260404T151757
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
END:VCALENDAR