default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrinivasan Raghuraman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Ranjit Kumaresan, Duc Viet Le, Mohsen Minaei, Srinivasan Raghuraman, Yibin Yang, Mahdi Zamani:
Programmable Payment Channels. ACNS (3) 2024: 51-73- [c23]Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal:
Improved Alternating-Moduli PRFs and Post-quantum Signatures. CRYPTO (8) 2024: 274-308 - [c22]Foteini Baldimtsi
, Ioanna Karantaidou, Srinivasan Raghuraman:
Oblivious Accumulators. Public Key Cryptography (2) 2024: 99-131 - [i32]Suvradip Chakraborty, Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal:
Logstar: Efficient Linear* Time Secure Merge. IACR Cryptol. ePrint Arch. 2024: 159 (2024) - [i31]Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal, Harshal Shah:
Efficient Permutation Correlations and Batched Random Access for Two-Party Computation. IACR Cryptol. ePrint Arch. 2024: 547 (2024) - [i30]Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal:
Improved Alternating Moduli PRFs and Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024: 582 (2024) - 2023
- [c21]Srinivasan Raghuraman, Yibin Yang:
Just How Fair is an Unreactive World? ASIACRYPT (6) 2023: 420-450 - [c20]Sivanarayana Gaddam, Ranjit Kumaresan, Srinivasan Raghuraman, Rohit Sinha:
LucidiTEE: Scalable Policy-Based Multiparty Computation with Fairness. CANS 2023: 343-367 - [c19]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 - [c18]Srinivasan Raghuraman, Peter Rindal, Titouan Tanguy:
Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN. CRYPTO (4) 2023: 602-632 - [c17]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 - [c16]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. Public Key Cryptography (1) 2023: 376-405 - [c15]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. TCC (1) 2023: 158-187 - [c14]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Synchronizable Fair Exchange. TCC (1) 2023: 411-440 - [i29]Panagiotis Chatzigiannis, Wanyun Catherine Gu, Srinivasan Raghuraman, Peter Rindal, Mahdi Zamani:
Privacy-Enhancing Technologies for Financial Data Sharing. CoRR abs/2306.10200 (2023) - [i28]Sunpreet S. Arora, Andrew Beams, Panagiotis Chatzigiannis, Sebastian Meiser, Karan Patel, Srinivasan Raghuraman, Peter Rindal, Harshal Shah, Yizhen Wang, Yuhang Wu, Hao Yang, Mahdi Zamani:
Privacy-Preserving Financial Anomaly Detection via Federated Learning & Multi-Party Computation. CoRR abs/2310.04546 (2023) - [i27]Yibin Yang, Mohsen Minaei, Srinivasan Raghuraman, Ranjit Kumaresan, Mahdi Zamani:
Off-Chain Programmability at Scale. IACR Cryptol. ePrint Arch. 2023: 347 (2023) - [i26]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) - [i25]Srinivasan Raghuraman, Peter Rindal, Titouan Tanguy:
Expand-Convolute Codes for Pseudorandom Correlation Generators from LPN. IACR Cryptol. ePrint Arch. 2023: 882 (2023) - [i24]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) - [i23]Foteini Baldimtsi, Ioanna Karantaidou, Srinivasan Raghuraman:
Oblivious Accumulators. IACR Cryptol. ePrint Arch. 2023: 1001 (2023) - [i22]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) - [i21]Amit Agarwal, Navid Alamati, Dakshita Khurana, Srinivasan Raghuraman, Peter Rindal:
On Black-Box Verifiable Outsourcing. IACR Cryptol. ePrint Arch. 2023: 1466 (2023) - 2022
- [j2]Varun Maram, Daniel Masny, Sikhar Patranabis, Srinivasan Raghuraman:
On the Quantum Security of OCB. IACR Trans. Symmetric Cryptol. 2022(2): 379-414 (2022) - [c13]Saikrishna Badrinarayanan, Sourav Das, Gayathri Garimella, Srinivasan Raghuraman, Peter Rindal:
Secret-Shared Joins with Multiplicity from Aggregation Trees. CCS 2022: 209-222 - [c12]Srinivasan Raghuraman, Peter Rindal:
Blazing Fast PSI from Improved OKVS and Subfield VOLE. CCS 2022: 2505-2517 - [c11]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. CRYPTO (1) 2022: 784-813 - [i20]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) - [i19]Peter Rindal, Srinivasan Raghuraman:
Blazing Fast PSI from Improved OKVS and Subfield VOLE. IACR Cryptol. ePrint Arch. 2022: 320 (2022) - [i18]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. IACR Cryptol. ePrint Arch. 2022: 355 (2022) - [i17]Varun Maram, Daniel Masny, Sikhar Patranabis, Srinivasan Raghuraman:
On the Quantum Security of OCB. IACR Cryptol. ePrint Arch. 2022: 699 (2022) - [i16]Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee, Sikhar Patranabis, Srinivasan Raghuraman, Pratik Sarkar:
Round-Optimal Oblivious Transfer and MPC from Computational CSIDH. IACR Cryptol. ePrint Arch. 2022: 1511 (2022) - [i15]Sunpreet S. Arora, Saikrishna Badrinarayanan, Srinivasan Raghuraman, Maliheh Shirvanian, Kim Wagner, Gaven J. Watson:
Avoiding Lock Outs: Proactive FIDO Account Recovery using Managerless Group Signatures. IACR Cryptol. ePrint Arch. 2022: 1555 (2022) - [i14]Saikrishna Badrinarayanan, Sourav Das, Gayathri Garimella, Srinivasan Raghuraman, Peter Rindal:
Secret-Shared Joins with Multiplicity from Aggregation Trees. IACR Cryptol. ePrint Arch. 2022: 1600 (2022) - [i13]Srinivasan Raghuraman, Yibin Yang:
Just How Fair is an Unreactive World? IACR Cryptol. ePrint Arch. 2022: 1655 (2022) - 2021
- [c10]Geoffroy Couteau, Peter Rindal, Srinivasan Raghuraman:
Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. CRYPTO (3) 2021: 502-534 - [c9]Saikrishna Badrinarayanan, Peihan Miao, Srinivasan Raghuraman, Peter Rindal:
Multi-party Threshold Private Set Intersection with Sublinear Communication. Public Key Cryptography (2) 2021: 349-379 - [i12]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) - [i11]Geoffroy Couteau, Peter Rindal, Srinivasan Raghuraman:
Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. IACR Cryptol. ePrint Arch. 2021: 1150 (2021) - 2020
- [c8]Shashank Agrawal, Srinivasan Raghuraman:
KVaC: Key-Value Commitments for Blockchains and Beyond. ASIACRYPT (3) 2020: 839-869 - [c7]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-Everywhere Secure Computation. EUROCRYPT (2) 2020: 159-183 - [i10]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) - [i9]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Synchronizable Exchange. IACR Cryptol. ePrint Arch. 2020: 976 (2020) - [i8]Shashank Agrawal, Srinivasan Raghuraman:
KVaC: Key-Value Commitments for Blockchains and Beyond. IACR Cryptol. ePrint Arch. 2020: 1161 (2020)
2010 – 2019
- 2019
- [i7]Siddhartha Jayanti, Srinivasan Raghuraman, Nikhil Vyas:
Efficient Constructions for Almost-everywhere Secure Computation. IACR Cryptol. ePrint Arch. 2019: 156 (2019) - 2017
- [c6]Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) 2017: 213-240 - 2016
- [j1]Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan:
A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 7(1): 1-22 (2016) - [c5]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. CRYPTO (2) 2016: 366-396 - [c4]Nishanth Chandran, Srinivasan Raghuraman, Dhinakaran Vinayagamurthy:
Reducing Depth in Constrained PRFs: From Bit-Fixing to \mathbf NC^1. Public Key Cryptography (2) 2016: 359-385 - [c3]Nishanth Chandran, Bhavana Kanukurthi, Srinivasan Raghuraman:
Information-Theoretic Local Non-malleable Codes and Their Applications. TCC (A2) 2016: 367-392 - [i6]Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan:
A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers. IACR Cryptol. ePrint Arch. 2016: 354 (2016) - [i5]Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon:
Network Oblivious Transfer. IACR Cryptol. ePrint Arch. 2016: 584 (2016) - 2015
- [i4]Suvradip Chakraborty, Srinivasan Raghuraman, C. Pandu Rangan:
Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2015: 520 (2015) - [i3]Nishanth Chandran, Srinivasan Raghuraman, Dhinakaran Vinayagamurthy:
Reducing Multilinear Map Levels in Constrained PRFs and ABE. IACR Cryptol. ePrint Arch. 2015: 829 (2015) - [i2]Nishanth Chandran, Bhavana Kanukurthi, Srinivasan Raghuraman:
Information-theoretic Local Non-malleable Codes and their Applications. IACR Cryptol. ePrint Arch. 2015: 1056 (2015) - 2014
- [c2]Venkata Padmavati Metta, Srinivasan Raghuraman, Kamala Krithivasan:
Small Universal Spiking Neural P Systems with Cooperating Rules as Function Computing Devices. Int. Conf. on Membrane Computing 2014: 300-313 - [c1]Venkata Padmavati Metta, Srinivasan Raghuraman, Kamala Krithivasan:
Spiking Neural P Systems with Cooperating Rules. Int. Conf. on Membrane Computing 2014: 314-329 - [i1]Nishanth Chandran, Srinivasan Raghuraman, Dhinakaran Vinayagamurthy:
Constrained Pseudorandom Functions: Verifiable and Delegatable. IACR Cryptol. ePrint Arch. 2014: 522 (2014)
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-08-21 20:25 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:
