default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSruthi Sekar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. Proc. Priv. Enhancing Technol. 2024(3): 314-335 (2024)- 2023
- [c12]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. FSTTCS 2023: 23:1-23:17 - [c11]Sanjam Garg
, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla, Sruthi Sekar:
zkSaaS: Zero-Knowledge SNARKs as a Service. USENIX Security Symposium 2023: 4427-4444 - [i14]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. CoRR abs/2310.00334 (2023) - [i13]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. IACR Cryptol. ePrint Arch. 2023: 902 (2023) - [i12]Sanjam Garg, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla, Sruthi Sekar:
zkSaaS: Zero-Knowledge SNARKs as a Service. IACR Cryptol. ePrint Arch. 2023: 905 (2023) - 2022
- [c10]Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Short Leakage Resilient and Non-malleable Secret Sharing Schemes. CRYPTO (1) 2022: 178-207 - [c9]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate one-third non-malleable codes. STOC 2022: 1364-1377 - [c8]Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. TCC (1) 2022: 588-617 - [i11]Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Short Leakage Resilient and Non-malleable Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2022: 216 (2022) - [i10]Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. IACR Cryptol. ePrint Arch. 2022: 649 (2022) - 2021
- [c7]Nishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Akash Shah:
Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI. CCS 2021: 1182-1204 - [c6]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Jenit Tomy:
Locally Reconstructable Non-Malleable Secret Sharing. ITC 2021: 11:1-11:19 - [c5]Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing. CRYPTO (3) 2021: 595-624 - [i9]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electron. Colloquium Comput. Complex. TR21 (2021) - [i8]Nishanth Chandran, Nishka Dasgupta, Divya Gupta, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Akash Shah:
Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI. IACR Cryptol. ePrint Arch. 2021: 172 (2021) - [i7]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Jenit Tomy:
Locally Reconstructable Non-malleable Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 657 (2021) - [i6]Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Rate One-Third Non-malleable Codes. IACR Cryptol. ePrint Arch. 2021: 1042 (2021) - 2020
- [j1]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Four-State Non-malleable Codes with Explicit Constant Rate. J. Cryptol. 33(3): 1044-1079 (2020) - [i5]Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Constant Rate (Non-malleable) Secret Sharing Schemes Tolerating Joint Adaptive Leakage. IACR Cryptol. ePrint Arch. 2020: 1252 (2020)
2010 – 2019
- 2019
- [c4]Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Privacy Amplification from Non-malleable Codes. INDOCRYPT 2019: 318-337 - [c3]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar:
Registration-Based Encryption from Standard Assumptions. Public Key Cryptography (2) 2019: 63-93 - 2018
- [c2]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Non-malleable Randomness Encoders and Their Applications. EUROCRYPT (3) 2018: 589-617 - [i4]Eshan Chattopadhyay, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Privacy Amplification from Non-malleable Codes. IACR Cryptol. ePrint Arch. 2018: 293 (2018) - [i3]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar:
Registration-Based Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 1030 (2018) - 2017
- [c1]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Four-State Non-malleable Codes with Explicit Constant Rate. TCC (2) 2017: 344-375 - [i2]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Four-state Non-malleable Codes with Explicit Constant Rate. IACR Cryptol. ePrint Arch. 2017: 930 (2017) - [i1]Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar:
Non-malleable Randomness Encoders and their Applications. IACR Cryptol. ePrint Arch. 2017: 1097 (2017)
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-05 20:22 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:
