The Warwick Postgraduate Colloquium in Computer Science (WPCCS) 2019 will be held on Monday, 9th December, in the Mathematical Sciences Building, University of Warwick. This is the final schedule. If there are any problems please get in touch with email@example.com immediately.
Posters on Display at Lunch
Guest Talk - Torsten Mutze - Origami and the mathematics behind it
In this talk we explore the mathematical and algorithmic theory behind the Japanese art of paper folding, illustrated with some beautiful models.
Guest Talk - Feng Hao - Tackling real-world security problems
Cryptography is a useful tool that often allows people to solve intuitively impossible problems with real-world impact. In this talk, I will present three examples from our previous research work. In the first example, I will show a technique that allows a user to anonymously send a veto message with untraceable origin even when all communication is under the strict surveillance, say by a big brother. In the second example, I will show a protocol that allows two remote users to establish a “high”- entropy session key from a “low”-entropy shared secret (password). The high-entropy session key can then be used for secure communication. In the third example, I will show a voting system that allows every voter to tally votes by themselves without needing any trusted tallying authority, while preserving the voter’s privacy. In each of these examples, cryptography is a key enabling technology that transforms the impossible to the possible.
Login to see student abstracts.