Franklin Harding
I am a first-year computer science Ph.D. student at Brown University studying cryptography under the guidance of Anna Lysyanskaya. Currently I am focused on cryptographic protocols that can be leveraged to create fairer and more privacy-conscious systems. The techniques involved are often bizarre and accomplish seemingly impossible tasks. For example, a blind signature scheme is the digital analog of physically sealing a document in a carbon-paper envelope before having it signed. I received my bachelor's in Mathematics from Oregon State University.
Papers:
- Franklin Harding, Jiayu Xu. Unforgeability of Blind Schnorr in the Limited Concurrency Setting, 2024. [Communications in Cryptology] [ArcticCrypt 2025] [ePrint]
- Willow Barkan-Vered, Franklin Harding, Jonathan Keller, and Jiayu Xu. On the Non-Malleability of ECVRF in the Algebraic Group Model, 2023. [ePrint]
Other projects:
- Go libraries for blind Schnorr and Snowblind
- How Easy is ROS with Not-So-Random Oracles? (CS517 project where we had to use an SMT solver)
- Tigard: an open-source FT2232H hardware hacking tool
- Gloworm: a low-cost vision tracking module for FIRST robotics competitions
- Web challenges for the BSidesPDX 2019 Capture the Flag hacking competition
- Peregrine: a scouting app for FIRST robotics teams