Sruthi Sekar

Orcid: 0000-0002-6681-1813

According to our database1, Sruthi Sekar authored at least 16 papers between 2017 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2023
SublonK: Sublinear Prover PlonK.
IACR Cryptol. ePrint Arch., 2023

zkSaaS: Zero-Knowledge SNARKs as a Service.
Proceedings of the 32nd USENIX Security Symposium, 2023

Bounded Simultaneous Messages.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
IBE with Incompressible Master Secret and Small Identity Secrets.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Rate one-third non-malleable codes.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Short Leakage Resilient and Non-malleable Secret Sharing Schemes.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters.
Electron. Colloquium Comput. Complex., 2021

Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Locally Reconstructable Non-Malleable Secret Sharing.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

Efficient Linear Multiparty PSI and Extensions to Circuit/Quorum PSI.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Constant Rate (Non-malleable) Secret Sharing Schemes Tolerating Joint Adaptive Leakage.
IACR Cryptol. ePrint Arch., 2020

2019
Registration-Based Encryption from Standard Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Privacy Amplification from Non-malleable Codes.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

2018
Non-malleable Randomness Encoders and Their Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Four-State Non-malleable Codes with Explicit Constant Rate.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017


  Loading...