default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinki Hhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Minki Hhan, Takashi Yamakawa, Aaram Yun:
Quantum Complexity for Discrete Logarithms and Related Problems. CRYPTO (6) 2024: 3-36- [i22]Minki Hhan:
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More. CoRR abs/2402.11269 (2024) - [i21]Beomgeun Cho, Minki Hhan, Taehyun Kim, Jeonghoon Lee, Yixin Shen:
Does quantum lattice sieving require quantum RAM? CoRR abs/2410.15565 (2024) - [i20]Minki Hhan:
A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More. IACR Cryptol. ePrint Arch. 2024: 268 (2024) - [i19]Beomgeun Cho, Minki Hhan, Taehyun Kim, Jeonghoon Lee, Yixin Shen:
Does quantum lattice sieving require quantum RAM? IACR Cryptol. ePrint Arch. 2024: 1700 (2024) - [i18]Minki Hhan, Shogo Yamada:
Pseudorandom Function-like States from Common Haar Unitary. IACR Cryptol. ePrint Arch. 2024: 1811 (2024) - 2023
- [c5]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. EUROCRYPT (1) 2023: 639-667 - [i17]Minki Hhan, Takashi Yamakawa, Aaram Yun:
Quantum Complexity for Discrete Logarithms and Related Problems. CoRR abs/2307.03065 (2023) - [i16]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
A Note on Output Length of One-Way State Generators. CoRR abs/2312.16025 (2023) - [i15]Minki Hhan, Takashi Yamakawa, Aaram Yun:
Quantum Complexity for Discrete Logarithms and Related Problems. IACR Cryptol. ePrint Arch. 2023: 1054 (2023) - [i14]Minki Hhan, Aaram Yun:
Oracle Recording for Non-Uniform Random Oracles, and its Applications. IACR Cryptol. ePrint Arch. 2023: 1371 (2023) - [i13]Wonseok Choi, Minki Hhan, Yu Wei, Vassilis Zikas:
Fine-Tuning Ideal Worlds for the Xor of Two Permutation Outputs. IACR Cryptol. ePrint Arch. 2023: 1704 (2023) - 2022
- [i12]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. CoRR abs/2210.05978 (2022) - [i11]Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa:
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments. IACR Cryptol. ePrint Arch. 2022: 1375 (2022) - [i10]Minki Hhan, Jiseung Kim, Changmin Lee, Yongha Son:
How to Meet Ternary LWE Keys on Babai's Nearest Plane. IACR Cryptol. ePrint Arch. 2022: 1473 (2022) - 2020
- [j4]Jung Hee Cheon, Wonhee Cho
, Minki Hhan, Jiseung Kim, Changmin Lee:
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. J. Math. Cryptol. 14(1): 397-413 (2020)
2010 – 2019
- 2019
- [j3]Kyoohyung Han, Minki Hhan, Jung Hee Cheon:
Improved Homomorphic Discrete Fourier Transforms and FHE Bootstrapping. IEEE Access 7: 57361-57370 (2019) - [j2]Jung Hee Cheon, Minki Hhan, Seungwan Hong, Yongha Son:
A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE. IEEE Access 7: 89497-89506 (2019) - [c4]Minki Hhan, Keita Xagawa, Takashi Yamakawa:
Quantum Random Oracle Model with Auxiliary Input. ASIACRYPT (1) 2019: 584-614 - [c3]Jung Hee Cheon, Wonhee Cho, Minki Hhan, Jiseung Kim, Changmin Lee:
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map. CRYPTO (3) 2019: 253-283 - [c2]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. TCC (1) 2019: 55-80 - [i9]Jung Hee Cheon, Wonhee Cho, Minki Hhan, Minsik Kang, Jiseung Kim, Changmin Lee:
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem. IACR Cryptol. ePrint Arch. 2019: 195 (2019) - [i8]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. IACR Cryptol. ePrint Arch. 2019: 1085 (2019) - [i7]Minki Hhan, Keita Xagawa, Takashi Yamakawa:
Quantum Random Oracle Model with Auxiliary Input. IACR Cryptol. ePrint Arch. 2019: 1093 (2019) - [i6]Jung Hee Cheon, Minki Hhan, Seungwan Hong, Yongha Son:
A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE. IACR Cryptol. ePrint Arch. 2019: 1114 (2019) - 2018
- [j1]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalysis on the HHSS Obfuscation Arising From Absence of Safeguards. IEEE Access 6: 40096-40104 (2018) - [c1]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem. CRYPTO (3) 2018: 184-210 - [i5]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalysis on the HHSS Obfuscation Arising from Absence of Safeguards. IACR Cryptol. ePrint Arch. 2018: 397 (2018) - [i4]Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee:
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from NTRU Attack. IACR Cryptol. ePrint Arch. 2018: 408 (2018) - [i3]Jung Hee Cheon, Kyoohyung Han, Minki Hhan:
Faster Homomorphic Discrete Fourier Transforms and Improved FHE Bootstrapping. IACR Cryptol. ePrint Arch. 2018: 1073 (2018) - [i2]Jung Hee Cheon, Wonhee Cho, Minki Hhan, Jiseung Kim, Changmin Lee:
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map. IACR Cryptol. ePrint Arch. 2018: 1081 (2018) - 2017
- [i1]Jung Hee Cheon, Minki Hhan, Changmin Lee:
Cryptanalysis of the Overstretched NTRU Problem for General Modulus Polynomial. IACR Cryptol. ePrint Arch. 2017: 484 (2017)
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-21 00:09 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:
