Kai-Min Chung

Kai-Min Chung, Rafael Pass: Guest column: parallel repetition theorems for interactive arguments. SIGACT News 44(1): 50-69 (2013)

Kai-Min Chung, Edward Lui, Rafael Pass: Can theories be tested?: a cryptographic treatment of forecast testing. ITCS 2013: 47-56

Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass: On the power of nonuniformity in proofs of security. ITCS 2013: 389-400

Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang: Randomness-Dependent Message Security. TCC 2013: 700-720

Kai-Min Chung, Rafael Pass, Karn Seth: Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security. IACR Cryptology ePrint Archive 2013: 8 (2013)

Kai-Min Chung, Rafael Pass: Simultaneous Resettable WI from One-way Functions. IACR Cryptology ePrint Archive 2013: 10 (2013)

Kai-Min Chung, Rafael Pass, Sidharth Telang: Interactive Coding, Revisited. IACR Cryptology ePrint Archive 2013: 160 (2013)

Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth: On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses. IACR Cryptology ePrint Archive 2013: 194 (2013)

Kai-Min Chung, Rafael Pass: A Simple ORAM. IACR Cryptology ePrint Archive 2013: 243 (2013)

Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher: Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. STACS 2012: 124-135

Kai-Min Chung, Rafael Pass, Wei-Lung Dustin Tseng: The Knowledge Tightness of Parallel Zero-Knowledge. TCC 2012: 512-529

Kai-Min Chung, Huijia Lin, Rafael Pass: Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. IACR Cryptology ePrint Archive 2012: 563 (2012)

Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass: Unprovable Security of Two-Message Zero Knowledge. IACR Cryptology ePrint Archive 2012: 711 (2012)

Kai-Min Chung, Omer Reingold, Salil P. Vadhan: S-T connectivity on digraphs with a known stationary distribution. ACM Transactions on Algorithms 7(3): 30 (2011)

Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz: Memory Delegation. CRYPTO 2011: 151-168

Ching-Hua Yu, Sherman S. M. Chow, Kai-Min Chung, Feng-Hao Liu: Efficient Secure Two-Party Exponentiation. CT-RSA 2011: 17-32

Kai-Min Chung, Rafael Pass: The Randomness Complexity of Parallel Repetition. FOCS 2011: 658-667

Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz: Memory Delegation. IACR Cryptology ePrint Archive 2011: 273 (2011)

Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang: Efficient String-Commitment from Weak Bit-Commitment. ASIACRYPT 2010: 268-282

Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan: Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO 2010: 483-501

Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky: AMS Without 4-Wise Independence on Product Domains. STACS 2010: 119-130

Kai-Min Chung, Feng-Hao Liu: Parallel Repetition Theorems for Interactive Arguments. TCC 2010: 19-36

Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan: Improved Delegation of Computation using Fully Homomorphic Encryption. IACR Cryptology ePrint Archive 2010: 241 (2010)

Kai-Min Chung, Feng-Hao Liu: Tight Parallel Repetition Theorems for Public-coin Arguments. Electronic Colloquium on Computational Complexity (ECCC) 16: 109 (2009)

Kai-Min Chung, Salil P. Vadhan: Tight Bounds for Hashing Block Sources. APPROX-RANDOM 2008: 357-370

Kai-Min Chung, Salil P. Vadhan: Tight Bounds for Hashing Block Sources. CoRR abs/0806.1948 (2008)

Kai-Min Chung, Omer Reingold, Salil P. Vadhan: S-T Connectivity on Digraphs with a Known Stationary Distribution. IEEE Conference on Computational Complexity 2007: 236-249

Kai-Min Chung, Omer Reingold, Salil P. Vadhan: S-T Connectivity on Digraphs with a Known Stationary Distribution. Electronic Colloquium on Computational Complexity (ECCC) 14(030) (2007)

Wei-Chun Kao, Kai-Min Chung, Chia-Liang Sun, Chih-Jen Lin: Decomposition Methods for Linear Support Vector Machines. Neural Computation 16(8): 1689-1704 (2004)

Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM J. Comput. 34(2): 373-387 (2004)

Kai-Min Chung, Wei-Chun Kao, Chia-Liang Sun, Li-Lun Wang, Chih-Jen Lin: Radius Margin Bounds for Support Vector Machines with the RBF Kernel. Neural Computation 15(11): 2643-2681 (2003)

Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. ESA 2003: 136-147

Kai-Min Chung, Hsueh-I Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. CoRR cs.DS/0311020 (2003)