Research interest: design and analysis of cryptographic schemes, especially regarding applications to security, scalability and privacy of blockchains.
Recent Professional Bio
In December 2015, I graduated from the College of Creative Studies with B.S. in Computer Science and B.S. in Mathematics. In September 2016, I received my Master degree in Computer Science at UCSB, advised by Stefano Tessaro. I interned at Visa Research during the summer of 2018 and was supervised by Atul Luykx. I visited University of Washington during the summer of 2019, working with Stefano Tessaro.
Chain Reductions for Multi-Signatures (ePrint)
Mihir Bellare and Wei Dai. To appear in ASIACRYPT 2021.
The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-Rewinding Proofs for Schnorr Identification and Signatures (ePrint)
Mihir Bellare and Wei Dai. INDOCRYPT 2020.
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption (ePrint)
Wei Dai, Stefano Tessaro, and Xihu Zhang. TCC 2020.
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements (ePrint)
Mihir Bellare, Wei Dai, and Phillip Rogaway. PETS 2020.
The Local Forking Lemma and its Application to Deterministic Encryption (ePrint)
Mihir Bellare, Wei Dai, and Lucy Li. Asiacrypt 2019.
Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction (ePrint)
Mihir Bellare and Wei Dai. ACM CCS 2017.
Information-Theoretic Indistinguishability via the Chi-Squared Method (ePrint)
Wei Dai, Viet Tung Hoang, and Stefano Tessaro. CRYPTO 2017.
Statistical Methods in Cryptography (pdf)
Master Thesis. College of Engineering, Unviersity of California Santa Barbara, Jun. 2016.
Randomness Extractors - An Exposition (pdf)
Senior Thesis. College of Creative Studies, University of California Santa Barbara, Oct. 2015. Also published in Rose-Hulman Undergraduate Math Journal (pdf). Vol. 17, Issue 1, 2016.