default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKai-Min Chung
Person information
- affiliation: Academia Sinica, Taipei City, Taiwan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[e12]Kai-Min Chung
, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15484, Springer 2025, ISBN 978-981-96-0874-4 [contents]- [e11]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part II. Lecture Notes in Computer Science 15485, Springer 2025, ISBN 978-981-96-0887-4 [contents] - [e10]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part III. Lecture Notes in Computer Science 15486, Springer 2025, ISBN 978-981-96-0890-4 [contents] - [e9]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part IV. Lecture Notes in Computer Science 15487, Springer 2025, ISBN 978-981-96-0893-5 [contents] - [e8]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part V. Lecture Notes in Computer Science 15488, Springer 2025, ISBN 978-981-96-0934-5 [contents] - [e7]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part VI. Lecture Notes in Computer Science 15489, Springer 2025, ISBN 978-981-96-0937-6 [contents] - [e6]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part VII. Lecture Notes in Computer Science 15490, Springer 2025, ISBN 978-981-96-0940-6 [contents] - [e5]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part VIII. Lecture Notes in Computer Science 15491, Springer 2025, ISBN 978-981-96-0943-7 [contents] - [e4]Kai-Min Chung, Yu Sasaki:
Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part IX. Lecture Notes in Computer Science 15492, Springer 2025, ISBN 978-981-96-0946-8 [contents] - 2024
- [c68]Kai-Min Chung, Eli Goldin, Matthew Gray:
On Central Primitives for Quantum Cryptography with Classical Communication. CRYPTO (7) 2024: 215-248 - [c67]Kai-Min Chung, Mi-Ying (Miryam) Huang, Er-Cheng Tang, Jiapeng Zhang:
Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort. EUROCRYPT (6) 2024: 119-148 - [i81]Kai-Min Chung, Eli Goldin, Matthew Gray:
On Central Primitives for Quantum Cryptography with Classical Communication. CoRR abs/2402.17715 (2024) - [i80]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Jiahui Liu:
The Black-Box Simulation Barrier Persists in a Fully Quantum World. CoRR abs/2409.06317 (2024) - [i79]Nai-Hui Chia, Kai-Min Chung, Tzu-Hsiang Huang, Jhih-Wei Shih:
Complexity Theory for Quantum Promise Problems. CoRR abs/2411.03716 (2024) - [i78]Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh, Wei-Jia Huang, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai:
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs. CoRR abs/2411.09121 (2024) - [i77]Kai-Min Chung, Eli Goldin, Matthew Gray:
On Central Primitives for Quantum Cryptography with Classical Communication. IACR Cryptol. ePrint Arch. 2024: 356 (2024) - [i76]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Jiahui Liu:
The Black-Box Simulation Barrier Persists in a Fully Quantum World. IACR Cryptol. ePrint Arch. 2024: 1413 (2024) - 2023
- [j17]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the Need for Large Quantum Depth. J. ACM 70(1): 6:1-6:38 (2023) - [j16]Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai, Di-De Yen:
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits. Proc. ACM Program. Lang. 7(PLDI): 1218-1243 (2023) - [c66]Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody:
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. ASIACRYPT (4) 2023: 339-368 - [c65]Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai:
AutoQ: An Automata-Based Quantum Circuit Verifier. CAV (3) 2023: 139-153 - [c64]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. CCC 2023: 33:1-33:45 - [c63]Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-interactive Classical Commitments in a Quantum World. EUROCRYPT (1) 2023: 144-172 - [e3]Kai-Min Chung:
4th Conference on Information-Theoretic Cryptography, ITC 2023, June 6-8, 2023, Aarhus University, Aarhus, Denmark. LIPIcs 267, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-271-6 [contents] - [i75]Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai, Di-De Yen:
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report). CoRR abs/2301.07747 (2023) - [i74]Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen:
On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation. CoRR abs/2305.12444 (2023) - [i73]Kai-Min Chung, Yao-Ting Lin, Mohammad Mahmoody:
Black-Box Separations for Non-Interactive Commitments in a Quantum World. IACR Cryptol. ePrint Arch. 2023: 570 (2023) - [i72]Abtin Afshar, Kai-Min Chung, Yao-Ching Hsieh, Yao-Ting Lin, Mohammad Mahmoody:
On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2023: 932 (2023) - 2022
- [j15]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. J. ACM 69(4): 27:1-27:49 (2022) - [c62]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. ASIACRYPT (1) 2022: 160-194 - [c61]Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody:
On the Impossibility of Key Agreements from Quantum Random Oracles. CRYPTO (2) 2022: 165-194 - [c60]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. CRYPTO (3) 2022: 533-563 - [c59]Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu:
Constant-Round Blind Classical Verification of Quantum Sampling. EUROCRYPT (3) 2022: 707-736 - [c58]Rohit Chatterjee, Kai-Min Chung, Xiao Liang, Giulio Malavolta:
A Note on the Post-quantum Security of (Ring) Signatures. Public Key Cryptography (2) 2022: 407-436 - [i71]Hsiao-Yu Hu, Hao-Ting Wei, Meng-Hsi Li, Kai-Min Chung, Chung-Shou Liao:
Online TSP with Predictions. CoRR abs/2206.15364 (2022) - [i70]Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody:
On the Impossibility of Key Agreements from Quantum Random Oracles. IACR Cryptol. ePrint Arch. 2022: 218 (2022) - [i69]Prabhanjan Ananth, Kai-Min Chung, Xiong Fan, Luowen Qian:
Collusion-Resistant Functional Encryption for RAMs. IACR Cryptol. ePrint Arch. 2022: 1269 (2022) - 2021
- [c57]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. CRYPTO (2) 2021: 3-32 - [c56]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds. CRYPTO (1) 2021: 315-345 - [c55]Prabhanjan Ananth, Kai-Min Chung, Rolando L. La Placa:
On the Concurrent Composition of Quantum Zero-Knowledge. CRYPTO (1) 2021: 346-374 - [c54]Bar Alon, Hao Chung, Kai-Min Chung, Mi-Ying Huang, Yi Lee, Yu-Ching Shen:
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort. CRYPTO (1) 2021: 436-466 - [c53]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. EUROCRYPT (2) 2021: 598-629 - [c52]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round. FOCS 2021: 59-67 - [c51]Kai-Min Chung, Han-Hsuan Lin:
Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem. TQC 2021: 3:1-3:22 - [i68]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. CoRR abs/2103.11244 (2021) - [i67]Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang, Yu-Hsuan Huang, Tanja Lange, Bo-Yin Yang:
Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. CoRR abs/2110.04795 (2021) - [i66]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. CoRR abs/2111.08665 (2021) - [i65]Rohit Chatterjee, Kai-Min Chung, Xiao Liang, Giulio Malavolta:
A Note on the Post-Quantum Security of (Ring) Signatures. CoRR abs/2112.06078 (2021) - [i64]Nai-Hui Chia, Kai-Min Chung, Qipeng Liu, Takashi Yamakawa:
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2021: 376 (2021) - [i63]Kai-Min Chung, Yao-Ching Hsieh, Mi-Ying Huang, Yu-Hsuan Huang, Tanja Lange, Bo-Yin Yang:
Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions. IACR Cryptol. ePrint Arch. 2021: 1368 (2021) - [i62]Nai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa:
Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round. IACR Cryptol. ePrint Arch. 2021: 1516 (2021) - [i61]Rohit Chatterjee, Kai-Min Chung, Xiao Liang, Giulio Malavolta:
A Note on the Post-Quantum Security of (Ring) Signatures. IACR Cryptol. ePrint Arch. 2021: 1616 (2021) - 2020
- [c50]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. FOCS 2020: 673-684 - [c49]Kai-Min Chung, Tai-Ning Liao, Luowen Qian:
Lower Bounds for Function Inversion with Quantum Advice. ITC 2020: 8:1-8:15 - [c48]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. ITCS 2020: 75:1-75:52 - [c47]Kai-Min Chung, Kuan-Yi Ho, Xiaorui Sun:
On the Hardness of Massively Parallel Computation. SPAA 2020: 153-162 - [c46]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the need for large quantum depth. STOC 2020: 902-915 - [c45]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. TCC (3) 2020: 181-206 - [p1]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
When Simple Hash Functions Suffice. Beyond the Worst-Case Analysis of Algorithms 2020: 567-585 - [i60]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. CoRR abs/2006.05650 (2020) - [i59]Kai-Min Chung, Kuan-Yi Ho, Xiaorui Sun:
On the Hardness of Massively Parallel Computation. CoRR abs/2008.06554 (2020) - [i58]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. CoRR abs/2010.11658 (2020) - [i57]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round. CoRR abs/2011.02670 (2020) - [i56]Kai-Min Chung, Yi Lee, Han-Hsuan Lin, Xiaodi Wu:
Constant-round Blind Classical Verification of Quantum Sampling. CoRR abs/2012.04848 (2020) - [i55]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. Electron. Colloquium Comput. Complex. TR20 (2020) - [i54]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. IACR Cryptol. ePrint Arch. 2020: 240 (2020) - [i53]Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian:
Tight Quantum Time-Space Tradeoffs for Function Inversion. IACR Cryptol. ePrint Arch. 2020: 693 (2020) - [i52]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. IACR Cryptol. ePrint Arch. 2020: 1273 (2020) - [i51]Kai-Min Chung, Serge Fehr, Yu-Hsuan Huang, Tai-Ning Liao:
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2020: 1305 (2020) - [i50]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2020: 1384 (2020) - [i49]Bar Alon, Hao Chung, Kai-Min Chung, Mi-Ying Huang, Yi Lee, Yu-Ching Shen:
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2020: 1464 (2020) - [i48]Prabhanjan Ananth, Kai-Min Chung, Rolando L. La Placa:
On the Concurrent Composition of Quantum Zero-Knowledge. IACR Cryptol. ePrint Arch. 2020: 1528 (2020) - [i47]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions. IACR Cryptol. ePrint Arch. 2020: 1591 (2020)
2010 – 2019
- 2019
- [j14]Kai-Min Chung, Marios Georgiou, Ching-Yi Lai, Vassilis Zikas:
Cryptography with Disposable Backdoors. Cryptogr. 3(3): 22 (2019) - [j13]Ching-Yi Lai, Kai-Min Chung:
Quantum encryption and generalized Shannon impossibility. Des. Codes Cryptogr. 87(9): 1961-1972 (2019) - [c44]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. EUROCRYPT (3) 2019: 219-246 - [c43]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-malleable Extractor - With Application to Privacy Amplification Against Active Quantum Adversaries. EUROCRYPT (2) 2019: 442-469 - [c42]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. ITCS 2019: 26:1-26:20 - [c41]Ching-Yi Lai, Kai-Min Chung:
Interactive Leakage Chain Rule for Quantum Min-entropy. ISIT 2019: 2997-3001 - [c40]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. SODA 2019: 2448-2467 - [c39]Kai-Min Chung, Luowen Qian:
Adaptively Secure Garbling Schemes for Parallel Computations. TCC (2) 2019: 285-310 - [i46]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. CoRR abs/1902.09768 (2019) - [i45]Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
On the Need for Large Quantum Depth. CoRR abs/1909.10303 (2019) - [i44]Kai-Min Chung, Tai-Ning Liao, Luowen Qian:
Lower Bounds for Function Inversion with Quantum Advice. CoRR abs/1911.09176 (2019) - [i43]Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa:
Classical Verification of Quantum Computations with Efficient Verifier. CoRR abs/1912.00990 (2019) - [i42]Dorit Aharonov, Zvika Brakerski, Kai-Min Chung, Ayal Green, Ching-Yi Lai, Or Sattath:
On Quantum Advantage in Information Theoretic Single-Server PIR. IACR Cryptol. ePrint Arch. 2019: 232 (2019) - [i41]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries. IACR Cryptol. ePrint Arch. 2019: 254 (2019) - [i40]Kai-Min Chung, Luowen Qian:
Adaptively Secure Garbling Schemes for Parallel Computations. IACR Cryptol. ePrint Arch. 2019: 1077 (2019) - 2018
- [j12]Yanlin Chen, Kai-Min Chung, Ching-Yi Lai:
Space-efficient classical and quantum algorithms for the shortest vector problem. Quantum Inf. Comput. 18(3&4): 285-306 (2018) - [j11]Ching-Yi Lai, Kai-Min Chung:
On statistically-secure quantum homomorphic encryption. Quantum Inf. Comput. 18(9&10): 785-794 (2018) - [c38]Yi-Hsiu Chen, Kai-Min Chung, Jyun-Jie Liao:
On the Complexity of Simulating Auxiliary Input. EUROCRYPT (3) 2018: 371-390 - [c37]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-party Coin Toss. TCC (1) 2018: 563-596 - [i39]Ching-Yi Lai, Kai-Min Chung:
Generalized Quantum Shannon Impossibility for Quantum Encryption. CoRR abs/1801.03656 (2018) - [i38]Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu:
On the Algorithmic Power of Spiking Neural Networks. CoRR abs/1803.10375 (2018) - [i37]Kai-Min Chung, Han-Hsuan Lin:
On the Sample Complexity of PAC Learning Quantum Process. CoRR abs/1810.10938 (2018) - [i36]Yi-Hsiu Chen, Kai-Min Chung, Jyun-Jie Liao:
On the Complexity of Simulating Auxiliary Input. IACR Cryptol. ePrint Arch. 2018: 171 (2018) - [i35]Kai-Min Chung, Marios Georgiou, Ching-Yi Lai, Vassilis Zikas:
Cryptography with Dispensable Backdoors. IACR Cryptol. ePrint Arch. 2018: 352 (2018) - [i34]Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-Party Coin Toss. IACR Cryptol. ePrint Arch. 2018: 1076 (2018) - 2017
- [j10]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. Algorithmica 79(4): 1052-1101 (2017) - [j9]Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. Distributed Comput. 30(4): 261-280 (2017) - [c36]T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi:
On the Depth of Oblivious Parallel RAM. ASIACRYPT (1) 2017: 567-597 - [i33]Yi-Hsiu Chen, Kai-Min Chung, Ching-Yi Lai, Salil P. Vadhan, Xiaodi Wu:
Computational Notions of Quantum Min-Entropy. CoRR abs/1704.07309 (2017) - [i32]Ching-Yi Lai, Kai-Min Chung:
On Statistically-Secure Quantum Homomorphic Encryption. CoRR abs/1705.00139 (2017) - [i31]Yanlin Chen, Kai-Min Chung, Ching-Yi Lai:
Space-efficient classical and quantum algorithms for the shortest vector problem. CoRR abs/1709.00378 (2017) - [i30]Divesh Aggarwal, Kai-Min Chung, Han-Hsuan Lin, Thomas Vidick:
A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. CoRR abs/1710.00557 (2017) - [i29]T.-H. Hubert Chan, Kai-Min Chung, Elaine Shi:
On the Depth of Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2017: 861 (2017) - [i28]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2017: 1033 (2017) - 2016
- [j8]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security. SIAM J. Comput. 45(2): 415-458 (2016) - [c35]Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Cryptography for Parallel RAM from Indistinguishability Obfuscation. ITCS 2016: 179-190 - [c34]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. TCC (B2) 2016: 3-30 - [c33]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM and Applications. TCC (A2) 2016: 175-204 - [e2]Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang:
Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9614, Springer 2016, ISBN 978-3-662-49383-0 [contents] - [e1]Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang:
Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9615, Springer 2016, ISBN 978-3-662-49386-1 [contents] - 2015
- [c32]Kai-Min Chung, Xiaodi Wu, Henry S. Yuen:
Parallel Repetition for Entangled k-player Games via Fast Quantum Search. CCC 2015: 512-536 - [c31]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation. CRYPTO (1) 2015: 287-307 - [c30]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs. CRYPTO (2) 2015: 742-762 - [c29]Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. TCC (1) 2015: 66-92 - [c28]Kai-Min Chung, Rafael Pass:
Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence. TCC (2) 2015: 229-246 - [i27]Xiaodi Wu, Kai-Min Chung, Henry S. Yuen:
Parallel repetition for entangled k-player games via fast quantum search. CoRR abs/1501.00033 (2015) - [i26]Kai-Min Chung, Rafael Pass:
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence. IACR Cryptol. ePrint Arch. 2015: 31 (2015) - [i25]Kai-Min Chung, Jonathan Katz, Hong-Sheng Zhou:
Functional Encryption from (Small) Hardwae Tokens. IACR Cryptol. ePrint Arch. 2015: 153 (2015) - [i24]Yu-Chi Chen, Sherman S. M. Chow, Kai-Min Chung, Russell W. F. Lai, Wei-Kai Lin, Hong-Sheng Zhou:
Computation-Trace Indistinguishability Obfuscation and its Applications. IACR Cryptol. ePrint Arch. 2015: 406 (2015) - [i23]Prabhanjan Ananth, Yu-Chi Chen, Kai-Min Chung, Huijia Lin, Wei-Kai Lin:
Delegating RAM Computations with Adaptive Soundness and Privacy. IACR Cryptol. ePrint Arch. 2015: 1082 (2015) - 2014
- [c27]Kai-Min Chung, Zhenming Liu, Rafael Pass:
Statistically-secure ORAM with Õ(log2 n) Overhead. ASIACRYPT (2) 2014: 62-81 - [c26]Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth:
On the Impossibility of Cryptography with Tamperable Randomness. CRYPTO (1) 2014: 462-479 - [c25]Kai-Min Chung, Seth Pettie, Hsin-Hao Su:
Distributed algorithms for the Lovász local lemma and graph coloring. PODC 2014: 134-143 - [c24]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. TCC 2014: 52-73 - [c23]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti:
4-Round Resettably-Sound Zero Knowledge. TCC 2014: 192-216 - [i22]Kai-Min Chung, Xin Li, Xiaodi Wu:
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications. CoRR abs/1411.2315 (2014) - [i21]Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert:
On the Lattice Smoothing Parameter Problem. CoRR abs/1412.7979 (2014) - [i20]Kai-Min Chung, Xin Li, Xiaodi Wu:
Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications. Electron. Colloquium Comput. Complex. TR14 (2014) - [i19]Elette Boyle, Kai-Min Chung, Rafael Pass:
Large-Scale Secure Computation. IACR Cryptol. ePrint Arch. 2014: 404 (2014) - [i18]Elette Boyle, Kai-Min Chung, Rafael Pass:
Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2014: 594 (2014) - [i17]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 991 (2014) - 2013
- [j7]Kai-Min Chung, Rafael Pass:
Guest column: parallel repetition theorems for interactive arguments. SIGACT News 44(1): 50-69 (2013) - [j6]Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan:
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream. Theory Comput. 9: 897-945 (2013) - [c22]Kai-Min Chung, Jonathan Katz, Hong-Sheng Zhou:
Functional Encryption from (Small) Hardware Tokens. ASIACRYPT (2) 2013: 120-139 - [c21]Kai-Min Chung, Daniel Dadush, Feng-Hao Liu, Chris Peikert:
On the Lattice Smoothing Parameter Problem. CCC 2013: 230-241 - [c20]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero Knowledge from P-Certificates. FOCS 2013: 50-59 - [c19]Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Ivan Visconti:
Simultaneous Resettability from One-Way Functions. FOCS 2013: 60-69 - [c18]Kai-Min Chung, Rafael Pass, Sidharth Telang:
Knowledge-Preserving Interactive Coding. FOCS 2013: 449-458 - [c17]Kai-Min Chung, Edward Lui, Rafael Pass:
Can theories be tested?: a cryptographic treatment of forecast testing. ITCS 2013: 47-56 - [c16]Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass:
On the power of nonuniformity in proofs of security. ITCS 2013: 389-400 - [c15]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-black-box simulation from one-way functions and applications to resettable security. STOC 2013: 231-240 - [c14]Eleanor Birrell, Kai-Min Chung, Rafael Pass, Sidharth Telang:
Randomness-Dependent Message Security. TCC 2013: 700-720 - [i16]Kai-Min Chung, Zhenming Liu, Rafael Pass:
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead. CoRR abs/1307.3699 (2013) - [i15]Kai-Min Chung, Rafael Pass, Karn Seth:
Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security. IACR Cryptol. ePrint Arch. 2013: 8 (2013) - [i14]Kai-Min Chung, Rafael Pass:
Simultaneous Resettable WI from One-way Functions. IACR Cryptol. ePrint Arch. 2013: 10 (2013) - [i13]Kai-Min Chung, Rafael Pass, Sidharth Telang:
Interactive Coding, Revisited. IACR Cryptol. ePrint Arch. 2013: 160 (2013) - [i12]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 Cryptol. ePrint Arch. 2013: 194 (2013) - [i11]Kai-Min Chung, Rafael Pass:
A Simple ORAM. IACR Cryptol. ePrint Arch. 2013: 243 (2013) - [i10]Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. IACR Cryptol. ePrint Arch. 2013: 260 (2013) - [i9]Elette Boyle, Kai-Min Chung, Rafael Pass:
On Extractability Obfuscation. IACR Cryptol. ePrint Arch. 2013: 650 (2013) - 2012
- [c13]Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher:
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. STACS 2012: 124-135 - [c12]Kai-Min Chung, Rafael Pass, Wei-Lung Dustin Tseng:
The Knowledge Tightness of Parallel Zero-Knowledge. TCC 2012: 512-529 - [i8]Kai-Min Chung, Huijia Lin, Rafael Pass:
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions. IACR Cryptol. ePrint Arch. 2012: 563 (2012) - [i7]Kai-Min Chung, Edward Lui, Mohammad Mahmoody, Rafael Pass:
Unprovable Security of Two-Message Zero Knowledge. IACR Cryptol. ePrint Arch. 2012: 711 (2012) - 2011
- [j5]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T connectivity on digraphs with a known stationary distribution. ACM Trans. Algorithms 7(3): 30:1-30:21 (2011) - [c11]Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz:
Memory Delegation. CRYPTO 2011: 151-168 - [c10]Ching-Hua Yu, Sherman S. M. Chow, Kai-Min Chung, Feng-Hao Liu:
Efficient Secure Two-Party Exponentiation. CT-RSA 2011: 17-32 - [c9]Kai-Min Chung, Rafael Pass:
The Randomness Complexity of Parallel Repetition. FOCS 2011: 658-667 - [i6]Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz:
Memory Delegation. IACR Cryptol. ePrint Arch. 2011: 273 (2011) - 2010
- [c8]Kai-Min Chung, Feng-Hao Liu, Chi-Jen Lu, Bo-Yin Yang:
Efficient String-Commitment from Weak Bit-Commitment. ASIACRYPT 2010: 268-282 - [c7]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO 2010: 483-501 - [c6]Vladimir Braverman, Kai-Min Chung, Zhenming Liu, Michael Mitzenmacher, Rafail Ostrovsky:
AMS Without 4-Wise Independence on Product Domains. STACS 2010: 119-130 - [c5]Kai-Min Chung, Feng-Hao Liu:
Parallel Repetition Theorems for Interactive Arguments. TCC 2010: 19-36 - [i5]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation using Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010: 241 (2010)
2000 – 2009
- 2009
- [i4]Kai-Min Chung, Feng-Hao Liu:
Tight Parallel Repetition Theorems for Public-coin Arguments. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c4]Kai-Min Chung, Salil P. Vadhan:
Tight Bounds for Hashing Block Sources. APPROX-RANDOM 2008: 357-370 - [i3]Kai-Min Chung, Salil P. Vadhan:
Tight Bounds for Hashing Block Sources. CoRR abs/0806.1948 (2008) - 2007
- [c3]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. CCC 2007: 236-249 - [i2]Kai-Min Chung, Omer Reingold, Salil P. Vadhan:
S-T Connectivity on Digraphs with a Known Stationary Distribution. Electron. Colloquium Comput. Complex. TR07 (2007) - 2004
- [j4]Wei-Chun Kao, Kai-Min Chung, Chia-Liang Sun, Chih-Jen Lin:
Decomposition Methods for Linear Support Vector Machines. Neural Comput. 16(8): 1689-1704 (2004) - [j3]Kai-Min Chung, Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM J. Comput. 34(2): 373-387 (2004) - 2003
- [j2]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 Comput. 15(11): 2643-2681 (2003) - [c2]Kai-Min Chung, Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem. ESA 2003: 136-147 - [c1]Kai-Min Chung, Wei-Chun Kao, Tony Sun, Chih-Jen Lin:
Decomposition methods for linear support vector machines. ICASSP (4) 2003: 868-871 - [i1]Kai-Min Chung, Hsueh-I Lu:
An Optimal Algorithm for the Maximum-Density Segment Problem. CoRR cs.DS/0311020 (2003)
1990 – 1999
- 1998
- [j1]Sen M. Kuo, Kai-Min Chung:
Narrowband active noise control using adaptive delay filter. IEEE Signal Process. Lett. 5(12): 309-311 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
