Preliminary Analysis of Page Reference Strings of an Interactive System. - Juan A. Garay; Martin G. Kienzle; William H. Tetzlaff (Int. CMG Conference, 1985)

Analysis of Page-Reference Strings of an Interactive System. - Martin G. Kienzle; Juan A. Garay; William H. Tetzlaff (IBM J. Res. Dev., 1988)

Towards Optimal Distributed Consensus (Extended Abstract) - Piotr Berman; Juan A. Garay; Kenneth J. Perry (FOCS, 1989)

Asymptotically Optimal Distributed Consensus (Extended Abstract). - Piotr Berman; Juan A. Garay (ICALP, 1989)

Efficient Agreement on Bounded-Degree Networks. - Piotr Berman; Juan A. Garay (ICPP (1), 1989)

Analysis of Block-Paging Strategies. - William H. Tetzlaff; Martin G. Kienzle; Juan A. Garay (IBM J. Res. Dev., 1989)

Fast Consensus in Networks of Bounded Degree (Extended Abstract). - Piotr Berman; Juan A. Garay (WDAG, 1990)

Optimal Amortized Distributed Consensus (Extended Abstract). - Amotz Bar-Noy; Xiaotie Deng; Juan A. Garay; Tiko Kameda (WDAG, 1991)

Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). - Piotr Berman; Juan A. Garay (WDAG, 1991)

Call Preemption in Communication Networks. - Juan A. Garay; Inder S. Gopal (INFOCOM, 1992)

Optimal Early Stopping in Distributed Consensus (Extended Abstract). - Piotr Berman; Juan A. Garay; Kenneth J. Perry (WDAG, 1992)

A Continuum of Failure Models for Distributed Computing. - Juan A. Garay; Kenneth J. Perry (WDAG, 1992)

A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract) - Juan A. Garay; Shay Kutten; David Peleg (FOCS, 1993)

Randomized Distributed Agreement Revisited. - Piotr Berman; Juan A. Garay (FTCS, 1993)

Fully polynomial Byzantine agreement in t+1 rounds. - Juan A. Garay; Yoram Moses (STOC, 1993)

Fast Consensus in Networks of Bounded Degree. - Piotr Berman; Juan A. Garay (Distributed Comput., 1993)

Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. - Piotr Berman; Juan A. Garay (Math. Syst. Theory, 1993)

Adaptive Video on Demand. - Sudhanshu Aggarwal; Juan A. Garay; Amir Herzberg (PODC, 1994)

Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract). - Juan A. Garay (WDAG, 1994)

Optimal Resiliency against Mobile Faults. - Harry Buhrman; Juan A. Garay; Jaap-Henk Hoepman (FTCS, 1995)

Long-Lived Renaming Made Fast. - Harry Buhrman; Juan A. Garay; Jaap-Henk Hoepman; Mark Moir (PODC, 1995)

Securing the Internet (Abstract). - Pau-Chen Cheng; Juan A. Garay; Amir Herzberg; Hugo Krawczyk (PODC, 1995)

Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX. - Pau-Chen Cheng; Juan A. Garay; Amir Herzberg; Hugo Krawczyk (USENIX Security Symposium, 1995)

iKP - A Family of Secure Electronic Payment Protocols. - Mihir Bellare; Amir Herzberg; Michael Steiner 001; Gene Tsudik; Michael Waidner; Ralf C. Hauser; Juan A. Garay (USENIX Workshop on Electronic Commerce, 1995)

Optimal Amortized Distributed Consensus - Amotz Bar-Noy; Xiaotie Deng; Juan A. Garay; Tiko Kameda (Inf. Comput., 1995)

Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. - Mihir Bellare; Juan A. Garay; Tal Rabin (PODC, 1996)

Fast, Long-Lived Renaming Improved and Simplified (Abstract). - Mark Moir; Juan A. Garay (PODC, 1996)

Fast, Long-Lived Renaming Improved and Simplified. - Mark Moir; Juan A. Garay (WDAG, 1996)

