R. Kumaresan

Publications
Influence

Efficient Batched Oblivious PRF with Applications to Private Set Intersection

V. Kolesnikov, R. Kumaresan, M. Rosulek, Ni Trieu
Computer Science
CCS
24 October 2016

We describe a lightweight protocol for oblivious evaluation of a pseudorandom function (OPRF) in the presence of semihonest adversaries. Expand

Improved OT Extension for Transferring Short Secrets

V. Kolesnikov, R. Kumaresan
Computer Science
CRYPTO
18 August 2013

We propose an optimization and generalization of OT extension of Ishai et al. of Crypto 2003. Expand

How to Use Bitcoin to Design Fair Protocols

I. Bentov, R. Kumaresan
Computer Science
CRYPTO
17 August 2014

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

Sprites and State Channels: Payment Networks that Go Faster Than Lightning

A. Miller, I. Bentov, S. Bakshi, R. Kumaresan, Patrick McCorry
Computer Science
Financial Cryptography
19 February 2017

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

Sprites: Payment Channels that Go Faster than Lightning

A. Miller, I. Bentov, R. Kumaresan, Patrick McCorry
Computer Science
ArXiv
19 February 2017

We develop a novel construction for payment channels that reduces the worst-case “collateral cost” for offchain payments. Expand

Improving the Round Complexity of VSS in Point-to-Point Networks

Jonathan Katz, C. Koo, R. Kumaresan
Computer Science
ICALP
7 July 2008

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 parties… Expand

How to Use Bitcoin to Incentivize Correct Computations

R. Kumaresan, I. Bentov
Computer Science
CCS
3 November 2014

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

How to Use Bitcoin to Play Decentralized Poker

R. Kumaresan, T. Moran, I. Bentov
Computer Science
CCS
12 October 2015

We formalize, generalize, and construct multiparty protocols for the primitive suggested by Andrychowicz et al. to perform secure multiparty computations on Bitcoin. Expand

Improvements to Secure Computation with Penalties

R. Kumaresan, V. Vaikuntanathan, Prashant Nalini Vasudevan
Computer Science
CCS
24 October 2016

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

Instantaneous Decentralized Poker

I. Bentov, R. Kumaresan, A. Miller
Computer Science
ASIACRYPT
24 January 2017

We present efficient protocols for amortized secure multiparty computation with penalties and secure cash distribution, of which poker is a prime example. Expand

Recommended Authors