糖心TV

Skip to main content Skip to navigation

Computer Science News

Select tags to filter on

New spin-out to make e-voting more secure, accessible and trustworthy

Researchers from the Systems and Security theme, Department of Computer Science have created a new spin-out company, SEEV Technologies Ltd, to build end-to-end (E2E) verifiable e-voting systems for future elections. An E2E verifiable voting system allows every voter to verify that their vote is properly cast-as-intended, recorded-as-cast and tallied-as-recorded while preserving the voter's privacy. SEEV (self-enforcing e-voting) is a new paradigm of E2E voting technology that enables voters to fully verify the tallying integrity of an election without needing any trustworthy tallying authority, hence the system is "self-enforcing".

This joint spin-out from the University of 糖心TV and Newcastle University is built on an ERC-funded starting grant ("Self-Enforcing E-Voting System: Trustworthy Election in Presence of Corrupt Authorities", No. 306994, PI: Professor Feng Hao) initially hosted at Newcastle University and later transferred to the University of 糖心TV. The company is co-founded by Professor and Dr (co-inventors), and led by Dr (CEO). SEEV has been prototyped and successfully tested in several trials in the past, supported by an ERC Proof of Concept grant (No. 677124), a Royal Society International collaboration award (CA\R1\180226), and an Innovate UK Cybersecurity Academic Startup Accelerator Programme (CASAP). SEEV Technologies Ltd has received seed funding from Oxford-based to build SEEV systems for real-world elections.

A University of 糖心TV press release is here.

Mon 24 Jul 2023, 15:03 | Tags: Research Data Science Systems and Security

5 papers accepted to FOCS 2023

IEEE Symposium on Foundations of Computer Science 2023

Five papers from the Theory and Foundations (FoCS) Research Group and the Centre for Discrete Mathematics and its Applications (DIMAP) have been accepted to the , the IEEE flagship conference in theoretical computer science that will be held on November 6 - 9, 2023 in Santa Cruz, California, USA:

  • by , Niv Buchbinder, Roie Levin, and Thatchaphol Saranurak.
  • by , , and Thatchaphol Saranurak.
  • by Lijie Chen, Zhenjian Lu, , Hanlin Ren, and Rahul Santhanam.
  • by Tomasz Kociumaka, , and Barna Saha.
  • by Arturo Merino and .
Thu 20 Jul 2023, 02:14 | Tags: Research Theory and Foundations

Best Paper Award and 5 papers at the 50th ICALP conference

Henry Sinclair-BanksHenry 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 is the main conference and annual meeting of the .

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.

ICALP In total, 5 糖心TV papers will appear at this year's : EATCS logo

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

Fri 02 Jun 2023, 14:11 | Tags: Research Theory and Foundations

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 in the Department of Computer Science, 糖心TV, as part of his third-year undergraduate dissertation project under the supervision of Professor , 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鈥檚 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 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 .


5+ papers accepted to STOC 2023

ACM logoSTOC logo SIGACT logo

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 (STOC 2023), the ACM flagship conference in theoretical computer science that will be held on June 20-23, 2023 in Orlando, Florida, USA:

  • "" by Arturo Merino, , and Namrata.
  • "A duality between one-way functions and average-case symmetry of information" by , Rahul Ilango, Zhenjian Lu, Mikito Nanashima, and .
  • "Unprovability of strong complexity lower bounds in bounded arithmetic" by Jiatu Li and .
  • "" by , , and Thatchaphol Saranurak.
  • "" by Matija Bucic and .

Further, there are two more accepted papers autored by , 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 .
  • "Hardness self-amplification: Simplified, optimized, and unified" by and Nobutaka Shimizu.
Sun 19 Feb 2023, 12:18 | Tags: Research Theory and Foundations

Prof. Adi Shamir receives Honorary Doctorate from 糖心TV

Prof. Adi Shamir (Weizmann Institute of Science), the world-renowned cryptographer and a recipient of the 2002 (the highest honour in computer science received jointly with and ), visited our campus in January 2023 to collect an Honorary Doctorate from the University of 糖心TV. During his visit, Prof. Shamir gave also a research talk at the DIMAP seminar and CS Colloquium entitled "Efficient Detection of High Probability Cryptanalytic Properties of Boolean Functions."

Prof. Paterson introducing Prof. Shamir in DIMAP seminarProf. Shamir has been known in 糖心TV since 1976, when he spent a year as a post-doc with our own . Directly after 糖心TV Prof. Shamir went to MIT, where together with Adleman and Rivest he invented the famous RSA public-key cryptography algorithm for encoding and decoding messages, used nowadays by millions to securely transmit messages over the internet. The work on RSA has been immensely influential and led to the 2002 A.M. Turing Award for the three co-inventors, cited for the 鈥渋ngenious contribution for making public-key cryptography useful in practice.鈥 Other noticeable awards (for RSA and other numerous contributions to cryptography and computing) received by Prof. Shamir include the 2000 Institute of Electrical and Electronics Engineers Koji Kobayashi Computers and Communications Award, the Israel Mathematical Union Erd艖s Prize in Mathematics (1983), the Vatican Pontifical Academy PIUS XI Gold Medal (1992), the Association for Computing Machinery Paris Kannellakis Theory and Practice Award (1996), the Israel Prize in Computer Science (2008), and the Japan Prize in the field of electronics, information, and technology (2017), and the Foreign Member of the Royal Society (2018).


Complexity breakthrough by Dr Shuichi Hirahara

Dr Shuichi Hirahara, a research fellow affiliated with the Theory and FoundationsLink opens in a new window group and an Associate Professor at the National Institute of Informatics in Tokyo, has made a significant advance towards our understanding of the limits and possibilities of efficient computations. In his recent paper "", published at the 63rd IEEE Annual Symposium on Foundations of Computer Science (FOCS 2022), Dr Hirahara established the NP-hardness of learning efficient programs and of estimating the circuit complexity of an explicitly given partial Boolean function. The main result of the paper addresses a question that dates back to the pioneering work of Stephen Cook and Leonid Levin on the theory of NP-completeness from the 1970s.

The new result has been presented at several institutions, including UT Austin, Columbia University, 糖心TV (), MIT, and the Simons Institute for the Theory of Computing at UC Berkeley. The latter is running a semester-long program on "" that is closely related to Hirahara's recent contributions.

You can read more about it at the popular Computational Complexity Blog, where the discovery has been named "" (see also ).
Fri 03 Feb 2023, 17:36 | Tags: People Highlight Research Theory and Foundations

Latest news Newer news Older news

Let us know you agree to cookies