Competing against Specialists. - Piotr Berman; Juan A. Garay (PODC, 1997)

Efficient On-Line Call Control Algorithms. - Juan A. Garay; Inder S. Gopal; Shay Kutten; Yishay Mansour; Moti Yung (J. Algorithms, 1997)

Adaptability and the Usefulness of Hints (Extended Abstract). - Piotr Berman; Juan A. Garay (ESA, 1998)

Batch Verification with Applications to Cryptography and Checking. - Mihir Bellare; Juan A. Garay; Tal Rabin (LATIN, 1998)

Mutual Search (Extended Abstract). - Harry Buhrman; Matthew K. Franklin; Juan A. Garay; Jaap-Henk Hoepman; John Tromp; Paul M. B. Vitányi (SODA, 1998)

VarietyCash: A Multi-Purpose Electronic Payment System. - Mihir Bellare; Juan A. Garay; Charanjit S. Jutla; Moti Yung (USENIX Workshop on Electronic Commerce, 1998)

Fast Batch Verification for Modular Exponentiation and Digital Signatures. - Mihir Bellare; Juan A. Garay; Tal Rabin (IACR Cryptol. ePrint Arch., 1998)

A Security Architecture for the Internet Protocol. - Pau-Chen Cheng; Juan A. Garay; Amir Herzberg; Hugo Krawczyk (IBM Syst. J., 1998)

A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. - Juan A. Garay; Shay Kutten; David Peleg (SIAM J. Comput., 1998)

Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. - Juan A. Garay; Yoram Moses (SIAM J. Comput., 1998)

Abuse-Free Optimistic Contract Signing. - Juan A. Garay; Markus Jakobsson; Philip D. MacKenzie (CRYPTO, 1999)

Multicast Security: A Taxonomy and Some Efficient Constructions. - Ran Canetti; Juan A. Garay; Gene Itkis; Daniele Micciancio; Moni Naor; Benny Pinkas (INFOCOM, 1999)

Self-Testing/Correcting Protocols (Extended Abstract). - Matthew K. Franklin; Juan A. Garay; Moti Yung (DISC, 1999)

Abuse-Free Multi-party Contract Signing. - Juan A. Garay; Philip D. MacKenzie (DISC, 1999)

Mutual Search. - Harry Buhrman; Matthew K. Franklin; Juan A. Garay; Jaap-Henk Hoepman; John Tromp; Paul M. B. Vitányi (J. ACM, 1999)

Long-Lived Broadcast Encryption. - Juan A. Garay; Jessica Staddon; Avishai Wool (CRYPTO, 2000)

Concurrent Oblivious Transfer. - Juan A. Garay; Philip D. MacKenzie (FOCS, 2000)

Application-Independent End-to-End Security in Shared-Link Access Networks. - José Carlos Brustoloni; Juan A. Garay (NETWORKING, 2000)

MicroISPs: providing convenient and low-cost high-bandwidth Internet access. - José Carlos Brustoloni; Juan A. Garay (Comput. Networks, 2000)

Design, implementation, and deployment of the iKP secure electronic payment system. - Mihir Bellare; Juan A. Garay; Ralf C. Hauser; Amir Herzberg; Hugo Krawczyk; Michael Steiner 001; Gene Tsudik; Els Van Herreweghen; Michael Waidner (IEEE J. Sel. Areas Commun., 2000)

Secure distributed storage and retrieval. - Juan A. Garay; Rosario Gennaro; Charanjit S. Jutla; Tal Rabin (Theor. Comput. Sci., 2000)

Timed Release of Standard Digital Signatures. - Juan A. Garay; Markus Jakobsson (Financial Cryptography, 2002)

On-line Admission Control and Packet Scheduling with Interleaving. - Juan A. Garay; Joseph Naor; Bülent Yener; Peng Zhao (INFOCOM, 2002)

A scheme for authentication and dynamic key exchange in wireless networks. - Uri Blumenthal; Milind M. Buddhikot; Juan A. Garay; Scott C. Miller; Sarvar Patel; Luca Salgarelli; Dorothy Stanley (Bell Labs Tech. J., 2002)

