Tiantian Gong

📧 tiangong17@gmail.com

About

I am joining the College of Computing and Data Science, Nanyang Technological University as an Assistant Professor in September, 2026.

I was previously a Postdoc kindly hosted by Dr. Ittay Eyal at Technion and Dr. Fan Zhang at Yale.

I received Ph.D. in Computer Science from Purdue University in Fall 2024, kindly advised by Dr. Aniket Kate.

I received B.S. from Renmin University of China.

My research interests are in secure computation, drawing on techniques from cryptography, game theory, distributed systems, information theory, and coding theory.

📢 Openings

I am looking for PhD students, postdoctoral researchers, and research assistants to join my research group.

Our research aims to build the theoretical foundations and practical systems needed for secure and privacy-preserving distributed computation. We are currently interested in topics including:

Foundations of secure computation, including new cryptographic primitives, new perspectives on classical primitives, and fundamental lower and upper bounds.
Secure computation for emerging computer systems, including agentic AI, blockchain, cloud computing, and other distributed systems.

We welcome applicants with backgrounds in cryptography, theoretical computer science, security, distributed systems, mathematics, or other related areas. Curiosity, motivation, and the potential to tackle challenging research problems are more important than prior experience in particular areas. If you are interested in joining, please complete this form. If you have questions that are not covered by the form or would like to discuss a specific research idea, you are more than welcome to email me.

Conference publications

* indicates main contributors; otherwise alphabetical

V3rified: Revelation V.S. Non-Revelation Mechanisms for Decentralized Verifiable Computation. 📄 [FC26]

Athina Terzoglou, Tiantian Gong, Aniket Kate, Alexandros Psomas.

Disincentivize Collusion in Verifiable Secret Sharing. 📄 [Eurocrypt25]

Tiantian Gong, Hai Hoang Nguyen, Hemanta K. Maji, Aniket Kate.

Recover from Excessive Faults in BFT SMR. 📄 [USENIX Security25]

Tiantian Gong*, Gustavo Camilo, Kartik Nayak, Andrew Lewis-Pye, Aniket Kate.

Rational Secret Sharing with Competition. 📄 [FC25]

Tiantian Gong, Zeyu Liu.

The Case of FBA as a DEX Processing Model. [FC25]

Tiantian Gong*, Zeyu Liu, Aniket Kate.

More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR. 📄[talk] [S&P24]

Tiantian Gong*, Ryan Henry, Alexandros Psomas, Aniket Kate.

Front-Running Attack in Sharded Blockchains and Fair Cross-Shard Consensus. [NDSS24]

Jianting Zhang*, Wuhui Chen, Sifu Luo, Tiantian Gong, Zicong Hong, Aniket Kate.

FairPoS: Input Fairness in Permissionless Consensus. 📄 [AFT23]

James Chiang, Bernando David, Ittay Eyal, Tiantian Gong.

Towards Overcoming the Undercutting Problem. 📄[talk] [FC22]

Tiantian Gong*, Mohsen Minaei, Wenhai Sun, Aniket Kate.

OpenSquare: Decentralized Repeated Modular Squaring Service. 📄 [Erratum] [talk] [CCS21]

Sri AravindaKrishnan Thyagarajan*, Tiantian Gong*, Adithya Bhat, Aniket Kate, Dominique Schröder.

*Aravind designed the service protocol, and I designed the outsourcing mechanism ensuring decentralization and minimized client costs.

Talks

The Curious Case of Relaxed Honesty Assumption in Secure Distributed Computing.

Yale Applied Cryptography Lab Seminar, October 10, 2025.

Recover from Excessive Faults in BFT SMR.

USENIX Security 2025, August 14, 2025.

Disincentivize Collusion in Verifiable Secret Sharing.

Technion ceClub Seminar, July 22, 2026
UMass Amherst Theory Seminar, April 21, 2026.
8th Annual Yale Postdoc Symposium, June 8, 2025.
Eurocrypt 2025, May 5, 2025.

Rational Secret Sharing with Competition.

FC 2025, April 17, 2025.

The Case of FBA as a DEX Processing Model.

FC 2025, April 14, 2025.

More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR.

Workshop on Private Information Retrieval Systems at Privacy Enhancing Technologies Symposium, July 2024.
IEEE Symposium on Security & Privacy, May 23, 2024.

Deter Privacy-Targeted Collusion in Multi-Server PIR and VSS.

Technion, March 18, 2024.

FairPoS: Input Fairness in Permissionless Consensus.

Advances in Financial Technologies, October 24, 2023.

Order but Not Execute in Order.

Seminar organized by Dr. Christian Cachin, October 31, 2022.

Towards Overcoming the Undercutting Problem.

Financial Cryptography and Data Security 2022, May 1-7, 2022.
CMU winter series, Jan 27, 2021.

OpenSquare: Distributed Repeated Modular Squaring Service.

ACM CCS 2021, November 17, 2021.
Brave Research, November 17, 2021.

Academic services

listed in reverse chronological order

PC: S&P {2026, 2027}, FC {2025, 2026}, AsiaCCS 2026, ICDCS 2025, CryptoValley Conference 2025

Sub-review: Asiacrypt 2026, OSDI 2025, Usenix Security 2025, S&P {2020, 2023, 2024}, TCC 2024, CCS {2020, 2021, 2022}, CSF 2022, FC {2022, 2023, 2024}, ICDCS 2022, AFT 2022.

Google Sites

Report abuse