Kai-Min Chung

Affiliations:
  • Academia Sinica, Taipei City, Taiwan


According to our database1, Kai-Min Chung authored at least 95 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report).
CoRR, 2023

2022
Foundations of Differentially Oblivious Algorithms.
J. ACM, 2022

On the Impossibility of Key Agreements from Quantum Random Oracles.
IACR Cryptol. ePrint Arch., 2022

Collusion-Resistant Functional Encryption for RAMs.
IACR Cryptol. ePrint Arch., 2022

Online TSP with Predictions.
CoRR, 2022

Constant-Round Blind Classical Verification of Quantum Sampling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions.
IACR Cryptol. ePrint Arch., 2021

Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round.
IACR Cryptol. ePrint Arch., 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2021

A Note on the Post-Quantum Security of (Ring) Signatures.
IACR Cryptol. ePrint Arch., 2021

Sample Efficient Algorithms for Learning Quantum Channels in PAC Model and the Approximate State Discrimination Problem.
Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2020

Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions.
IACR Cryptol. ePrint Arch., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds.
IACR Cryptol. ePrint Arch., 2020

Classical Verification of Quantum Computations with Efficient Verifier.
IACR Cryptol. ePrint Arch., 2020

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.
IACR Cryptol. ePrint Arch., 2020

On the Concurrent Composition of Quantum Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2020

Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort.
IACR Cryptol. ePrint Arch., 2020

Tight Quantum Time-Space Tradeoffs for Function Inversion.
Electron. Colloquium Comput. Complex., 2020

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Round.
CoRR, 2020

On the need for large quantum depth.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

On the Hardness of Massively Parallel Computation.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Lower Bounds for Function Inversion with Quantum Advice.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

When Simple Hash Functions Suffice.
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2019
Adaptively Secure Garbling Schemes for Parallel Computations.
IACR Cryptol. ePrint Arch., 2019

On Quantum Advantage in Information Theoretic Single-Server PIR.
IACR Cryptol. ePrint Arch., 2019

A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries.
IACR Cryptol. ePrint Arch., 2019

Quantum encryption and generalized Shannon impossibility.
Des. Codes Cryptogr., 2019

Cryptography with Disposable Backdoors.
Cryptogr., 2019

Interactive Leakage Chain Rule for Quantum Min-entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Algorithmic Power of Spiking Neural Networks.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
On statistically-secure quantum homomorphic encryption.
Quantum Inf. Comput., 2018

Space-efficient classical and quantum algorithms for the shortest vector problem.
Quantum Inf. Comput., 2018

Cryptography with Dispensable Backdoors.
IACR Cryptol. ePrint Arch., 2018

Game Theoretic Notions of Fairness in Multi-Party Coin Toss.
IACR Cryptol. ePrint Arch., 2018

On the Complexity of Simulating Auxiliary Input.
IACR Cryptol. ePrint Arch., 2018

On the Sample Complexity of PAC Learning Quantum Process.
CoRR, 2018

Generalized Quantum Shannon Impossibility for Quantum Encryption.
CoRR, 2018

2017
On the Depth of Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch., 2017

Distributed algorithms for the Lovász local lemma and graph coloring.
Distributed Comput., 2017

Computational Notions of Quantum Min-Entropy.
CoRR, 2017

On the Impossibility of Cryptography with Tamperable Randomness.
Algorithmica, 2017

2016
Oblivious Parallel RAM and Applications.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Cryptography for Parallel RAM from Indistinguishability Obfuscation.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence.
IACR Cryptol. ePrint Arch., 2015

Functional Encryption from (Small) Hardwae Tokens.
IACR Cryptol. ePrint Arch., 2015

Computation-Trace Indistinguishability Obfuscation and its Applications.
IACR Cryptol. ePrint Arch., 2015

Delegating RAM Computations with Adaptive Soundness and Privacy.
IACR Cryptol. ePrint Arch., 2015

Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Parallel Repetition for Entangled k-player Games via Fast Quantum Search.
Proceedings of the 30th Conference on Computational Complexity, 2015

2014
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch., 2014

Large-Scale Secure Computation.
IACR Cryptol. ePrint Arch., 2014

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications.
Electron. Colloquium Comput. Complex., 2014

4-Round Resettably-Sound Zero Knowledge.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Statistically-secure ORAM with Õ(log<sup>2</sup> n) Overhead.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream.
Theory Comput., 2013

Guest column: parallel repetition theorems for interactive arguments.
SIGACT News, 2013

Interactive Coding, Revisited.
IACR Cryptol. ePrint Arch., 2013

Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security.
IACR Cryptol. ePrint Arch., 2013

A Simple ORAM.
IACR Cryptol. ePrint Arch., 2013

Simultaneous Resettable WI from One-way Functions.
IACR Cryptol. ePrint Arch., 2013

From Weak to Strong Zero-Knowledge and Applications.
IACR Cryptol. ePrint Arch., 2013

On Extractability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

On the (Im)Possibility of Tamper-Resilient Cryptography: Using Fourier Analysis in Computer Viruses.
IACR Cryptol. ePrint Arch., 2013

Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead.
CoRR, 2013

Randomness-Dependent Message Security.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Can theories be tested?: a cryptographic treatment of forecast testing.
Proceedings of the Innovations in Theoretical Computer Science, 2013

On the power of nonuniformity in proofs of security.
Proceedings of the Innovations in Theoretical Computer Science, 2013

Knowledge-Preserving Interactive Coding.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Simultaneous Resettability from One-Way Functions.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Constant-Round Concurrent Zero Knowledge from P-Certificates.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

On the Lattice Smoothing Parameter Problem.
Proceedings of the 28th Conference on Computational Complexity, CCC 2013, K.lo Alto, 2013

Functional Encryption from (Small) Hardware Tokens.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions.
IACR Cryptol. ePrint Arch., 2012

Unprovable Security of Two-Message Zero Knowledge.
IACR Cryptol. ePrint Arch., 2012

The Knowledge Tightness of Parallel Zero-Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011
S-T connectivity on digraphs with a known stationary distribution.
ACM Trans. Algorithms, 2011

Memory Delegation.
IACR Cryptol. ePrint Arch., 2011

The Randomness Complexity of Parallel Repetition.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Efficient Secure Two-Party Exponentiation.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

2010
Improved Delegation of Computation using Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2010

Parallel Repetition Theorems for Interactive Arguments.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

AMS Without 4-Wise Independence on Product Domains.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Efficient String-Commitment from Weak Bit-Commitment.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Tight Parallel Repetition Theorems for Public-coin Arguments.
Electron. Colloquium Comput. Complex., 2009

2008
Tight Bounds for Hashing Block Sources.
Proceedings of the Approximation, 2008

2004
An Optimal Algorithm for the Maximum-Density Segment Problem.
SIAM J. Comput., 2004

Decomposition Methods for Linear Support Vector Machines.
Neural Comput., 2004

2003
Radius Margin Bounds for Support Vector Machines with the RBF Kernel.
Neural Comput., 2003

Decomposition methods for linear support vector machines.
Proceedings of the 2003 IEEE International Conference on Acoustics, 2003

1998
Narrowband active noise control using adaptive delay filter.
IEEE Signal Process. Lett., 1998


  Loading...