Mostly, this is a place for me to keep track of every (academic) piece I’ve read and enjoyed. Trying to keep this semi-organized by topic.
My all-time favorite papers, for one reason or another. No particular order.
Primarily stuff about random sampling of spanning trees or graph partitions.
Theoretical computer-scientific methods aimed at ameliorating social/civic issues. Kinda the coolest thing in the world if I’m being honest.
Pseudorandomness, complexity theory, computability theory, algorithms, etc.
Codes are sets (whose elements are codewords) which have a variety of applications — data compression, error correction, cryptography, etc. Most of these papers have to do with fingerprinting codes, which can aid anti-piracy enforcement by identifying users who pirate digital content.
How can we use (cryptographic) techniques to ensure that we can distinguish between text coming from an LLM vs. a human? How do these techniques connect to steganography, a cryptographic primitive for hiding secret text in ostensibly innocuous covertext?
How can we use cryptographic techniques to allow clients to store private data on an untrustworthy server, and allow them to query their data without their queries or responses being seen by the server?
Mostly from Aloni’s crypto seminar in Spring 2024.
A differentially-private algorithm is a randomized function of a dataset whose outputs shouldn’t change much whether or not your data is in the dataset.
Mostly related to data privacy law and questions about what data deletion should mean.
I went down a rabbit hole about whether we can run fair/secure elections online. Turns out it’s hard!
Mostly from a networks class I took with Ben Zhao. We read some of the original Internet papers (near the bottom of this list) and worked our way up to modern stuff.
Interesting blog posts that I’ve read or want to read….