Browser-based fog computing

The dramatic increase in the amount of data being produced and processed by connected devices has led to paradigms that seek to decentralize the traditional cloud model. In 2011 Cisco  47 introduced the vision of fog computing that combines the cloud with resources located at the edge of the network and in between. More generally, the term edge computing has been associated with the idea of adding edge-of-the network storage and computation to traditional cloud infrastructures  41.

A number of efforts in this directions focus on specific hardware, e.g. fog nodes that are responsible for connected IoT devices  48. However, many of today's applications run within web browsers or mobile phones. In this context, the recent introduction of the WebRTC API, makes it possible for browsers and smartphones to exchange directly between each other, enabling mobile, or browser-based decentralized applications.

Maygh  79, for example, uses the WebRTC API to build a decentralized Content Delivery Network that runs solely on web browsers. The fact that the application is hosted completely on a web server and downloaded with enabled websites means that webmasters can adopt the Content Delivery Network (CDN) without requiring users to install any specific software.

For us, the ability of browsers to communicate with each other using the WebRTC paradigm provides a novel playground for new programming models, and for a browser-based fog architecture combining both a centralized, cloud-based part, and a decentralized, browser-supported part.

This model offers tremendous potential by making edge-of-the-network resources available through the interconnection of web-browsers, and offers new opportunities for the protection of the personal data of end users. But consistently engineering browser-based components requires novel tools and methodologies.

In particular, WebRTC was primarily designed for exchanging media and data between two browsers in the presence of a coordinating server. Its complex mechanisms for connection establishment make many of the existing peer-to-peer protocols inefficient. To address this challenge, we plan to consider two angles of attack. First, we plan to design novel protocols that take into account the specific requirements set by this new technology. Second, we envisage to investigate variants of the current WebRTC model with cheaper connection-establishment protocols, in order to provide lower delays and bandwidth consumption in large-scale browser-based applications.

We also plan to address the trade-offs associated with hybrid browser-cloud models. For example, when should computation be delegated to browsers and when should it be executed on the cloud in order to maximize the quality of service? Or, how can a decentralized analytics algorithms operating on browser-based data complement or exploit the knowledge built by cloud-based data analytics solutions?

Emergent micro-service deployment and management

