| 2020 | ICALP | An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). | Andrew Chi-Chih Yao |
| 2020 | USENIX | A Decentralized Blockchain with High Throughput and Fast Confirmation. | Chenxing Li, Peilun Li, Dong Zhou, Zhe Yang, Ming Wu, Guang Yang, Wei Xu, Fan Long, Andrew Chi-Chih Yao |
| 2018 | SAGT | On Revenue Monotonicity in Combinatorial Auctions. | Andrew Chi-Chih Yao |
| 2015 | SODA | An | Andrew Chi-Chih Yao |
| 2013 | CCS | OAKE: a new family of implicitly authenticated diffie-hellman protocols. | Andrew Chi-Chih Yao, Yunlei Zhao |
| 2012 | TAMC | Quantum Computing: A Great Science in the Making. | Andrew Chi-Chih Yao |
| 2010 | ACNS | Deniable Internet Key Exchange. | Andrew Chi-Chih Yao, Yunlei Zhao |
| 2010 | ICALP | Concurrent Knowledge Extraction in the Public-Key Model. | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao |
| 2009 | FAW | Communication Complexity and Its Applications. | Andrew Chi-Chih Yao |
| 2008 | ASIACRYPT | Graph Design for Secure Multiparty Computation over Non-Abelian Groups. | Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary |
| 2008 | ASIACRYPT | Some Perspectives on Complexity-Based Cryptography. | Andrew Chi-Chih Yao |
| 2007 | TAMC | A Note on Universal Composable Zero Knowledge in Common Reference String Model. | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
| 2007 | TAMC | A Note on the Feasibility of Generalized Universal Composability. | Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao |
| 2006 | FOCS | On the Quantum Query Complexity of Local Search in Two and Three Dimensions. | Xiaoming Sun, Andrew Chi-Chih Yao |
| 2006 | TAMC | Recent Progress in Quantum Computational Complexity. | Andrew Chi-Chih Yao |
| 2005 | COCOON | Oblivious and Adaptive Strategies for the Majority and Plurality Problems. | Fan R. K. Chung, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao |
| 2005 | MFCS | On the Communication Complexity of Co-linearity Problems. | Andrew Chi-Chih Yao |
| 2004 | ESA | Fisher Equilibrium Price with a Class of Concave Utility Functions. | Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao |
| 2004 | ICALP | Dynamic Price Sequence and Incentive Compatibility (Extended Abstract). | Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao |
| 2004 | STOC | Graph entropy and quantum sorting problems. | Andrew Chi-Chih Yao |
| 2003 | ISAAC | Interactive Proofs for Quantum Computation. | Andrew Chi-Chih Yao |
| 2003 | STOC | On the power of quantum fingerprinting. | Andrew Chi-Chih Yao |
| 2001 | FOCS | Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity. | Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao |
| 2001 | STOC | Some perspective on computational complexity (abstract). | Andrew Chi-Chih Yao |
| 2000 | STOC | Quantum bit escrow. | Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao |
| 1998 | FOCS | Quantum Cryptography with Imperfect Apparatus. | Dominic Mayers, Andrew Chi-Chih Yao |
| 1997 | STOC | Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus. | Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao |
| 1996 | WG | Hypergraphs and Decision Trees (Abstract). | Andrew Chi-Chih Yao |
| 1995 | CPM | Dictionary Loop-Up with Small Errors. | Andrew Chi-Chih Yao, F. Frances Yao |
| 1995 | STOC | Security of quantum protocols against coherent measurements. | Andrew Chi-Chih Yao |
| 1994 | FOCS | A Lower Bound for the Monotone Depth of Connectivity | Andrew Chi-Chih Yao |
| 1994 | STOC | Decision tree complexity and Betti numbers. | Andrew Chi-Chih Yao |
| 1993 | FOCS | Quantum Circuit Complexity | Andrew Chi-Chih Yao |
| 1993 | WADS | Groups and Algebraic Complexity (Abstract). | Andrew Chi-Chih Yao |
| 1992 | FOCS | Algebraic Decision Trees and Euler Characteristics | Andrew Chi-Chih Yao |
| 1992 | STOC | Linear Decision Trees: Volume Estimates and Topological Bounds | Anders Bjrner, Lszl Lovsz, Andrew Chi-Chih Yao |
| 1991 | FCT | Recent Progress in Circuit and Communication Complexity (Abstract). | Andrew Chi-Chih Yao |
| 1991 | ICALP | Program Checkers for Probability Generation. | Sampath Kannan, Andrew Chi-Chih Yao |
| 1990 | FOCS | On ACC and Threshold Circuits | Andrew Chi-Chih Yao |
| 1990 | STOC | Coherent Functions and Program Checkers (Extended Abstract) | Andrew Chi-Chih Yao |
| 1989 | FOCS | Lower Bounds for Algebraic Computation Trees with Integer Inputs | Andrew Chi-Chih Yao |
| 1989 | STOC | On the Improbability of Reaching Byzantine Agreements (Preliminary Version) | Ronald L. Graham, Andrew Chi-Chih Yao |
| 1989 | STOC | Circuits and Local Computation | Andrew Chi-Chih Yao |
| 1988 | FOCS | Near-Optimal Time-Space Tradeoff for Element Distinctness | Andrew Chi-Chih Yao |
| 1987 | FOCS | Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract) | Andrew Chi-Chih Yao |
| 1986 | FOCS | How to Generate and Exchange Secrets (Extended Abstract) | Andrew Chi-Chih Yao |
| 1985 | FOCS | Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) | Andrew Chi-Chih Yao |
| 1985 | STOC | A General Approach to d-Dimensional Geometric Queries (Extended Abstract) | Andrew Chi-Chih Yao, F. Frances Yao |
| 1983 | FOCS | Lower Bounds by Probabilistic Arguments (Extended Abstract) | Andrew Chi-Chih Yao |
| 1983 | STOC | Strong Signature Schemes | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao |
| 1982 | CRYPTO | On Signatures and Authentication. | Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao |
| 1982 | FOCS | Theory and Applications of Trapdoor Functions (Extended Abstract) | Andrew Chi-Chih Yao |
| 1982 | FOCS | Protocols for Secure Computations (Extended Abstract) | Andrew Chi-Chih Yao |
| 1982 | STOC | Space-Time Tradeoff for Answering Range Queries (Extended Abstract) | Andrew Chi-Chih Yao |
| 1981 | FOCS | On the Security of Public Key Protocols (Extended Abstract) | Danny Dolev, Andrew Chi-Chih Yao |
| 1981 | STOC | On the Parallel Computation for the Knapsack Problem | Andrew Chi-Chih Yao |
| 1981 | STOC | The Entropic Limitations on VLSI Computations (Extended Abstract) | Andrew Chi-Chih Yao |
| 1979 | STOC | Some Complexity Questions Related to Distributive Computing (Preliminary Report) | Andrew Chi-Chih Yao |
| 1978 | FOCS | Should Tables Be Sorted? (Extended Abstract) | Andrew Chi-Chih Yao |
| 1978 | FOCS | On the Average-case Complexity of Selecting k-th Best | Andrew Chi-Chih Yao, F. Frances Yao |
| 1977 | FOCS | Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract) | Andrew Chi-Chih Yao |
| 1977 | STOC | An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem | Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest |
| 1976 | FOCS | k+1 Heads Are Better than k | Andrew Chi-Chih Yao, Ronald L. Rivest |
| 1976 | FOCS | The Complexity of Searching an Ordered Random Table (Extended Abstract) | Andrew Chi-Chih Yao, F. Frances Yao |
| 1976 | STOC | On the Average Behavior of Set Merging Algorithms (Extended Abstract) | Andrew Chi-Chih Yao |
| 1975 | FOCS | On the Complexity of Comparison Problems using Linear Functions (Preliminary Report) | Andrew Chi-Chih Yao |
| 1975 | STOC | On Computing the Minima of Quadratic Forms (Preliminary Report) | Andrew Chi-Chih Yao |
| 1974 | FOCS | Bounds on Selection Networks | Andrew Chi-Chih Yao |