BEGIN:VCALENDAR VERSION:2.0 PRODID:-//LORIA - ECPv6.17.3.1//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:LORIA X-ORIGINAL-URL:https://www.loria.fr X-WR-CALDESC:Évènements pour LORIA REFRESH-INTERVAL;VALUE=DURATION:PT1H X-Robots-Tag:noindex X-PUBLISHED-TTL:PT1H BEGIN:VTIMEZONE TZID:Europe/Paris BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:20200329T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:20201025T010000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:20210328T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:20211031T010000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST DTSTART:20220327T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET DTSTART:20221030T010000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20211109T104500 DTEND;TZID=Europe/Paris:20211109T170000 DTSTAMP:20211102T121517Z CREATED:20211102T121517Z LAST-MODIFIED:20211102T121517Z UID:14163-1636454700-1636477200@www.loria.fr SUMMARY:Day on citizen trust and informatics - DigiTrust - OLKi DESCRIPTION:Organizing committee : Enka BLANCHARD (DigiTrust)\, Aurore COINCE (OLKi)\, Maïra NASSAU (DigiTrust) \nContext \nRecent events — from the CoViD-19 pandemic to various electoral scandals — have shown that the public’s trust has major impacts not just on policy-making but on the political effectiveness of said policies. \nOn the technological front\, one way of addressing the issue has been to build systems that do not rely on a central authority\, and where the security depends on decentralised actions by all the users. However\, whether it concerns electronic voting or vaccination status\, technical solutions face an uphill fight to obtain public acceptance. \nThis one-day event brings experts from multiple interrelated fields such as voting systems\, accessibility technologies and cybersecurity. They will exchange insights on the impact of public trust on new technological designs\, as well as the reciprocal. \nLink to the videoconference \nProgram\n10:45 Introduction : Christophe CERISARA (OLKi) and Enka BLANCHARD (DigiTrust) \n11:00-12:00 Opening conference on citizen trust in Taiwan during the Covid-19 situation by Audrey TANG\, Digital Minister of Taiwan \nAudrey Tang is a leading figure in East Asian open-source communities and has been Taiwan’s Digital Minister since 2016\, an interesting position for a self-identified anarchist who challenges traditional hierarchical structures on an daily basis. A central part of their work has been on making governemnental websites more accessible to all netizens and promoting full transparency of governmental data. They’ve been at the core of vTaiwan\, one of the most successful participatory democracy projects ever created which has had tangible impact on Taiwanese policy-making and legislature. \n12:00-13:30 Lunch break \n13:30-15:10 E-democracy and citizen acceptance of technologies \nChaire: Ksenia ERMOSHINA (Centre for Internet and Society) \n– Véronique CORTIER (LORIA) \n– Anna ZIELINSKA (AHP) \n– David MONNIAUX (VERIMAG) [to be confirmed] \n15:15-16:55 Trust and technological support systems \nChaire : Enka BLANCHARD\, LORIA \n– Ted SELKER (UMBC Center for Cybersecurity) \n– Ashley SHEW (Virginia Polytechnic Institute and State University) \n– Eloïse ZEHNDER (2LPN- INRIA) \n16:55-17:00 Conclusion by Enka BLANCHARD URL:https://www.loria.fr/event/day-on-citizen-trust-and-informatics-digitrust-olki/ CATEGORIES:Séminaire END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20211130T090000 DTEND;TZID=Europe/Paris:20211130T170000 DTSTAMP:20211123T153607Z CREATED:20211104T165309Z LAST-MODIFIED:20211123T153607Z UID:14168-1638262800-1638291600@www.loria.fr SUMMARY:3rd CISPA - LORIA Workshop on Cybersecurity DESCRIPTION:The 3rd Cispa-Loria workshop will take place on 30 November from 9am online.\n\nA day of exchanges with presentations of researchers from CISPA and Loria and brainstorming moments to find joint topics and to make possible collaborations.\n\nProgram:\n\n09: 00 – 09:15 – Opening words by Antoine JOUX and Marine MINIER \n09:15 – 09:55 – How will our cryptographic toolkit and cyber security solutions be impacted by Machine Learning? \nNajwa Aaraj – Chief Researcher at the Cryptography Research Centre at Technology Innovation Institute (TII\, Abu Dhabi\, United Arab Emirates) \nA part of this talk will focus on the impact of quantum computers on cryptographic algorithms and the changes that are required to protect against both passive and active quantum attacks. We cover the new set of post quantum cryptographic (PQC) schemes that are being proposed to protect current and future systems\, the implied security thereof\, as well as their practicality when deployed in real world systems. We also discuss standardization efforts\, industry challenges\, and complexities of the roadmap to transition current cryptographic systems and secure communications solutions to quantum-resistant alternatives.\nWe will also discuss briefly the role of Machine Learning in advancing cyber security solutions\, including (1) cryptographic schemes for privacy preserving technologies; (2) theoretical and implementation-focused (side channel) cryptanalysis techniques; and (3) vulnerability management and automated incident response systems. We cover the role of cryptography in securing Machine Learning models by (1) ensuring confidentiality of both data & model during training and classification; (2) protection of models from being tampered-with or introducing bias for profit or control; (3) protection against model poisoning; and (4) introducing cryptographic randomness in training Deep Neural Networks. \n09:55 – 10:35 – When Fuzzing Meets Crypto – Fuzzing SSL Certificates\nAndreas ZELLER – Professor for Software Engineering at Saarland University and research at CISPA Helmholtz Center for Information Security \nFormatFuzzer is a framework for high-efficiency\, high-quality generation and parsing of binary inputs. It takes a binary template that describes the format of a binary input and generates an executable that produces and parses the given binary format. From a binary template for MP4\, for instance\, FormatFuzzer produces a MP4 generator\, which can also parse and mutate existing MP4s\, even guided by coverage in the target program. We are currently working on binary templates for inputs as complex as X.509/SSL certificates. This allows systematic parsing\, checking\, mutating\, and producing SSL certificates\, including some with subtle semantic flaws\, to thoroughly test SSL infrastructures\, with thousands of valid (or seemingly valid) inputs per second. \n10:35 – 11:10 – CTET+: A Beyond-Birthday-Bound Secure Tweakable Enciphering Scheme Using a Single Pseudorandom Permutation\nVirginie LALLEMAND – CNRS researcher on security by symmetric cryptography\nBenoit COGLIATI – Research Group Leader at the CISPA on security by symmetric cryptography \nIn this talk\, we propose a construction of 2-round tweakable substitution-permutation networks using a single secret S-box. This construction is based on non-linear permutation layers using independent round keys\, and achieves security beyond the birthday bound in the random permutation model. When instantiated with an n-bit block cipher with κ-bit keys\, the resulting tweakable block cipher\, dubbed CTET+\, can be viewed as a tweakable enciphering scheme that encrypts wn-bit messages for any integer w>1 using 5n+κ-bit keys and n-bit tweaks\, providing 2n/3-bit security. Furthermore\, we propose a new tweakable enciphering scheme\, dubbed AES6-CTET+\, which is an actual instantiation of CTET+ using a reduced round AES block cipher as the underlying secret S-box. \n11:10 – 11:30 – Time break \n11:30 – 12:20- Network Agnostic Protocols for Distributed Computations\nJulian LOSS – Tenure-track faculty at CISPA Helmholtz Center for Information Security. \nDistributed tasks such as agreeing on a common output (consensus) or joint computation of a public function on private inputs (multi-party computation) are typically studied in two types of models. The first model is the synchronous model\, where parties have synchronized clocks and messages are delivered within some upper known bound. The second model is the asynchronous model\, where no timing assumptions are made. Using the synchronous model (and cryptographic setup)\, it is possible to design protocols that allow to solve the above tasks among n parties that tolerate up to t