NSF PAR Search | NSF Public Access Repository

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

On the (Im)possibility of Time-Lock Puzzles in the Quantum Random Oracle Model

https://doi.org/10.1007/978-981-99-8730-6_11

Afshar, Abtin; Chung, Kai-Min; Hsieh, Yao-Ching; Lin, Yao-Ting; Mahmoody, Mohammad (November 2023, Springer)

Full Text Available
Black-Box Separations for Non-Interactive Classical Commitments in a Quantum World

https://doi.org/10.1007/978-3-031-30545-0_6

Chung, Kai-Min; Lin, Yao-Ting; Mahmoody, Mohammad (April 2023, Springer)

Full Text Available
On the Impossibility of Key Agreements from Quantum Random Oracles

https://doi.org/10.1007/978-3-031-15979-4_6

Austrin, Per; Chung, Hao; Chung, Kai-Min; Fu, Shiuan; Lin, Yao-Ting; Mahmoody, Mohammad (August 2022, Springer)

Full Text Available
A Note on the Post-quantum Security of (Ring) Signatures

Chatterjee, Rohit; Chung, Kai-min; Liang, Xiao; Malavolta, Giulio (February 2022, Springer, Cham https://doi.org/10.1007/978-3-030-97131-1_14)

Full Text Available
On the Complexity of Simulating Auxiliary Input

https://doi.org/https://doi.org/10.1007/978-3-319-78372-7_12

Chen, Yi-Hsiu; Chung, Kai-Min Chung; Liao, Jyun-Jie Liao (March 2018, Advances in Cryptology – EUROCRYPT 2018)

We construct a simulator for the simulating auxiliary input problem with complexity better than all previous results and prove the optimality up to logarithmic factors by establishing a black-box lower bound. Specifically, let ℓ be the length of the auxiliary input and ϵ be the indistinguishability parameter. Our simulator is O~(2^ℓ/ϵ^2) more complicated than the distinguisher family. For the lower bound, we show the relative complexity to the distinguisher of a simulator is at least Ω(2^ℓ/ϵ^2) assuming the simulator is restricted to use the distinguishers in a black-box way and satisfy a mild restriction.
more » « less
Full Text Available
Distributed algorithms for the Lovász local lemma and graph coloring

https://doi.org/10.1007/s00446-016-0287-6

Chung, Kai-Min; Pettie, Seth; Su, Hsin-Hao (August 2017, Distributed Computing)

Full Text Available

Search for: All records