Juan A. Garay
Juan A. Garay
juan.a.garayatgmail.com

  Affiliation history
Bibliometrics: publication history
Average citations per article13.04
Citation Count1,187
Publication count91
Publication years1989-2017
Available for download22
Average downloads per article359.41
Downloads (cumulative)7,907
Downloads (12 Months)1,812
Downloads (6 Weeks)215
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


91 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 91
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
October 2017 CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 19,   Downloads (12 Months): 72,   Downloads (Overall): 72

Full text available: PDFPDF
While the feasibility of constant-round and actively secure MPC has been known for over two decades, the last few years have witnessed a flurry of designs and implementations that make its deployment a palpable reality. To our knowledge, however, existing concretely efficient MPC constructions are only for up to three ...
Keywords: secure multi-party computation, cryptographic implementations, garbled circuits, oblivious transfer

2 published by ACM
July 2017 PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 70,   Downloads (Overall): 70

Full text available: PDFPDF
Self-stabilization refers to the ability of systems to recover after temporal violations of conditions required for their correct operation. Such violations may lead the system to an arbitrary state from which it should automatically recover. Today, beyond recovering functionality, there is a need to recover security and confidentiality guarantees as ...
Keywords: secure multi-party computation, security and privacy, self-stabilization

3 published by ACM
April 2017 BCC '17: Proceedings of the ACM Workshop on Blockchain, Cryptocurrencies and Contracts
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 134,   Downloads (12 Months): 1,119,   Downloads (Overall): 1,119

Full text available: PDFPDF
As the first decentralized cryptocurrency, Bitcoin [1] has ignited much excitement, not only for its novel realization of a central bank-free financial instrument, but also as an alternative approach to classical distributed computing problems, such as reaching agreement distributedly in the presence of misbehaving parties, as well as to numerous ...

4
December 2016 Proceedings, Part II, of the 22nd International Conference on Advances in Cryptology --- ASIACRYPT 2016 - Volume 10032
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Secure multi-party computation MPC allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchronous MPC parties are connected by a synchronous network with a global clock, and protocols proceed in rounds with strong delivery guarantees, whereas asynchronous MPC ...

5 published by ACM
September 2016 ACM Transactions on Privacy and Security (TOPS): Volume 19 Issue 2, September 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 56,   Downloads (Overall): 109

Full text available: PDFPDF
We present Shallow MAC (ShMAC), a fixed-input-length message authentication code that performs most of the computation prior to the availability of the message. Specifically, ShMAC’s message-dependent computation is much faster and smaller in hardware than the evaluation of a pseudorandom permutation (PRP) and can be implemented by a small shallow ...
Keywords: MAC precomputation, Message authentication code (MAC), tamper-resistant hardware, system on a chip

6
August 2016 Proceedings of the 10th International Conference on Security and Cryptography for Networks - Volume 9841
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider the problem of whether there exist non-trivial constant-round public-coin zero-knowledge ZK proofs. To date, in spite of high interest in the problem, there is no definite answer to the question. We focus on the type of ZK proofs that admit a universal simulator which handles all malicious verifiers, ...

7
August 2016 Proceedings, Part III, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9816
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

When analyzing the round complexity of multi-party computation MPC, one often overlooks the fact that underlying resources, such as a broadcast channel, can by themselves be expensive to implement. For example, it is impossible to implement a broadcast channel by a deterministic protocol in a sub-linear in the number of ...

8
October 2015 DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing - Volume 9363
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

A fair distributed protocol ensures that dishonest parties have no advantage over honest parties in learning their protocol's output. What makes fairness a particularly intriguing research topic is Cleve's seminal result [STOC'86], which proved that fairness is impossible to achieve in the presence of dishonest majorities and ignited a quest ...
Keywords: Cryptographic protocols, Fairness, Secure multi-party computation, Game theory

9
October 2015 Journal of Cryptology: Volume 28 Issue 4, October 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We consider secure multi-party computation (MPC) in a setting where the adversary can separately corrupt not only the parties (nodes) but also the communication channels (edges), and can furthermore choose selectively and adaptively which edges or nodes to corrupt. Note that if an adversary corrupts an edge, even if the ...
Keywords: Almost-everywhere secure computation, Secure message transmission, bounded-degree network, Byzantine agreement

10 published by ACM
July 2015 PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 32,   Downloads (Overall): 104

Full text available: PDFPDF
Security of distributed cryptographic protocols usually requires privacy (inputs of the honest parties remain hidden), correctness (the adversary cannot improperly affect the outcome), and fairness (if the adversary learns the output, all honest parties do also). Cleve's seminal result (STOC '86) implies that satisfying these properties simultaneously is impossible in ...
Keywords: theory, security

