I'm currently the research director at Shanghai Tree-Graph Blockchain Research Institute (Conflux), which is initiated by Fan Long and Andrew Yao.

Before joining Conflux, I was an assistant professor at Institute of Computing Technology (ICT), Chinese Academy of Sciences, after working as a postdoctoral researcher at Center for the Theory of Interactive Computation (CTIC), Aarhus University.

I finished my Ph.D on August 2015 and defended on December.

In graduate school, I read computer science and mathematics under the advising of Periklis A. Papakonstantinou in Institute for Theoretical Computer Science (a.k.a. IIIS, which is Turing Award winner Andrew Yao’s institute) at Tsinghua University.

Research Interests:

Blockchain, Foundations of Cryptography, Game Theory, and Streaming Computation.

Education:

Tsinghua University -- Institute for Interdisciplinary Information Sciences (IIIS)

September 2010 -- December 2015

Ph.D in Computer Science (advisor: Periklis A. Papakonstantinou)

Doctoral dissertation: Cryptography and Randomness Extraction in the Multi-Stream Model.

Tsinghua University -- Yao Class at Department of Computer Science and Technology

August 2006 -- July 2010

B.Eng. in Computer Science

Publications:

• Decentralized Asset Custody Scheme with Security against Rational Adversary. (with Zhaohua Chen). WINE 2021. [PDF(arXiv), link]

• A Decentralized Blockchain with High Throughput and Fast Confirmation. (with Chenxing Li, Peilun Li, Dong Zhou, Zhe Yang, Ming Wu, Wei Xu, Fan Long, and Andrew Chi-Chih Yao). USENIX ATC 2020. [PDF, link]

• Sharing Information with Competitors. (with Simina Brânzei and Claudio Orlandi). SAGT 2019. [PDF(arXiv), link]

• Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams. (with David Woodruff). ICALP 2019. [PDF(arXiv), link]

• Querying a Matrix Through Matrix-Vector Products. (with Xiaoming Sun, David Woodruff, and Jialin Zhang). ICALP 2019. [PDF(arXiv), link]

• True Randomness from Big Data. (with Periklis Papakonstantinou and David Woodruff). Scientific Reports, 6:33740, 2016.

• Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions. (with Benny Applebaum, Sergei Artemenko, and Ronen Shaltiel). Computational Complexity, 25(2), 349-418, 2016, Special issue for CCC 2015. [conference version (CCC'15), PDF(ECCC)]

• On the Power of Distance-Based Learning. (with Periklis Papakonstantinou and Jia Xu).
  ICML 2016. [PDF, link]

• Online Non-Preemptive Story Scheduling in Web Advertising. (with Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, and Bo Zheng). AAMAS 2016. [PDF]

• Online Posted-Price Mechanism with a Finite Time Horizon. (with Tao Qin, Li Xiao, and Bo Zheng). AAMAS 2016 short paper. [PDF]

• Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits. (with Yuval Ishai and Mor Weiss). TCC 2016-A. [PDF, PDF(full)]

• Cryptography with Streaming Algorithms. (with Periklis Papakonstantinou). CRYPTO 2014. [PDF, Presentation, CRYPTO '12 rump session slides]

• A remark on One-wayness versus Pseudorandomness. (with Periklis Papakonstantinou).
  COCOON 2012. [PDF (ECCC)]

• Reversing Longest Previous Factor Tables is Hard. (with Hongyu Liang and Jing He).
  WADS 2011. [DOI, PDF(full)]