Efficient and Player-Optimal Strong Consensus. - Matthias Fitzi; Juan A. Garay (IACR Cryptol. ePrint Arch., 2002)

Timed Fair Exchange of Standard Signatures: [Extended Abstract]. - Juan A. Garay; Carl Pomerance (Financial Cryptography, 2003)

Efficient player-optimal protocols for strong and differential consensus. - Matthias Fitzi; Juan A. Garay (PODC, 2003)

Sharing Video on Demand. - Amotz Bar-Noy; Juan A. Garay; Amir Herzberg (Discret. Appl. Math., 2003)

Timed Fair Exchange of Standard Signatures. - Juan A. Garay; Carl Pomerance (IACR Cryptol. ePrint Arch., 2003)

Efficient authentication and key distribution in wireless IP networks. - Luca Salgarelli; Milind M. Buddhikot; Juan A. Garay; Sarvar Patel; Scott C. Miller (IEEE Wirel. Commun., 2003)

Efficient and Universally Composable Committed Oblivious Transfer and Applications. - Juan A. Garay (TCC, 2004)

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (IACR Cryptol. ePrint Arch., 2004)

Efficient and Universally Composable Committed Oblivious Transfer and Applications. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (IACR Cryptol. ePrint Arch., 2004)

Preface. - Juan A. Garay; Sergio Rajsbaum (Theor. Comput. Sci., 2004)

Minimal Complete Primitives for Secure Multi-Party Computation. - Matthias Fitzi; Juan A. Garay; Ueli M. Maurer; Rafail Ostrovsky (J. Cryptol., 2005)

Software integrity protection using timed executable agents. - Juan A. Garay; Lorenz Huelsbergen (AsiaCCS, 2006)

Round-Optimal and Efficient Verifiable Secret Sharing. - Matthias Fitzi; Juan A. Garay; Shyamnath Gollakota; C. Pandu Rangan; K. Srinathan 001 (TCC, 2006)

Strengthening Zero-Knowledge Protocols Using Signatures. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (J. Cryptol., 2006)

Round Complexity of Authenticated Broadcast with a Dishonest Majority. - Juan A. Garay; Jonathan Katz; Chiu-Yuen Koo; Rafail Ostrovsky (FOCS, 2007)

Practical and Secure Solutions for Integer Comparison. - Juan A. Garay; Berry Schoenmakers; José Villegas (Public Key Cryptography, 2007)

Towards Optimal and Efficient Perfectly Secure Message Transmission. - Matthias Fitzi; Matthew K. Franklin; Juan A. Garay; Harsha Vardhan Simhadri (TCC, 2007)

Almost-everywhere Secure Computation. - Juan A. Garay; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2007)

Sound and Fine-grain Specification of Ideal Functionalities. - Juan A. Garay; Aggelos Kiayias; Hong-Sheng Zhou (Theoretical Foundations of Practical Information Security, 2008)

Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk). - Juan A. Garay (ICITS, 2008)

A Framework for the Sound Specification of Cryptographic Tasks. - Juan A. Garay; Aggelos Kiayias; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2008)

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer. - Juan A. Garay; Daniel Wichs; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2008)

Optimal Probabilistic Synchronous Byzantine Agreement. - Juan A. Garay (Encyclopedia of Algorithms, 2008)

Swarming secrets. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov (Allerton, 2009)

Improved Fault Tolerance and Secure Computation on Sparse Networks. - Nishanth Chandran; Juan A. Garay; Rafail Ostrovsky (ICALP (2), 2010)

Brief announcement: swarming secrets. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov (PODC, 2010)

Secure Message Transmission by Public Discussion: A Brief Survey. - Juan A. Garay; Clint Givens; Rafail Ostrovsky (IWCC, 2011)

Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov (ICS, 2011)

