default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRanjit Kumaresan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Ranjit Kumaresan, Duc Viet Le, Mohsen Minaei, Srinivasan Raghuraman, Yibin Yang, Mahdi Zamani:
Programmable Payment Channels. ACNS (3) 2024: 51-73- [c29]Lucien K. L. Ng, Panagiotis Chatzigiannis, Duc Viet Le, Mohsen Minaei, Ranjit Kumaresan, Mahdi Zamani:
A Plug-and-Play Long-Range Defense System for Proof-of-Stake Blockchains. ESORICS (4) 2024: 45-64 - [i22]Lucien K. L. Ng, Panagiotis Chatzigiannis, Duc Viet Le, Mohsen Minaei, Ranjit Kumaresan, Mahdi Zamani:
A Plug-and-Play Long-Range Defense System for Proof-of-Stake Blockchains. IACR Cryptol. ePrint Arch. 2024: 684 (2024) - 2023
- [c28]Sivanarayana Gaddam, Ranjit Kumaresan, Srinivasan Raghuraman, Rohit Sinha:
LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness. CANS 2023: 343-367 - [c27]Saikrishna Badrinarayanan, Ranjit Kumaresan, Mihai Christodorescu, Vinjith Nagaraja, Karan Patel, Srinivasan Raghuraman, Peter Rindal, Wei Sun, Minghua Xu:
A Plug-n-Play Framework for Scaling Private Set Intersection to Billion-Sized Sets. CANS 2023: 443-467 - [c26]Mohsen Minaei, Panagiotis Chatzigiannis, Shan Jin, Srinivasan Raghuraman, Ranjit Kumaresan, Mahdi Zamani, Pedro Moreno-Sanchez:
Unlinkability and Interoperability in Account-Based Universal Payment Channels. FC Workshops 2023: 367-384 - [c25]Ranjit Kumaresan
, Srinivasan Raghuraman, Adam Sealfon:
Synchronizable Fair Exchange. TCC (1) 2023: 411-440 - [i21]Yibin Yang, Mohsen Minaei, Srinivasan Raghuraman, Ranjit Kumaresan, Mahdi Zamani:
Off-Chain Programmability at Scale. IACR Cryptol. ePrint Arch. 2023: 347 (2023) - [i20]Sivanarayana Gaddam, Ranjit Kumaresan, Srinivasan Raghuraman, Rohit Sinha:
How to Design Fair Protocols in the Multi-Blockchain Setting. IACR Cryptol. ePrint Arch. 2023: 762 (2023) - [i19]Mohsen Minaei, Panagiotis Chatzigiannis, Shan Jin, Srinivasan Raghuraman, Ranjit Kumaresan, Mahdi Zamani, Pedro Moreno-Sanchez:
Unlinkability and Interoperability in Account-Based Universal Payment Channels. IACR Cryptol. ePrint Arch. 2023: 916 (2023) - [i18]Mohsen Minaei, Duc Viet Le, Ranjit Kumaresan, Andrew Beams, Pedro Moreno-Sanchez, Yibin Yang, Srinivasan Raghuraman, Panagiotis Chatzigiannis, Mahdi Zamani:
Scalable Off-Chain Auctions. IACR Cryptol. ePrint Arch. 2023: 1454 (2023) - 2022
- [i17]Saikrishna Badrinarayanan, Ranjit Kumaresan, Mihai Christodorescu, Vinjith Nagaraja, Karan Patel, Srinivasan Raghuraman, Peter Rindal, Wei Sun, Minghua Xu:
A Plug-n-Play Framework for Scaling Private Set Intersection to Billion-sized Sets. IACR Cryptol. ePrint Arch. 2022: 294 (2022) - 2021
- [i16]Mihai Christodorescu, Erin English, Wanyun Catherine Gu, David Kreissman, Ranjit Kumaresan, Mohsen Minaei, Srinivasan Raghuraman, Cuy Sheffield, Arjuna Wijeyekoon, Mahdi Zamani:
Universal Payment Channels: An Interoperability Platform for Digital Currencies. CoRR abs/2109.12194 (2021) - 2020
- [i15]Mihai Christodorescu, Wanyun Catherine Gu, Ranjit Kumaresan, Mohsen Minaei, Mustafa Özdayi, Benjamin Price, Srinivasan Raghuraman, Muhammad Saad, Cuy Sheffield, Minghua Xu, Mahdi Zamani:
Towards a Two-Tier Hierarchical Infrastructure: An Offline Payment System for Central Bank Digital Currencies. CoRR abs/2012.08003 (2020) - [i14]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Synchronizable Exchange. IACR Cryptol. ePrint Arch. 2020: 976 (2020)
2010 – 2019
- 2019
- [c24]Andrew Miller, Iddo Bentov, Surya Bakshi, Ranjit Kumaresan, Patrick McCorry:
Sprites and State Channels: Payment Networks that Go Faster Than Lightning. Financial Cryptography 2019: 508-526 - [i13]Rohit Sinha, Sivanarayana Gaddam, Ranjit Kumaresan:
LucidiTEE: Policy-based Fair Computing at Scale. IACR Cryptol. ePrint Arch. 2019: 178 (2019) - 2017
- [c23]Iddo Bentov, Ranjit Kumaresan, Andrew Miller:
Instantaneous Decentralized Poker. ASIACRYPT (2) 2017: 410-440 - [i12]Iddo Bentov, Ranjit Kumaresan, Andrew Miller:
Instantaneous Decentralized Poker. CoRR abs/1701.06726 (2017) - [i11]Andrew Miller, Iddo Bentov, Ranjit Kumaresan, Patrick McCorry:
Sprites: Payment Channels that Go Faster than Lightning. CoRR abs/1702.05812 (2017) - [i10]Iddo Bentov, Ranjit Kumaresan, Andrew Miller:
Instantaneous Decentralized Poker. IACR Cryptol. ePrint Arch. 2017: 875 (2017) - 2016
- [c22]Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Improvements to Secure Computation with Penalties. CCS 2016: 406-417 - [c21]Ranjit Kumaresan, Iddo Bentov:
Amortizing Secure Computation with Penalties. CCS 2016: 418-429 - [c20]Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni Trieu:
Efficient Batched Oblivious PRF with Applications to Private Set Intersection. CCS 2016: 818-829 - [c19]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. CRYPTO (2) 2016: 366-396 - [i9]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. IACR Cryptol. ePrint Arch. 2016: 584 (2016) - [i8]Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, Ni Trieu:
Efficient Batched Oblivious PRF with Applications to Private Set Intersection. IACR Cryptol. ePrint Arch. 2016: 799 (2016) - 2015
- [c18]Vladimir Kolesnikov, Ranjit Kumaresan:
On Cut-and-Choose Oblivious Transfer and Its Variants. ASIACRYPT (1) 2015: 386-412 - [c17]Ranjit Kumaresan, Tal Moran, Iddo Bentov:
How to Use Bitcoin to Play Decentralized Poker. CCS 2015: 195-206 - [c16]Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky:
Secure Computation with Minimal Interaction, Revisited. CRYPTO (2) 2015: 359-378 - [i7]Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff:
Amortizing Garbled Circuits. IACR Cryptol. ePrint Arch. 2015: 81 (2015) - [i6]Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid:
Multi-Client Non-Interactive Verifiable Computation. IACR Cryptol. ePrint Arch. 2015: 190 (2015) - 2014
- [j2]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated broadcast with a partially compromised public-key infrastructure. Inf. Comput. 234: 17-25 (2014) - [c15]Ranjit Kumaresan, Iddo Bentov:
How to Use Bitcoin to Incentivize Correct Computations. CCS 2014: 30-41 - [c14]Iddo Bentov, Ranjit Kumaresan:
How to Use Bitcoin to Design Fair Protocols. CRYPTO (2) 2014: 421-439 - [c13]Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, Alex J. Malozemoff:
Amortizing Garbled Circuits. CRYPTO (2) 2014: 458-475 - [c12]Juan A. Garay, Yuval Ishai, Ranjit Kumaresan, Hoeteck Wee:
On the Complexity of UC Commitments. EUROCRYPT 2014: 677-694 - [c11]Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz:
On the Cryptographic Complexity of the Worst Functions. TCC 2014: 317-342 - [i5]Iddo Bentov, Ranjit Kumaresan:
How to Use Bitcoin to Design Fair Protocols. IACR Cryptol. ePrint Arch. 2014: 129 (2014) - 2013
- [c10]Vladimir Kolesnikov, Ranjit Kumaresan:
Improved OT Extension for Transferring Short Secrets. CRYPTO (2) 2013: 54-70 - [c9]Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Carlos Cid:
Multi-Client Non-interactive Verifiable Computation. TCC 2013: 499-518 - [i4]Vladimir Kolesnikov, Ranjit Kumaresan:
Improved OT Extension for Transferring Short Secrets. IACR Cryptol. ePrint Arch. 2013: 491 (2013) - 2012
- [b1]Ranjit Kumaresan:
Broadcast and Verifiable Secret Sharing: New Security Models and Round Optimal Constructions. University of Maryland, College Park, MD, USA, 2012 - [c8]Vladimir Kolesnikov, Ranjit Kumaresan, Abdullatif Shikfa:
Efficient Verification of Input Consistency in Server-Assisted Secure Function Evaluation. CANS 2012: 201-217 - [c7]Vladimir Kolesnikov, Ranjit Kumaresan:
Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits. SCN 2012: 205-221 - [c6]Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou:
On the Security of the "Free-XOR" Technique. TCC 2012: 39-53 - 2011
- [c5]Juan A. Garay, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou:
Adaptively secure broadcast, revisited. PODC 2011: 179-186 - [i3]Seung Geol Choi, Jonathan Katz, Ranjit Kumaresan, Hong-Sheng Zhou:
On the Security of the Free-XOR Technique. IACR Cryptol. ePrint Arch. 2011: 510 (2011) - 2010
- [c4]Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan:
The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010: 431-447 - [c3]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. SSS 2010: 144-158
2000 – 2009
- 2009
- [j1]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
Improving the round complexity of VSS in point-to-point networks. Inf. Comput. 207(8): 889-899 (2009) - [i2]S. Dov Gordon, Jonathan Katz, Ranjit Kumaresan, Arkady Yerukhimovich:
Authenticated Broadcast with a Partially Compromised Public-Key Infrastructure. IACR Cryptol. ePrint Arch. 2009: 410 (2009) - 2008
- [c2]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
Improving the Round Complexity of VSS in Point-to-Point Networks. ICALP (2) 2008: 499-510 - 2007
- [c1]K. Srinathan, C. Pandu Rangan, Ranjit Kumaresan:
On Exponential Lower Bound for Protocols for Reliable Communication in Networks. ICITS 2007: 89-98 - [i1]Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
Improving the Round Complexity of VSS in Point-to-Point Networks. IACR Cryptol. ePrint Arch. 2007: 358 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-15 00:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