11 published by ACM
January 2015 ITCS '15: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Downloads (Overall): 103

Full text available: PDFPDF
The vast majority of works on secure multi-party computation (MPC) assume a full communication pattern: every party exchanges messages with all the network participants over a complete network of point-to-point channels. This can be problematic in modern large scale networks, where the number of parties can be of the order ...
Keywords: graph theory, communication locality, secure multi-party computation, adaptive security

12 published by ACM
July 2014 PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 21,   Downloads (Overall): 144

Full text available: PDFPDF
In this paper we focus on sender-anonymous channels (a.k.a. Dining Cryptographers networks ) and present a construction requiring a very low (constant) number of rounds of interaction while tolerating actively malicious behavior by some of the participants (up to less than half of them). Our construction is unconditionally secure (meaning ...
Keywords: byzantine agreement, pseudosignatures, DC-nets, anonymous message transmission

13
April 2014 IEEE Transactions on Information Theory: Volume 60 Issue 4, April 2014
Publisher: IEEE Press
Bibliometrics:
Citation Count: 0

In the problem of secure message transmission in the public discussion model (SMT-PD), a sender wants to send a message $M_{{\cal S}}\in\{0,1\}^{\ell}$ to a receiver privately and reliably. Sender and receiver are connected by $n$ channels, also known as simple wires, up to $t<n$ of which may be maliciously controlled ...

14
October 2013 FOCS '13: Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

Existing work on "rational cryptographic protocols" treats each party (or coalition of parties) running the protocol as a selfish agent trying to maximize its utility. In this work we propose a fundamentally different approach that is better suited to modeling a protocol under attack from an external entity. Specifically, we ...
Keywords: Protocols, Game Theory, Secure Computation, Composition

15
June 2013 ACNS'13: Proceedings of the 11th international conference on Applied Cryptography and Network Security
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In the problem of private "swarm" computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, ...

16 published by ACM
January 2013 ITCS '13: Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 6,   Downloads (Overall): 85

Full text available: PDFPDF
In the setting of cryptographic protocols, the corruption of a party has traditionally been viewed as a simple, uniform and atomic operation, where the adversary decides to get control over a party and this party immediately gets corrupted. In this paper, motivated by the fact that different players may require ...
Keywords: combinatorial analysis, cost of corruption, hardness amplification, exact hardness, secure multi-party computation

17
October 2012 DISC'12: Proceedings of the 26th international conference on Distributed Computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We consider a distributed computation setting in which a party, whom we refer to as the dealer , has a finite state automaton (FSA) $\mathcal{A}$ with m states,which accepts an ( a priori unbounded) stream of inputs x 1 , x 2 ,... received from an external source. The dealer ...

18
July 2012 ICALP'12: Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

Byzantine agreement, which requires n processors (nodes) in a completely connected network to agree on a value dependent on their initial values and despite the arbitrary, possible malicious behavior of some of them, is perhaps the most popular paradigm in fault-tolerant distributed systems. However, partially connected networks are far more ...

19
October 2011 Journal of Cryptology: Volume 24 Issue 4, October 2011
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

We introduce the notion of resource-fair protocols. Informally, this property states that if one party learns the output of the protocol, then so can all other parties, as long as they expend roughly the same amount of resources. As opposed to previously proposed definitions related to fairness, our definition follows ...
Keywords: Security models and definitions, Universal composability, Cryptographic protocols, Fairness

20
September 2011 Journal of Computer Security: Volume 19 Issue 5, September 2011
Publisher: IOS Press
Bibliometrics:
Citation Count: 28

Searchable symmetric encryption SSE allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been proposed. In this ...
Keywords: Storage Outsourcing, Cloud Storage, Searchable Encryption



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us