Privacy in population protocols with probabilistic scheduling

DOI10.1016/j.tcs.2024.114926MaRDI QIDQ6652458

James Aspnes, [[Person:6202213|Author name not available (Why is that?)]]

Publication date: 12 December 2024

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

zbMATH Keywords

population protocolsmobile ad-hoc networksinformation-theoretic privacy

Mathematics Subject Classification ID

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

Cites Work

• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• The knowledge complexity of interactive proof-systems
• How to Simulate It – A Tutorial on the Simulation Proof Technique
• Spreading Alerts Quietly and the Subgroup Escape Problem
• Message complexity of population protocols

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)