Adaptively secure broadcast, revisited. - Juan A. Garay; Jonathan Katz; Ranjit Kumaresan; Hong-Sheng Zhou (PODC, 2011)

Searchable symmetric encryption: Improved definitions and efficient constructions. - Reza Curtmola; Juan A. Garay; Seny Kamara; Rafail Ostrovsky (J. Comput. Secur., 2011)

Resource Fairness and Composability of Cryptographic Protocols. - Juan A. Garay; Philip D. MacKenzie; Manoj Prabhakaran 001; Ke Yang 005 (J. Cryptol., 2011)

Edge Fault Tolerance on Sparse Networks. - Nishanth Chandran; Juan A. Garay; Rafail Ostrovsky (ICALP (2), 2012)

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (DISC, 2012)

Efficient Private Distributed Computation on Unbounded Input Streams - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (CoRR, 2012)

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs. - Yi Deng 002; Juan A. Garay; San Ling; Huaxiong Wang; Moti Yung (IACR Cryptol. ePrint Arch., 2012)

Broadcast-Efficient Secure Multiparty Computation. - Juan A. Garay; Clint Givens; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2012)

Resource-based Corruptions and the Combinatorics of Hidden Diversity. - Juan A. Garay; David S. Johnson 001; Aggelos Kiayias; Moti Yung (IACR Cryptol. ePrint Arch., 2012)

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (ACNS, 2013)

Broadcast (and Round) Efficient Verifiable Secret Sharing. - Juan A. Garay; Clint Givens; Rafail Ostrovsky; Pavel Raykov (ICITS, 2013)

EyeDecrypt - Private Interactions in Plain Sight. - Andrea G. Forte; Juan A. Garay; Trevor Jim; Yevgeniy Vahlis (IACR Cryptol. ePrint Arch., 2013)

Rational Protocol Design: Cryptography Against Incentive-driven Adversaries. - Juan A. Garay; Jonathan Katz; Ueli Maurer; Björn Tackmann; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2013)

On the Complexity of UC Commitments. - Juan A. Garay; Yuval Ishai; Ranjit Kumaresan; Hoeteck Wee (EUROCRYPT, 2014)

Fast and unconditionally secure anonymous channel. - Juan A. Garay; Clinton Givens; Rafail Ostrovsky; Pavel Raykov (PODC, 2014)

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality. - Nishanth Chandran; Wutichai Chongchitmate; Juan A. Garay; Shafi Goldwasser; Rafail Ostrovsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2014)

A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation. - Juan A. Garay; Ran Gelles; David S. Johnson 001; Aggelos Kiayias; Moti Yung (IACR Cryptol. ePrint Arch., 2014)

Secure Message Transmission With Small Public Discussion. - Juan A. Garay; Clint Givens; Rafail Ostrovsky (IEEE Trans. Inf. Theory, 2014)

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. - Nishanth Chandran; Wutichai Chongchitmate; Juan A. Garay; Shafi Goldwasser; Rafail Ostrovsky; Vassilis Zikas (ITCS, 2015)

Blockchain-Based Consensus (Keynote). - Juan A. Garay (OPODIS, 2015)

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality. - Juan A. Garay; Jonathan Katz; Björn Tackmann; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2015)

Fair Distributed Computation of Reactive Functions. - Juan A. Garay; Björn Tackmann; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2015)

Towards efficient private distributed computation on unbounded input streams. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Yelena Yuditsky (J. Math. Cryptol., 2015)

Almost-Everywhere Secure Computation with Edge Corruptions. - Nishanth Chandran; Juan A. Garay; Rafail Ostrovsky (J. Cryptol., 2015)

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions. - Sandro Coretti; Juan A. Garay; Martin Hirt; Vassilis Zikas (ASIACRYPT (2), 2016)

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. - Yi Deng 002; Juan A. Garay; San Ling; Huaxiong Wang; Moti Yung (SCN, 2016)

Constant-Round Asynchronous Multi-Party Computation. - Sandro Coretti; Juan A. Garay; Martin Hirt; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2016)

