Katerina Sotiraki

Orcid: 0009-0002-5372-4849

Affiliations:
  • Yale University, New Haven, CT, USA


According to our database1, Katerina Sotiraki authored at least 21 papers between 2013 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Dinocchio: Distributed Prover for Ring Arithmetic.
IACR Cryptol. ePrint Arch., 2026

Lookup Arguments over Rings and Applications to Batch-Verification of RAM Programs.
IACR Cryptol. ePrint Arch., 2026

2025
Snake-Eye Resistant PKE from LWE for Oblivious Message Retrieval and Robust Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Lattice-Based Multi-message Multi-recipient KEM/PKE with Malicious Security.
Proceedings of the Advances in Cryptology - ASIACRYPT 2025, 2025

2024
DoS-resistant Oblivious Message Retrieval from Snake-eye Resistant PKE.
IACR Cryptol. ePrint Arch., 2024

Injecting Undetectable Backdoors in Deep Learning and Language Models.
CoRR, 2024

Injecting Undetectable Backdoors in Obfuscated Neural Networks and Language Models.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023
HOLMES: Efficient Distribution Testing for Secure Collaborative Learning.
Proceedings of the 32nd USENIX Security Symposium, 2023

Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2021
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE.
J. Cryptol., 2021

HOLMES: A Platform for Detecting Malicious Inputs in Secure Collaborative Computation.
IACR Cryptol. ePrint Arch., 2021

A Topological Characterization of Modulo-<i>p</i> Arguments and Implications for Necklace Splitting.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Sumcheck Arguments and Their Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting.
CoRR, 2020

Consensus-Halving: Does It Ever Get Easier?
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Towards Non-Interactive Zero-Knowledge for NP from LWE.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

2018
PPP-Completeness with Connections to Cryptography.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2014
Agreement in Partitioned Dynamic Networks.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

2013
Occupational fraud detection through visualization.
Proceedings of the 2013 IEEE International Conference on Intelligence and Security Informatics, 2013


  Loading...