His thesis is on “Flow Table Security” where he formulated a novel inference problem called Adversarial Cache Inference problem about probing, inferring, and attacking a flow table (modeled as a cache) from one or a set of compromised host(s). The work has been accepted to INFOCOM’20 and the long version is under submission to IEEE/ACM Transactions on Networking. Congratulations, Mingli!