Pham Van Long Phuoc

Talks:

Presenting papers is not just to show results. Through a well-prepared talk, I hope to express my own viewpoint about the problem, and the solution that we proposed. Given enough time to practice and many iterations, I believe anyone could come up with a talk that has a clear structure, and one clear message that the author hopes to convey. This message could be the problem itself, or the new technique that was introduced in the work, or sometimes just a really subtle trick that requires sufficient background and explanation to understand.
In my point of view, giving a good talk is hard, and I have a high standard on public speaking. For almost all of my talks, given sufficient time, I always prepare a well-thought script (even before preparing the slides!), which (I feel) greatly help with consistency and delivery. Especially, as a self-claimed funny guy, I suddenly want to give one or two jokes in my presentation, that would fail embarassingly without a script and a thousand iterations. This preparation had certainly given me a lot of compliments for many talks I have given (both serious and non serious talks) (trust me, or just ask some friends about my PICS talk).
I hope these small tips would help bring a little improvement to the presentations of whoever is reading this page! Nonetheless, time for advertisement: If you would like to host me for a talk, don't be shy and send an email to (firstname)_pham_van_long(at)brown.edu!

  • Survey for Reed-Solomon List Decoding and related topics.
    • Seminar ACR Lab - VIASM, Hanoi, Vietnam (Remote).
  • Multiple lectures on Reed-Solomon Codes: Berlekamp-Welch algorithm, List Decoding.
    • Brown's Algorithm Lunch, Summer 2026.
  • PICS: Private Intersection over Committed (and reusable) Sets.
    • USENIX Security 2026, Baltimore, USA.
    • TPMPC 2026, Aarhus, Denmark.
    • MongoDB Cryptography Research Group, New York, USA.
    • Brown's Cryptography Reading Group, Spring 2026.
  • Multiparty Computation with Minimal Overhead without Circuit Transformation.
    • TPMPC 2026, Aarhus, Denmark.
    • Columbia's Student Theory Seminar, New York, Spring 2026.
  • New Framework for Structure-Aware PSI From Distributed Function Secret Sharing.
    • Asiacrypt 2025, Melbourne, Australia.
    • Brown's Cryptography Reading Group, Spring 2026.
    • Brown's Algorithm Lunch, Fall 2025.
  • Noise-tolerant Codebooks for Semi-quantitative Group Testing: Application to Spatial Genomics.
    • The 2024 IEEE International Symposium on Information Theory, Athens, Greece.
    • The 2nd Workshop on Combinatorics and Coding Theory, VIASM, Hanoi, Vietnam.
  • Sequence reconstruction problem for deletion channels: A complete asymptotic solution.
    • The 2022 IEEE international Symposium on Information Theory, Aalto University, Espoo, Finland.
    • 2022 Munich Workshop on Coding and Cryptography, Munich, Germany.