Juan A. Garay

According to our database1, Juan A. Garay authored at least 128 papers between 1985 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Consensus from Signatures of Work.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
Perennial secure multi-party computation of universal Turing machine.
Theor. Comput. Sci., 2019

Probabilistic Termination and Composability of Cryptographic Protocols.
J. Cryptology, 2019

Iterated Search Problems and Blockchain Security under Falsifiable Assumptions.
IACR Cryptology ePrint Archive, 2019

Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast).
IACR Cryptology ePrint Archive, 2019

The Bitcoin Backbone Protocol Against Quantum Adversaries.
IACR Cryptology ePrint Archive, 2019

Broadcast-Optimal Two-Round MPC.
IACR Cryptology ePrint Archive, 2019

2018
SoK: A Consensus Taxonomy in the Blockchain Era.
IACR Cryptology ePrint Archive, 2018

But Why does it Work? A Rational Protocol Design Treatment of Bitcoin.
IACR Cryptology ePrint Archive, 2018

Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2017
Proofs of Work for Blockchain Protocols.
IACR Cryptology ePrint Archive, 2017

The Price of Low Communication in Secure Multi-Party Computation.
IACR Cryptology ePrint Archive, 2017

Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.
IACR Cryptology ePrint Archive, 2017

Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case.
IACR Cryptology ePrint Archive, 2017

Special Issue: Algorithmic Tools in Cryptography.
Algorithmica, 2017

Brief Announcement: Secure Self-Stabilizing Computation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Optimal Probabilistic Synchronous Byzantine Agreement.
Encyclopedia of Algorithms, 2016

MAC Precomputation with Applications to Secure Memory.
ACM Trans. Priv. Secur., 2016

Bootstrapping the Blockchain - Directly.
IACR Cryptology ePrint Archive, 2016

The Bitcoin Backbone Protocol with Chains of Variable Difficulty.
IACR Cryptology ePrint Archive, 2016

Short and Adjustable Signatures.
IACR Cryptology ePrint Archive, 2016

Constant-Round Asynchronous Multi-Party Computation.
IACR Cryptology ePrint Archive, 2016

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Almost-Everywhere Secure Computation with Edge Corruptions.
J. Cryptology, 2015

Fair Distributed Computation of Reactive Functions.
IACR Cryptology ePrint Archive, 2015

How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality.
IACR Cryptology ePrint Archive, 2015

Blockchain-Based Consensus (Keynote).
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Secure Message Transmission With Small Public Discussion.
IEEE Trans. Information Theory, 2014

The Bitcoin Backbone Protocol: Analysis and Applications.
IACR Cryptology ePrint Archive, 2014

A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2014

Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality.
IACR Cryptology ePrint Archive, 2014

Fast and unconditionally secure anonymous channel.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

On the Complexity of UC Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries.
IACR Cryptology ePrint Archive, 2013

EyeDecrypt - Private Interactions in Plain Sight.
IACR Cryptology ePrint Archive, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams.
IACR Cryptology ePrint Archive, 2013

Broadcast (and Round) Efficient Verifiable Secret Sharing.
Proceedings of the Information Theoretic Security - 7th International Conference, 2013

Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract).
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Resource-based Corruptions and the Combinatorics of Hidden Diversity.
IACR Cryptology ePrint Archive, 2012

Broadcast-Efficient Secure Multiparty Computation.
IACR Cryptology ePrint Archive, 2012

On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.
IACR Cryptology ePrint Archive, 2012

Efficient Private Distributed Computation on Unbounded Input Streams
CoRR, 2012

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Edge Fault Tolerance on Sparse Networks.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Resource Fairness and Composability of Cryptographic Protocols.
J. Cryptology, 2011

Adaptively secure broadcast, revisited.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation.
Proceedings of the Innovations in Computer Science, 2011

Secure Message Transmission by Public Discussion: A Brief Survey.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
Brief announcement: swarming secrets.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Improved Fault Tolerance and Secure Computation on Sparse Networks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2008
Optimal Probabilistic Synchronous Byzantine Agreement.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.
IACR Cryptology ePrint Archive, 2008

A Framework for the Sound Specification of Cryptographic Tasks.
IACR Cryptology ePrint Archive, 2008

Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk).
Proceedings of the Information Theoretic Security, Third International Conference, 2008

Sound and Fine-grain Specification of Ideal Functionalities.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

2007
Almost-everywhere Secure Computation.
IACR Cryptology ePrint Archive, 2007

Towards Optimal and Efficient Perfectly Secure Message Transmission.
Proceedings of the Theory of Cryptography, 4th Theory of Cryptography Conference, 2007

Practical and Secure Solutions for Integer Comparison.
Proceedings of the Public Key Cryptography, 2007

Round Complexity of Authenticated Broadcast with a Dishonest Majority.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006
Strengthening Zero-Knowledge Protocols Using Signatures.
J. Cryptology, 2006

Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions.
IACR Cryptology ePrint Archive, 2006

