Juan A. Garay juan.a.garaygmail.com
Bibliometrics: publication history
SEARCH
ROLE
Author only
· Editor only
· All roles

AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas

BOOKMARK & SHARE

 #resultstats2 { width:100%; padding: 10px; background-color:#ECE9D8; /*background:#9c9;*/ } #resultstats { width:100%; /*background-color:#ECE9D8;*/ font-size: 12px; /*background:#9c9;*/ } #resultstats a:link { text-decoration: none; } #resultstats div { padding-bottom: 5px; padding-top: 5px; } #resfound { background-color: #ece9d8; padding-left:5px } #searchtools { display:inline; float:right; padding-right: 10px; } #refinements { padding-top: 5px; } #refinements table { margin-left: 10px; } #refinements tr { vertical-align:top; } #refinements span { font-size: 12px; } .rectots { font-size:12px; } .problem { font-size:12px; color: red; } div.problem { height: 400px; } #results { /* float:right; */ /* width:80%; */ color: #000000; font-family: Verdana,Arial,Helvetica,sans-serif; font-size: 12px; padding-top: 10px; /*background:#9c9;*/ } #aggs { float:left; width:20%; font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; } #pagelogic { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #pagerange { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:left; padding-bottom: 10px; } #resultmenu { font-family: Verdana,Arial,Helvetica,sans-serif; font-size:12px; float:right; padding-bottom: 10px; } #resultmenu label { margin-right: 0px; vertical-align:bottom; } #resultmenu input { margin-right: 0px; vertical-align:bottom; } #resultmenu select { margin-right: 0px; background-color: #aff; border: 0; border-radius: 0; font-size: 12px; } #resultmenu option { font-size: 12px; background-color: white; } .aggHead { font-weight: bold; padding-bottom: 0; padding-top: 10px; } #aggs ul{ list-style-type: none; margin-top: 0.25em; padding-left: 0; font-size: 1em; } #upcevents li{ padding-bottom: 1.25em; } #upcevents div{ margin-top: 25px; } a.showhide:link { text-decoration: none; } #results .numbering{ font-size: 12px; font-weight:bold; width:30px; float:left; text-align: right; padding-top: 2px; } #results .details{ font-size: 12px; width:92%; float:right; padding-bottom: 20px; } #results .title{ font-size: 14px; padding-bottom:5px; } #results .authors{ font-size: 12px; padding-bottom:5px; } #results .source{ font-size: 12px; padding-bottom:5px; } #results .publisher{ font-size: 12px; padding-bottom:5px; } #results .metrics{ font-size: 12px; padding-bottom:5px; } #results .metricsCol1{ float: left; display:inline; padding-bottom:5px; } #results .metricsCol2{ float: right; display: inline; width: 590px; padding-bottom:5px; } #results .ft{ font-size: 12px; padding-bottom:5px; } #results .abstract{ font-size: 12px; padding-bottom:5px; } #results .kw{ font-size: 12px; padding-bottom:5px; } #results .pubother{ font-size: 12px; padding-bottom:5px; } .izers { margin-top: 10px; margin-bottom:10px; } .highlights em{ background-color: #FFFF00; font-style: normal; } .publicationDate { background-color: #aff; } .citedCount { } .download6Weeks { } .download12Months { } .downloadAll { } 91 results found Export Results: bibtex | endnote | acmref | csv Result 1 – 20 of 91 Result page: 1 2 3 4 5 Sort by: relevance publication date citation count downloads (6 Weeks) downloads (12 months) downloads (overall) 1 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: PDF 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 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: PDF 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 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: PDF 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 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: PDF 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 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: PDF 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 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: PDF 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 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: PDF 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