Henry Sinclair-Banks, a PhD student in the the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP), has won a Best Paper Award at ICALP 2023, the 50th EATCS International Colloquium on Automata, Languages and Programming. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS).

Henry's paper, co-authored with researchers from Germany and Poland: Marvin Künnemann, Filip Mazowiecki, Lia Schütze, and Karol Węgrzycki, addresses the coverability problem in vector addition systems (VASS), a well-known model of concurrent systems. Coverability is an algorithmic problem for the verification of "safety properties": whether the system always avoids a set of bad states. Henry and his co-authors determine how much time is required to solve this problem in the worst case. They develop an algorithm that improves upon the state of the art that has stood for forty years. They also prove that, in several settings, it is impossible to decide coverability substantially faster, unless there is also a faster algorithm for a classic problem such as Boolean satisfiability (SAT) and finding cycles of fixed length in graphs.

In total, 5 Warwick papers will appear at this year's ICALP:

• Michael Benedikt, Dmitry Chistikov, and Alessio Mansutti, "The complexity of Presburger arithmetic with power or powers",
• Sam Coy, Artur Czumaj, Peter Davies, and Gopinath Mishra, "Optimal (degree+1)-coloring in congested clique",
• Charilaos Efthymiou and Weiming Feng, "On the mixing time of Glauber dynamics for the hard-core and related models on G(n,d/n)",
• Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, and Karol Węgrzycki, "Coverability in VASS revisited: Improving Rackoff's bound to obtain conditional optimality",
• Konstantinos Zampetakis and Charilaos Efthymiou, "Broadcasting with random matrices".

This July's ICALP will be the 50th edition of the conference.

When you purchase an IP-based spy (hidden) camera for surveillance, are you aware that others may be spying on what you are watching? Recent research by Samuel Herodotou in the Department of Computer Science, Warwick, as part of his third-year undergraduate dissertation project under the supervision of Professor Feng Hao, has revealed a wide range of vulnerabilities of a generic camera module that has been used in many best-selling hidden cameras. Exploiting these vulnerabilities, an attacker may capture your hidden camera's video/audio streams from anywhere in the world, and furthermore, take complete control of the camera as a bot to attack other devices in your home network. To launch the attack, all the attacker needs to know is merely your hidden camera’s serial number. It is estimated that these vulnerabilities affect millions of hidden cameras, mostly sold in America, Europe and Asia. The (insecure) peer-to-peer network that is used by the affected cameras is also being used by 50 million IoT devices as a general communication platform. Hence, many millions of other IoT devices may also be affected. Researchers have responsibly disclosed findings to the manufacturers, and a CVE has already been assigned. Samuel will present this research work at the 17th International Conference on Network and System Security (Canterbury, UK, 14-16 August 2023). More details can be found in the paper.

The department would like to congratulate our 2021-2022 MSc students on their end-of-year results. Additional congratulations go to the following outstanding students, who have been awarded academic prizes:

	Herby Bowen - best overall graduating MSc student in Computer Science
	George Wright - best MSc dissertation in Computer Science entitled "Countering Antimicrobial Resistance with Machine Learning"
	Kartik Jain - best overall graduating MSc student in Data Analytics and best MSc dissertation in Data Analytics entitled "Football analytics: A novel approach to estimate success"

Two papers by members of Warwick Quantum were accepted to QIP 2023, the most prestigious conference in Quantum Computing and Quantum Information.

These works provide a methodology for boosting the power of quantum algorithms using deep mathematical tools from additive combinatorics, as well as provide the techniques, tools, and abstractions necessary to answer when classical zero-knowledge protocols remain secure against quantum attacks.

• "Quantum Worst-Case to Average-Case Reductions for All Linear Problems" by Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, and Sathyawageeswar Subramanian.
• "Post-Quantum Zero Knowledge, Revisited" by Alex Lombardi, Fermi Ma and Nicholas Spooner.