In a recent Scientific American article, a paper on zero-knowledge proofs by computational complexity theorist Rahul Ilango, Member in the School of Mathematics, was described as “the most creative and most consequential paper in the field [...] at least in the past decade.”
