Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
---|---|---|---|---|---|---|
2018 | On the Complexity of Simulating Auxiliary Input | Yi-Hsiu Chen; Kai-Min Chung; Jyun-Jie Liao | ||||
2017 | On the Depth of Oblivious Parallel RAM | T-H. Hubert Chan; Kai-Min Chung; Elaine Shi | ||||
2017 | On the Impossibility of Cryptography with Tamperable Randomness | Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth | Algorithmica 79(4), 1052-1101 | |||
2014 | On the Impossibility of Cryptography with Tamperable Randomness | Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth | ||||
2013 | On the Lattice Smoothing Parameter Problem | Kai-Min Chung; Daniel Dadush; Feng-Hao Liu; Chris Peikert | ||||
2013 | On the Power of Nonuniformity in Proofs of Security | Kai-Min Chung; Huijia Lin; Mohammad Mahmoody; Rafael Pass | ||||
2015 | Parallel Repetition for Entangled k-player Games via Fast Quantum Search | Xiaodi Wu; Kai-Min Chung; Henry S. Yuen | ||||
2013 | Parallel Repetition Theorems for Interactive Arguments | Kai-Min Chung; Rafael Pass | SIGACT News 44(1), 50-69 | |||
2010 | Parallel Repetition Theorems for Interactive Arguments | Kai-Min Chung; Feng-Hao Liu | ||||
2014 | Physical Randomness Extractors | Kai-Min Chung; Yaoyun Shi; Xiaodi Wu | ||||
2003 | Radius Margin Bounds for Support Vector Machines with RBF Kernel | Kai-Min Chung; Wei-Chun Kao; Chia-Liang Sun; Li Lun Wang; Chih-Jen Lin | Neural Computation 15(11), 2643-2681 | |||
2013 | Randomness-Dependent Message Security | Eleanor Birrell; Kai-Min Chung; Rafael Pass; Sidharth Telang | ||||
2011 | S-t Connectivity on Digraphs with a Known Stationary Distribution | Kai-Min Chung; Omer Reingold; Salil Vadhan | ACM Transactions on Algorithms 7(3), 30:1-30:21 | |||
2007 | S-t Connectivity on Digraphs with a Known Stationary Distribution | Kai-Min Chung; Omer Reingold; Salil Vadhan | ||||
2018 | Space-efficient Classical and Quantum Algorithms for the Shortest Vector Problem | Yanlin Chen; Kai-Min Chung; Ching-Yi Lai | Quantum Information & Computation 18, 285-306 | |||
2018 | Space-efficient Classical and Quantum Algorithms for the Shortest Vector Problem | Yanlin Chen; Kai-Min Chung; Ching-Yi Lai | ||||
2014 | Statistically-secure ORAM with Õ (log² n) Overhead | Kai-Min Chung; Zhenming Liu; Rafael Pass | ||||
2012 | The Knowledge Tightness of Parallel Zero-Knowledge | Kai-Min Chung; Rafael Pass; Wei-Lung Dustin Tseng | ||||
2011 | The Randomness Complexity of Parallel Repetition | Kai-Min Chung; Rafael Pass | ||||
2008 | Tight Bounds for Hashing Block Sources | Kai-Min Chung; Salil Vadhan |