Page 187 - My FlipBook
P. 187
Research Fellow 鐘楷閔 研
究
Kai-Min Chung 人
員
Ph.D., Computer Science, Harvard University, United States Faculty
T +86-2-2788-3799 ext. 1716 E kmchung@iis.sinica.edu.tw
F +886-2-2782-4814 W kwmwcwh.uiisn.gsinica.edu.tw/pages/
・ Research Fellow, Academia Sinica, Institute of Information Science, Taiwan
(2020/2-present)
・ Associate Research Fellow, Academia Sinica, Institute of Information Science , Taiwan
(2015/3-2020/2)
・ Assistant Research Fellow, Academia Sinica, Institute of Information Science, Taiwan
(2013/9-2015/2)
・ Postdoctoral Research Associate, Cornell University, Department of Computer Science,
United States (2010/8-2013/8)
・ Ph.D., Computer Science, Harvard University, United States (2005/9-2011/3)
・ B.S., Computer Science and Information Engineering, National Taiwan University,
Taiwan (1996/9-2003/6)
Research Description
My research lies in the eld of (quantum) cryptography with a broad interest in theoretical computer science. I have worked on classical
cryptography for decade, and contributed to several lines of research, such as cryptography for parallel RAM, zero-knowledge, program
obfuscation, and delegation of computation. In recent years, my research focuses more on the interdisciplinary field of quantum
cryptography, which investigates the role of quantum computation in cryptography. In the following, I highlight my research on
cryptography in the parallel RAM model and quantum cryptography.
Cryptography for parallel RAM (PRAM)
Large data sets, such as medical, genetic, and transaction data are now in abundance. Leveraging the power of massive parallelism and
random data access simultaneously is important to handle the big data. However, traditional cryptographic designs typically work with
the circuit model, which does not capture random data access, and recent research on cryptography for the RAM model does not capture
parallelism. We propose to use the parallel RAM (PRAM) model as a clean abstract model to capture both power, and develop techniques
to design cryptographic solutions for the PRAM model. In particular, we de ned and construct the rst oblivious PRAM, obtained general
feasibility results based on indistinguishability obfuscations, and constructed the rst adaptively secure garbled PRAM.
Quantum cryptography
Quantum cryptography aims to understand the role of quantum computation in cryptography, which is a double-edged sword. On one
hand, Shor’s quantum algorithm can be used to break most public-key cryptosystems in use. One the other hand, quantum also enhances
the honest parties to achieve stronger functionalities or security. We are generally interested in investigating the role of quantum in
cryptography on both sides in diverse directions; some of which proposed by us. The topics include device-independent cryptography,
understanding the role of quantum (side) information, classical delegation of quantum computation, and security in the quantum random
oracle model.
Publications
1. Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai, "On the Need for 6. Kai-Min Chung, Yaoyun Shi and Xiaodi Wu, "General Brochure 2020
Large Quantum Depth," The 52nd Annual ACM Symposium on Randomness Amplification with Non-signaling Security," The
Theory of Computing 2020 (STOC 2020), June 2020. 20th Annual Conference on Quantum Information Processing
(QIP2017), January 2017.
2. T-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin and Elaine Shi,
"MPC for MPC: Secure Computation on a Massively Parallel 7. Elette Boyle and Kai-Min Chung and Rafael Pass, "Oblivious
Computing Architecture," The 11th Innovations in Theoretical Parallel RAM and Applications," The 13rd IACR Theory of
Computer Science (ITCS 2020), January 2020. Cryptography Conference (TCC2016), January 2016.
3. Thomas Vidick, Han-hsuan Lin, Divesh Aggarwal and Kai- 8. Kai-Min Chung and Huijia Lin and Rafael Pass, "Constant-
Min Chung, "A Quantum-Proof Non-Malleable Extractor With Round Concurrent Zero-knowledge from Indistinguishability
Application to Privacy Amplification against Active Quantum Obfuscation," The 35th International Cryptology Conference
Adversaries," The 38th Annual International Conference on the (CRYPTO), August 2015.
Theory and Applications of Cryptographic Techniques (Eurocrypt
2019), May 2019. 9. Kai-Min Chung and Yaoyun Shi and Xiaodi Wu, "Physical
Randomness Extractors," The 17th Conference on Quantum
4. T-H. Hubert Chan, Kai-Min Chung, Bruce Maggs and Elaine Information Processing (QIP) , Renato Renner, editor, February
Shi, "Foundations of Differentially Oblivious Algorithms," 2014, Accepted as a *plenary talk* at the 17th Conference on
ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), Quantum Information Processing (QIP) February 2014.
January 2019.
10. Kai-Min Chung and Rafael Pass and Karn Seth, "Non-Black-
5. Chi-Ning Chou, Kai-Min Chung and Chi-Jen Lu, "On the Box Simulation from One-Way Functions And Applications to
Algorithmic Power of Spiking Neural Networks," The 10th Resettable Security," The 45th ACM Symposium on Theory of
Innovations in Theoretical Computer Science (ITCS 2019), Computing (STOC), Dan Boneh and Tim Roughgarden and Joan
January 2019. Feigenbaum, editor, ACM, pages 231-240, June 2013.
185
究
Kai-Min Chung 人
員
Ph.D., Computer Science, Harvard University, United States Faculty
T +86-2-2788-3799 ext. 1716 E kmchung@iis.sinica.edu.tw
F +886-2-2782-4814 W kwmwcwh.uiisn.gsinica.edu.tw/pages/
・ Research Fellow, Academia Sinica, Institute of Information Science, Taiwan
(2020/2-present)
・ Associate Research Fellow, Academia Sinica, Institute of Information Science , Taiwan
(2015/3-2020/2)
・ Assistant Research Fellow, Academia Sinica, Institute of Information Science, Taiwan
(2013/9-2015/2)
・ Postdoctoral Research Associate, Cornell University, Department of Computer Science,
United States (2010/8-2013/8)
・ Ph.D., Computer Science, Harvard University, United States (2005/9-2011/3)
・ B.S., Computer Science and Information Engineering, National Taiwan University,
Taiwan (1996/9-2003/6)
Research Description
My research lies in the eld of (quantum) cryptography with a broad interest in theoretical computer science. I have worked on classical
cryptography for decade, and contributed to several lines of research, such as cryptography for parallel RAM, zero-knowledge, program
obfuscation, and delegation of computation. In recent years, my research focuses more on the interdisciplinary field of quantum
cryptography, which investigates the role of quantum computation in cryptography. In the following, I highlight my research on
cryptography in the parallel RAM model and quantum cryptography.
Cryptography for parallel RAM (PRAM)
Large data sets, such as medical, genetic, and transaction data are now in abundance. Leveraging the power of massive parallelism and
random data access simultaneously is important to handle the big data. However, traditional cryptographic designs typically work with
the circuit model, which does not capture random data access, and recent research on cryptography for the RAM model does not capture
parallelism. We propose to use the parallel RAM (PRAM) model as a clean abstract model to capture both power, and develop techniques
to design cryptographic solutions for the PRAM model. In particular, we de ned and construct the rst oblivious PRAM, obtained general
feasibility results based on indistinguishability obfuscations, and constructed the rst adaptively secure garbled PRAM.
Quantum cryptography
Quantum cryptography aims to understand the role of quantum computation in cryptography, which is a double-edged sword. On one
hand, Shor’s quantum algorithm can be used to break most public-key cryptosystems in use. One the other hand, quantum also enhances
the honest parties to achieve stronger functionalities or security. We are generally interested in investigating the role of quantum in
cryptography on both sides in diverse directions; some of which proposed by us. The topics include device-independent cryptography,
understanding the role of quantum (side) information, classical delegation of quantum computation, and security in the quantum random
oracle model.
Publications
1. Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai, "On the Need for 6. Kai-Min Chung, Yaoyun Shi and Xiaodi Wu, "General Brochure 2020
Large Quantum Depth," The 52nd Annual ACM Symposium on Randomness Amplification with Non-signaling Security," The
Theory of Computing 2020 (STOC 2020), June 2020. 20th Annual Conference on Quantum Information Processing
(QIP2017), January 2017.
2. T-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin and Elaine Shi,
"MPC for MPC: Secure Computation on a Massively Parallel 7. Elette Boyle and Kai-Min Chung and Rafael Pass, "Oblivious
Computing Architecture," The 11th Innovations in Theoretical Parallel RAM and Applications," The 13rd IACR Theory of
Computer Science (ITCS 2020), January 2020. Cryptography Conference (TCC2016), January 2016.
3. Thomas Vidick, Han-hsuan Lin, Divesh Aggarwal and Kai- 8. Kai-Min Chung and Huijia Lin and Rafael Pass, "Constant-
Min Chung, "A Quantum-Proof Non-Malleable Extractor With Round Concurrent Zero-knowledge from Indistinguishability
Application to Privacy Amplification against Active Quantum Obfuscation," The 35th International Cryptology Conference
Adversaries," The 38th Annual International Conference on the (CRYPTO), August 2015.
Theory and Applications of Cryptographic Techniques (Eurocrypt
2019), May 2019. 9. Kai-Min Chung and Yaoyun Shi and Xiaodi Wu, "Physical
Randomness Extractors," The 17th Conference on Quantum
4. T-H. Hubert Chan, Kai-Min Chung, Bruce Maggs and Elaine Information Processing (QIP) , Renato Renner, editor, February
Shi, "Foundations of Differentially Oblivious Algorithms," 2014, Accepted as a *plenary talk* at the 17th Conference on
ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), Quantum Information Processing (QIP) February 2014.
January 2019.
10. Kai-Min Chung and Rafael Pass and Karn Seth, "Non-Black-
5. Chi-Ning Chou, Kai-Min Chung and Chi-Jen Lu, "On the Box Simulation from One-Way Functions And Applications to
Algorithmic Power of Spiking Neural Networks," The 10th Resettable Security," The 45th ACM Symposium on Theory of
Innovations in Theoretical Computer Science (ITCS 2019), Computing (STOC), Dan Boneh and Tim Roughgarden and Joan
January 2019. Feigenbaum, editor, ACM, pages 231-240, June 2013.
185
