The field of online voting and networks is moving towards a greater emphasis on security and transparency. Researchers are exploring new threats and vulnerabilities, such as inference attacks on encrypted online voting via traffic analysis, and developing mitigations to address these threats. The design of secure and transparent voting systems, including stateless and transparent voting machines, is also an area of active research. Additionally, the security of peer-to-peer networks, including resistance to Sybil attacks and routing attacks, is being investigated. Noteworthy papers in this area include: On the Number of Control Nodes of Threshold and XOR Boolean Networks, which derives theoretical insights into minimal interventions in networked systems. A Stateless Transparent Voting Machine, which describes a secure and accessible voting system. Approximating Electoral Control Problems, which establishes approximation algorithms for electoral control problems under various voting rules.