Micro-services tend to produce fine-grained applications in which many small services interact in a loosely coupled manner to produce a wide range of services within an organization. Individual services need to evolve independently of each other over time without compromising the availability of the overall application. Lightweight isolation solutions such as containers (Docker, ...), and their associated tooling ecosystem (e.g. Google's Borg  78, Kubernetes  45) have emerged to facilitate the deployment of large-scale micro-service-based applications, but only provide preliminary solutions for key concerns in these systems, which we would like to investigate and extend.

Most of today's on-line computer systems are now too large to evolve in monolithic, entirely pre-planned ways. This applies to very large data centres, for example, where the placement of virtual machines to reduce heating and power consumption can no longer be treated using top-down exhaustive optimisation approaches beyond a critical size. This is also true of social networking applications, where different mechanisms—e.g. to spread news notifications, or to recommend new contacts—must be adapted to the different sub-communities present in the system.

To cope with the inherent complexity of building complex loosely-coupled distributed systems while fostering and increasing efficiency, maintainability, and scalability, we plan to study how novel programming techniques based on declarative programming, components and epidemic protocols can help design, deploy, and maintain self-adaptive structures (e.g. placement of VM) and mechanisms (e.g. contact recommendations) that are optimized to the local context of very large distributed systems. To fulfill this vision, we plan to explore a three-pronged strategy to raise the level of programming abstraction offered to developers.

• First, we plan to explore the use of high-level domain-specific languages (DSL) to declare how large-scale topologies should be achieved, deployed, and maintained. Our vision is a declarative approach to describe how to combine, deploy and orchestrate micro-services in an abstract manner thus abstracting away developers from the underlying cloud infrastructures, and from the intricacies involved in writing low-level code to build a large-scale distributed application that scales. With this effort, we plan notably to directly support the twin properties of emergence (the adaptation “from within”) and differentiation (the possibility from parts of the system to diverge while still forming a whole). Our central objective is to search for principled programming constructs to support these two capabilities using a modular and incremental software development approach.
• On a second strand of work, we plan to investigate how unikernels enable smaller footprints, more optimization options, and faster boot times for micro-services. Isolating micro-services into VMs is not the most adequate approach as it requires the use of hypervisors, or virtual machine monitors (VMMs), to virtualize hardware resources. VMMs are well known to be heavyweight with both boot and run time overheads that may have a strong impact on performances. Unikernels seem to offer the right balance between performance and flexibility to address this challenge. One of the key underlying challenges is to compile directly the aforementioned provided DSL to a dedicated and customized machine image, ready to be deployed directly on top of a large set of bare metal servers.
• Depending on the workload it is subjected to, and the state of its execution environment (network, VMs), a large-scale distributed application may present erratic or degraded performance that is hard to anticipate and plan for. There is therefore a strong need to adapt dynamically the way resources are allocated to a running application. We would like to study how the DSL approach we envisage can be extended to enable developers to express orchestration algorithms based on machine learning algorithms.

Privacy-preserving decentralized learning

Personalization and recommendation can be seen as a specific case of general machine learning. Production-grade recommenders and personalizers typically centralize and process the available data in one location (a data-center, a cloud service). This is highly problematic, as it endangers the privacy of users, while hampering the analysis of datasets subject to privacy constraints that are held by multiple independent organizations (such as health records). A decentralized approach to machine learning appears as a promising candidate to overcome these weaknesses: if each user or participating organization keeps its data, while only exchanging gradient or model information, privacy leaks seem less likely to occur.

In some cases, decentralized learning may be achieved through relatively simple adaptations of existing centralized models, for instance by defining alternative learning models that may be more easily decentralized. But in all cases, processing growing amounts of information calls for high-performance algorithms and middleware that can handle diverse storage and computation resources, in the presence of dynamic and privacy-sensitive data. To reach this objective, we will therefore leverage our work in distributed and privacy-preserving algorithms and middleware  49, 51, 52 as well as the results of our work on large-scale hybrid architectures in Objective 1.

Personalization in user-oriented applications

As a first application perspective, we plan to design tools that exploit decentralized analytics to enhance user-centric personalized applications. As we observed above, such applications exhibit an inherent trade-off between personalization quality and privacy preservation. The most obvious goal in this direction consists in designing algorithms that can achieve high levels of personalization while protecting sensitive user information. But an equally important one consists in personalizing the trade-off itself by adapting the quality of the personalization provided to a user to his/her willingness to expose information. This, like other desirable behaviors, appears at odds with the way current systems work. For example, a user of a recommender system that does not reveal his/her profile information penalizes other users causing them to receive less accurate recommendations. We would like to mitigate this situation by means of protocols that reward users for sharing information. On the one hand, we plan to take inspiration from protocols for free-riding avoidance in peer-to-peer systems  53, 60. On the other hand, we will consider blockchains as a tool for tracking and rewarding data contributions. Ultimately, we aim at enabling users to configure the level of privacy and personalization they wish to experience.

Privacy preserving decentralized aggregation

As a second setting we would like to consider target applications running on constrained devices like in the Internet-of-Things (IoT). This setting makes it particularly important to operate on decentralized data in a light-weight privacy-preserving manner, and further highlights the synergy between this objective and Objective 1. For example, we plan to provide data subjects with the possibility to store and manage their data locally on their own devices, without having to rely on third-party managers or aggregators, but possibly storing less private information or results in the cloud. Using this strategy, we intend to design protocols that enable users themselves, or third-party companies to query distributed data in aggregate form, or to run data analytics processes on a distributed set of data repositories, thereby gathering knowledge without violating the privacy of other users. For example, we have started working on the problem of computing an aggregate function over a subset of the data in a distributed setting. This involves two major steps: selection and aggregation. With respect to selection, we envision defining a decentralized data-selection operation that can apply a selection predicate without violating privacy constraints. With respect to aggregation, we will continue our investigation of lightweight protocols that can provide privacy with limited computational complexity  42.

Spread maximization

Our goal is in particular to study spread maximization in a broader class of diffusion processes than the basic independent cascade (IC) and linear threshold (LT) models of influence  68, 66, 67 that have been studied in this context so far. This includes the randomized rumor spreading (RS) model for information dissemination  57, biased versions of the voter model  62 modelling influence, and the (graph-based) Moran processes  70 modelling the spread of mutations. We would like to consider several natural versions of the spread maximization problem, and the relationships between them. For these problems we will use the greedy algorithm and the submodularity-based analytical framework of  68, and will also explore new approaches.

Immunization optimization

Conversely we would also like to explore immunization optimization problems. Existing works on these types of problem assume a perfect-contagion model, i.e., once a node gets infected, it deterministically infects all its non-immunized neighbors. We plan to consider various diffusion processes, including the standard susceptible–infected (SI), susceptible–infected–recovered (SIR) and susceptible–infected–susceptible (SIS) epidemic models, and explore the extent to which results and techniques for the perfect-contagion model carry over to these probabilistic models. We will also investigate whether techniques for spread maximization could be applied to immunization problems.

Some immunization problems are known to be hard to approximate in general graphs, even for the perfect-contagion model, e.g., the fixed-budget version of the fire-fighter problem cannot be approximated to any $n^{1-ϵ}$ factor  44. This strand of work will consider restricted graph families, such as trees or graphs of small treewidth, for such problems. In addition, for some immunization problems, there is a large gap between the best known approximation algorithm and the best known inaproximability result, and we would like to make progress in reducing these gaps.

Randomized algorithm for mutual exclusion and coordination

To exploit the power of massive distributed applications and systems (such as those envisaged in Objectives 1 and 2) or multiple processors, algorithms must cope with the scale and asynchrony of these systems, and their inherent instability, e.g., due to node, link, or processor failures. Our goal is to explore the power and limits of randomized algorithms for large-scale networks of distributed systems, and for shared memory multi-processor systems, in effect providing fundamental building blocks to the work envisioned in Objectives 1 and 2.

For shared memory systems, randomized algorithms have notably proved extremely useful to deal with asynchrony and failures. Sometimes probabilistic algorithms provide the only solution to a problem; sometimes they are more efficient; sometimes they are simply easier to implement. We plan to devise efficient algorithms for some of the fundamental problems of shared memory computing, such as mutual exclusion, renaming, and consensus.

In particular, looking at the problem of mutual exclusion, it is desirable that mutual exclusion algorithms be abortable. This means that a process that is trying to lock the resource can abort its attempt in case it has to wait too long. Abortability is difficult to achieve for mutual exclusion algorithms. We will try to extend our algorithms for the cache-coherent (CC) and the distributed shared memory (DSM) model in order to make them abortable, while maintaining expected constant Remote Memory References (RMRs) complexity, under optimistic system assumptions. In order to achieve this, the algorithm will use strong synchronization primitives, called compare-and-swap objects. As part of our collaboration with the University of Calgary, we will work on implementing those objects from registers in such a way that they also allow aborts. Our goal is to build on existing non-abortable implementations 59. We plan then later to use these objects as building blocks in our mutual exclusion algorithm, in order to make them work even if the system does not readily provide such primitives.

We have also started working on blockchains, as these represent a new and interesting trade-off between probabilistic guarantees, scalability, and system dynamics, while revisiting some of the fundamental questions and limitations of consensus in fault-prone asynchronous systems.

Modular theory of distributed computing

Practitioners and engineers have proposed a number of reusable frameworks and services to implement specific distributed services (from Remote Procedure Calls with Java RMI or SOAP-RPC, to JGroups for group communication, and Apache Zookeeper for state machine replication). In spite of the high conceptual and practical interest of such frameworks, many of these efforts lack a sound grounding in distributed computation theory (with the notable exceptions of JGroups and Zookeeper), and often provide punctual and partial solutions for a narrow range of services. We argue that this is because we still lack a generic framework that unifies the large body of fundamental knowledge on distributed computation that has been acquired over the last 40 years.

To overcome this gap we would like to develop a systematic model of distributed computation that organizes the functionalities of a distributed computing system into reusable modular constructs assembled via well-defined mechanisms that maintain sound theoretical guarantees on the resulting system. This research vision arises from the strong belief that distributed computing is now mature enough to resolve the tension between the social needs for distributed computing systems, and the lack of a fundamentally sound and systematic way to realize these systems.

To progress on this vision, we plan in the near future to investigate, from a distributed software point of view, the impact due to failures and asynchrony on the layered architecture of distributed computing systems. A first step in this direction will address the notions of message adversaries (introduced a long time ago in  76) and process adversaries (investigated in several papers, e.g.  75, 56, 64, 65, 69). The aim of these notions is to consider failures, not as “bad events”, but as part of the normal behavior of a system. As an example, when considering round-based algorithms, a message adversary is a daemon which, at every round, is allowed to suppress some messages. The aim is then, given a problem $P$, to find the strongest adversary under which $P$ can be solved (“strongest” means here that giving more power to the adversary makes the problem impossible to solve). This work will allow us to progress in terms of general layered theory of distributed computing, and allow us to better map distributed computing models and their relations, in the steps of noticeable early efforts in this direction  75, 40.

Objective 1: Large-scale Trustless Sybil-Resistant Systems

We plan to contribute to the theoretical understanding of Blockchain-based and Byzantine-tolerant systems by exploring reusable abstractions that can allow programmers to develop Byzantine-tolerant applications more easily. We plan for example to extend existing work on weak consistency to a BFT setting, building for instance on recent proposals on Byzantine Fault-Tolerant CRDTs  63. To address scale, we plan to explore novel scalable Byzantine fault-tolerant algorithms, both in the context of closed systems, and then in the more challenging case of open (aka permissionless) systems. Our line of attack is to focus on lightweight BFT primitives that can enable faster and more resource-efficient algorithms  54, 61. In the case of open systems, we will leverage the expertise of our team in theoretical distributed algorithms and randomized algorithms to address Sybil attacks through novel countermeasures providing (hopefully) cheaper and more equitable alternatives to proof-of-work of proof-of-stake algorithms. One open, yet enticing, questions is whether anonymous computing models could provide a path to address this issue. We would also like to investigate how storage can be improved in Blockchains and BFT large-scale systems. Most of these systems are fully replicated, incurring formidable costs (up to 2.6PB of distributed storage in the case of Bitcoin). Coding techniques, that we have used in the past, and adaptable redundancy based on Byzantine quorums  71 are some avenues we would like to explore to address this challenge.

Objective 2: Robustness and Security at Scale

Although WIDE did not focus initially on security issues per se, our historical interest in privacy concerns and Byzantine fault-tolerance has progressively led us to consider a broader range of security properties in distributed and decentralized systems, ranging from anonymity (in anonymity networks, explored in the PhD of Quentin Dufour) to malware protection through large-scale computations.

In terms of malware protection, we would like to harness the power of distribution and collaborative data gathering to help antivirus designers improve and optimize malware detection. We plan in particular to work on the automatic creation of test datasets for antivirus software using automated mutation techniques, building upon our preliminary work in this area. Such a tool is of primary importance in both the academic and industrial fields to be able to quantify the effectiveness of new countermeasures.

On the front of privacy, we plan to investigate the design of a distributed digital data vault able to securely store personal data, leveraging our experience on privacy-preserving decentralized systems 42, and on trusted-execution environments (e.g. SGX). We have started collaborating with the CIDRE team at Inria Rennes, with colleagues at KTH (Sweden), and with the company AriadNext (H2020 Soteria project) on these topics.

At an infrastructure level, and following the recruitment of Djob Mvondo, we plan to explore how progress in virtualization can help advance the team's agenda in terms of large-scale robustness, in particular in a cloud-computing setting  72, 73. Specifically we would like to investigate how novel heterogeneous architectures that embed a range of ASICs and specialized units (GPU, FPGA, SMARTNIC, PIM-devices) can be leveraged to provide more robust and more efficient virtualized services.

Objective 3: Collaborative and stealthy audits of algorithms

This research objective is interested in the possibility of (and the algorithmic means for) auditing algorithms running at third parties (such as classifiers, recommenders or ranking applications)  55. These algorithms, often coined black-box algorithms  74, can only be interacted with by sending inputs and observing the result of their computation through outputs. While their full reverse engineering is either intractable or even undecidable (i.e., retrieving a full map of the outputs depending on all the possible inputs), the coordinated action of several observers (or auditors) can help infer important properties of these algorithms, such as bias, stability or security in their decisions.

The challenges are thus 1) to first understand what can or cannot be inferred, given for instance a number of requests as inputs, a set of assumptions for what is running in the black-box, and considering which type of adversary is running and modifying the audited algorithm; 2) to turn initial theoretical results into practical tools. To this end, we must find ways to interface with the audited algorithm in vivo, so that input/output interactions can be performed. This may imply coordinating of various auditors, and sharing their observation results for better efficiency.

