default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan A. Garay
Person information
- affiliation: Texas A&M University, USA
- affiliation (former): Yahoo Research
- affiliation (former): Bell Labs
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j32]Juan A. Garay
, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. J. ACM 71(4): 25:1-25:49 (2024)- [c105]Alexandru Cojocaru, Juan A. Garay, Fang Song:
Generalized Hybrid Search with Applications to Blockchains and Hash Function Security. ASIACRYPT (9) 2024: 65-93 - [c104]Alexandru Cojocaru, Juan A. Garay, Qipeng Liu, Fang Song:
Improved Quantum Lifting by Coherent Measure-and-Reprogram. ASIACRYPT (9) 2024: 158-184 - [c103]Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos:
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. CRYPTO (2) 2024: 113-146 - [c102]Juan A. Garay, Aggelos Kiayias, Yu Shen:
Proof-of-Work-Based Consensus in Expected-Constant Time. EUROCRYPT (3) 2024: 96-125 - [c101]Nishanth Chandran, Juan A. Garay, Ankit Kumar Misra, Rafail Ostrovsky, Vassilis Zikas:
Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC. TCC (4) 2024: 293-326 - [i58]Marshall Ball, Juan A. Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos:
Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity. IACR Cryptol. ePrint Arch. 2024: 637 (2024) - [i57]Nishanth Chandran, Juan A. Garay, Ankit Kumar Misra, Rafail Ostrovsky, Vassilis Zikas:
Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC. IACR Cryptol. ePrint Arch. 2024: 1489 (2024) - [i56]Juan A. Garay, Yun Lu, Julien Prat, Brady Testa, Vassilis Zikas:
A Composability Treatment of Bitcoin's Transaction Ledger with Variable Difficulty. IACR Cryptol. ePrint Arch. 2024: 1823 (2024) - 2023
- [j31]Alexandru Cojocaru, Juan A. Garay, Aggelos Kiayias, Fang Song, Petros Wallden:
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security. Quantum 7: 944 (2023) - [c100]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Completeness Theorems for Adaptively Secure Broadcast. CRYPTO (1) 2023: 3-38 - [c99]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. TCC (4) 2023: 422-451 - [i55]Alexandru Cojocaru, Juan A. Garay, Fang Song:
Generalized Hybrid Search and Applications to Blockchain and Hash Function Security. CoRR abs/2311.03723 (2023) - [i54]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. CoRR abs/2312.14506 (2023) - [i53]Alexandru Cojocaru, Juan A. Garay, Fang Song:
Generalized Hybrid Search and Applications. IACR Cryptol. ePrint Arch. 2023: 798 (2023) - [i52]Ran Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas:
Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited. IACR Cryptol. ePrint Arch. 2023: 1003 (2023) - [i51]Juan A. Garay, Aggelos Kiayias, Yu Shen:
Proof-of-Work-based Consensus in Expected-Constant Time. IACR Cryptol. ePrint Arch. 2023: 1663 (2023) - 2022
- [c98]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. ITC 2022: 14:1-14:25 - [c97]Juan A. Garay, Aggelos Kiayias, Yu Shen:
Permissionless Clock Synchronization with Public Setup. TCC (3) 2022: 181-211 - [e10]Ittay Eyal, Juan A. Garay:
Financial Cryptography and Data Security - 26th International Conference, FC 2022, Grenada, May 2-6, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13411, Springer 2022, ISBN 978-3-031-18282-2 [contents] - [i50]Juan A. Garay, Aggelos Kiayias, Yu Shen:
Permissionless Clock Synchronization with Public Setup. IACR Cryptol. ePrint Arch. 2022: 1220 (2022) - 2021
- [j30]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. J. Cryptol. 34(2): 12 (2021) - [c96]Juan A. Garay, Yu Shen:
On Bitcoin cash's target recalculation functions. AFT 2021: 192-204 - [e9]Juan A. Garay:
Public-Key Cryptography - PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10-13, 2021, Proceedings, Part I. Lecture Notes in Computer Science 12710, Springer 2021, ISBN 978-3-030-75244-6 [contents] - [e8]Juan A. Garay:
Public-Key Cryptography - PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10-13, 2021, Proceedings, Part II. Lecture Notes in Computer Science 12711, Springer 2021, ISBN 978-3-030-75247-7 [contents] - [i49]Juan A. Garay, Yu Shen:
The Bitcoin Cash Backbone Protocol. IACR Cryptol. ePrint Arch. 2021: 143 (2021) - [i48]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Adaptively Secure Broadcast in Resource-Restricted Cryptography. IACR Cryptol. ePrint Arch. 2021: 775 (2021) - [i47]Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1398 (2021) - 2020
- [j29]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
The combinatorics of hidden diversity. Theor. Comput. Sci. 812: 80-95 (2020) - [c95]Juan A. Garay, Aggelos Kiayias:
SoK: A Consensus Taxonomy in the Blockchain Era. CT-RSA 2020: 284-318 - [c94]Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Consensus from Signatures of Work. CT-RSA 2020: 319-344 - [c93]Juan A. Garay, Aggelos Kiayias, Rafail M. Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era. EUROCRYPT (2) 2020: 129-158 - [c92]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Broadcast-Optimal Two-Round MPC. EUROCRYPT (2) 2020: 828-858 - [c91]Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Blockchains from Non-idealized Hash Functions. TCC (1) 2020: 291-321 - [i46]Alexandru Cojocaru, Juan A. Garay, Aggelos Kiayias, Fang Song, Petros Wallden:
Post-Quantum Security of the Bitcoin Backbone and Quantum Multi-Solution Bernoulli Search. CoRR abs/2012.15254 (2020) - [i45]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
Full Analysis of Nakamoto Consensus in Bounded-Delay Networks. IACR Cryptol. ePrint Arch. 2020: 277 (2020)
2010 – 2019
- 2019
- [j28]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. J. Cryptol. 32(3): 690-741 (2019) - [j27]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Muni Venkateswarlu Kumaramangalam:
Perennial secure multi-party computation of universal Turing machine. Theor. Comput. Sci. 769: 43-62 (2019) - [i44]Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Iterated Search Problems and Blockchain Security under Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2019: 315 (2019) - [i43]Alexandru Cojocaru, Juan A. Garay, Aggelos Kiayias, Fang Song, Petros Wallden:
The Bitcoin Backbone Protocol Against Quantum Adversaries. IACR Cryptol. ePrint Arch. 2019: 1150 (2019) - [i42]Ran Cohen, Juan A. Garay, Vassilis Zikas:
Broadcast-Optimal Two-Round MPC. IACR Cryptol. ePrint Arch. 2019: 1183 (2019) - [i41]Juan A. Garay, Aggelos Kiayias, Rafail Ostrovsky, Giorgos Panagiotakos, Vassilis Zikas:
Resource-Restricted Cryptography: Honest-Majority MPC from a CRS (and No Broadcast). IACR Cryptol. ePrint Arch. 2019: 1264 (2019) - 2018
- [c90]Christian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin. EUROCRYPT (2) 2018: 34-65 - [c89]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos:
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. Public Key Cryptography (2) 2018: 465-495 - [i40]Christian Badertscher, Juan A. Garay, Ueli Maurer, Daniel Tschudi, Vassilis Zikas:
But Why does it Work? A Rational Protocol Design Treatment of Bitcoin. IACR Cryptol. ePrint Arch. 2018: 138 (2018) - [i39]Juan A. Garay, Aggelos Kiayias:
SoK: A Consensus Taxonomy in the Blockchain Era. IACR Cryptol. ePrint Arch. 2018: 754 (2018) - 2017
- [j26]Juan A. Garay, Rafail Ostrovsky:
Special Issue: Algorithmic Tools in Cryptography. Algorithmica 79(4): 985-986 (2017) - [c88]Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala:
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. CCS 2017: 277-294 - [c87]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. CRYPTO (1) 2017: 291-323 - [c86]Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
The Price of Low Communication in Secure Multi-party Computation. CRYPTO (1) 2017: 420-446 - [c85]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. ICALP 2017: 37:1-37:15 - [c84]Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Secure Self-Stabilizing Computation. PODC 2017: 415-417 - [i38]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2017: 364 (2017) - [i37]Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala:
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case. IACR Cryptol. ePrint Arch. 2017: 519 (2017) - [i36]Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas:
The Price of Low Communication in Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017: 520 (2017) - [i35]Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Proofs of Work for Blockchain Protocols. IACR Cryptol. ePrint Arch. 2017: 775 (2017) - 2016
- [j25]Juan A. Garay, Vladimir Kolesnikov, Rae McLellan:
MAC Precomputation with Applications to Secure Memory. ACM Trans. Priv. Secur. 19(2): 6:1-6:21 (2016) - [c83]Sandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas:
Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions. ASIACRYPT (2) 2016: 998-1021 - [c82]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. CRYPTO (3) 2016: 240-269 - [c81]Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung:
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. SCN 2016: 237-253 - [r2]Juan A. Garay:
Optimal Probabilistic Synchronous Byzantine Agreement. Encyclopedia of Algorithms 2016: 1467-1470 - [i34]Sandro Coretti, Juan A. Garay, Martin Hirt, Vassilis Zikas:
Constant-Round Asynchronous Multi-Party Computation. IACR Cryptol. ePrint Arch. 2016: 208 (2016) - [i33]Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas:
Probabilistic Termination and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2016: 350 (2016) - [i32]Xiong Fan, Juan A. Garay, Payman Mohassel:
Short and Adjustable Signatures. IACR Cryptol. ePrint Arch. 2016: 549 (2016) - [i31]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos:
Bootstrapping the Blockchain - Directly. IACR Cryptol. ePrint Arch. 2016: 991 (2016) - [i30]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol with Chains of Variable Difficulty. IACR Cryptol. ePrint Arch. 2016: 1048 (2016) - 2015
- [j24]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards efficient private distributed computation on unbounded input streams. J. Math. Cryptol. 9(2): 79-94 (2015) - [j23]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation with Edge Corruptions. J. Cryptol. 28(4): 745-768 (2015) - [c80]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. EUROCRYPT (2) 2015: 281-310 - [c79]Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas:
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. ITCS 2015: 153-162 - [c78]Juan A. Garay:
Blockchain-Based Consensus (Keynote). OPODIS 2015: 5:1-5:1 - [c77]Juan A. Garay, Jonathan Katz, Björn Tackmann, Vassilis Zikas:
How Fair is Your Protocol?: A Utility-based Approach to Protocol Optimality. PODC 2015: 281-290 - [c76]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. TCC (1) 2015: 134-158 - [c75]Juan A. Garay, Björn Tackmann, Vassilis Zikas:
Fair Distributed Computation of Reactive Functions. DISC 2015: 497-512 - [i29]Juan A. Garay, Jonathan Katz, Björn Tackmann, Vassilis Zikas:
How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality. IACR Cryptol. ePrint Arch. 2015: 187 (2015) - [i28]Juan A. Garay, Björn Tackmann, Vassilis Zikas:
Fair Distributed Computation of Reactive Functions. IACR Cryptol. ePrint Arch. 2015: 807 (2015) - 2014
- [j22]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission With Small Public Discussion. IEEE Trans. Inf. Theory 60(4): 2373-2390 (2014) - [c74]Juan A. Garay, Yuval Ishai, Ranjit Kumaresan, Hoeteck Wee:
On the Complexity of UC Commitments. EUROCRYPT 2014: 677-694 - [c73]Juan A. Garay, Clinton Givens, Rafail Ostrovsky, Pavel Raykov:
Fast and unconditionally secure anonymous channel. PODC 2014: 313-321 - [c72]Andrea G. Forte, Juan A. Garay, Trevor Jim, Yevgeniy Vahlis:
EyeDecrypt - Private Interactions in Plain Sight. SCN 2014: 255-276 - [e7]Juan A. Garay, Rosario Gennaro:
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I. Lecture Notes in Computer Science 8616, Springer 2014, ISBN 978-3-662-44370-5 [contents] - [e6]Juan A. Garay, Rosario Gennaro:
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II. Lecture Notes in Computer Science 8617, Springer 2014, ISBN 978-3-662-44380-4 [contents] - [i27]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 209 (2014) - [i26]Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas:
Optimally Resilient and Adaptively Secure Multi-Party Computation with Low Communication Locality. IACR Cryptol. ePrint Arch. 2014: 615 (2014) - [i25]Juan A. Garay, Aggelos Kiayias, Nikos Leonardos:
The Bitcoin Backbone Protocol: Analysis and Applications. IACR Cryptol. ePrint Arch. 2014: 765 (2014) - 2013
- [c71]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards Efficient Private Distributed Computation on Unbounded Input Streams - (Extended Abstract). ACNS 2013: 69-83 - [c70]Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Rational Protocol Design: Cryptography against Incentive-Driven Adversaries. FOCS 2013: 648-657 - [c69]Juan A. Garay, Clint Givens, Rafail Ostrovsky, Pavel Raykov:
Broadcast (and Round) Efficient Verifiable Secret Sharing. ICITS 2013: 200-219 - [c68]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based corruptions and the combinatorics of hidden diversity. ITCS 2013: 415-428 - [e5]Ran Canetti, Juan A. Garay:
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I. Lecture Notes in Computer Science 8042, Springer 2013, ISBN 978-3-642-40040-7 [contents] - [e4]Ran Canetti, Juan A. Garay:
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II. Lecture Notes in Computer Science 8043, Springer 2013, ISBN 978-3-642-40083-4 [contents] - [i24]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Towards Efficient Private Distributed Computation on Unbounded Input Streams. IACR Cryptol. ePrint Arch. 2013: 220 (2013) - [i23]Juan A. Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, Vassilis Zikas:
Rational Protocol Design: Cryptography Against Incentive-driven Adversaries. IACR Cryptol. ePrint Arch. 2013: 496 (2013) - [i22]Andrea G. Forte, Juan A. Garay, Trevor Jim, Yevgeniy Vahlis:
EyeDecrypt - Private Interactions in Plain Sight. IACR Cryptol. ePrint Arch. 2013: 590 (2013) - 2012
- [c67]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Edge Fault Tolerance on Sparse Networks. ICALP (2) 2012: 452-463 - [c66]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. DISC 2012: 431-432 - [i21]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Efficient Private Distributed Computation on Unbounded Input Streams. CoRR abs/1208.4909 (2012) - [i20]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Broadcast-Efficient Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2012: 130 (2012) - [i19]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation with Edge Corruptions. IACR Cryptol. ePrint Arch. 2012: 221 (2012) - [i18]Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung:
On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2012: 508 (2012) - [i17]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based Corruptions and the Combinatorics of Hidden Diversity. IACR Cryptol. ePrint Arch. 2012: 556 (2012) - 2011
- [j21]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable symmetric encryption: Improved definitions and efficient constructions. J. Comput. Secur. 19(5): 895-934 (2011) - [j20]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. J. Cryptol. 24(4): 615-658 (2011) - [c65]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission by Public Discussion: A Brief Survey. IWCC 2011: 126-141 - [c64]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov:
Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. ICS 2011: 32-44 - [c63]Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou:
Adaptively secure broadcast, revisited. PODC 2011: 179-186 - 2010
- [c62]Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou:
A Framework for the Sound Specification of Cryptographic Tasks. CSF 2010: 277-289 - [c61]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission with Small Public Discussion. EUROCRYPT 2010: 177-196 - [c60]Nishanth Chandran, Juan A. Garay, Rafail Ostrovsky:
Improved Fault Tolerance and Secure Computation on Sparse Networks. ICALP (2) 2010: 249-260 - [c59]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov:
Brief announcement: swarming secrets. PODC 2010: 231-232 - [e3]Juan A. Garay, Roberto De Prisco:
Security and Cryptography for Networks, 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6280, Springer 2010, ISBN 978-3-642-15316-7 [contents]
2000 – 2009
- 2009
- [c58]Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov:
Swarming secrets. Allerton 2009: 1438-1445 - [c57]Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou:
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer. CRYPTO 2009: 505-523 - [c56]Juan A. Garay, Vladimir Kolesnikov, Rae McLellan:
MAC Precomputation with Applications to Secure Memory. ISC 2009: 427-442 - [e2]Juan A. Garay, Atsuko Miyaji, Akira Otsuka:
Cryptology and Network Security, 8th International Conference, CANS 2009, Kanazawa, Japan, December 12-14, 2009. Proceedings. Lecture Notes in Computer Science 5888, Springer 2009, ISBN 978-3-642-10432-9 [contents] - [i16]Juan A. Garay, Vladimir Kolesnikov, Rae McLellan:
MAC Precomputation with Applications to Secure Memory. IACR Cryptol. ePrint Arch. 2009: 358 (2009) - [i15]Juan A. Garay, Clint Givens, Rafail Ostrovsky:
Secure Message Transmission with Small Public Discussion. IACR Cryptol. ePrint Arch. 2009: 519 (2009) - 2008
- [c55]Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation. EUROCRYPT 2008: 307-323 - [c54]Juan A. Garay:
Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk). ICITS 2008: 1 - [r1]Juan A. Garay:
Optimal Probabilistic Synchronous Byzantine Agreement. Encyclopedia of Algorithms 2008 - [i14]Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou:
Sound and Fine-grain Specification of Ideal Functionalities. Theoretical Foundations of Practical Information Security 2008 - [i13]Juan A. Garay, Aggelos Kiayias, Hong-Sheng Zhou:
A Framework for the Sound Specification of Cryptographic Tasks. IACR Cryptol. ePrint Arch. 2008: 132 (2008) - [i12]Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou:
Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer. IACR Cryptol. ePrint Arch. 2008: 534 (2008) - 2007
- [c53]Juan A. Garay, Jonathan Katz, Chiu-Yuen Koo, Rafail Ostrovsky:
Round Complexity of Authenticated Broadcast with a Dishonest Majority. FOCS 2007: 658-668 - [c52]Juan A. Garay, Berry Schoenmakers, José Villegas:
Practical and Secure Solutions for Integer Comparison. Public Key Cryptography 2007: 330-342 - [c51]Matthias Fitzi, Matthew K. Franklin, Juan A. Garay, Harsha Vardhan Simhadri:
Towards Optimal and Efficient Perfectly Secure Message Transmission. TCC 2007: 311-322 - [e1]Juan A. Garay, Arjen K. Lenstra, Masahiro Mambo, René Peralta:
Information Security, 10th International Conference, ISC 2007, Valparaíso, Chile, October 9-12, 2007, Proceedings. Lecture Notes in Computer Science 4779, Springer 2007, ISBN 978-3-540-75495-4 [contents] - [i11]Juan A. Garay, Rafail Ostrovsky:
Almost-everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2007: 394 (2007) - 2006
- [j19]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptol. 19(2): 169-209 (2006) - [c50]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable symmetric encryption: improved definitions and efficient constructions. CCS 2006: 79-88 - [c49]Juan A. Garay, Lorenz Huelsbergen:
Software integrity protection using timed executable agents. AsiaCCS 2006: 189-200 - [c48]Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan:
Round-Optimal and Efficient Verifiable Secret Sharing. TCC 2006: 329-342 - [c47]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. TCC 2006: 404-428 - [i10]Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky:
Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. IACR Cryptol. ePrint Arch. 2006: 210 (2006) - 2005
- [j18]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-Party Computation. J. Cryptol. 18(1): 37-61 (2005) - [i9]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2005: 370 (2005) - 2004
- [j17]Juan A. Garay, Sergio Rajsbaum:
Preface. Theor. Comput. Sci. 321(1): 1-3 (2004) - [c46]Juan A. Garay:
Efficient and Universally Composable Committed Oblivious Transfer and Applications. TCC 2004: 297-316 - [i8]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. IACR Cryptol. ePrint Arch. 2004: 9 (2004) - [i7]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Universally Composable Committed Oblivious Transfer and Applications. IACR Cryptol. ePrint Arch. 2004: 53 (2004) - 2003
- [j16]Amotz Bar-Noy, Juan A. Garay, Amir Herzberg:
Sharing Video on Demand. Discret. Appl. Math. 129(1): 3-30 (2003) - [j15]Luca Salgarelli, Milind M. Buddhikot, Juan A. Garay, Sarvar Patel, Scott C. Miller:
Efficient authentication and key distribution in wireless IP networks. IEEE Wirel. Commun. 10(6): 52-61 (2003) - [c45]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194 - [c44]Juan A. Garay, Carl Pomerance:
Timed Fair Exchange of Standard Signatures: [Extended Abstract]. Financial Cryptography 2003: 190-207 - [c43]Matthias Fitzi, Juan A. Garay:
Efficient player-optimal protocols for strong and differential consensus. PODC 2003: 211-220 - [i6]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols using Signatures. IACR Cryptol. ePrint Arch. 2003: 37 (2003) - [i5]Juan A. Garay, Carl Pomerance:
Timed Fair Exchange of Standard Signatures. IACR Cryptol. ePrint Arch. 2003: 42 (2003) - 2002
- [j14]Uri Blumenthal, Milind M. Buddhikot, Juan A. Garay, Scott C. Miller, Sarvar Patel, Luca Salgarelli, Dorothy Stanley:
A scheme for authentication and dynamic key exchange in wireless networks. Bell Labs Tech. J. 7(2): 37-48 (2002) - [c42]Juan A. Garay, Markus Jakobsson:
Timed Release of Standard Digital Signatures. Financial Cryptography 2002: 168-182 - [c41]Juan A. Garay, Joseph Naor, Bülent Yener, Peng Zhao:
On-line Admission Control and Packet Scheduling with Interleaving. INFOCOM 2002: 94-103 - [i4]Matthias Fitzi, Juan A. Garay:
Efficient and Player-Optimal Strong Consensus. IACR Cryptol. ePrint Arch. 2002: 85 (2002) - 2001
- [c40]Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-party Computation. CRYPTO 2001: 80-100 - 2000
- [j13]José Carlos Brustoloni, Juan A. Garay:
MicroISPs: providing convenient and low-cost high-bandwidth Internet access. Comput. Networks 33(1-6): 789-802 (2000) - [j12]Mihir Bellare, Juan A. Garay, Ralf C. Hauser, Amir Herzberg, Hugo Krawczyk, Michael Steiner, Gene Tsudik, Els Van Herreweghen, Michael Waidner:
Design, implementation, and deployment of the iKP secure electronic payment system. IEEE J. Sel. Areas Commun. 18(4): 611-627 (2000) - [j11]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure distributed storage and retrieval. Theor. Comput. Sci. 243(1-2): 363-389 (2000) - [c39]Juan A. Garay, Jessica Staddon, Avishai Wool:
Long-Lived Broadcast Encryption. CRYPTO 2000: 333-352 - [c38]Juan A. Garay, Philip D. MacKenzie:
Concurrent Oblivious Transfer. FOCS 2000: 314-324 - [c37]José Carlos Brustoloni, Juan A. Garay:
Application-Independent End-to-End Security in Shared-Link Access Networks. NETWORKING 2000: 608-619
1990 – 1999
- 1999
- [j10]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search. J. ACM 46(4): 517-536 (1999) - [c36]Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie:
Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466 - [c35]Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas:
Multicast Security: A Taxonomy and Some Efficient Constructions. INFOCOM 1999: 708-716 - [c34]Juan A. Garay, Philip D. MacKenzie:
Abuse-Free Multi-party Contract Signing. DISC 1999: 151-165 - [c33]Matthew K. Franklin, Juan A. Garay, Moti Yung:
Self-Testing/Correcting Protocols (Extended Abstract). DISC 1999: 269-283 - [i3]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search. CoRR cs.DS/9902005 (1999) - 1998
- [j9]Pau-Chen Cheng, Juan A. Garay, Amir Herzberg, Hugo Krawczyk:
A Security Architecture for the Internet Protocol. IBM Syst. J. 37(1): 42-60 (1998) - [j8]Juan A. Garay, Yoram Moses:
Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM J. Comput. 27(1): 247-290 (1998) - [j7]Juan A. Garay, Shay Kutten, David Peleg:
A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees. SIAM J. Comput. 27(1): 302-316 (1998) - [c32]Piotr Berman, Juan A. Garay:
Adaptability and the Usefulness of Hints (Extended Abstract). ESA 1998: 271-282 - [c31]Mihir Bellare, Juan A. Garay, Tal Rabin:
Fast Batch Verification for Modular Exponentiation and Digital Signatures. EUROCRYPT 1998: 236-250 - [c30]Mihir Bellare, Juan A. Garay, Tal Rabin:
Batch Verification with Applications to Cryptography and Checking. LATIN 1998: 170-191 - [c29]Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi:
Mutual Search (Extended Abstract). SODA 1998: 481-489 - [c28]Mihir Bellare, Juan A. Garay, Charanjit S. Jutla, Moti Yung:
VarietyCash: A Multi-Purpose Electronic Payment System. USENIX Workshop on Electronic Commerce 1998 - [i2]Mihir Bellare, Juan A. Garay, Tal Rabin:
Fast Batch Verification for Modular Exponentiation and Digital Signatures. IACR Cryptol. ePrint Arch. 1998: 7 (1998) - [i1]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. IACR Cryptol. ePrint Arch. 1998: 25 (1998) - 1997
- [j6]Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms. J. Algorithms 23(1): 180-194 (1997) - [c27]Piotr Berman, Juan A. Garay:
Competing against Specialists. PODC 1997: 284 - [c26]Juan A. Garay, Rosario Gennaro, Charanjit S. Jutla, Tal Rabin:
Secure Distributed Storage and Retrieval. WDAG 1997: 275-289 - 1996
- [c25]Mark Moir, Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified (Abstract). PODC 1996: 152 - [c24]Mihir Bellare, Juan A. Garay, Tal Rabin:
Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. PODC 1996: 191-200 - [c23]Mark Moir, Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified. WDAG 1996: 287-303 - 1995
- [j5]Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus. Inf. Comput. 120(1): 93-100 (1995) - [c22]Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg:
Adaptive Video on Demand. ESA 1995: 538-553 - [c21]Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman:
Optimal Resiliency against Mobile Faults. FTCS 1995: 83-88 - [c20]Harry Buhrman, Juan A. Garay, Jaap-Henk Hoepman, Mark Moir:
Long-Lived Renaming Made Fast. PODC 1995: 194-203 - [c19]Pau-Chen Cheng, Juan A. Garay, Amir Herzberg, Hugo Krawczyk:
Securing the Internet (Abstract). PODC 1995: 257 - [c18]Pau-Chen Cheng, Juan A. Garay, Amir Herzberg, Hugo Krawczyk:
Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX. USENIX Security Symposium 1995 - [c17]Mihir Bellare, Amir Herzberg, Michael Steiner, Gene Tsudik, Michael Waidner, Ralf C. Hauser, Juan A. Garay:
iKP - A Family of Secure Electronic Payment Protocols. USENIX Workshop on Electronic Commerce 1995 - 1994
- [c16]Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg:
Adaptive Video on Demand. PODC 1994: 402 - [c15]Juan A. Garay:
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract). WDAG 1994: 253-264 - 1993
- [j4]Piotr Berman, Juan A. Garay:
Fast Consensus in Networks of Bounded Degree. Distributed Comput. 7(2): 67-73 (1993) - [j3]Piotr Berman, Juan A. Garay:
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. Math. Syst. Theory 26(1): 3-19 (1993) - [c14]Juan A. Garay, Shay Kutten, David Peleg:
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract). FOCS 1993: 659-668 - [c13]Piotr Berman, Juan A. Garay:
Randomized Distributed Agreement Revisited. FTCS 1993: 412-419 - [c12]Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms. ISTCS 1993: 285-293 - [c11]Juan A. Garay, Yoram Moses:
Fully polynomial Byzantine agreement in t+1 rounds. STOC 1993: 31-41 - 1992
- [c10]Juan A. Garay, Inder S. Gopal:
Call Preemption in Communication Networks. INFOCOM 1992: 1043-1050 - [c9]Juan A. Garay, Kenneth J. Perry:
A Continuum of Failure Models for Distributed Computing. WDAG 1992: 153-165 - [c8]Piotr Berman, Juan A. Garay, Kenneth J. Perry:
Optimal Early Stopping in Distributed Consensus (Extended Abstract). WDAG 1992: 221-237 - 1991
- [c7]Amotz Bar-Noy, Xiaotie Deng, Juan A. Garay, Tiko Kameda:
Optimal Amortized Distributed Consensus (Extended Abstract). WDAG 1991: 95-107 - [c6]Piotr Berman, Juan A. Garay:
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). WDAG 1991: 129-142 - 1990
- [c5]Piotr Berman, Juan A. Garay:
Fast Consensus in Networks of Bounded Degree (Extended Abstract). WDAG 1990: 321-333
1980 – 1989
- 1989
- [j2]William H. Tetzlaff, Martin G. Kienzle, Juan A. Garay:
Analysis of Block-Paging Strategies. IBM J. Res. Dev. 33(1): 51-59 (1989) - [c4]Piotr Berman, Juan A. Garay, Kenneth J. Perry:
Towards Optimal Distributed Consensus (Extended Abstract). FOCS 1989: 410-415 - [c3]Piotr Berman, Juan A. Garay:
Asymptotically Optimal Distributed Consensus (Extended Abstract). ICALP 1989: 80-94 - [c2]Piotr Berman, Juan A. Garay:
Efficient Agreement on Bounded-Degree Networks. ICPP (1) 1989: 188-191 - 1988
- [j1]Martin G. Kienzle, Juan A. Garay, William H. Tetzlaff:
Analysis of Page-Reference Strings of an Interactive System. IBM J. Res. Dev. 32(4): 523-535 (1988) - 1985
- [c1]Juan A. Garay, Martin G. Kienzle, William H. Tetzlaff:
Preliminary Analysis of Page Reference Strings of an Interactive System. Int. CMG Conference 1985: 94-105
Coauthor Index
Rafail Ostrovsky
aka: Rafail M. Ostrovsky
aka: Rafail M. Ostrovsky
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
