2008 |
72 | EE | Juan A. Garay,
Rafail Ostrovsky:
Almost-Everywhere Secure Computation.
EUROCRYPT 2008: 307-323 |
71 | EE | Juan A. Garay:
Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk).
ICITS 2008: 1 |
70 | EE | Juan A. Garay:
Optimal Probabilistic Synchronous Byzantine Agreement.
Encyclopedia of Algorithms 2008 |
2007 |
69 | | 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
Springer 2007 |
68 | EE | Juan A. Garay,
Jonathan Katz,
Chiu-Yuen Koo,
Rafail Ostrovsky:
Round Complexity of Authenticated Broadcast with a Dishonest Majority.
FOCS 2007: 658-668 |
67 | EE | Juan A. Garay,
Berry Schoenmakers,
José Villegas:
Practical and Secure Solutions for Integer Comparison.
Public Key Cryptography 2007: 330-342 |
66 | EE | Matthias Fitzi,
Matthew K. Franklin,
Juan A. Garay,
S. Harsha Vardhan:
Towards Optimal and Efficient Perfectly Secure Message Transmission.
TCC 2007: 311-322 |
2006 |
65 | EE | Reza Curtmola,
Juan A. Garay,
Seny Kamara,
Rafail Ostrovsky:
Searchable symmetric encryption: improved definitions and efficient constructions.
ACM Conference on Computer and Communications Security 2006: 79-88 |
64 | EE | Juan A. Garay,
Lorenz Huelsbergen:
Software integrity protection using timed executable agents.
ASIACCS 2006: 189-200 |
63 | EE | Matthias Fitzi,
Juan A. Garay,
Shyamnath Gollakota,
C. Pandu Rangan,
K. Srinathan:
Round-Optimal and Efficient Verifiable Secret Sharing.
TCC 2006: 329-342 |
62 | EE | Juan A. Garay,
Philip D. MacKenzie,
Manoj Prabhakaran,
Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols.
TCC 2006: 404-428 |
61 | EE | Juan A. Garay,
Philip D. MacKenzie,
Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures.
J. Cryptology 19(2): 169-209 (2006) |
2005 |
60 | EE | Matthias Fitzi,
Juan A. Garay,
Ueli M. Maurer,
Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-Party Computation.
J. Cryptology 18(1): 37-61 (2005) |
2004 |
59 | EE | Juan A. Garay:
Efficient and Universally Composable Committed Oblivious Transfer and Applications.
TCC 2004: 297-316 |
58 | EE | Juan A. Garay,
Sergio Rajsbaum:
Preface.
Theor. Comput. Sci. 321(1): 1-3 (2004) |
2003 |
57 | EE | Juan A. Garay,
Philip D. MacKenzie,
Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures.
EUROCRYPT 2003: 177-194 |
56 | EE | Juan A. Garay,
Carl Pomerance:
Timed Fair Exchange of Standard Signatures: [Extended Abstract].
Financial Cryptography 2003: 190-207 |
55 | EE | Matthias Fitzi,
Juan A. Garay:
Efficient player-optimal protocols for strong and differential consensus.
PODC 2003: 211-220 |
54 | EE | Amotz Bar-Noy,
Juan A. Garay,
Amir Herzberg:
Sharing Video on Demand.
Discrete Applied Mathematics 129(1): 3-30 (2003) |
2002 |
53 | EE | Juan A. Garay,
Markus Jakobsson:
Timed Release of Standard Digital Signatures.
Financial Cryptography 2002: 168-182 |
52 | EE | Juan A. Garay,
Joseph Naor,
Bülent Yener,
Peng Zhao:
On-line Admission Control and Packet Scheduling with Interleaving.
INFOCOM 2002 |
51 | EE | 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 Technical Journal 7(2): 37-48 (2002) |
2001 |
50 | EE | Matthias Fitzi,
Juan A. Garay,
Ueli M. Maurer,
Rafail Ostrovsky:
Minimal Complete Primitives for Secure Multi-party Computation.
CRYPTO 2001: 80-100 |
2000 |
49 | EE | Juan A. Garay,
Jessica Staddon,
Avishai Wool:
Long-Lived Broadcast Encryption.
CRYPTO 2000: 333-352 |
48 | | Juan A. Garay,
Philip D. MacKenzie:
Concurrent Oblivious Transfer.
FOCS 2000: 314-324 |
47 | EE | José Carlos Brustoloni,
Juan A. Garay:
Application-Independent End-to-End Security in Shared-Link Access Networks.
NETWORKING 2000: 608-619 |
46 | EE | José Carlos Brustoloni,
Juan A. Garay:
MicroISPs: providing convenient and low-cost high-bandwidth Internet access.
Computer Networks 33(1-6): 789-802 (2000) |
45 | EE | Juan A. Garay,
Rosario Gennaro,
Charanjit S. Jutla,
Tal Rabin:
Secure distributed storage and retrieval.
Theor. Comput. Sci. 243(1-2): 363-389 (2000) |
1999 |
44 | EE | Juan A. Garay,
Markus Jakobsson,
Philip D. MacKenzie:
Abuse-Free Optimistic Contract Signing.
CRYPTO 1999: 449-466 |
43 | EE | Juan A. Garay,
Philip D. MacKenzie:
Abuse-Free Multi-party Contract Signing.
DISC 1999: 151-165 |
42 | EE | Matthew K. Franklin,
Juan A. Garay,
Moti Yung:
Self-Testing/Correcting Protocols (Extended Abstract).
DISC 1999: 269-283 |
41 | | 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 |
40 | EE | 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) |
39 | EE | 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) |
1998 |
38 | EE | Piotr Berman,
Juan A. Garay:
Adaptability and the Usefulness of Hints (Extended Abstract).
ESA 1998: 271-282 |
37 | EE | Mihir Bellare,
Juan A. Garay,
Tal Rabin:
Fast Batch Verification for Modular Exponentiation and Digital Signatures.
EUROCRYPT 1998: 236-250 |
36 | EE | Mihir Bellare,
Juan A. Garay,
Tal Rabin:
Batch Verification with Applications to Cryptography and Checking.
LATIN 1998: 170-191 |
35 | | 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 |
34 | | Pau-Chen Cheng,
Juan A. Garay,
Amir Herzberg,
Hugo Krawczyk:
A Security Architecture for the Internet Protocol.
IBM Systems Journal 37(1): 42-60 (1998) |
33 | | 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) |
32 | | 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) |
1997 |
31 | | Piotr Berman,
Juan A. Garay:
Competing against Specialists.
PODC 1997: 284 |
30 | | Juan A. Garay,
Rosario Gennaro,
Charanjit S. Jutla,
Tal Rabin:
Secure Distributed Storage and Retrieval.
WDAG 1997: 275-289 |
29 | | 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) |
1996 |
28 | | Mark Moir,
Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified (Abstract).
PODC 1996: 152 |
27 | | 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 |
26 | | Mark Moir,
Juan A. Garay:
Fast, Long-Lived Renaming Improved and Simplified.
WDAG 1996: 287-303 |
1995 |
25 | | Sudhanshu Aggarwal,
Juan A. Garay,
Amir Herzberg:
Adaptive Video on Demand.
ESA 1995: 538-553 |
24 | | Harry Buhrman,
Juan A. Garay,
Jaap-Henk Hoepman:
Optimal Resiliency against Mobile Faults.
FTCS 1995: 83-88 |
23 | | Harry Buhrman,
Juan A. Garay,
Jaap-Henk Hoepman,
Mark Moir:
Long-Lived Renaming Made Fast.
PODC 1995: 194-203 |
22 | | Pau-Chen Cheng,
Juan A. Garay,
Amir Herzberg,
Hugo Krawczyk:
Securing the Internet (Abstract).
PODC 1995: 257 |
21 | | Amotz Bar-Noy,
Xiaotie Deng,
Juan A. Garay,
Tiko Kameda:
Optimal Amortized Distributed Consensus
Inf. Comput. 120(1): 93-100 (1995) |
1994 |
20 | | Sudhanshu Aggarwal,
Juan A. Garay,
Amir Herzberg:
Adaptive Video on Demand.
PODC 1994: 402 |
19 | | Juan A. Garay:
Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract).
WDAG 1994: 253-264 |
1993 |
18 | | Juan A. Garay,
Shay Kutten,
David Peleg:
A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)
FOCS 1993: 659-668 |
17 | | Piotr Berman,
Juan A. Garay:
Randomized Distributed Agreement Revisited.
FTCS 1993: 412-419 |
16 | | Juan A. Garay,
Inder S. Gopal,
Shay Kutten,
Yishay Mansour,
Moti Yung:
Efficient On-Line Call Control Algorithms.
ISTCS 1993: 285-293 |
15 | EE | Juan A. Garay,
Yoram Moses:
Fully polynomial Byzantine agreement in t+1 rounds.
STOC 1993: 31-41 |
14 | | Piotr Berman,
Juan A. Garay:
Fast Consensus in Networks of Bounded Degree.
Distributed Computing 7(2): 67-73 (1993) |
13 | | Piotr Berman,
Juan A. Garay:
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds.
Mathematical Systems Theory 26(1): 3-19 (1993) |
1992 |
12 | | Juan A. Garay,
Inder S. Gopal:
Call Preemption in Communication Networks.
INFOCOM 1992: 1043-1050 |
11 | | Juan A. Garay,
Kenneth J. Perry:
A Continuum of Failure Models for Distributed Computing.
WDAG 1992: 153-165 |
10 | | Piotr Berman,
Juan A. Garay,
Kenneth J. Perry:
Optimal Early Stopping in Distributed Consensus (Extended Abstract).
WDAG 1992: 221-237 |
1991 |
9 | | Piotr Berman,
Juan A. Garay:
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract).
WDAG 1991: 129-142 |
8 | | Amotz Bar-Noy,
Xiaotie Deng,
Juan A. Garay,
Tiko Kameda:
Optimal Amortized Distributed Consensus (Extended Abstract).
WDAG 1991: 95-107 |
1990 |
7 | | Piotr Berman,
Juan A. Garay:
Fast Consensus in Networks of Bounded Degree (Extended Abstract).
WDAG 1990: 321-333 |
1989 |
6 | | Piotr Berman,
Juan A. Garay,
Kenneth J. Perry:
Towards Optimal Distributed Consensus (Extended Abstract)
FOCS 1989: 410-415 |
5 | | Piotr Berman,
Juan A. Garay:
Asymptotically Optimal Distributed Consensus (Extended Abstract).
ICALP 1989: 80-94 |
4 | | Piotr Berman,
Juan A. Garay:
Efficient Agreement on Bounded-Degree Networks.
ICPP (1) 1989: 188-191 |
3 | | William H. Tetzlaff,
Martin G. Kienzle,
Juan A. Garay:
Analysis of Block-Paging Strategies.
IBM Journal of Research and Development 33(1): 51-59 (1989) |
1988 |
2 | | Martin G. Kienzle,
Juan A. Garay,
William H. Tetzlaff:
Analysis of Page-Reference Strings of an Interactive System.
IBM Journal of Research and Development 32(4): 523-535 (1988) |
1985 |
1 | | 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 |