Objective 4: Fundamentals of distributed randomized algorithms

We plan to continue our theoretical exploration of simple randomized distributed algorithms, where individual entities (nodes or mobile agents) have limited computation and communication power, and are often unreliable. These distributed randomized algorithms are closely related to the mechanisms we plan to explore for Sybil attack protection (Objective 1), privacy protection (Objective 2), and remote auditing (Objective 3).

More concretely, we will investigate three settings: in the first setting, agents perform independent or mildly dependent random walks on a graph, and interact when they meet. In the second (more traditional) setting, the interacting entities are the nodes of graph. Finally, in a third setting, nodes are the computing entities and the goal is to modify the graph edges to achieve certain desirable graph properties (an expander graph  43, or a k-nearest neighbor graph), by means of local decentralized operations (typically adjacent nodes interact by exchanging some of their incident edges). In all three cases, we will strive to derive time- and space- optimal algorithms, with strong robustness guarantees.

7.1.1 Basalt

• Keywords:
  Peer-sampling, Blockchain
• Functional Description:
  A number of novel blockchain and cryptocurrency implementations rely on random peer sampling. But existing protocols remain vulnerable to Sybil attacks. BASALT is a peer-sampling protocol that addresses this limitation by leveraging three main components. First it employs a novel sampling approach, termed stubborn chaotic search, that exploits ranking functions to define a dynamic target random graph (i.e. a set of target neighbors for each node) that cannot be controlled by Byzantine nodes. Second, it adopts a hit-counter mechanism that favors the exploration of new peers even in the presence of Byzantine nodes that flood the network with their identities. Finally, it incorporates hierarchical ranking functions that ensure that nodes sample their peers from a variety of address prefixes. The first two mechanisms ensure that the number of Byzantine nodes in a node’s view cannot be increased arbitrarily by attackers. This offers protection from general Byzantine behaviors including those resulting from botnet attacks, as defined above. The third mechanism ensures that nodes sample their peers from a variety of address prefixes, thereby countering institutional attacks where the attacker controls a limited number of entire address prefixes.
• Contact:
  François Taiani
• Participants:
  Alex Auvolat-Bernstein, David Bromberg, François Taiani, Davide Frey

7.1.2 Killerdroid-packer

• Name:
  Practical implementation of dissimulation techniques for Android application
• Keywords:
  Malware, Android, Machine learning, Cybersecurity
• Functional Description:
  Killerdroid-packer allows to intricate a Android guest application in a Android host application. A common use case is to hide a malicious code inside a benign one to evade typical detection systems. Killerdroid-packer has been proven effective and scalable. Applications generated with the tool can evade state-of-the art detection systems (Drebin, Mamadroid ...) and can be used to forge large scale datasets of malicious applications.
• Publication:
  hal-03146161
• Contact:
  David Bromberg
• Participants:
  David Bromberg, Mathieu Simonin, Louison Gitzinger
• Partner:
  DGA-MI

7.1.3 python-andromak

• Name:
  Andromak: A library to assess Android detector quality
• Keywords:
  Android, Anomaly detection, Cybersecurity, Distribution, Malware, Machine learning
• Functional Description:

  State of the Art detectors are numerous, but actually comparing them in a thorough way is tedious. Andromak aims to make a step toward easier and sound comparisons between the top existing detectors.

  Python-andromak is a library to: - (a) scale your training, - (b) evaluate the quality of you model against several input datasets and scenario, - (c) analyse the performance results (domain-specific metrics and statistical tests are shipped).

• Contact:
  David Bromberg
• Participants:
  Mathieu Simonin, David Bromberg

7.1.4 Donar

• Keywords:
  Audio, Anonymisation
• Functional Description:
  Make anonymous calls via Tor
• Publication:
  hal-03923695
• Contact:
  Quentin Dufour
• Participants:
  Quentin Dufour, David Bromberg, Davide Frey, Etienne Riviere

8.1.1 A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary

Participants: Timothé Albouy, Davide Frey, Michel Raynal, François Taïani.

