Peihan Miao  觭驛縌

 

 

Hi! I am a PhD candidate in the Theory Group and Cryptography Group at UC Berkeley. My advisor is Sanjam Garg. Before coming to Berkeley, I received my BS degree in Computer Science from ACM Honors Class at Shanghai Jiao Tong University.

I spent the summer of 2017 as a research intern working with Melissa Chase at Microsoft Research, and the summer of 2015 as a visiting student at Simons Institute.

I am interested in theoretical computer science, especially cryptography. Here is my CV.

 

Publications

Cut-and-Choose for Garbled RAM [eprint]
Peihan Miao.
Manuscript.

Obfuscation from Low Noise Multilinear Maps [eprint]
Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, and Pratyay Mukherjee.
Manuscript.

Laconic Oblivious Transfer and its Applications [eprint]
Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, and Antigoni Polychroniadou.
In Proceedings of the 37th International Cryptology Conference (CRYPTO) 2017.

Decentralized Anonymous Micropayments [eprint]
Alessandro Chiesa, Matthew Green, Jingcheng Liu, Peihan Miao, Ian Miers, and Pratyush Mishra.
In Proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) 2017.

Secure Multiparty RAM Computation in Constant Rounds [eprint] [slides]
Sanjam Garg, Divya Gupta, Peihan Miao, and Omkant Pandey
In Proceedings of the 14th IACR Theory of Cryptography Conference (TCC) 2016-B.

Nordhaus-Gaddum-Type Problems for Lines in Hypergraphs [arxiv]
Xiaomin Chen, and Peihan Miao
Discrete Applied Mathematics (2016).

Secretary Markets with Local Information [pdf] [slides]
Ning Chen, Martin Hoefer, Marvin K邦nnemann, Chengyu Lin, and Peihan Miao.
In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP) 2015.

Graph Metric with No Proper Inclusion Between Lines [arxiv]
Xiaomin Chen, Guangda Huzhang, Peihan Miao, and Kuan Yang.
Discrete Applied Mathematics (2015).

Number of Lines in Hypergraphs [arxiv]
Pierre Aboulker, Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Vašek Chv芍tal, and Peihan Miao.
Discrete Applied Mathematics (2014).

 

Talks

Laconic Oblivious Transfer and its Applications.
Invited talk at China Theory Week. Shanghai, China, July 17 每 20, 2017.

Laconic Oblivious Transfer and its Applications.
Invited talk at Bay Area Crypto Day. Visa Research, Palo Alto, April 21, 2017.

Laconic Oblivious Transfer and its Applications.
Contributed talk at Theory and Practice of Multi-Party Computation Workshop. Bristol, United Kingdom, April 3 每 7, 2017.

Secure Multiparty RAM Computation in Constant Rounds.
Conference talk at IACR Theory of Cryptography Conference (TCC). Beijing, China, Oct 31 每 Nov 3, 2016.

Decentralized Anonymous Micropayments.
Short talk at IACR Summer School on Blockchains and Cryptocurrencies. Corfu, Greece, May 30 每 June 2, 2016.

Decentralized Anonymous Micropayments.
Lightning talk at Women in Theory Workshop. Simons Institute, Berkeley, May 22 每 25, 2016.

Cut-and-Choose for Garbled RAM.
Invited talk at Bay Area Crypto Day. UC Berkeley, Nov 20, 2015.

Secretary Markets with Local Information.
Conference talk at International Colloquium on Automata, Languages, and Programming (ICALP). Kyoto, Japan, July 6 每 10, 2015.

 

Contact

665 Soda Hall
Computer Science Division
University of California, Berkeley
Berkeley, CA 94720

Email: peihan [at] cs.berkeley.edu