Theory and Foundations News
Archive news content can be found here.
Best Paper Award and 5 papers at the 50th ICALP conference
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.
- 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.
Spying on the Spy: Security Analysis of Hidden Cameras
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.
5+ papers accepted to STOC 2023
Several papers from the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP) have been accepted to the 55th ACM SIGACT Symposium on Theory of Computing (STOC 2023), the ACM flagship conference in theoretical computer science that will be held on June 20-23, 2023 in Orlando, Florida, USA:
- "Kneser graphs are Hamiltonian" by Arturo Merino, Torsten Mütze, and Namrata.
- "A duality between one-way functions and average-case symmetry of information" by Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, and Igor C. Oliveira.
- "Unprovability of strong complexity lower bounds in bounded arithmetic" by Jiatu Li and Igor C. Oliveira.
- "Sublinear algorithms for (1.5+ϵ)-approximate matching" by Sayan Bhattacharya, Peter Kiss, and Thatchaphol Saranurak.
- "Towards the Erdős-Gallai cycle decomposition conjecture" by Matija Bucic and Richard Montgomery.
Further, there are two more accepted papers autored by Shuichi Hirahara, who was affiliated with the department and the FoCS group during the submission time, in Autumn 2022:
- "Capturing one-way functions via NP-hardness of meta-complexity" by Shuichi Hirahara.
- "Hardness self-amplification: Simplified, optimized, and unified" by Shuichi Hirahara and Nobutaka Shimizu.