This work 18 explores how reliable broadcast can be implemented without signatures when facing a dual adversary that can both corrupt processes and remove messages. More precisely, we consider an asynchronous n-process message-passing system in which up to t processes are Byzantine and where, at the network level, for each message broadcast by a correct process, an adversary can prevent up to d processes from receiving it (the integer d defines the power of the message adversary). So, unlike previous works, this work considers that not only can computing entities be faulty (Byzantine processes), but, in addition, that the network can also lose messages. To this end, this work adopts a modular strategy and first introduces a new basic communication abstraction denoted k2-cast, which simplifies quorum engineering, and studies its properties in this new adversarial context. Then, this work deconstructs existing signature-free Byzantine-tolerant asynchronous broadcast algorithms and, with the help of the k2-cast communication abstraction, reconstructs versions of them that tolerate both Byzantine processes and message adversaries. Interestingly, these reconstructed algorithms are also more efficient than the Byzantine-tolerant-only algorithms from which they originate.

8.1.2 Reaching Consensus in the Presence of Contention-Related Crash Failures

Participants: Michel Raynal.

While consensus is at the heart of many coordination problems in asynchronous distributed systems prone to process crashes, it has been shown to be impossible to solve in such systems where processes communicate by message-passing or by reading and writing a shared memory. Hence, these systems must be enriched with additional computational power for consensus to be solved on top of them. This work 2215 presents a new restriction of the classical basic computational model that combines process participation and a constraint on failure occurrences that can happen only while a predefined contention threshold has not yet been bypassed. This type of failure is called $\lambda$-constrained crashes, where $\lambda$ defines the considered contention threshold. It appears that when assuming such contention-related crash failures and enriching the system with objects whose consensus number is $k\ge 1$, consensus for n processes can be solved for any $n\ge k$ assuming up to $k$ failures. The work proceeds incrementally. It first presents an algorithm that solves consensus on top of read/write registers if at most one crash occurs before the contention threshold $\lambda =n-1$ has been bypassed. Then, it shows that if the system is enriched with objects whose consensus number is $k\ge 1$, then when $\lambda$ = n - k, consensus can be solved despite up to k $\lambda$-constrained crashes, for any $n\ge k$, and when $\lambda =n-2k+1$, consensus can be solved despite up to $2k-1$$\lambda$-constrained crashes, assuming $k$ divides $n$. Finally, impossibility results are presented for the number of $\lambda$-constrained failures that can be tolerated.

This is a joint work with Anaïs Durand (LIMOS, Clermont-Ferrand) and Gadi Taubenfeld (Reichman University, Israel)

8.1.3 Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case

Participants: Timothé Albouy, Davide Frey, Michel Raynal, François Taïani.

This work 19 considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct, and an essential property for practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained under a Byzantine majority. In this work, we answer this open question positively and propose a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of $max(2,t+3-c)$ rounds, where t is the upper bound on the number of Byzantine processes, and c the number of effectively correct processes.

8.1.4 A visit to mutual exclusion in seven dates

Participants: Michel Raynal.

Mutual exclusion (mutex) is one of the most fundamental synchronization problems encountered in shared memory systems. It appears in all computer science first-degree curricula. This work 17 presents nine mutex algorithms, each with its noteworthy features, spread over seven dates covering 1965-2020. Most of these algorithms are very well known and paved the way for new research directions. This work aims to present fundamental issues and basic principles that underlie the design of shared memory mutex algorithms in different contexts. So, differently from exhaustive surveys on shared memory mutex algorithms, it strives to give the reader a flavor of the many design facets of this still challenging problem.

This is a joint work with Gadi Taubenfeld (Reichman University, Herzliya 46150, Israel).

8.1.5 Distributed computability: Relating k-immediate snapshot and x-set agreement

Participants: Michel Raynal.

This work 14 introduces a generalization of the immediate snapshot object denoted k-immediate snapshot, requiring that the snapshot returned contains at least $(n-k)$ pairs. The case $k=n-1$ corresponds to the original immediate snapshot object, which requires that the snapshot returned contains at least one $\langle$process id, value$\rangle$ pair, that corresponds to the process id that invoked the operation).

The work first shows that k-immediate snapshot is impossible to implement in an asynchronous read/write system, even if $k=n-2$ and $t=1$. Then, this work considers x-set agreement, another object stronger than the classical read/write t-crash read/write model (when $x\le t$ ), and studies the relation with the k-immediate snapshot object, establishing strong relations linking these two fundamental distributed computing abstractions. This work shows conditions under which x-set agreement can be solved in read/write systems enriched with k-immediate snapshot objects. It also shwos when k-immediate snapshot and consensus are equivalent.

This is a joint work with Carole Delporte (IRIF, Université Paris Diderot, Paris, France), Hugues Fauconnier (IRIF, Université Paris Diderot, Paris, France), and Sergio Rajsbaum (Instituto de Matemáticas, UNAM, Mexico City, Mexico).

8.1.6 Optimal Algorithms for Synchronous Byzantine k-Set Agreement

Participants: Michel Raynal.

Considering a system made up of n processes prone to Byzantine failures, k-set agreement allows each process to propose a value and decide a value such that at most k different values are decided by the correct (i.e., non-Byzantine) processes, in such a way that, if all the correct processes propose the same value v, they will decide v (when $k=1$, k-set agreement boils down to consensus). This work 21 presents a two-round algorithm that solves Byzantine k-set agreement on top of a synchronous message-passing system. This algorithm is based on two new notions denoted by Square and Regions which allow processes to locally build a global knowledge on which processes proposed some values. Two instances of the algorithm are presented. Assuming $n=3t$, where t is the maximum number of Byzantine, the first instance solves 2-set agreement. The second one solves the more general case $2t<n\le 3t$, where $k=n-tn-2t$ is an integer. These two algorithm instances are optimal with respect to the number of rounds executed by the processes (namely two rounds). Combined with previous results, this work “nearly closes” the solvability of Byzantine k-set agreement in synchronous message-passing systems (more precisely, the only remaining case for which it is not known whether k-set agreement can or cannot be solved is when $k=n-tn-2t$ is not an integer).

This is a joint work with Carole Delporte (IRIF, Université Paris Diderot, Paris, France), Hugues Fauconnier (IRIF, Université Paris Diderot, Paris, France), and Mouna Safir (IRIF, Université Paris Cité, Paris, France, and School of Computer Sciences, Mohammed VI Polytechnic University, Ben Guerir, Morocco).

8.1.7 Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast

Participants: Michel Raynal.

In this work 29, we study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This abstraction is central in the design and implementation of fault-tolerant distributed systems, as many fault-tolerant distributed applications require communication with provable guarantees on message deliveries. Our study focuses on fault-tolerant implementations for message-passing systems that are prone to process-failures, such as crashes and malicious behaviors.

At PODC 1983, Bracha and Toueg, in short, BT, solved the BRB problem. BT has optimal resilience since it can deal with up to $5<n/3$

Byzantine processes, where n is the number of processes. The present work aims at the design of an even more robust solution than BT by expanding its fault-model with self-stabilization, a vigorous notion of fault-tolerance. In addition to tolerating Byzantine and communication failures, self-stabilizing systems can recover after the occurrence of arbitrary transient-faults. These faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code remains intact).

