activity
20082024
most citedPhysical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

40 citations · 92 across the 28 of their papers we have counts for

collaborators

36 papers

cs.CR2024

On Central Primitives for Quantum Cryptography with Classical Communication

Kai-Min Chung, Eli Goldin, Matthew Gray

Recent work has introduced the "Quantum-Computation Classical-Communication" (QCCC) (Chung et. al.) setting for cryptography. There has been some evidence that One Way Puzzles (OWP…

quant-ph2023

On the Impossibility of General Parallel Fast-forwarding of Hamiltonian Simulation

Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh +3

Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and…

cs.LO2023★ 1 cited

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

Yu-Fang Chen, Kai-Min Chung, Ondřej Lengál +3

We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our approach, the problem is given by a triple and the question is whether, giv…

quant-ph2022

Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort

Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang +1

Alon et al. (CRYPTO 2021) introduced a multiparty quantum computation protocol that is secure with identifiable abort (MPQC-SWIA). However, their protocol allows only inside MPQC p…

quant-ph2021

A Note on the Post-Quantum Security of (Ring) Signatures

Rohit Chatterjee, Kai-Min Chung, Xiao Liang +1

This work revisits the security of classical signatures and ring signatures in a quantum world. For (ordinary) signatures, we focus on the arguably preferable security notion of bl…

cs.CR2021

Post-Quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-Round

Nai-Hui Chia, Kai-Min Chung, Xiao Liang +1

From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first -simulatable two-party computation (2PC) against quantum polynomial-time (QPT) ad…