| How to use bitcoin to design fair protocols I Bentov, R Kumaresan Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 425 | 2014 |
| Sprites and state channels: Payment networks that go faster than lightning A Miller, I Bentov, S Bakshi, R Kumaresan, P McCorry Financial Cryptography and Data Security: 23rd International Conference, FC …, 2019 | 340* | 2019 |
| 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 | 247 | 2016 |
| How to use bitcoin to incentivize correct computations R Kumaresan, I Bentov Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 210 | 2014 |
| Improved OT extension for transferring short secrets V Kolesnikov, R Kumaresan Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013 | 190 | 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 |
| Multi-client non-interactive verifiable computation SG Choi, J Katz, R Kumaresan, C Cid Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013 …, 2013 | 109 | 2013 |
| On the security of the “free-XOR” technique SG Choi, J Katz, R Kumaresan, HS Zhou Theory of Cryptography: 9th Theory of Cryptography Conference, TCC 2012 …, 2012 | 105 | 2012 |
| Amortizing garbled circuits Y Huang, J Katz, V Kolesnikov, R Kumaresan, AJ Malozemoff Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 95 | 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 | 85 | 2016 |
| Amortizing secure computation with penalties R Kumaresan, I Bentov Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016 | 77 | 2016 |
| Instantaneous decentralized poker I Bentov, R Kumaresan, A Miller Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017 | 70 | 2017 |
| On the cryptographic complexity of the worst functions A Beimel, Y Ishai, R Kumaresan, E Kushilevitz Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014 | 68 | 2014 |
| Improving the round complexity of VSS in point-to-point networks J Katz, CY Koo, R Kumaresan Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 64 | 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 | 54 | 2011 |
| Secure computation with minimal interaction, revisited Y Ishai, R Kumaresan, E Kushilevitz, A Paskin-Cherniavsky Advances in Cryptology--CRYPTO 2015: 35th Annual Cryptology Conference …, 2015 | 51 | 2015 |
| The round complexity of verifiable secret sharing: The statistical case R Kumaresan, A Patra, CP Rangan Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the …, 2010 | 51 | 2010 |
| 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 | 32 | 2009 |
| On the complexity of UC commitments JA Garay, Y Ishai, R Kumaresan, H Wee Advances in Cryptology–EUROCRYPT 2014: 33rd Annual International Conference …, 2014 | 28 | 2014 |
| Improved secure two-party computation via information-theoretic garbled circuits V Kolesnikov, R Kumaresan Security and Cryptography for Networks: 8th International Conference, SCN …, 2012 | 23 | 2012 |