We propose, to the best of our knowledge, the first self-stabilizing Byzantine fault-tolerant (SSBFT) solution for repeated BRB (that follows BT’s specifications) in signature-free message-passing systems. Our contribution includes a self-stabilizing variation on a BT that solves asynchronous single-instance BRB. We also consider the problem of recycling instances of single-instance BRB. Our SSBFT recycling for time-free systems facilitates the concurrent handling of a predefined number of BRB invocations and, by this way, can serve as the basis for SSBFT consensus.

This is a joint work with Romaric Duvignau and Elad M. Schiller from Chalmers University of Technology, Gothenburg, Sweden.

8.1.8 Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms

Participants: Michel Raynal.

This work 30 addresses election in fully anonymous systems made up of n asynchronous processes that communicate through atomic read-write registers or atomic read-modify-write registers. Given an integer $d\in \{1,...,n-1\}$, two elections problems are considered: d-election (at least one and at most d processes are elected) and exact d-election (exactly d processes are elected). Full anonymity means that both the processes and the shared registers are anonymous. Memory anonymity means that the processes may disagree on the names of the shared registers. That is, the same register name A can denote different registers for different processes, and the register name A used by a process and the register name B used by another process can address the same shared register. Let n be the number of processes, m the number of atomic read-modify-write registers, and let $M(n,d)=\{k:\forall \ell :1<\ell \le n:\mathrm{𝗀𝖼𝖽}(\ell ,k)\le d\}$. The following results are presented for solving election in such an adversarial full anonymity context.

- It is possible to solve d-election when participation is not required if and only if $m\in M(n,d)$.

- It is possible to solve exact d-election when participation is required if and only if $\mathrm{𝗀𝖼𝖽}(m,n)$ divides d.

- It is possible to solve d-election when participation is required if and only if $\mathrm{𝗀𝖼𝖽}(m,n)\le d$.

- Neither d-election nor exact d-election (be participation required or not) can be solved when the processes communicate through read-write registers only.

This is a joint work with Damien Imbs (LIS, Aix-Marseille University & CNRS & Univ. Toulon, Marseille, France) and Gadi Taubenfeld (Reichman University, Herzliya, Israel).

8.2.1 Hidden Issuer Anonymous Credential

Participants: Davide Frey, Mathieu Gestin.

8.2.2 Donar: Anonymous VoIP over Tor

Participants: David Bromberg, Davide Frey.

In this work, we introduced DONAR, a system enabling anonymous VoIP with good quality-of-experience (QoE) over Tor. No individual Tor link can match VoIP networking requirements. DONAR bridges this gap by spreading VoIP traffic over several links. It combines active performance monitoring, dynamic link selection, adaptive traffic scheduling, and redundancy at no extra bandwidth cost. DONAR enables high QoE: latency remains under 360 ms for 99% of VoIP packets during most (86%) 5-minute and 90-minute calls. This work, published at NSDI 2022 20, was done in collaboration with former WIDE member Quentin Dufour who defended his thesis in February 2021, and Etienne Rivière from UC Louvain.

8.2.3 RAPTEE: Leveraging trusted execution environments for Byzantine-tolerant peer sampling services

Participants: David Bromberg, Davide Frey.

8.2.4 Odile: A scalable tracing tool for non-rooted and on-device Android phones

Participants: David Bromberg.

8.3.1 Expanders via Local Edge Flips in Quasilinear Time

Participants: George Giakkoupis.

Mahlmann and Schindelhaue (2005) proposed the following simple process, called flip-chain, for transforming any given connected $d$-regular graph into a $d$-regular expander: In each step, a random 3-path $abcd$ is selected, and edges $ab$ and $cd$ are replaced by two new edges $ac$ and $bd$, provided that $ac$ and $bd$ do not exist already. A motivation for the study of the flip-chain arises in the design of overlay networks, where it is common practice that adjacent nodes periodically exchange random neighbors, to maintain good connectivity properties. It is known that the flip-chain converges to the uniform distribution over connected $d$-regular graphs, and it is conjectured that an expander graph is obtained after $O(ndlogn)$ steps, w.h.p., where $n$ is the number of vertices. However, the best known upper bound on the number of steps has been $O\left(n^2{d}^2\sqrt{logn}\right)$, and the best bound on the mixing time of the chain is $O(n^{16}{d}^{36}logn)$.

In 23 we provide a new analysis of a natural flip-chain instantiation, which shows that starting from any connected $d$-regular graph, for $d=\Omega \left({log}^{2}n\right)$, an expander is obtained after $O\left(nd{log}^{2}n\right)$ steps, w.h.p. This result is tight within logarithmic factors, and almost matches the conjectured bound. Moreover, it justifies the use of edge flip operations in practice: for any $d$-regular graph with $d=\mathrm{𝑝𝑜𝑙𝑦}(logn)$, an expander is reached after each vertex participates in at most $\mathrm{𝑝𝑜𝑙𝑦}(logn)$ operations, w.h.p. Our analysis is arguably more elementary than previous approaches. It uses the novel notion of the strain of a cut, a value that depends both on the crossing edges and their adjacent edges. By keeping track of the cut strains, we form a recursive argument that bounds the time before all sets of a given size have large expansion, after all smaller sets have already attained large expansion.

8.3.2 Distributed Self-Stabilizing MIS with Few States and Weak Communication

Participants: George Giakkoupis, Isabella Ziccardi.

In this work in progress we study a simple random process that computes a maximal independent set (MIS) on a general $n$-vertex graph. Each vertex has a binary state, black or white, where black indicates inclusion into the MIS. The vertex states are arbitrary initially, and are updated in parallel: In each round, every vertex whose state is “inconsistent” with its neighbors', i.e., it is black and has a black neighbor, or it is white and all neighbors are white, flips its state independently with probability $1/2$. The process stabilizes with probability 1 on any graph, and the resulting set of black vertices is an MIS. It is easy to see that the expected stabilization time is $O(logn)$ on certain graph families, such as cliques and trees. However, analysing the process on graphs beyond these simple cases seems challenging, which may explain why the process has not appeared in the literature before.

Our main result is that the process stabilizes in $\mathrm{𝑝𝑜𝑙𝑦}(logn)$ rounds w.h.p. on $G_{n,p}$ random graphs, for all $0\le p=\tilde{O}\left(n^{-1/2}\right)$. Further, an extension of this process, with larger but still constant vertex state space, stabilizes in $\mathrm{𝑝𝑜𝑙𝑦}(logn)$ rounds on $G_{n,p}$ graphs w.h.p., for all $1\le p\le 1$. We conjecture that this improved bound holds for the original process as well. In fact, we believe that the original process stabilizes in $\mathrm{𝑝𝑜𝑙𝑦}(logn)$ rounds on any given $n$-vertex graph w.h.p. Both processes readily translate into distributed/parallel MIS algorithms, which are self-stabilizing, use constant memory (and constant random bits per round), and assume restricted communication as in the beeping or the synchronous stone age models. To the best of our knowledge, no previously known MIS algorithm is self-stabilising, uses constant memory and constant randomness, and stabilizes in $\mathrm{𝑝𝑜𝑙𝑦}(logn)$ rounds in general or random graphs.