Short and Adjustable Signatures. - Xiong Fan; Juan A. Garay; Payman Mohassel (IACR Cryptol. ePrint Arch., 2016)

The Bitcoin Backbone Protocol with Chains of Variable Difficulty. - Juan A. Garay; Aggelos Kiayias; Nikos Leonardos (IACR Cryptol. ePrint Arch., 2016)

Bootstrapping the Blockchain - Directly. - Juan A. Garay; Aggelos Kiayias; Nikos Leonardos; Giorgos Panagiotakos (IACR Cryptol. ePrint Arch., 2016)

MAC Precomputation with Applications to Secure Memory. - Juan A. Garay; Vladimir Kolesnikov; Rae McLellan (ACM Trans. Priv. Secur., 2016)

Optimal Probabilistic Synchronous Byzantine Agreement. - Juan A. Garay (Encyclopedia of Algorithms, 2016)

Brief Announcement: Secure Self-Stabilizing Computation. - Shlomi Dolev; Karim Eldefrawy; Juan A. Garay; Muni Venkateswarlu Kumaramangalam; Rafail Ostrovsky; Moti Yung (PODC, 2017)

Special Issue: Algorithmic Tools in Cryptography. - Juan A. Garay; Rafail Ostrovsky (Algorithmica, 2017)

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. - Nishanth Chandran; Juan A. Garay; Payman Mohassel; Satyanarayana Vusirikala (IACR Cryptol. ePrint Arch., 2017)

The Price of Low Communication in Secure Multi-Party Computation. - Juan A. Garay; Yuval Ishai; Rafail Ostrovsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2017)

Proofs of Work for Blockchain Protocols. - Juan A. Garay; Aggelos Kiayias; Giorgos Panagiotakos (IACR Cryptol. ePrint Arch., 2017)

Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. - Juan A. Garay; Aggelos Kiayias; Nikos Leonardos; Giorgos Panagiotakos (Public Key Cryptography (2), 2018)

But Why does it Work? A Rational Protocol Design Treatment of Bitcoin. - Christian Badertscher; Juan A. Garay; Ueli Maurer; Daniel Tschudi; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2018)

SoK: A Consensus Taxonomy in the Blockchain Era. - Juan A. Garay; Aggelos Kiayias (IACR Cryptol. ePrint Arch., 2018)

Broadcast-Optimal Two-Round MPC. - Ran Cohen; Juan A. Garay; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2019)

The Bitcoin Backbone Protocol Against Quantum Adversaries. - Alexandru Cojocaru; Juan A. Garay; Aggelos Kiayias; Fang Song 001; Petros Wallden (IACR Cryptol. ePrint Arch., 2019)

Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast). - Juan A. Garay; Aggelos Kiayias; Rafail Ostrovsky; Giorgos Panagiotakos; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2019)

Iterated Search Problems and Blockchain Security under Falsifiable Assumptions. - Juan A. Garay; Aggelos Kiayias; Giorgos Panagiotakos (IACR Cryptol. ePrint Arch., 2019)

Probabilistic Termination and Composability of Cryptographic Protocols. - Ran Cohen; Sandro Coretti; Juan A. Garay; Vassilis Zikas (J. Cryptol., 2019)

Perennial secure multi-party computation of universal Turing machine. - Shlomi Dolev; Juan A. Garay; Niv Gilboa; Vladimir Kolesnikov; Muni Venkateswarlu Kumaramangalam (Theor. Comput. Sci., 2019)

Consensus from Signatures of Work. - Juan A. Garay; Aggelos Kiayias; Giorgos Panagiotakos (CT-RSA, 2020)

Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. - Juan A. Garay; Aggelos Kiayias; Rafail M. Ostrovsky; Giorgos Panagiotakos; Vassilis Zikas (EUROCRYPT (2), 2020)

Blockchains from Non-idealized Hash Functions. - Juan A. Garay; Aggelos Kiayias; Giorgos Panagiotakos (TCC (1), 2020)

Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search. - Alexandru Cojocaru; Juan A. Garay; Aggelos Kiayias; Fang Song 001; Petros Wallden (CoRR, 2020)

