• Publications
  • Influence
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
TLDR
We describe a lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries. Expand
  • 92
  • 17
  • PDF
Improved OT Extension for Transferring Short Secrets
TLDR
We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. Expand
  • 98
  • 15
  • PDF
How to Use Bitcoin to Design Fair Protocols
TLDR
We study a model of fairness in secure computation in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty. Expand
  • 253
  • 14
  • PDF
Sprites and State Channels: Payment Networks that Go Faster Than Lightning
TLDR
We propose a novel variant of payment channels, called Sprites, that reduces the worst-case "collateral cost" that each hop along the route may incur. Expand
  • 83
  • 13
  • PDF
Sprites: Payment Channels that Go Faster than Lightning
TLDR
We develop a novel construction for payment channels that reduces the worst-case “collateral cost” for offchain payments. Expand
  • 103
  • 12
  • PDF
Improving the Round Complexity of VSS in Point-to-Point Networks
We revisit the following question: what is the optimal round complexity of verifiable secret sharing (VSS)? We focus here on the case of perfectly-secure VSS where the number of corrupted partiesExpand
  • 56
  • 10
  • PDF
How to Use Bitcoin to Incentivize Correct Computations
TLDR
We study a model of incentivizing correct computations in a variety of cryptographic tasks, namely verifiable computation, secure computation, fair computation, and bounty mechanisms. Expand
  • 135
  • 6
  • PDF
How to Use Bitcoin to Play Decentralized Poker
TLDR
We formalize, generalize, and construct multiparty protocols for the primitive suggested by Andrychowicz et al. to perform secure multiparty computations on Bitcoin. Expand
  • 85
  • 5
  • PDF
Improvements to Secure Computation with Penalties
TLDR
We improve the efficiency of protocols for secure computation with penalties in a hybrid model where parties have access to the "claim-or-refund" transaction functionality. Expand
  • 43
  • 4
  • PDF
Instantaneous Decentralized Poker
TLDR
We present efficient protocols for amortized secure multiparty computation with penalties and secure cash distribution, of which poker is a prime example. Expand
  • 41
  • 4
  • PDF