Publications

Publications

• DTL: Data Tumbling Layer. A Composable Unlinkability for Smart Contracts
  M. Minaei, P. Moreno-Sanchez, Z. Fang, S. Raghuraman, N. Alamati, P. Chatzigiannis, R. Kumaresan, D. Le
  AsiaCCS, 2025
• Programmable Payment Channels
  R. Kumaresan, D. Le, M. Minaei, S. Raghuraman, Y. Yang, M. Zamani
  ACNS, 2024
• A Plug-and-Play Long-Range Defense System for Proof-of-Stake Blockchains
  L. Ng, P. Chatzigiannis, D. Le, M. Minaei, R. Kumaresan, M. Zamani
  ESORICS, 2024
• A plug-n-play framework for scaling private set intersection to billion-sized sets
  S. Badrinarayanan, R. Kumaresan, M. Christodorescu, V. Nagaraja, K. Patel, S. Raghuraman, P. Rindal, W. Sun, M. Xu
  CANS, 2023
• LucidiTEE: Scalable policy-based multiparty computation with fairness
  S. Gaddam, R. Kumaresan, S. Raghuraman, R. Sinha
  CANS, 2023
• Synchronizable Fair Exchange
  R. Kumaresan, S. Raghuraman, A. Sealfon
  Theory of Cryptography Conference, 2023
• Unlinkability and Interoperability in Account-Based Universal Payment Channels
  M. Minaei, P. Chatzigiannis, S. Jin, S. Raghuraman, R. Kumaresan, M. Zamani, P. Moreno-Sanchez
  Financial Cryptography Workshop, 2023
• Sprites and State Channels: Payment Networks that Go Faster Than Lightning
  A. Miller, I. Bentov, S. Bakshi, R. Kumaresan, P. McCorry
  Financial Cryptography, 2019
• Instantaneous Decentralized Poker
  I. Bentov, R. Kumaresan, A. Miller
  Advances in Cryptology—Asiacrypt, 2017
• Network Oblivious Transfer
  R. Kumaresan, S. Raghuraman, A. Sealfon
  Advances in Cryptology—Crypto, 2016
• Efficient Batched Oblivious PRF with Applications to Private Set Intersection
  V. Kolesnikov, R. Kumaresan, M. Rosulek, N. Trieu
  ACM Conference on Computer and Communications Security (CCS), 2016
• Improvements to Secure Computation with Penalties
  R. Kumaresan, V. Vaikuntanathan, P. Vasudevan
  ACM Conference on Computer and Communications Security (CCS), 2016
• Amortizing Secure Computation with Penalties
  R. Kumaresan, I. Bentov
  ACM Conference on Computer and Communications Security (CCS), 2016
• Secure Computation with Minimal Interaction, Revisited
  Y. Ishai, R. Kumaresan, E. Kushilevitz, A. Paskin-Cherniavsky
  Advances in Cryptology—Crypto, 2015
• How to Use Bitcoin to Play Decentralized Poker
  R. Kumaresan, T. Moran, I. Bentov
  ACM Conference on Computer and Communications Security (CCS), 2015
• On Cut-and-Choose Oblivious Transfer and Its Variants
  V. Kolesnikov, R. Kumaresan
  Advances in Cryptology—Asiacrypt, 2015
• Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure
  S.D. Gordon, J. Katz, R. Kumaresan, A. Yerukhimovich
  Information & Computation, 2014
• On the Cryptographic Complexity of the Worst Functions
  A. Beimel, Y. Ishai, R. Kumaresan, E. Kushilevitz
  Theory of Cryptography Conference (TCC), 2014
• On the Complexity of UC Commitments
  J.A. Garay, Y. Ishai, R. Kumaresan, H. Wee
  Advances in Cryptology—Eurocrypt, 2014
• Amortizing Garbled Circuits
  Y. Huang, J. Katz, V. Kolesnikov, R. Kumaresan, A. Malozemoff
  Advances in Cryptology—Crypto, 2014
• How to Use Bitcoin to Design Fair Protocols
  I. Bentov, R. Kumaresan
  Advances in Cryptology—Crypto, 2014
• How to Use Bitcoin to Incentivize Correct Computations
  R. Kumaresan, I. Bentov
  ACM Conference on Computer and Communications Security (CCS), 2014
• Multi-Client Non-interactive Verifiable Computation
  S.G. Choi, J. Katz, R. Kumaresan, C. Cid
  Theory of Cryptography Conference (TCC), 2013
• Improved OT Extension for Transferring Short Secrets
  V. Kolesnikov, R. Kumaresan
  Advances in Cryptology—Crypto, 2013
• On the Security of the 'Free-XOR' Technique
  S.G. Choi, J. Katz, R. Kumaresan, H.-S. Zhou
  Theory of Cryptography Conference (TCC), 2012
• Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits
  V. Kolesnikov, R. Kumaresan
  Security and Cryptography for Networks (SCN), 2012
• Efficient Verification of Input Consistency in Server-Assisted Secure Function Evaluation
  V. Kolesnikov, R. Kumaresan, A. Shikfa
  Cryptology and Network Security (CANS), 2012
• Adaptively Secure Broadcast, Revisited
  J.A. Garay, J. Katz, R. Kumaresan, H.-S. Zhou
  ACM Symposium on Principles of Distributed Computing (PODC), 2011
• Authenticated Broadcast with a Partially Compromised Public Key Infrastructure
  S.D. Gordon, J. Katz, R. Kumaresan, A. Yerukhimovich
  Intl. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), 2010
• The Round Complexity of Verifiable Secret Sharing: The Statistical Case
  R. Kumaresan, A. Patra, C.P. Rangan
  Advances in Cryptology—Asiacrypt, 2010
• Improving the Round Complexity of VSS in Point-to-Point Networks
  J. Katz, C.-Y. Koo, R. Kumaresan
  Information & Computation, 2009
• Improving the Round Complexity of VSS in Point-to-Point Networks
  J. Katz, C.-Y. Koo, R. Kumaresan
  Intl. Colloquium on Automata, Languages and Programming (ICALP), 2008
• On Exponential Lower Bound for Protocols for Reliable Communication in Networks
  K. Srinathan, C.P. Rangan, R. Kumaresan
  Intl. Conf. on Information Theoretic Security (ICITS), 2007