Round-Optimal and Efficient Verifiable Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Software integrity protection using timed executable agents.
Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, 2006

2005
Minimal Complete Primitives for Secure Multi-Party Computation.
J. Cryptology, 2005

2004
Preface.
Theor. Comput. Sci., 2004

Efficient and Universally Composable Committed Oblivious Transfer and Applications.
IACR Cryptology ePrint Archive, 2004

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness.
IACR Cryptology ePrint Archive, 2004

Efficient and Universally Composable Committed Oblivious Transfer and Applications.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

2003
Efficient authentication and key distribution in wireless IP networks.
IEEE Wireless Commun., 2003

Timed Fair Exchange of Standard Signatures.
IACR Cryptology ePrint Archive, 2003

Sharing Video on Demand.
Discrete Applied Mathematics, 2003

Efficient player-optimal protocols for strong and differential consensus.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Timed Fair Exchange of Standard Signatures: [Extended Abstract].
Proceedings of the Financial Cryptography, 2003

2002
Efficient and Player-Optimal Strong Consensus.
IACR Cryptology ePrint Archive, 2002

A scheme for authentication and dynamic key exchange in wireless networks.
Bell Labs Technical Journal, 2002

On-line Admission Control and Packet Scheduling with Interleaving.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

Timed Release of Standard Digital Signatures.
Proceedings of the Financial Cryptography, 6th International Conference, 2002

2000
Secure distributed storage and retrieval.
Theor. Comput. Sci., 2000

Design, implementation, and deployment of the iKP secure electronic payment system.
IEEE Journal on Selected Areas in Communications, 2000

MicroISPs: providing convenient and low-cost high-bandwidth Internet access.
Computer Networks, 2000

Application-Independent End-to-End Security in Shared-Link Access Networks.
Proceedings of the NETWORKING 2000, 2000

Concurrent Oblivious Transfer.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Long-Lived Broadcast Encryption.
Proceedings of the Advances in Cryptology, 2000

1999
Mutual Search.
J. ACM, 1999

Abuse-Free Multi-party Contract Signing.
Proceedings of the Distributed Computing, 1999

Self-Testing/Correcting Protocols (Extended Abstract).
Proceedings of the Distributed Computing, 1999

Multicast Security: A Taxonomy and Some Efficient Constructions.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

Abuse-Free Optimistic Contract Signing.
Proceedings of the Advances in Cryptology, 1999

1998
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds.
SIAM J. Comput., 1998

A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees.
SIAM J. Comput., 1998

A Security Architecture for the Internet Protocol.
IBM Systems Journal, 1998

Fast Batch Verification for Modular Exponentiation and Digital Signatures.
IACR Cryptology ePrint Archive, 1998

VarietyCash: A Multi-Purpose Electronic Payment System.
Proceedings of the 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, August 31, 1998

Mutual Search (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Batch Verification with Applications to Cryptography and Checking.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Adaptability and the Usefulness of Hints (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
Efficient On-Line Call Control Algorithms.
J. Algorithms, 1997

Competing against Specialists.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Fast, Long-Lived Renaming Improved and Simplified.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Fast, Long-Lived Renaming Improved and Simplified (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Optimal Amortized Distributed Consensus
Inf. Comput., July, 1995

iKP - A Family of Secure Electronic Payment Protocols.
Proceedings of the First USENIX Workshop on Electronic Commerce, 1995

Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX.
Proceedings of the 5th USENIX Security Symposium, 1995

Securing the Internet (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Long-Lived Renaming Made Fast.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Optimal Resiliency against Mobile Faults.
Proceedings of the Digest of Papers: FTCS-25, 1995

Adaptive Video on Demand.
Proceedings of the Algorithms, 1995

1994
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract).
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

1993
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds.
Mathematical Systems Theory, 1993

Fast Consensus in Networks of Bounded Degree.
Distributed Computing, 1993

Fully polynomial Byzantine agreement in t+1 rounds.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Randomized Distributed Agreement Revisited.
Proceedings of the Digest of Papers: FTCS-23, 1993

A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
A Continuum of Failure Models for Distributed Computing.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Optimal Early Stopping in Distributed Consensus (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Call Preemption in Communication Networks.
Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Optimal Amortized Distributed Consensus (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

1990
Fast Consensus in Networks of Bounded Degree (Extended Abstract).
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989
Analysis of Block-Paging Strategies.
IBM Journal of Research and Development, 1989

Efficient Agreement on Bounded-Degree Networks.
Proceedings of the International Conference on Parallel Processing, 1989

Asymptotically Optimal Distributed Consensus (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Towards Optimal Distributed Consensus (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988
Analysis of Page-Reference Strings of an Interactive System.
IBM Journal of Research and Development, 1988

1985
Preliminary Analysis of Page Reference Strings of an Interactive System.
Proceedings of the Eleventh International Computer Measurement Group Conference, 1985


  Loading...