HR job title
- Professor
- Contact Info
Garay, Juan Professor - Term Appointment
Positions
- Professor - Term Appointment, Computer Science and Engineering, College of Engineering
Dr. Garay's research interests include both foundational and applied aspects of cryptography and information security. He has published extensively in the areas of cryptography, network security, distributed computing and algorithms. He has been involved in the design, analysis and implementation of a variety of secure systems, and is the recipient of over two dozen patents.
- Overview
- Publications
- Research
- Teaching
- Background
- Contact
- Other
- View All
Overview
Publications
selected publications
-
academic article
-
Dolev, S., Garay, J. A., Gilboa, N., Kolesnikov, V., & Kumaramangalam, M. V.
(2019).
Perennial secure multi-party computation of universal Turing machine. Theoretical Computer Science.
769, 43-62.
-
Garay, J. A., & Ostrovsky, R.
(2017).
Special Issue: Algorithmic Tools in Cryptography. Algorithmica: an international journal in computer science.
79(4), 985-986.
-
Garay, J. A., Kolesnikov, V., & Mclellan, R.
(2016).
MAC Precomputation with Applications to Secure Memory. ACM Transactions on Privacy and Security.
19(2), 1-21.
-
Chandran, N., Garay, J. A., & Ostrovsky, R.
(2015).
Almost-Everywhere Secure Computation with Edge Corruptions. Journal of Cryptology.
28(4), 745-768.
-
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V., & Yuditsky, Y.
(2015).
Towards efficient private distributed computation on unbounded input streams. Journal of Mathematical Cryptology.
9(2), 79-94.
-
Garay, J., Givens, C., & Ostrovsky, R.
(2014).
Secure Message Transmission With Small Public Discussion. IEEE TRANSACTIONS ON INFORMATION THEORY.
60(4), 2373-2390.
-
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R.
(2011).
Searchable symmetric encryption: Improved definitions and efficient constructions. Journal of Computer Security.
19(5), 895-934.
-
Garay, J. A., MacKenzie, P., Prabhakaran, M., & Yang, K. e.
(2011).
Resource Fairness and Composability of Cryptographic Protocols. Journal of Cryptology.
24(4), 615-658.
-
Garay, J. A., MacKenzie, P., & Yang, K. e.
(2006).
Strengthening Zero-Knowledge Protocols Using Signatures. Journal of Cryptology.
19(2), 169-209.
-
Fitzi, M., Garay, J. A., Maurer, U., & Ostrovsky, R.
(2005).
Minimal Complete Primitives for Secure Multi-Party Computation. Journal of Cryptology.
18(1), 37-61.
-
Garay, J. A., MacKenzie, P., & Yang, K.
(2004).
Efficient and Universally Composable Committed Oblivious Transfer and Applications. Lecture Notes in Computer Science.
2951, 297-316.
-
Salgarelli, L., Buddhikot, M., Garay, J., Patel, S., & Miller, S.
(2003).
Efficient authentication and key distribution in wireless IP networks. IEEE Wireless Communications.
10(6), 52-61.
-
Garay, J. A., MacKenzie, P., & Yang, K.
(2003).
Strengthening zero-knowledge protocols using signatures. Lecture Notes in Computer Science.
2656, 177-194.
-
Garay, J. A., & Pomerance, C.
(2003).
Timed fair exchange of standard signatures [extended abstract]. Lecture Notes in Computer Science.
2742, 190-207.
-
Blumenthal, U., Buddhikot, M. M., Garay, J. A., Miller, S. C., Patel, S., Salgarelli, L., & Stanley, D.
(2002).
A scheme for authentication and dynamic key exchange in wireless networks. Bell Labs Technical Journal.
7(2), 37-48.
-
Garay, J. A., Gennaro, R., Jutla, C., & Rabin, T.
(2000).
Secure distributed storage and retrieval. Theoretical Computer Science.
243(1-2), 363-389.
-
Brustoloni, J., & Garay, J.
(2000).
MicroISPs: providing convenient and low-cost high-bandwidth Internet access. Computer Networks.
33(1-6), 789-802.
-
Bellare, M., Garay, J. A., Hauser, R., Herzberg, A., Krawczyk, H., Steiner, M., ... Waidner, M.
(2000).
Design, implementation, and deployment of the iKP secure electronic payment system. IEEE Journal on Selected Areas in Communications.
18(4), 611-627.
-
Buhrman, H., Franklin, M., Garay, J. A., Hoepman, J., Tromp, J., & Vitnyi, P.
(1999).
Mutual search. Journal of the ACM.
46(4), 517-536.
-
Garay, J. A., Kutten, S., & Peleg, D.
(1998).
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM Journal on Computing.
27(1), 302-316.
-
Garay, J. A., & Moses, Y.
(1998).
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM Journal on Computing.
27(1), 247-290.
-
Cheng, P., Garay, J. A., Herzberg, A., & Krawczyk, H.
(1998).
A security architecture for the Internet Protocol. IBM Systems Journal.
37(1), 42-60.
-
Garay, J. A., Gopal, I. S., Kutten, S., Mansour, Y., & Yung, M.
(1997).
Efficient On-Line Call Control Algorithms. Journal of Algorithms in Cognition, Informatics and Logic.
23(1), 180-194.
-
Barnoy, A., Deng, X., Garay, J. A., & Kameda, T.
(1995).
Optimal Amortized Distributed Consensus. Information and Computation.
120(1), 93-100.
-
Berman, P., & Garay, J. A.
(1993).
Fast consensus in networks of bounded degree. Distributed Computing.
7(2), 67-73.
-
Berman, P., & Garay, J. A.
(1993).
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds. Theory of Computing Systems.
26(1), 3-19.
-
Tetzlaff, W. H., Kienzle, M. G., & Garay, J. A.
(1989).
Analysis of block-paging strategies. IBM Journal of Research and Development.
33(1), 51-59.
-
Kienzle, M. G., Garay, J. A., & Tetzlaff, W. H.
(1988).
Analysis of page-reference strings of an interactive system. IBM Journal of Research and Development.
32(4), 523-535.
-
Dolev, S., Garay, J. A., Gilboa, N., Kolesnikov, V., & Kumaramangalam, M. V.
(2019).
Perennial secure multi-party computation of universal Turing machine. Theoretical Computer Science.
769, 43-62.
-
book
-
Garay, J. A., & Rajsbaum, S.
(2004).
Preface. Ed. 321.
Elsevier.
-
Garay, J. A., & Rajsbaum, S.
(2004).
Preface. Ed. 321.
Elsevier.
-
conference paper
-
Garay, J. A., Kiayias, A., & Panagiotakos, G.
(2020).
Blockchains from Non-idealized Hash Functions. Lecture Notes in Computer Science.
291-321.
-
Garay, J. A., Kiayias, A., & Panagiotakos, G.
(2020).
Consensus from Signatures of Work. Lecture Notes in Computer Science.
319-344.
-
Garay, J. A., Kiayias, A., Leonardos, N., & Panagiotakos, G.
(2018).
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. Lecture Notes in Computer Science.
465-495.
-
Chandran, N., Garay, J. A., Mohassel, P., & Vusirikala, S.
(2017).
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. 277-294.
-
Dolev, S., Eldefrawy, K., Garay, J. A., Kumaramangalam, M. V., Ostrovsky, R., & Yung, M.
(2017).
Brief Announcement: Secure Self-Stabilizing Computation. 415-417.
-
Cohen, R., Coretti, S., Garay, J. A., & Zikas, V.
(2017).
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. 37:1-37:15.
-
Garay, J. A., Kiayias, A., & Leonardos, N.
(2017).
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. 291-323.
-
Garay, J. A., Ishai, Y., Ostrovsky, R., & Zikas, V.
(2017).
The Price of Low Communication in Secure Multi-party Computation. 420-446.
-
Coretti, S., Garay, J. A., Hirt, M., & Zikas, V.
(2016).
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions. 998-1021.
-
Cohen, R., Coretti, S., Garay, J. A., & Zikas, V.
(2016).
Probabilistic Termination and Composability of Cryptographic Protocols. 240-269.
-
Deng, Y., Garay, J. A., Ling, S., Wang, H., & Yung, M.
(2016).
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. 237-253.
-
Garay, J. A.
(2015).
Blockchain-Based Consensus (Keynote). 5:1-5:1.
-
Garay, J. A., Tackmann, B., & Zikas, V.
(2015).
Fair Distributed Computation of Reactive Functions. 497-512.
-
Garay, J. A., Katz, J., Tackmann, B., & Zikas, V.
(2015).
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality. 281-290.
-
Garay, J. A., Kiayias, A., & Leonardos, N.
(2015).
The Bitcoin Backbone Protocol: Analysis and Applications. 281-310.
-
Garay, J. A., Gelles, R., Johnson, D. S., Kiayias, A., & Yung, M.
(2015).
A little honesty goes a long way: The two-tier model for secure multiparty computation. Lecture Notes in Computer Science.
134-158.
-
Chandran, N., Chongchitmate, W., Garay, J. A., Goldwasser, S., Ostrovsky, R., & Zikas, V.
(2015).
The Hidden Graph Model. 153-162.
-
Garay, J. A.
(2014).
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I
-
Garay, J. A.
(2014).
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II
-
Forte, A. G., Garay, J. A., Jim, T., & Vahlis, Y.
(2014).
Eyedecryptprivate interactions in plain sight. Lecture Notes in Computer Science.
255-276.
-
Garay, J. A., Givens, C., Ostrovsky, R., & Raykov, P.
(2014).
Fast and unconditionally secure anonymous channel. 313-321.
-
Garay, J. A., Ishai, Y., Kumaresan, R., & Wee, H.
(2014).
On the Complexity of UC Commitments. Lecture Notes in Computer Science.
677-694.
-
Garay, J. A.
(2013).
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I
-
Garay, J. A.
(2013).
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II
-
Garay, J. A., Katz, J., Maurer, U., Tackmann, B., & Zikas, V.
(2013).
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries. 648-657.
-
Garay, J. A., Johnson, D. S., Kiayias, A., & Yung, M.
(2013).
Resource-based corruptions and the combinatorics of hidden diversity. 415-428.
-
Dolev, S., Garay, J. A., Gilboa, N., Kolesnikov, V., & Yuditsky, Y.
(2013).
Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). 69-83.
-
Garay, J. A., Givens, C., Ostrovsky, R., & Raykov, P.
(2013).
Broadcast (and Round) Efficient Verifiable Secret Sharing. 200-219.
-
Dolev, S., Garay, J. A., Gilboa, N., Kolesnikov, V., & Yuditsky, Y.
(2012).
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. 431-432.
-
Chandran, N., Garay, J. A., & Ostrovsky, R.
(2012).
Edge Fault Tolerance on Sparse Networks. 452-463.
-
Garay, J. A., Katz, J., Kumaresan, R., & Zhou, H.
(2011).
Adaptively secure broadcast, revisited. 179-186.
-
Dolev, S., Garay, J. A., Gilboa, N., & Kolesnikov, V.
(2011).
Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. 32-44.
-
Garay, J. A., Givens, C., & Ostrovsky, R.
(2011).
Secure Message Transmission by Public Discussion: A Brief Survey. 126-141.
-
Garay, J. A., Kiayias, A., & Zhou, H.
(2010).
A Framework for the Sound Specification of Cryptographic Tasks. 277-289.
-
Dolev, S., Garay, J. A., Gilboa, N., & Kolesnikov, V.
(2010).
Brief announcement: swarming secrets. 231-232.
-
Chandran, N., Garay, J. A., & Ostrovsky, R.
(2010).
Improved Fault Tolerance and Secure Computation on Sparse Networks. 249-260.
-
Garay, J. A., Givens, C., & Ostrovsky, R.
(2010).
Secure Message Transmission with Small Public Discussion. 177-196.
-
Garay, J. A.
(2010).
Security and Cryptography for Networks, 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings
-
Garay, J. A.
(2009).
Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. Proceedings
-
Garay, J. A., Kolesnikov, V., & McLellan, R.
(2009).
MAC Precomputation with Applications to Secure Memory. 427-442.
-
Garay, J. A., Wichs, D., & Zhou, H.
(2009).
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer. 505-523.
-
Garay, J. A.
(2008).
Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk). 1.
-
Garay, J. A., & Ostrovsky, R.
(2008).
Almost-Everywhere Secure Computation. 307-323.
-
Garay, J. A., Katz, J., Koo, C., & Ostrovsky, R.
(2007).
Round Complexity of Authenticated Broadcast with a Dishonest Majority. Annual Symposium on Foundations of Computer Science.
658-668.
-
Garay, J. A.
(2007).
Information Security, 10th International Conference, ISC 2007, Valparaso, Chile, October 9-12, 2007, Proceedings
-
Garay, J. A., Schoenmakers, B., & Villegas, J.
(2007).
Practical and Secure Solutions for Integer Comparison. 330-342.
-
Fitzi, M., Franklin, M. K., Garay, J. A., & Simhadri, H. V.
(2007).
Towards Optimal and Efficient Perfectly Secure Message Transmission. 311-322.
-
Garay, J. A., MacKenzie, P. D., Prabhakaran, M., & Yang, K.
(2006).
Resource Fairness and Composability of Cryptographic Protocols. 404-428.
-
Curtmola, R., Garay, J. A., Kamara, S., & Ostrovsky, R.
(2006).
Searchable symmetric encryption: improved definitions and efficient constructions. 79-88.
-
Garay, J. A., & Huelsbergen, L.
(2006).
Software integrity protection using timed executable agents. 189-200.
-
Fitzi, M., Garay, J. A., Gollakota, S., Rangan, C. P., & Srinathan, K.
(2006).
Round-Optimal and Efficient Verifiable Secret Sharing. 329-342.
-
Fitzi, M., & Garay, J. A.
(2003).
Efficient Player-Optimal Protocols for Strong and Differential Consensus. 211-220.
-
Bar-Noy, A., Garay, J. A., & Herzberg, A.
(2003).
Sharing video on demand. DISCRETE APPLIED MATHEMATICS.
3-30.
-
Garay, J. A., & Jakobsson, M.
(2003).
Timed release of standard digital signatures extended abstract. Lecture Notes in Computer Science.
168-182.
-
Garay, J. A., Naor, J., Yener, B., & Zhao, P.
(2002).
On-line Admission Control and Packet Scheduling with Interleaving. 94-103.
-
Garay, J. A., & Jakobsson, M.
(2002).
Timed Release of Standard Digital Signatures. 168-182.
-
Fitzi, M., Garay, J. A., Maurer, U., & Ostrovsky, R.
(2001).
Minimal complete primitives for secure multi-party computation. Lecture Notes in Computer Science.
80-100.
-
Brustoloni, J. C., & Garay, J. A.
(2000).
Application-Independent End-to-End Security in Shared-Link Access Networks. 608-619.
-
Garay, J. A., & MacKenzie, P. D.
(2000).
Concurrent Oblivious Transfer. 314-324.
-
Garay, J. A., Staddon, J., & Wool, A.
(2000).
Long-lived broadcast encryption. Lecture Notes in Computer Science.
333-352.
-
Garay, J. A., & MacKenzie, P. D.
(1999).
Abuse-Free Multi-party Contract Signing. 151-165.
-
Garay, J. A., Jakobsson, M., & MacKenzie, P. D.
(1999).
Abuse-Free Optimistic Contract Signing. 449-466.
-
Canetti, R., Garay, J. A., Itkis, G., Micciancio, D., Naor, M., & Pinkas, B.
(1999).
Multicast Security: A Taxonomy and Some Efficient Constructions. 708-716.
-
Franklin, M. K., Garay, J. A., & Yung, M.
(1999).
Self-Testing/Correcting Protocols (Extended Abstract). 269-283.
-
Franklin, M., Garay, J. A., & Yung, M.
(1999).
Self-testing/correcting protocols. Lecture Notes in Computer Science.
269-284.
-
Berman, P., & Garay, J. A.
(1998).
Adaptability and the Usefulness of Hints (Extended Abstract). 271-282.
-
Bellare, M., Garay, J. A., & Rabin, T.
(1998).
Batch Verification with Applications to Cryptography and Checking. 170-191.
-
Bellare, M., Garay, J. A., & Rabin, T.
(1998).
Fast Batch Verification for Modular Exponentiation and Digital Signatures. 236-250.
-
Buhrman, H., Franklin, M. K., Garay, J. A., Hoepman, J., Tromp, J., & Vitnyi, P.
(1998).
Mutual Search (Extended Abstract). 481-489.
-
Bellare, M., Garay, J. A., Jutla, C. S., & Yung, M.
(1998).
VarietyCash: A Multi-Purpose Electronic Payment System
-
Berman, P., & Garay, J. A.
(1997).
Competing against Specialists. 284.
-
Garay, J. A., Gennaro, R., Jutla, C. S., & Rabin, T.
(1997).
Secure Distributed Storage and Retrieval. 275-289.
-
Moir, M., & Garay, J. A.
(1996).
Fast, Long-Lived Renaming Improved and Simplified (Abstract). 152.
-
Moir, M., & Garay, J. A.
(1996).
Fast, Long-Lived Renaming Improved and Simplified. 287-303.
-
Bellare, M., Garay, J. A., & Rabin, T.
(1996).
Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. 191-200.
-
Aggarwal, S., Garay, J. A., & Herzberg, A.
(1995).
Adaptive Video on Demand. 538-553.
-
Cheng, P., Garay, J. A., Herzberg, A., & Krawczyk, H.
(1995).
Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX
-
Buhrman, H., Garay, J. A., Hoepman, J., & Moir, M.
(1995).
Long-Lived Renaming Made Fast. 194-203.
-
Buhrman, H., Garay, J. A., & Hoepman, J.
(1995).
Optimal Resiliency against Mobile Faults. 83-88.
-
Cheng, P., Garay, J. A., Herzberg, A., & Krawczyk, H.
(1995).
Securing the Internet (Abstract). 257.
-
Bellare, M., Herzberg, A., Steiner, M., Tsudik, G., Waidner, M., Hauser, R. C., & Garay, J. A.
(1995).
iKP - A Family of Secure Electronic Payment Protocols
-
Aggarwal, S., Garay, J. A., & Herzberg, A.
(1994).
Adaptive Video on Demand. 402.
-
Garay, J. A.
(1994).
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract). 253-264.
-
Garay, J. A., Kutten, S., & Peleg, D.
(1993).
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract). 659-668.
-
Garay, J. A., Gopal, I. S., Kutten, S., Mansour, Y., & Yung, M.
(1993).
Efficient On-Line Call Control Algorithms. 285-293.
-
Garay, J. A., & Moses, Y.
(1993).
Fully polynomial Byzantine agreement in t+1 rounds. 31-41.
-
Berman, P., & Garay, J. A.
(1993).
Randomized Distributed Agreement Revisited. 412-419.
-
Garay, J. A., & Perry, K. J.
(1992).
A Continuum of Failure Models for Distributed Computing. 153-165.
-
Garay, J. A., & Gopal, I. S.
(1992).
Call Preemption in Communication Networks. 1043-1050.
-
Berman, P., Garay, J. A., & Perry, K. J.
(1992).
Optimal Early Stopping in Distributed Consensus (Extended Abstract). 221-237.
-
Berman, P., & Garay, J. A.
(1991).
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). 129-142.
-
Bar-Noy, A., Deng, X., Garay, J. A., & Kameda, T.
(1991).
Optimal Amortized Distributed Consensus (Extended Abstract). 95-107.
-
Berman, P., & Garay, J. A.
(1990).
Fast Consensus in Networks of Bounded Degree (Extended Abstract). 321-333.
-
Berman, P., & Garay, J. A.
(1989).
Asymptotically Optimal Distributed Consensus (Extended Abstract). 80-94.
-
Berman, P., & Garay, J. A.
(1989).
Efficient Agreement on Bounded-Degree Networks. 188-191.
-
Berman, P., Garay, J. A., & Perry, K. J.
(1989).
Towards Optimal Distributed Consensus (Extended Abstract). 410-415.
-
Garay, J. A., Kienzle, M. G., & Tetzlaff, W. H.
(1985).
Preliminary Analysis of Page Reference Strings of an Interactive System. 94-105.
-
Garay, J. A., Kiayias, A., & Panagiotakos, G.
(2020).
Blockchains from Non-idealized Hash Functions. Lecture Notes in Computer Science.
291-321.
Research
principal investigator on
Teaching
teaching activities
- CSCE411 Design Analy Algorithms Instructor
- CSCE433 Formal Languages Autom Instructor
- CSCE485 Directed Studies Instructor
- CSCE489 Sptp: Fd&app Of Blockchains Instructor
- CSCE489 Sptp: Found Of Blockchains Instructor
- CSCE489 Sptp:fndn In Mod Cryptography Instructor
- CSCE489 Sptp:intro Mdrn Crypto Instructor
- CSCE491 Hnr-research Instructor
- CSCE627 Th Of Computability Instructor
- CSCE629 Analysis Of Algorithms Instructor
- CSCE668 Distributed Algs & Sys Instructor
- CSCE684 Professional Internship Instructor
- CSCE685 Directed Studies Instructor
- CSCE689 Sptp: Fd&app Of Blockchains Instructor
- CSCE689 Sptp: Intro Modern Cryptograph Instructor
- CSCE689 Sptp:blockchain Foundations Instructor
- CSCE691 Research Instructor
- CSCE711 Foundation Modern Cryptography Instructor
- CSCE716 Foundations & Apps Blockchains Instructor
Background
education and training
- Ph.D. in Computer Science, Pennsylvania State University - (State College, Pennsylvania, United States) 1989
Contact
first name
- Juan
has last name
- Garay
mailing address
-
Texas A&M University
Computer Science & Engineering
3112 TAMU
College Station, TX 77843-3112
USA
Other
- garay@tamu.edu