Full Analysis of Nakamoto Consensus in Bounded-Delay Networks. - Juan A. Garay; Aggelos Kiayias; Nikos Leonardos (IACR Cryptol. ePrint Arch., 2020)

The combinatorics of hidden diversity. - Juan A. Garay; David S. Johnson 001; Aggelos Kiayias; Moti Yung (Theor. Comput. Sci., 2020)

On Bitcoin cash's target recalculation functions. - Juan A. Garay; Yu Shen 002 (AFT, 2021)

Universally Composable Almost-Everywhere Secure Computation. - Nishanth Chandran; Pouyan Forghani; Juan A. Garay; Rafail Ostrovsky; Rutvik Patel; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2021)

Adaptively Secure Broadcast in Resource-Restricted Cryptography. - Ran Cohen; Juan A. Garay; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2021)

The Bitcoin Cash Backbone Protocol. - Juan A. Garay; Yu Shen 002 (IACR Cryptol. ePrint Arch., 2021)

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. - Ran Cohen; Sandro Coretti; Juan A. Garay; Vassilis Zikas (J. Cryptol., 2021)

Permissionless Clock Synchronization with Public Setup. - Juan A. Garay; Aggelos Kiayias; Yu Shen 002 (IACR Cryptol. ePrint Arch., 2022)

Completeness Theorems for Adaptively Secure Broadcast. - Ran Cohen; Juan A. Garay; Vassilis Zikas (CRYPTO (1), 2023)

Generalized Hybrid Search and Applications to Blockchain and Hash Function Security. - Alexandru Cojocaru; Juan A. Garay; Fang Song 001 (CoRR, 2023)

Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. - Ran Cohen; Pouyan Forghani; Juan A. Garay; Rutvik Patel; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2023)

Generalized Hybrid Search and Applications. - Alexandru Cojocaru; Juan A. Garay; Fang Song 001 (IACR Cryptol. ePrint Arch., 2023)

Proof-of-Work-based Consensus in Expected-Constant Time. - Juan A. Garay; Aggelos Kiayias; Yu Shen 002 (IACR Cryptol. ePrint Arch., 2023)

Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security. - Alexandru Cojocaru; Juan A. Garay; Aggelos Kiayias; Fang Song 001; Petros Wallden (Quantum, 2023)

Improved Quantum Lifting by Coherent Measure-and-Reprogram. - Alexandru Cojocaru; Juan A. Garay; Qipeng Liu 001; Fang Song 001 (ASIACRYPT (9), 2024)

Generalized Hybrid Search with Applications to Blockchains and Hash Function Security. - Alexandru Cojocaru; Juan A. Garay; Fang Song 001 (ASIACRYPT (9), 2024)

Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. - Marshall Ball; Juan A. Garay; Peter Hall; Aggelos Kiayias; Giorgos Panagiotakos (IACR Cryptol. ePrint Arch., 2024)

Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC. - Nishanth Chandran; Juan A. Garay; Ankit Kumar Misra; Rafail Ostrovsky; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2024)

A Composability Treatment of Bitcoin's Transaction Ledger with Variable Difficulty. - Juan A. Garay; Yun Lu 001; Julien Prat; Brady Testa; Vassilis Zikas (IACR Cryptol. ePrint Arch., 2024)

The Bitcoin Backbone Protocol: Analysis and Applications. - Juan A. Garay; Aggelos Kiayias; Nikos Leonardos (J. ACM, 2024)

State Machine Replication Among Strangers, Fast and Self-Sufficient. - Juan A. Garay; Aggelos Kiayias; Yu Shen 002 (IACR Cryptol. ePrint Arch., 2025)

Robust and Verifiable MPC with Applications to Linear Machine Learning Inference. - Tzu-Shen Wang; Jimmy Dani; Juan Garay; Soamar Homsi; Nitesh Saxena (IACR Cryptol. ePrint Arch., 2025)