Scholar
Matthew Gray
Google Scholar ID: MO847GEAAAAJ
DPhil student Computer Science, University of Oxford
Citations & Impact
Citations
62
H-index
5
i10-index
3
Publications
8
Co-authors
0
Publications
Resume (English only)
Academic Achievements
- - Preprint: On Cryptography and Distribution Verification, with Applications to Quantum Advantage
- - Preprint: A Meta-Complexity Characterization of Minimal Quantum Cryptography
- - 2025 Eurocrypt: A Meta-Complexity Characterization of Quantum Cryptography
- - 2025 Quantum: On the Computational Hardness of Quantum One-Wayness
- - 2024 Crypto: On Central Primitives for Quantum Cryptography with Classical Communication
- - 2024 CCC, 2025 Computational Complexity: On the Quantum Automatability of Propositional Proof Systems
- - 2018 IEEE NVMSA: Designing Data Structures to Minimize Bit Flips On NVM
- - 2021 Equality by Lot: Large Scale Secure Sortition
- - 2019 Bach Thesis: “LOADS of Space”, Local Order Agnosticism and Bit Flip Efficient Data Structure Codes
Research Experience
- - Balliol College Oxford: Stipendiary Lecturer, taught Computational Models, Algorithms, and Data Structures to second-year undergraduates
- - University of Oxford: Teaching Assistant, helped teach Advanced Complexity Theory and Lower Bounds course under Rahul Santhanam
- - Renton Technical College: Adjunct Faculty, taught Web Development, brought in guest speakers, and helped redesign the AAS curriculum
- - Microsoft: Software Engineering, worked on React Native components for Office 365, focusing on iOS and Android development
- - Storage Systems Research Center: Research Assistant, worked on storage and security research
Education
- DPhil Student at the University of Oxford
Background
- Theoretical Computer Scientist and Mathematician. Primary research interests include the intersection of Quantum Computing, Cryptography, and Meta Complexity. Specifically interested in the connections between the hardness of quantum meta complexity problems and the existence of quantum crypto primitives, as well as the relationship between post-quantum cryptography and proof complexity.
Miscellany
- Interested in philosophical questions, particularly a Bayesian resolution to Hume's problem of Induction. Also interested in historical cryptography, working on decrypting diplomatic letters from Italian city states in the fifteenth through seventeenth centuries.
Co-authors