• Publications
  • Influence
More efficient oblivious transfer and extensions for faster secure computation
Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is obliviousExpand
  • 235
  • 20
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) enables secure computation over the encrypted data of a single party. We explore how to extend this to multiple parties, using threshold fully homomorphicExpand
  • 246
  • 15
Towards a Game Theoretic View of Secure Computation
We demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of two-party protocols in the face ofExpand
  • 77
  • 12
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
  • Gilad Asharov, G. Segev
  • Computer Science, Mathematics
  • IEEE 56th Annual Symposium on Foundations of…
  • 8 December 2016
Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a "central hub" for almost all known cryptographic tasks, and as an extremely powerful building block for newExpand
  • 48
  • 8
Privacy-Preserving Search of Similar Patients in Genomic Data
Abstract The growing availability of genomic data holds great promise for advancing medicine and research, but unlocking its full potential requires adequate methods for protecting the privacy ofExpand
  • 23
  • 8
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
Searchable symmetric encryption (SSE) enables a client to store a database on an untrusted server while supporting keyword search in a secure manner. Despite the rapidly increasing interest in SSEExpand
  • 52
  • 7
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that has been studiedExpand
  • 38
  • 7
A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation
In the setting of secure multiparty computation, a set of n parties with private inputs wish to jointly compute some functionality of their inputs. One of the most fundamental results of secureExpand
  • 105
  • 6
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. As secure computation becomes moreExpand
  • 80
  • 5
Towards Characterizing Complete Fairness in Secure Two-Party Computation
  • Gilad Asharov
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • 24 February 2014
The well known impossibility result of Cleve (STOC 1986) implies that in general it is impossible to securely compute a function with complete fairness without an honest majority. Since then, theExpand
  • 32
  • 5