糖心TV

Our colleague Dr Claire Rocks achieved Senior Fellow (SFHEA) status through the dialogic route of 糖心TV鈥檚 Academic and Professional Pathway for Experienced Staff (APP EXP) programme. Her application was recognised by assessors as one of the strongest D3 submissions they had reviewed, demonstrating a sustained and significant record of educational leadership that extends well beyond her own teaching.

Claire鈥檚 work focuses on leading and influencing inclusive, evidence-informed approaches to assessment and curriculum design. She has played a central role in shaping teaching quality and learning culture across departmental, institutional, and sector contexts, including leading 糖心TV鈥檚 strand of the Inclusive Assessment in STEM project and contributing to institutional strategy through curriculum development and quality assurance processes.

Within the department, Claire has introduced collaborative structures such as module huddles and supported colleagues and students to work together to enhance clarity, consistency, and inclusivity in assessment practice. She has also strengthened pedagogic scholarship through establishing the Computer Science Education Research Group.

The panel particularly commended the scale, depth, and impact of Claire鈥檚 leadership, noting that elements of her work are already operating at a level associated with Principal Fellowship.

Many congratulations to Claire on this achievement and her continued commitment to advancing inclusive, high-quality teaching and learning!

New research from the University of 糖心TV and Fudan University identifies the hippocampus as a key brain system shaping emotional resilience to long-term pain.

In a recent work, visiting undergraduate student Yahel Manor and 糖心TV DCS researchers and addressed a fundamental question relevant to the security of cryptographic protocols.

The symmetry of information principle says that the amount of information that a sequence x of bits reveals about another sequence y is essentially the same in either direction. This is known to hold in an idealised world where computations can take an arbitrarily long time, as demonstrated by A. Kolmogorov and L. Levin in the 1970s. In contrast, modern cryptography is built around deliberate asymmetry—for example, functions of the form y = f(x) that are easy to compute but hard to invert (one-way functions).

The new work shows that, once one moves from the idealised setting of time-unbounded computations to the more realistic world of efficient, randomised computations (algorithms that must run quickly and may use randomness), this symmetry can fail in a strong and unconditional way. In other words, computational constraints can yield information asymmetry. In practical terms, this supports the intuition that information may not be extracted efficiently: knowing y = f(x) may not make x efficiently recoverable to the extent that an (ineffective) symmetry principle would suggest, even when x and y are closely related.

Earlier work formally tied an average-case form of this symmetry failure to the existence of one-way functions, the central primitive in cryptography. By proving new failures of symmetry of information, the authors provide concrete progress towards the computational asymmetry that underpins encryption, digital signatures, and many other cryptographic protocols.

This work will be presented at the 58th Annual ACM Symposium on Theory of Computing (STOC) in June 2026 in Salt Lake City, Utah, USA.

Failure of Symmetry of Information for Randomised Computations
Jinqiao Hu (University of 糖心TV); Yahel Manor (University of Haifa); Igor C. Oliveira (University of 糖心TV)

The paper describing this research is available .