Aayush Yadav
- PhD candidate in Computer Science
- at George Mason University
- aayushy [ʇɐ] duck [ʇop] com
My work focuses on designing practically efficient cryptographic protocols that address the dual concerns of privacy and accountability, with a particular emphasis on blind signature schemes, authentication schemes, zero-knowledge proof systems and threshold cryptosystems.
I am also interested in computational number theory, especially as it concerns to the arithmetic of elliptic curves and its applications to cryptography.
Recent news (± 2 months)
[May '26] Presenting our work on non-interactive batched blind signatures at PKC.
[Mar '26] Got to work on a very cool project at the Arizona Winter School on Computational Aspects of Arithmetic Geometry and Cryptography.
[Jan '26] Talked about our work on non-interactive anonymous tokens at the Yale Applied Cryptography Seminar.
