| How to use bitcoin to design fair protocols I Bentov, R Kumaresan Annual Cryptology Conference, 421-439, 2014 | 400 | 2014 |
| Sprites and state channels: Payment networks that go faster than lightning A Miller, I Bentov, S Bakshi, R Kumaresan, P McCorry International Conference on Financial Cryptography and Data Security, 508-526, 2019 | 290* | 2019 |
| How to use bitcoin to incentivize correct computations R Kumaresan, I Bentov Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 202 | 2014 |
| Efficient batched oblivious PRF with applications to private set intersection V Kolesnikov, R Kumaresan, M Rosulek, N Trieu Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 200 | 2016 |
| Improved OT extension for transferring short secrets V Kolesnikov, R Kumaresan Annual Cryptology Conference, 54-70, 2013 | 161 | 2013 |
| How to use bitcoin to play decentralized poker R Kumaresan, T Moran, I Bentov Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 130 | 2015 |
| On the security of the “free-XOR” technique SG Choi, J Katz, R Kumaresan, HS Zhou Theory of Cryptography Conference, 39-53, 2012 | 104 | 2012 |
| Multi-client non-interactive verifiable computation SG Choi, J Katz, R Kumaresan, C Cid Theory of Cryptography Conference, 499-518, 2013 | 102 | 2013 |
| Amortizing garbled circuits Y Huang, J Katz, V Kolesnikov, R Kumaresan, AJ Malozemoff Annual Cryptology Conference, 458-475, 2014 | 90 | 2014 |
| Improvements to secure computation with penalties R Kumaresan, V Vaikuntanathan, PN Vasudevan Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 79 | 2016 |
| Amortizing secure computation with penalties R Kumaresan, I Bentov Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 73 | 2016 |
| Instantaneous decentralized poker I Bentov, R Kumaresan, A Miller International conference on the theory and application of cryptology and …, 2017 | 67 | 2017 |
| On the cryptographic complexity of the worst functions A Beimel, Y Ishai, R Kumaresan, E Kushilevitz Theory of Cryptography Conference, 317-342, 2014 | 64 | 2014 |
| Improving the round complexity of VSS in point-to-point networks J Katz, CY Koo, R Kumaresan International Colloquium on Automata, Languages, and Programming, 499-510, 2008 | 63 | 2008 |
| Adaptively secure broadcast, revisited JA Garay, J Katz, R Kumaresan, HS Zhou Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 49 | 2011 |
| The round complexity of verifiable secret sharing: The statistical case R Kumaresan, A Patra, CP Rangan International Conference on the Theory and Application of Cryptology and …, 2010 | 49 | 2010 |
| Secure computation with minimal interaction, revisited Y Ishai, R Kumaresan, E Kushilevitz, A Paskin-Cherniavsky Annual Cryptology Conference, 359-378, 2015 | 46 | 2015 |
| Improving the round complexity of VSS in point-to-point networks J Katz, CY Koo, R Kumaresan Information and Computation 207 (8), 889-899, 2009 | 31 | 2009 |
| On the complexity of UC commitments JA Garay, Y Ishai, R Kumaresan, H Wee Annual International Conference on the Theory and Applications of …, 2014 | 26 | 2014 |
| Improved secure two-party computation via information-theoretic garbled circuits V Kolesnikov, R Kumaresan International Conference on Security and Cryptography for Networks, 205-221, 2012 | 23 | 2012 |
