Current students

Li Liu, PhD candidate
David R. Cheriton School of Computer Science

Following my previous seminar talk on embezzlement of entanglement, this talk introduces a more general version of the problem — self-embezzlement. Instead of embezzling a pair of entangled state from a catalyst, self-embezzlement aims to create two copies of the catalyst state using only local operators. 

Murray Dunne, Master’s candidate
David R. Cheriton School of Computer Science

Distributed, life-critical systems that bridge the gap between software and hardware are becoming an integral part of our everyday lives. From autonomous cars to smart electrical grids, such cyber-physical systems will soon be omnipresent. With this comes a corresponding increase in our vulnerability to cyber-attacks. Monitoring such systems to detect malicious actions is of critical importance. 

John P. Conley, Department of Economics
Vanderbilt University

Blockchains are distributed, immutable, append only, ledgers designed to make trustless interactions between anonymous agents feasible and safe. The ledgers are maintained by networks of independent nodes who process transactions and come to a consensus view of which are valid and how this affects the ledger state. The integrity of blockchain ledgers therefore depends on the incentives contained in the consensus protocols that are designed to make the validating nodes behave honestly.

Monday, November 26, 2018 10:30 am - 10:30 am EST (GMT -05:00)

Seminar • Cryptography, Security, and Privacy (CrySP) — Securing Cloud-assisted Services

N. Asokan, Department of Computer Science
Aalto University, Finland

All kinds of previously local services are being moved to cloud settings. While this is justified by the scalability and efficiency benefits of cloud-based services, it also raises new security and privacy challenges. Solving them by naive application of standard security/privacy techniques can conflict with other functional requirements. In this talk, I will outline some cloud-assisted services and the conflicts that arise while trying to secure these services.

Thomas Lidbetter, Master candidate
David R. Cheriton School of Computer Science

In this talk we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first topic lies in the intersection of automata theory and additive number theory.