|Liangfeng Zhang, Assistant Professor|
Cryptographic protocols design, secure multiparty computation, cloud computing security
Dr. Liangfeng Zhang received his bachelor and master degrees in applied mathematics from Tongji University and Shanghai Jiao Tong University, respectively. He received his PhD degree in cryptography and information security from Nanyang Technological University. He has been a postdoctoral fellow at the Department of Computer Science, University of Calgary, Canada. His research focuses on cryptography and coding theory. He joined the School of Information Science and Technology at ShanghaiTech University as an assistant professor, PI in March, 2015. He has been an invited reviewer of “Mathematical Reviews” (AMS) since 2016. After joining ShanghaiTech, his research is mainly on cloud computing security, which was funded by the National Natural Science Foundation of China and Shanghai Pujiang Talent Program.
Chen Xin, Liang Feng Zhang, “Two-server delegation of computation on label-encrypted data”, IEEE Transactions on Cloud Computing, to appear, 2019.
Go Ohtake, Reihaneh Safavi-Naini, Liang Feng Zhang, “Outsourcing scheme of ABE encryption secure against malicious adversary”, Computers & Security, to appear, 2019.
Liang Feng Zhang, Reihaneh Safavi-Naini, “Batch verifiable computation of outsourced functions”, Designs, Codes and Cryptography, vol. 77, no. 2-3, pp. 563-585, 2015.
Liang Feng Zhang, Reihaneh Safavi-Naini, “Batch verifiable computation of polynomials on outsourced data”, in Proceedings of the 20th European Symposium on Research in Computer Security (ESORICS 2015), LNCS 9327, pp. 167-185, 2015.
Liang Feng Zhang, “A coding-theoretic application of Baranyai’s theorem”, IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 6988-6992, 2014.
Liang Feng Zhang, Reihaneh Safavi-Naini, “Verifiable delegation of computations with storage-verification trade-off”, in Proceedings of the 19th European Symposium on Research in Computer Security (ESORICS 2014), LNCS 8712, pp. 112-129, 2014.
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang, “Query-efficient locally decodable codes of subexponential length”, Computational Complexity, vol. 22, issue 1, pp. 159-189, 2013.
Yeow Meng Chee, San Ling, Huaxiong Wang, Liang Feng Zhang, “Upper bounds on matching families in Z_pq^n”, IEEE Transactions on Information Theory, vol. 59, no. 8, pp. 5131-5139, 2013.
Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang, “Communication-efficient distributed oblivious transfer”, Journal of Computer and System Sciences, vol. 78, pp. 1142-1157, 2012.