8.4.1 Randomized Smoothing under Attack: How Good is it in Pratice?

Participants: Erwan Le Merrer.

Randomized smoothing is a recent and celebrated solution to certify the robustness of any classifier. While it indeed provides a theoretical robustness against adversarial attacks, the dimensionality of current classifiers necessarily imposes Monte Carlo approaches for its application in practice. This work 25 questions the effectiveness of randomized smoothing as a defense, against state of the art black-box attacks. This is a novel perspective, as previous research works considered the certification as an unquestionable guarantee. We first formally highlight the mismatch between a theoretical certification and the practice of attacks on classifiers. We then perform attacks on randomized smoothing as a defense. Our main observation is that there is a major mismatch in the settings of the RS for obtaining high certified robustness or when defeating black box attacks while preserving the classifier accuracy.

Join work with Teddy Furon (Inria) and Thibault Maho (Inria).

9.1.1 Associate Teams in the framework of an Inria International Lab or in the framework of an Inria International Program

9.1.2 H2020 projects

ANR Project PAMELA (2016-2022)

Participants: Davide Frey, George Giakkoupis, François Taïani.

PAMELA is a collaborative ANR project involving Inria/IRISA, Inria Lille (MAGNET team), UMPC, Mediego and Snips. The project aims at developing machine learning theories and algorithms in order to learn local and personalized models from data distributed over networked infrastructures. This project seeks to provide fundamental answers to modern information systems built by interconnecting many personal devices holding private user data in the search of personalized suggestions and recommendations. A significant asset of the project is the quality of its industrial partners, Snips and Mediego, who bring in their expertise in privacy protection and distributed computing as well as use cases and datasets.

Collaboration with the Conseil Supérieur de l'Audiovisuel (CSA)

Participants: Erwan Le Merrer.

Collaborating with the CSA (the French regulator of audio-visual content) on the YouTube recommender system, in order to assess the presence or not of the so called rabbit-hole phenomenon.

ANR Project ByBloS (2021-2025)

Participants: George Giakkoupis, Michel Raynal, Davide Frey, David Bromberg, François Taïani, Timothé Albouy.

Partners: IRISA (coordinator, U. Rennes I) in Rennes, LIRIS (INSA Lyon) in Lyon, and LS2N (Université de Nantes) in Nantes. Budget: 252 220€

Cominlabs Project PriCLeSS (2021-2023)

Participants: Davide Frey, Arthur Rauch, Michel Raynal, François Taïani.

Partners: WIDE@Inria (coordinator), CIDRE@Inria, GDD@LS2N (Université de Nantes) in Nantes. Budget:

10.1.1 Scientific events: organisation

10.1.2 Scientific events: selection

10.1.3 Journal

10.1.4 Invited talks

• George Giakkoupis, Simple efficient distributed processes on graphs, Keynote talk, 29th International Colloquium on Starutural Information and Communication Complexity (SIROCCO), Paderborn, Germany, Jun 28 2022.
• George Giakkoupis, Expanders via local edge flips in quasilinear time, 2nd Workshop Complexity and Algorithms (CoA), The Henri Poincare Institute (IHP), Paris, France, Sep. 27 2022.
• François Taïani, Asynchronous Byzantine Reliable Broadcast With a Message Adversary, Invited Talk, EPFL (Lausanne, Switzerland), 31 May 2022.
• Djob Mvondo, Towards enhanced performance and energy savings for new Cloud services, NEC Europe Laboratories, Heidelberg, Germany, 21 September 2022.
• David Bromberg, Major Android Safety Breach, Beware of your Android, Invited talk, University of Yaoundé 1, Cameroon, June 2022.
• David Bromberg, Major Android Safety Breach, Beware of your Android, Invited talk, University of Dshang, Cameroon, June 2022.
• David Bromberg, Major Android Safety Breach, Beware of your Android, Invited talk, University of Bordeaux, France, November 2022.
• David Bromberg, Odile : A scalable tracing tool for non-rooted and off-the-shelf Android phones, Invited talk, University of Yaoundé 1, Cameroon, November 2022.
• Davide Frey, Asynchronous Byzantine Reliable Broadcast With a Message Adversary, Invited Talk, University of Sydney, Australia, July 2022.
• Davide Frey, Donar: Anonymous VoIP over Tor, Invited Talk, KU Leuven, Belgium, October 2022.
• Mathieu Gestin, Hidden Issuer Anonymous Credential, Invited Talk, University of Sydney, Australia, July 2022.
• Jade Garcia Bourée, From image to graph watermarks, Invited Talk, EPFL, Switzerland, July 2022.
• Erwan Le Merrer, Auditing and modeling the rabbit-hole effect in YouTube, Invited Talk, EPFL, Switzerland, September 2022.

10.1.5 Leadership within the scientific community

