Privacy in population protocols with probabilistic scheduling

DOI10.1016/J.TCS.2024.114926MaRDI QIDQ6652458zbMATH OpenFDO

Authors James Aspnes

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114926

zbMATH Keywords

population protocolsmobile ad-hoc networksinformation-theoretic privacy

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14) Privacy of data (68P27)

Recommendations

• Secretive birds: privacy in population protocols
• Time-space trade-offs in population protocols for the majority problem
• Population protocols and related models
• Modular verification of protocol equivalence in the presence of randomness
• The Dynamics of Probabilistic Population Protocols

Cites work

• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• How to simulate it -- a tutorial on the simulation proof technique
• Message complexity of population protocols
• Spreading Alerts Quietly and the Subgroup Escape Problem
• The knowledge complexity of interactive proof-systems

This page was built for publication: Privacy in population protocols with probabilistic scheduling

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