| 2025 | CRYPTO | State Machine Replication Among Strangers, Fast and Self-sufficient. | Juan A. Garay, Aggelos Kiayias, Yu Shen |
| 2024 | ASIACRYPT | Improved Quantum Lifting by Coherent Measure-and-Reprogram. | Alexandru Cojocaru, Juan A. Garay, Qipeng Liu, Fang Song |
| 2024 | ASIACRYPT | Generalized Hybrid Search with Applications to Blockchains and Hash Function Security. | Alexandru Cojocaru, Juan A. Garay, Fang Song |
| 2024 | CRYPTO | Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. | Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos |
| 2024 | EuroCrypt | Proof-of-Work-Based Consensus in Expected-Constant Time. | Juan A. Garay, Aggelos Kiayias, Yu Shen |
| 2024 | TCC | Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC. | Nishanth Chandran, Juan A. Garay, Ankit Kumar Misra, Rafail Ostrovsky, Vassilis Zikas |
| 2023 | CRYPTO | Completeness Theorems for Adaptively Secure Broadcast. | Ran Cohen, Juan A. Garay, Vassilis Zikas |
| 2023 | TCC | Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. | Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas |
| 2022 | TCC | Permissionless Clock Synchronization with Public Setup. | Juan A. Garay, Aggelos Kiayias, Yu Shen |
| 2021 | AFT | On Bitcoin cash's target recalculation functions. | Juan A. Garay, Yu Shen |
| 2020 | EuroCrypt | Broadcast-Optimal Two-Round MPC. | Ran Cohen, Juan A. Garay, Vassilis Zikas |
| 2020 | EuroCrypt | Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. | Juan A. Garay, Aggelos Kiayias, Rafail M. Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas |
| 2020 | TCC | Blockchains from Non-idealized Hash Functions. | Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos |
| 2018 | EuroCrypt | But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. | Christian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas |
| 2018 | PKC | Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. | Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos |
| 2017 | CCS | Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. | Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala |
| 2017 | CRYPTO | The Price of Low Communication in Secure Multi-party Computation. | Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas |
| 2017 | CRYPTO | The Bitcoin Backbone Protocol with Chains of Variable Difficulty. | Juan A. Garay, Aggelos Kiayias, Nikos Leonardos |
| 2017 | ICALP | Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. | Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2017 | PODC | Brief Announcement: Secure Self-Stabilizing Computation. | Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung |
| 2016 | ASIACRYPT | Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions. | Sandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas |
| 2016 | CRYPTO | Probabilistic Termination and Composability of Cryptographic Protocols. | Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2016 | SCN | On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. | Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung |
| 2015 | EuroCrypt | The Bitcoin Backbone Protocol: Analysis and Applications. | Juan A. Garay, Aggelos Kiayias, Nikos Leonardos |
| 2015 | OPODIS | Blockchain-Based Consensus (Keynote). | Juan A. Garay |
| 2015 | PODC | How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality. | Juan A. Garay, Jonathan Katz, Bjrn Tackmann, Vassilis Zikas |
| 2015 | TCC | A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. | Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung |
| 2014 | EuroCrypt | On the Complexity of UC Commitments. | Juan A. Garay, Yuval Ishai, Ranjit Kumaresan, Hoeteck Wee |
| 2014 | PODC | Fast and unconditionally secure anonymous channel. | Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov |
| 2014 | SCN | EyeDecrypt - Private Interactions in Plain Sight. | Andrea G. Forte, Juan A. Garay, Trevor Jim, Yevgeniy Vahlis |
| 2013 | ACNS | Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). | Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky |
| 2013 | FOCS | Rational Protocol Design: Cryptography against Incentive-Driven Adversaries. | Juan A. Garay, Jonathan Katz, Ueli Maurer, Bjrn Tackmann, Vassilis Zikas |
| 2012 | ICALP | Edge Fault Tolerance on Sparse Networks. | Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky |
| 2011 | PODC | Adaptively secure broadcast, revisited. | Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou |
| 2010 | EuroCrypt | Secure Message Transmission with Small Public Discussion. | Juan A. Garay, Clint Givens, Rafail Ostrovsky |
| 2010 | ICALP | Improved Fault Tolerance and Secure Computation on Sparse Networks. | Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky |
| 2010 | PODC | Brief announcement: swarming secrets. | Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov |
| 2009 | CRYPTO | Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer. | Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou |
| 2008 | EuroCrypt | Almost-Everywhere Secure Computation. | Juan A. Garay, Rafail Ostrovsky |
| 2007 | FOCS | Round Complexity of Authenticated Broadcast with a Dishonest Majority. | Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky |
| 2007 | PKC | Practical and Secure Solutions for Integer Comparison. | Juan A. Garay, Berry Schoenmakers, Jos Villegas |
| 2007 | TCC | Towards Optimal and Efficient Perfectly Secure Message Transmission. | Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri |
| 2006 | CCS | Searchable symmetric encryption: improved definitions and efficient constructions. | Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky |
| 2006 | CCS | Software integrity protection using timed executable agents. | Juan A. Garay, Lorenz Huelsbergen |
| 2006 | TCC | Round-Optimal and Efficient Verifiable Secret Sharing. | Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan |
| 2006 | TCC | Resource Fairness and Composability of Cryptographic Protocols. | Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang |
| 2004 | TCC | Efficient and Universally Composable Committed Oblivious Transfer and Applications. | Juan A. Garay |
| 2003 | EuroCrypt | Strengthening Zero-Knowledge Protocols Using Signatures. | Juan A. Garay, Philip D. MacKenzie, Ke Yang |
| 2003 | FC | Timed Fair Exchange of Standard Signatures: [Extended Abstract]. | Juan A. Garay, Carl Pomerance |
| 2003 | PODC | Efficient player-optimal protocols for strong and differential consensus. | Matthias Fitzi, Juan A. Garay |
| 2002 | FC | Timed Release of Standard Digital Signatures. | Juan A. Garay, Markus Jakobsson |
| 2002 | INFOCOM | On-line Admission Control and Packet Scheduling with Interleaving. | Juan A. Garay, Joseph Naor, Blent Yener, Peng Zhao |
| 2001 | CRYPTO | Minimal Complete Primitives for Secure Multi-party Computation. | Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky |
| 2000 | CRYPTO | Long-Lived Broadcast Encryption. | Juan A. Garay, Jessica Staddon, Avishai Wool |
| 2000 | FOCS | Concurrent Oblivious Transfer. | Juan A. Garay, Philip D. MacKenzie |
| 2000 | Networking | Application-Independent End-to-End Security in Shared-Link Access Networks. | Jos Carlos Brustoloni, Juan A. Garay |
| 1999 | CRYPTO | Abuse-Free Optimistic Contract Signing. | Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie |
| 1999 | INFOCOM | Multicast Security: A Taxonomy and Some Efficient Constructions. | Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas |
| 1998 | ESA | Adaptability and the Usefulness of Hints (Extended Abstract). | Piotr Berman, Juan A. Garay |
| 1998 | EuroCrypt | Fast Batch Verification for Modular Exponentiation and Digital Signatures. | Mihir Bellare, Juan A. Garay, Tal Rabin |
| 1998 | LATIN | Batch Verification with Applications to Cryptography and Checking. | Mihir Bellare, Juan A. Garay, Tal Rabin |
| 1998 | SODA | Mutual Search (Extended Abstract). | Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitnyi |
| 1997 | PODC | Competing against Specialists. | Piotr Berman, Juan A. Garay |
| 1996 | PODC | Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. | Mihir Bellare, Juan A. Garay, Tal Rabin |
| 1996 | PODC | Fast, Long-Lived Renaming Improved and Simplified (Abstract). | Mark Moir, Juan A. Garay |
| 1995 | ESA | Adaptive Video on Demand. | Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg |
| 1995 | PODC | Long-Lived Renaming Made Fast. | Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir |
| 1995 | PODC | Securing the Internet (Abstract). | Pau-Chen Cheng, Juan A. Garay, Amir Herzberg, Hugo Krawczyk |
| 1994 | PODC | Adaptive Video on Demand. | Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg |
| 1993 | FOCS | A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) | Juan A. Garay, Shay Kutten, David Peleg |
| 1993 | STOC | Fully polynomial Byzantine agreement in t+1 rounds. | Juan A. Garay, Yoram Moses |
| 1992 | INFOCOM | Call Preemption in Communication Networks. | Juan A. Garay, Inder S. Gopal |
| 1989 | FOCS | Towards Optimal Distributed Consensus (Extended Abstract) | Piotr Berman, Juan A. Garay, Kenneth J. Perry |
| 1989 | ICALP | Asymptotically Optimal Distributed Consensus (Extended Abstract). | Piotr Berman, Juan A. Garay |
| 1989 | ICPP | Efficient Agreement on Bounded-Degree Networks. | Piotr Berman, Juan A. Garay |