2 papers
cs.IT2022
Analyzing Ta-Shma's Code via the Expander Mixing Lemma
Silas Richelson, Sourya Roy
Random walks in expander graphs and their various derandomizations (e.g., replacement/zigzag product) are invaluable tools from pseudorandomness. Recently, Ta-Shma used s-wide repl…
cs.CR2018
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts
Thibaut Horel, Sunoo Park, Silas Richelson +1
We study secure and undetectable communication in a world where governments can read all encrypted communications of citizens. We consider a world where the only permitted communic…