Cody Freitag

Northeastern University — United States

Computer Science · Physical Sciences

9h-index307citations29works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(19), Complexity and Algorithms in Graphs(8), Cryptographic Implementations and Security(7), Privacy-Preserving Technologies in Data(5), Chaos-based Image/Signal Encryption(4)

Publications29 total

Improved Rate for Non-Malleable Codes and Time-Lock Puzzles
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
Journal of Cryptology·2025Open Access
Seedless Condensers for Efficiently Samplable Sources
Lecture notes in computer science·2025Open Access
Unambiguous SNARGs for P from LWE with Applications to PPAD Hardness
2025
Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance
Lecture notes in computer science·2024· 1 cited
Riggs: Decentralized Sealed-Bid Auctions
2023· 15 cited
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More
Lecture notes in computer science·2023· 36 cited
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions
Lecture notes in computer science·2023· 7 cited
SPARKs: Succinct Parallelizable Arguments of Knowledge
Journal of the ACM·2022
Parallelizable Delegation from LWE
Lecture notes in computer science·2022· 6 cited
Universal Reductions: Reductions Relative to Stateful Oracles
Lecture notes in computer science·2022· 2 citedOpen Access
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
Lecture notes in computer science·2022· 9 cited
Inference Under Information Constraints III: Local Privacy Constraints
IEEE Journal on Selected Areas in Information Theory·2021· 16 cited
Inference under Information Constraints III: Local Privacy Constraints
arXiv (Cornell University)·2021Open Access
Non-malleable Time-Lock Puzzles and Applications
Lecture notes in computer science·2021· 20 cited
Continuous Verifiable Delay Functions
Lecture notes in computer science·2020· 76 cited
Non-Malleable Time-Lock Puzzles and Applications.
IACR Cryptology ePrint Archive·2020· 12 cited
Impossibility of Strong KDM Security with Auxiliary Input
Lecture notes in computer science·2020· 1 cited
SPARKs: Succinct Parallelizable Arguments of Knowledge
Lecture notes in computer science·2020· 16 cited
Impossibility of Strong KDM Security with Auxiliary Input.
IACR Cryptology ePrint Archive·2019· 2 cited
page 1 of 2Next →

Frequent Co-authors

Ilan Komargodski(13), Rafael Pass(12), Naomi Ephraim(5), Jayadev Acharya(3), Clément L. Canonne(3), Himanshu Tyagi(3), Ashrujit Ghoshal(3), Brent Waters(2), Thomas R. Cundari(2), Naomi Sirkin(2), Ziteng Sun(2), Jad Silbak(2), Daniel Wichs(2), David J. Wu(1), Jiajun Mei(1), Kurtis M. Carsch(1), T. Brent Gunnoe(1), Nirvan Tyagi(1), Arasu Arun(1), Riad S. Wahby(1)