#### Filter Results:

- Full text PDF available (86)

#### Publication Year

1985

2017

- This year (7)
- Last 5 years (36)
- Last 10 years (56)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail Ostrovsky
- Journal of Computer Security
- 2006

Searchable symmetric encryption (SSE) allows a party to outsource the storage of its data to another party (a server) in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research in recent years. In this paper we show two solutions to SSE that simultaneously enjoy the following… (More)

- Ran Canetti, Juan A. Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
- INFOCOM
- 1999

Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out relevant security… (More)

- Mihir Bellare, Juan A. Garay, Tal Rabin
- EUROCRYPT
- 1998

Many tasks in cryptography (e.g., digital signature verification) call for verification of a basic operation like modular exponentiation in some group: given (g, x, y) check that g = y. This is typically done by re-computing g and checking we get y. We would like to do it differently, and faster. The approach we use is batching. Focusing first on the basic… (More)

- Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie
- CRYPTO
- 1999

We introduce the notion of abuse-free distributed contract signing, that is, distributed contract signing in which no party ever can prove to a third party that he is capable of choosing whether to validate or invalidate the contract. Assume Alice and Bob are signing a contract. If the contract protocol they use is not abuse-free, then it is possible for… (More)

- Juan A. Garay, Aggelos Kiayias, Nikos Leonardos
- EUROCRYPT
- 2014

Bitcoin is the first and most popular decentralized cryptocurrency to date. In this work, we extract and analyze the core of the Bitcoin protocol, which we term the Bitcoin backbone, and prove two of its fundamental properties which we call common prefix and chain quality. Our proofs hinge on appropriate and novel assumptions on the “hashing power” of the… (More)

- Juan A. Garay, Shay Kutten, David Peleg
- SIAM J. Comput.
- 1993

This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network’s diameter… (More)

- Piotr Berman, Juan A. Garay, Kenneth J. Perry
- WDAG
- 1992

Perfectly secure message transmission (PSMT), a problem formulated by Dolev, Dwork, Waarts and Yung, involves a sender S and a recipient R who are connected by n synchronous channels of which up to t may be corrupted by an active adversary. The goal is to transmit, with perfect security, a message from S to R. PSMT is achievable if and only if n > 2t. For… (More)

- Juan A. Garay, Inder S. Gopal
- INFOCOM
- 1992

The technique of preempting ongoing calls in order to accommodate new calls of greater “value” has been used in many existing networks. In this paper we investigate some problems that relate to making the best decision on which (if any) call to preempt. We provide some results on the computational complexity of these problems and on how well simple… (More)

We consider perfect verifiable secret sharing (VSS) in a synchronous network of n processors (players) where a designated player called the dealer wishes to distribute a secret s among the players in a way that no t of them obtain any information, but any t + 1 players obtain full information about the secret. The round complexity of a VSS protocol is… (More)