Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Taiani, Francois"'
Publikováno v:
2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS), Jul 2024, Jersey City, France. pp.139-150
Detecting and handling network partitions is a fundamental requirement of distributed systems. Although existing partition detection methods in arbitrary graphs tolerate unreliable networks, they either assume that all nodes are correct or that a lim
Externí odkaz:
http://arxiv.org/abs/2408.14814
Autor:
Albouy, Timothé, Anceaume, Emmanuelle, Frey, Davide, Gestin, Mathieu, Rauch, Arthur, Raynal, Michel, Taïani, François
This article introduces a new asynchronous Byzantine-tolerant asset transfer system (cryptocurrency) with three noteworthy properties: quasi-anonymity, lightness, and consensus-freedom. Quasi-anonymity means no information is leaked regarding the rec
Externí odkaz:
http://arxiv.org/abs/2405.18072
Batch normalization has proven to be a very beneficial mechanism to accelerate the training and improve the accuracy of deep neural networks in centralized environments. Yet, the scheme faces significant challenges in federated learning, especially u
Externí odkaz:
http://arxiv.org/abs/2405.14670
Autor:
Biswas, Sayan, Frey, Davide, Gaudel, Romaric, Kermarrec, Anne-Marie, Lerévérend, Dimitri, Pires, Rafael, Sharma, Rishi, Taïani, François
This paper introduces ZIP-DL, a novel privacy-aware decentralized learning (DL) algorithm that exploits correlated noise to provide strong privacy protection against a local adversary while yielding efficient convergence guarantees for a low communic
Externí odkaz:
http://arxiv.org/abs/2403.11795
Publikováno v:
2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML)
Auditors need robust methods to assess the compliance of web platforms with the law. However, since they hardly ever have access to the algorithm, implementation, or training data used by a platform, the problem is harder than a simple metric estimat
Externí odkaz:
http://arxiv.org/abs/2402.09043
Autor:
Albouy, Timothé, Frey, Davide, Gelles, Ran, Hazay, Carmit, Raynal, Michel, Schiller, Elad Michael, Taïani, François, Zikas, Vassilis
We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary that can drop some of the messages sent by correct (non-faulty) nodes.
Externí odkaz:
http://arxiv.org/abs/2312.16253
This paper explores the territory that lies between best-effort Byzantine-Fault-Tolerant Conflict-free Replicated Data Types (BFT CRDTs) and totally ordered distributed ledgers, such as those implemented by Blockchains. It formally characterizes a no
Externí odkaz:
http://arxiv.org/abs/2311.13936
As shown by Reliable Broadcast and Consensus, cooperation among a set of independent computing entities (sequential processes) is a central issue in distributed computing. Considering $n$-process asynchronous message-passing systems where some proces
Externí odkaz:
http://arxiv.org/abs/2311.08776
This paper 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. This time plays a crucial role in the performance of practical distri
Externí odkaz:
http://arxiv.org/abs/2303.05152
This paper considers the problem of reliable broadcast in asynchronous authenticated systems, in which n processes communicate using signed messages and up to t processes may behave arbitrarily (Byzantine processes). In addition, for each message m b
Externí odkaz:
http://arxiv.org/abs/2205.09992