Visit ShanghaiTech University | 中文 | How to find us
HOME> People> Faculty
Prof. Liangfeng Zhang / 张良峰 助理教授、研究员

Tel:  (021)54207362
Email: zhanglf@shanghaitech.edu.cn
Office: Room 1A-504D, SIST Building, No.393 Huaxia Middle Road, Pudong Area Shanghai
Major: CS
Website: http://sist.shanghaitech.edu.cn/faculty/zhanglf/
Liangfeng Zhang Research Group Recruitment (Click Here)

RESEARCH INTERESTS

  • Modern Cryptography: Private Information Retrieval, Verifiable Computation, Secure Multi-Party Computation
  • Algebraic Coding Theory: Locally Decodable Codes

BIOGRAPHY

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 in 2012. Since 2012 he has been a postdoctoral fellow at the Department of Computer Science, University of Calgary. His main research interests include modern cryptography and algebraic coding theory. He joined the School of Information Science and Technology at ShanghaiTech University as an assistant professor, PI in March, 2015.

SELECTED PUBLICATIONS

1. L.F. Zhang, R. Safavi-Naini: Batch verifiable computation of outsourced functions, Designs, Codes and Cryptography, 2015.
2. L.F. Zhang, R. Safavi-Naini: Batch verifiable computation of polynomials on outsourced data, ESORICS 2015. 
3. Liang Feng Zhang and Reihaneh Safavi-Naini, "Verifiable Delegation of Computations with Storage-Verification Trade-off," Proceedings of the 19th European Symposium on Research in Computer Security (ESORICS 2014), LNCS 8712, pp. 112-129, 2014. 
4. Liang Feng Zhang and Reihaneh Safavi-Naini, "Verifiable Multi-Server Private Information Retrieval," Proceedings of the 12th International Conference on Applied Cryptography and Network Security (ACNS 2014), LNCS 8479, pp. 62-79, 2014. 
5. Liang Feng Zhang, "A Coding-Theoretic Application of Baranyai’s Theorem," IEEE Transactions on Information Theory, Vol. 60, No. 11, pp. 6988-6992, 2014. 
6. Yeow Meng Chee, San Ling, Huaxiong Wang, and 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.
7. Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, and Liang Feng Zhang, "Query-Efficient Locally Decodable Codes of Subexponential Length," Computational Complexity, Vol. 22, Issue 1, pp. 159-189, 2013.