How to spread adversarial nodes?

DOI10.1145/1060590.1060694MaRDI QIDQ3581458zbMATH OpenOpenAlexFDO

Authors Christian Scheideler

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1060590.1060694

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to dynamical systems and ergodic theory (37-04) Applications of dynamical systems (37Nxx) Computer system organization (68M99)

Recommendations

• Achieving adversarial robustness via sparsity
• Distributed Optimization Under Adversarial Nodes
• Understanding adversarial robustness via critical attacking route
• On the power of adversarial infections in networks
• Adversarial perturbations of deep neural networks
• VectorDefense: Vectorization as a Defense to Adversarial Examples
• Resilient Distributed Optimization Algorithm Against Adversarial Attacks

Cited in

(10)

• Robust random number generation for peer-to-peer systems
• A theoretical and empirical evaluation of an algorithm for self-healing computation
• Distributed agreement in dynamic peer-to-peer networks
• Towards worst-case churn resistant peer-to-peer systems
• Bankrupting Sybil despite churn
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Towards a universal approach for the finite departure problem in overlay networks
• Towards robust and efficient computation in dynamic peer-to-peer networks
• Robust overlays meet blockchains: on handling high churn and catastrophic failures
• Towards a scalable and robust DHT

This page was built for publication: How to spread adversarial nodes?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581458)