• Erwan Le Merrer co-organized the "Journée infrastructures pour la souveraineté numérique", November 22nd, in CNAM Paris.
• Erwan Le Merrer co-organized the SUPSEC workshop on AI for supervision, September 19/20, in Inria Rennes.
• François Taïani was the chair of the hiring committee for the position of Professeur des Universités at University of Rennes 1 - ESIR.
• David Bromberg was the chair of the hiring committee for the position of Professeur des Universités at University of Rennes 1 - ESIR.
• David Bromberg was member of the hiring committee for the position of Maître de conférences at University of Rennes 1 - ESIR.
• François Taïani served on the promotion committee for computer science (comité d'audition de repyramidage pour la section 27) of Université Grenoble Alpes (UGA).
• Djob Mvondo co-organized a hackathon on Unikraft at Lyon 14-15 May 2022.
• David Bromberg organized a hackathon on AI for Malware detection at Yaoundé, Cameroon 7-9 November 2022.

10.1.6 Scientific expertise

• George Giakkoupis reviewed a grant proposal for the Israel Science Foundation (ISF).
• François Taïani reviewed an ERC starting grant proposal for the European Research Council.
• David Bromberg is an expert for the ministry of higher education and research concerning the French Research Tax Credit (CIR).
• Davide Frey was a project reviewer for the ANR and for the National Science Center of Poland

10.1.7 Research administration

• Erwan Le Merrer has served on the scientific board of Inria's REGALIA since 2021.
• Erwan Le Merrer has served on the administrative board of the Société Informatique de France since 2019.
• François Taïani served on the panel of the ARED programme (Allocations de Recherche Doctorale) of the region Brittany.
• François Taïani has served as Career Advice Person, (Référent conseil-parcours professionel chercheurs) for IRISA/Inria Rennes Bretagne Atlantique since 2019.
• David Bromberg has led the IRISA department (D1) entitled large scale distributed systems since 2021.
• David Bromberg has served on the administrative board of the Société Informatique de France since 2022.

10.2.1 Teaching

• Bachelor: George Giakkoupis, Distributed Algorithms, 10h, L3 parcours SI, ISTIC, ENS Rennes, France.
• Master: Barbe Thystere Mvondo Djob, Network and Security for IOT, 45h, ESIR M1, Rennes, France
• Master: Barbe Thystere Mvondo Djob, FabLab for IOT, 30h, ESIR, M1, Rennes, France
• Master: Barbe Thystere Mvondo Djob, Cloud Computing for IOT, 45h, ESIR M2, Rennes, France
• Engineering School: David Bromberg, FabLab for IOT, 30h, ESIR, M1, Rennes, France
• Engineering School: David Bromberg, Web for IOT, 45h, ESIR, M1, Rennes, France
• Master: Erwan Le Merrer, Network Science, 10h, ESIR Rennes, France.
• Engineering School: François Taïani, Synchronization and Parallel Programming, 30h, 2nd year of Engineering School (M1), ESIR / U. Rennes I, France.
• Engineering School: François Taïani, Distributed Systems, 12h, 3rd year of Engineering School (M2), ESIR / U. Rennes I, France.
• Engineering School: François Taïani, Introduction to Operating Systems, 24h, 1st year of Engineering School (L3), ESIR / U. Rennes I, France.
• Master: Davide Frey, Scalable Distributed Systems, 10h, M1, EIT/ICT Labs Master School, U. Rennes I, France.
• ENS L3 : Davide Frey, Distributed Algorithms, 11h, ENS Rennes, France.
• Master: Davide Frey, Cloud Computing, 12h, M2-MIAGE, U. Rennes I, France.
• Master: Davide Frey, Distributed Systems/Systèmes Répartis, 21h, ENSAI, France.
• Master: Davide Frey, Apprentice Tutoring, 16h ETD, M2 Alternance U. Rennes I, France.
• Engineering School: François Taïani, Synchronization and Parallel Programming, 30h, 2nd year of Engineering School (M1), ESIR / U. Rennes I, France.
• Engineering School: François Taïani, Distributed Systems, 12h, 3rd year of Engineering School (M2), ESIR / U. Rennes I, France.
• Engineering School: François Taïani, Introduction to Operating Systems, 24h, 1st year of Engineering School (L3), ESIR / U. Rennes I, France.

10.2.2 Supervision

• PhD in progress: Thibault Maho, On the security of neural networks, started in 2020, supervised by Erwan Le Merrer and Teddy Furon (Linkmedia team).
• PhD in progress: Jade Garcia Bourrée, “Trust but verify”: bot-driven audits of AI systems, started in October 2022, supervised by Erwan Le Merrer and Gilles Trédan (LAAS/CNRS).
• PhD in progress: Augustin Godinot, Auditing the mutations of AI-models, started on November 2022, supervised by Erwan Le Merrer, Gilles Trédan (LAAS/CNRS) François Taïani and Camilla Penzo (PEReN).
• PhD in progress: Cesaire Honoré, Scheduling in heterogeneous architectures, started on December 2022, supervised by Yerom-David Bromberg and Djob Mvondo
• PhD in progress: Timothé Albouy, Towards Lightweight Scalable and Open Byzantine-Fault-Tolerant Distributed Objects, U. Rennes I, supervised by François Taïani and Davide Frey, started on Oct 18 2021.
• PhD in progress: Arthur Rauch, Frugal and Legal for Future Blockchain, Inria Rennes, supervised by Emmanuelle Anceaume and Davide Frey, started on Oct 1 2021.
• PhD in progress: Mathieu Gestin, Private Authenticated Storage for Online Services, Inria Rennes, supervised by Davide Frey, started on Oct 1 2021.
• Supervision of engineer Ali Yesilkanat, for developing audits of rabbit-holes on YouTube.
• Supervision of engineer Muhammed Selcuk Kok, for developing predictions of the rate of unemployment, in collaboration with Pôle Emploi.

10.2.3 Juries

• François Taïani was chairman for the PhD thesis of Pierre Jeanjean: IDE as Code, U. Rennes 1, April 29 2022.
• François Taïani was external reviewer for the PhD thesis of Arsany Guirguis: System Support for Robust Distributed Learning, EPFL (Switzerland), June 1 2022.
• David Bromberg was external reviewer for the PhD thesis of Brice Ekane Apah: Input-Output optimization in multi-tiers architectures, Grenoble (France), December 8 2022.
• David Bromberg was external reviewer for the PhD thesis of Moubarak ZOURE: Verification of anomalies in NFV-based network services outsourced to the cloud, March 18 2022.
• Davide Frey was external reviewer for the PhD thesis of Alejandro Ranchal Pedrosa, The Blockchain of Oz: Specifying Blockchain Failures for Scalable Protocols Offering Unprecedented Safety and Decentralization, University of Sydney.
• Davide Frey was external reviewer for the PhD thesis of Matthieu Nicolas, Ré-identification sans coordination dans les types de données répliquées sans conflits (CRDTs), December 20, 2022.

10.3.1 Internal or external Inria responsibilities

• Erwan Le Merrer is at the scientific board of the REGALIA pilot project.

10.3.2 Articles and contents

• Erwan Le Merrer was interviewed for an article in The conversation: "Peut-on faire des sondages politiques avec YouTube ?", July 5th 2022.
• Erwan Le Merrer wrote an article in Binaire (blog Le Monde): "Le recommandeur de Youtube et les sondages électoraux", July 5th 2022.
• Erwan Le Merrer was interviewed for an article in the Inria's intranet: "Quand la campagne présidentielle inspire les scientifiques", June 30th 2022.

10.3.3 Interventions

• Erwan Le Merrer was interviewed for a video in Le Media TV, "L'élection approche, la guerre de l'information fait rage | Contre-matinale 117", March 29th 2022.

International journals

• 11 articleD.Daniel Bosk, D.Davide Frey, M.Mathieu Gestin and G.Guillaume Piolle. Hidden Issuer Anonymous Credential.Proceedings on Privacy Enhancing Technologies2022June 2022, 571 - 607
  HALDOIback to textback to text
• 12 articleR.-A.Ronan-Alexandre Cherrueau, M.Marie Delavergne, A.Alexandre van Kempen, A.Adrien Lebre, D.Dimitri Pertin, J.Javier Rojas Balderrama, A.Anthony Simonet and M.Matthieu Simonin. EnosLib: A Library for Experiment-Driven Research in Distributed Computing.IEEE Transactions on Parallel and Distributed Systems336June 2022, 1464-1477
  HALDOI
• 13 articleG.Georgios Damaskinos, R.Rachid Guerraoui, A.-M.Anne-Marie Kermarrec, V.Vlad Nitu, R.Rhicheek Patra and F.Francois Taiani. FLeet: Online Federated Learning via Staleness Awareness and Performance Prediction.ACM Transactions on Intelligent Systems and Technology135October 2022, 1-30
  HALDOI
• 14 articleC.Carole Delporte, H.Hugues Fauconnier, S.Sergio Rajsbaum and M.Michel Raynal. Distributed computability: Relating k-immediate snapshot and x-set agreement.Information and Computation285May 2022, 104815
  HALDOIback to text
• 15 articleA.Anaïs Durand, M.Michel Raynal and G.Gadi Taubenfeld. Contention-related crash failures: Definitions, agreement algorithms, and impossibility results.Theoretical Computer Science909March 2022, 76-86
  HALDOIback to text
• 16 articleD.Davide Frey, A.Achour Mostefaoui, M.Matthieu Perrin, P.-L.Pierre-Louis Roman and F.Francois Taiani. Differentiated consistency for worldwide gossips.IEEE Transactions on Parallel and Distributed Systems341September 2022, 1-15
  HALDOI
• 17 articleM.Michel Raynal and G.Gadi Taubenfeld. A visit to mutual exclusion in seven dates.Theoretical Computer Science919June 2022, 47-65
  HALDOIback to text

International peer-reviewed conferences

• 18 inproceedingsT.Timothé Albouy, D.Davide Frey, M.Michel Raynal and F.François Taïani. A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary.OPODIS 2022 - 26th Conference on Principles of Distributed SystemsBrussels, BelgiumDecember 2022, 1-44
  HALback to text
• 19 inproceedingsT.Timothé Albouy, D.Davide Frey, M.Michel Raynal and F.François Taïani. Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case.DISC 2022 - 36th International Symposium on Distributed ComputingAugusta, GA, United StatesOctober 2022
  HALDOIback to text
• 20 inproceedingsY.-D.Yérom-David Bromberg, Q.Quentin Dufour, D.Davide Frey and E.Etienne Rivière. Donar: Anonymous VoIP over Tor.NSDI 2022 - 19th USENIX Symposium on Networked Systems Design and ImplementationRENTON, WA, United StatesApril 2022, 1-17
  HALback to text
• 21 inproceedingsC.Carole Delporte-Gallet, H.Hugues Fauconnier, M.Michel Raynal and M.Mouna Safir. Optimal Algorithms for Synchronous Byzantine k-Set Agreement.SSS 2022 - 24th International Symposium on Stabilizing, Safety, and Security of Distributed SystemsLNCS -13751Lecture Notes in Computer ScienceClermont-Ferrand, FranceSpringer International PublishingNovember 2022, 178-192
  HALDOIback to text
• 22 inproceedingsA.Anaïs Durand, M.Michel Raynal and G.Gadi Taubenfeld. Reaching Consensus in the Presence of Contention-Related Crash Failures.Lecture Notes in Computer ScienceSSS 2022 - 24th International Symposium on Stabilization, Safety, and Security of Distributed SystemsLNCS-13751Stabilization, Safety, and Security of Distributed SystemsClermont-Ferrand, FranceSpringer International PublishingNovember 2022, 193-205
  HALDOIback to text
• 23 inproceedingsG.George Giakkoupis. Expanders via local edge flips in quasilinear time.STOC 2022 - 54th Annual ACM SIGACT Symposium on Theory of ComputingRome, ItalyACMMay 2022, 64-76
  HALDOIback to text
• 24 inproceedingsT.Thibault Maho, T.Teddy Furon and E.Erwan Le Merrer. FBI: Fingerprinting models with Benign Inputs.CAID 2022 - Conference on Artificial Intelligence for DefenseActes de la 4ème Conference on Artificial Intelligence for Defense (CAID 2022)Rennes, FranceNovember 2022
  HAL
• 25 inproceedingsT.Thibault Maho, T.Teddy Furon and E.Erwan Le Merrer. Randomized Smoothing under Attack: How Good is it in Pratice?ICASSP 2022 - IEEE International Conference on Acoustics, Speech and Signal ProcessingSingapore, SingaporeIEEEMay 2022, 1-5
  HALback to text
• 26 inproceedingsM.Matthieu Pigaglio, J.Joachim Bruneau-Queyreix, Y.-D.Yérom-David Bromberg, D.Davide Frey, E.Etienne Rivière and L.Laurent Réveillère. RAPTEE: Leveraging trusted execution environments for Byzantine-tolerant peer sampling services.ICDCS 2022 - 42nd IEEE International Conference on Distributed Computing SystemsBologna, ItalyIEEEJuly 2022, 1-11
  HALback to text
• 27 inproceedingsA.Arthur Rauch, Q.Quentin Bramas, S.Stéphane Devismes, P.Pascal Lafourcade and A.Anissa Lamani. Exploration perpétuelle : ça s'en va et ça revient.AlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des TélécommunicationsSaint-Rémy-Lès-Chevreuse, FranceMay 2022, 1-4
  HALDOI

Conferences without proceedings

• 28 inproceedingsD.Djob Mvondo, A.Antonio Barbalace, J.-P.Jean-Pierre Lozi and G.Gilles Muller. Towards User-Programmable Schedulers in the Operating System Kernel.SPMA 22 - 11th workshop on Systems for Post-Moore ArchitecturesRennes, FranceApril 2022, 1-4
  HAL

Scientific book chapters

• 29 inbookR.Romaric Duvignau, M.Michel Raynal and E.Elad Schiller. Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast.13751Stabilization, Safety, and Security of Distributed SystemsLecture Notes in Computer ScienceSpringer International PublishingNovember 2022, 206-221
  HALDOIback to text
• 30 inbookD.Damien Imbs, M.Michel Raynal and G.Gadi Taubenfeld. Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms.13298Structural Information and Communication ComplexityLecture Notes in Computer ScienceSpringer International PublishingJune 2022, 174-190
  HALDOIback to text

Reports & preprints

• 31 miscT.Timothé Albouy, D.Davide Frey, M.Michel Raynal and F.François Taïani. Asynchronous Byzantine Reliable Broadcast With a Message Adversary.May 2022
  HAL
• 32 miscD.Davide Frey, M.Michel Raynal, F.François Taïani and T.Timothé Albouy. A Modular Approach to Construct Signature-Free BRB Algorithms under a Message Adversary.November 2022
  HAL
• 33 misc M. S.Muhammed Selcuk Kok. Is Okun's law still valid in France? May 2022
  HAL
• 34 miscE.Erwan Le Merrer, R.Ronan Pons and G.Gilles Trédan. Algorithmic audits of algorithms, and the law.February 2022
  HAL
• 35 miscE.Erwan Le Merrer and G.Gilles Trédan. Qu’est ce qu’un algorithme en boîte noire ? Tractatus des décisions algorithmiques.2022
  HAL
• 36 miscE.Erwan Le Merrer and G.Gilles Trédan. Surfing Personalization for Quantifying the Rabbit Hole Phenomenon on YouTube.March 2022
  HAL
• 37 reportE.Erwan Le Merrer, G.Gilles Trédan and A.Ali Yesilkanat. YouTube Recommendations Do Predict Polls: A note on the 2022 French presidential election.Rapport LAAS n° 22136InriaApril 2022
  HAL

Other scientific publications

• 38 inproceedingsA.Andrea Clementi, G.George Giakkoupis, E.Emanuele Natale and F.Francesco d'Amore. Search via Parallel Lévy Walks on $Z^2$.HALG 2022 - Highlights of AlgorithmsLondon, United KingdomJune 2022, 1-13
  HAL

Scientific popularization

• 39 bookE.Erwan Le Merrer and G.Gilles Trédan. What is a black box algorithm?: Tractatus of algorithmic decision-making.2023
  HAL