About me

Researcher, Engineer, Food Lover.

I'm a second year Ph.D. student at University of Michigan in Computer Science and Engineering division, College of Engineering. I obtained my Bachelor's degree in Computer Science from the University of Michigan, and a dual degree in Electric and Computer Engineering from Shanghai Jiao Tong University. My primary research interest lies in applied cryptography and secure and trustworthy system. I can be reached at duy"u"ng (at) umich (dot) edu.


  • [new] [06/2022] Our paper "Snapshot-oblivious RAM..." is accepted to CRYPTO'22. I will present this paper in Santa Barbara, CA this summer.
  • [09/2021] I started my Ph.D. program at the University of Michigan. My advisor is Prof. Grubbs, Paul.
  • [08/2021] I got my Bachalor's degree in ECE from SJTU.
  • [05/2021] I got my Bachalor's degree in CS from UM.
  • Projects

    See a selection of my research projects below.

    Snapshot-oblivious RAMs

    We introduce snapshot-oblivious RAMs, a new secure memory access primitive. Snapshot-oblivious RAMs bypass lower bounds by providing security only for transcripts whose length is fixed and known ahead of time. Intuitively, snapshot-oblivious RAMs provide strong security for attacks of short duration, such as the snapshot attacks targeted by many encrypted databases.

    Oblivious range query data structure

    We use Path ORAM and deterministic eviction to implement an oblivious AVL tree with log(N) overhead. We devise new range query data structure using range tree and Path ORAM in 2-d case, and extend into multi-dimension.

    Approximate number of prime factors of integer

    We devise the first efficient deterministic algorithm for approximating ω(N) the number of prime factors of an integer given in addition oracle access to Euler’s Totient function. We show that the algorithm can be extended to handle a more general class of additive functions that "depend solely on the exponents in the prime factorization of an integer".


    Snapshot-Oblivious RAMs: Sub-Logarithmic Efficiency for Short Transcripts

    Yang Du, Daniel Genkin, Paul Grubbs, Accepted to CRYPTO 2022.

    Approximating the Number of Prime Factors Given an Oracle to Euler’s Totient Function

    Yang Du, Ilya Volkovich, In proceedings of FSTTCS 2021.

    Contact Me

    Feel free to contact me by email. Ask me anything: research, cryptography, grad school, bitcoin, life in Ann Arbor.