Peihan Miao 缪沛晗

I am an Assistant Professor in the Department of Computer Science at Brown University. I am honored to be part of Brown's Theory Group.

I received my Ph.D. from UC Berkeley in 2019 under the supervision of Sanjam Garg and my BS degree from ACM Honors Class at Shanghai Jiao Tong University. Here is my CV.

My research interests lie broadly in cryptography and security, with a focus on secure multi-party computation (both theoretical and applied). My research is supported by the NSF SaTC Award, Meta Research Award, DSI Seed Grant, Google Research Scholar Award, and Amazon Research Award.

For Brown students: If you are interested in learning more about cryptography research, you are welcome to attend our weekly crypto reading group. Subscribe to the crypto mailing list here!

Contact

Publications

[24] Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity [eprint]

[23] Client-Aided Privacy-Preserving Machine Learning [eprint]

[22] Computation Efficient Structure-Aware PSI From Incremental Function Secret Sharing [eprint] [slides] [video]

[21] Laconic Branching Programs from the Diffie-Hellman Assumption [eprint]

[20] On the Round Complexity of Fully Secure Solitary MPC with Honest Majority [eprint]

[19] Unidirectional Updatable Encryption and Proxy Re-encryption from DDH [eprint]

[18] Updatable Private Set Intersection [eprint]

[17] Amortizing Rate-1 OT and Applications to PIR and PSI [eprint] [video]

[16] Multi-Party Threshold Private Set Intersection with Sublinear Communication [eprint] [video]

[15] Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF [eprint] [video]

[14] Two-Sided Malicious Security for Private Intersection-Sum with Cardinality [eprint]

[13] Cut-and-Choose for Garbled RAM [eprint] [slides]

[12] Secretary Markets with Local Information [pdf]

[11] Efficient Leakage Resilient Secret Sharing [pdf]

[10] PASTA: PASsword-based Threshold Authentication [eprint] [short video] [long video]

[9] Two-Round Multiparty Secure Computation Minimizing Public Key Operations [eprint] [video]

[8] Obfuscation from Low Noise Multilinear Maps [eprint]

[7] Laconic Oblivious Transfer and its Applications [eprint] [video]

[6] Decentralized Anonymous Micropayments [eprint]

[5] Secure Multiparty RAM Computation in Constant Rounds [eprint]

[4] Nordhaus-Gaddum-Type Problems for Lines in Hypergraphs [arxiv]

[3] Secretary Markets with Local Information [pdf

[2] Graph Metric with No Proper Inclusion Between Lines [arxiv]

[1] Number of Lines in Hypergraphs [arxiv]

Service

Program Committees


Check out the Mentoring Videos on questions such as

and many many more questions, all answered by researchers in our field. There are many familiar faces.