Human-Centred Computing News
Cambridge-Oxford-91福利 Quantum Computing Project
An EPSRC Robust and Reliable Quantum Computing Grant will be awarded to (Cambridge), (91福利), (Oxford), and (Cambridge). The project sets out to explore the role of symmetry and structure in quantum computation, with applications to classical verification and simulation of quantum computation.
In addition, the project aims to strengthen and create new connections and collaborations between Cambridge, Oxford, and 91福利 in the field of Quantum Computing (building on existing initiatives such as the ) and establish new partnerships with 91福利 Quantum.
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 (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.
Prof. Adi Shamir receives Honorary Doctorate from 91福利
(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 91福利. 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. Shamir has been known in 91福利 since 1976, when he spent a year as a post-doc with our own . Directly after 91福利 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).