Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Minki Hhan

dblp:201/6462 · DBLP profile ↗
← Back
12ranked-venue papers
7as first author
8since 2021 · last 2026
0000-0001-5143-4587ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 11 · 7 first-author · 7 since 2021Theory of computation · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
7 papers
Cryptographic primitives and cryptanalysis · 83% Cryptographic protocols and secure computation · 17%
Theoretical computer science
4 papers
Quantum computing and quantum information · 68% Computational complexity · 17% Algorithms and data structures · 15%

Topics — the 19 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum cryptography
1.022023
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments · EUROCRYPT (1) 2023
Quantum Random Oracle Model with Auxiliary Input · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
1.012026
From Perfect to Approximate Hints: Efficient LWE Secret Recovery Leveraging Low Hamming Weight · SP 2026
Cryptographic primitives and cryptanalysis
post-quantum cryptography
1.022026
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments · EUROCRYPT (1) 2023
From Perfect to Approximate Hints: Efficient LWE Secret Recovery Leveraging Low Hamming Weight · SP 2026
Cryptographic primitives and cryptanalysis › cryptanalysis
quantum cryptanalysis
0.912025
Quantum Lifting for Invertible Permutations and Ideal Ciphers · CRYPTO (2) 2025
Computational complexity
lower bounds
0.912025
A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and More · EUROCRYPT (7) 2025
Quantum computing and quantum information
quantum algorithms
0.912025
A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and More · EUROCRYPT (7) 2025
Quantum computing and quantum information › quantum algorithms
quantum factoring
0.912025
A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and More · EUROCRYPT (7) 2025
Algorithms and data structures › number-theoretic algorithms
discrete logarithm
0.812024
Quantum Complexity for Discrete Logarithms and Related Problems · CRYPTO (6) 2024
Quantum computing and quantum information
quantum complexity theory
0.812024
Quantum Complexity for Discrete Logarithms and Related Problems · CRYPTO (6) 2024
Cryptographic primitives and cryptanalysis › obfuscation
branching program obfuscation
0.722019
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map · CRYPTO (3) 2019
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem · CRYPTO (3) 2018
Cryptographic primitives and cryptanalysis
obfuscation
0.722019
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map · CRYPTO (3) 2019
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem · CRYPTO (3) 2018
Cryptographic protocols and secure computation
commitment schemes
0.712023
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments · EUROCRYPT (1) 2023
Cryptographic protocols and secure computation › commitment schemes
quantum commitments
0.712023
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments · EUROCRYPT (1) 2023
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
quantum public-key encryption
0.712023
From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments · EUROCRYPT (1) 2023
Cryptographic primitives and cryptanalysis
provable security
0.412019
Quantum Random Oracle Model with Auxiliary Input · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › random oracle model
quantum random oracle model
0.412019
Quantum Random Oracle Model with Auxiliary Input · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis
random oracle model
0.412019
Quantum Random Oracle Model with Auxiliary Input · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › block cipher
ideal cipher
0.312025
Quantum Lifting for Invertible Permutations and Ideal Ciphers · CRYPTO (2) 2025
Cryptographic primitives and cryptanalysis
discrete logarithm
0.212024
Quantum Complexity for Discrete Logarithms and Related Problems · CRYPTO (6) 2024

Methods — techniques the papers use, named apart from their topics

quantum hardness of detecting superpositions · 1.3low hamming weight exploitation · 1.0hint-based recovery · 1.0quantum algorithm · 0.9minimum distance of linear codes · 0.9indifferentiability · 0.8quantum adversary · 0.4quantum adversaries · 0.4GGH15 multilinear map · 0.4NTRU · 0.3GGH13 multilinear map · 0.3
YearPublicationVenuePosition
2026 From Perfect to Approximate Hints: Efficient LWE Secret Recovery Leveraging Low Hamming Weight
Minki Hhan, Ga Hee Hong, Jiseung Kim, Changmin Lee 0001
SP1
2026 A hybrid of lattice-reduction and Meet-LWE via near-collision on babai's plane
Minki Hhan, Jiseung Kim 0001, Changmin Lee 0001, Yongha Son
Des. Codes Cryptogr.1
2025 Quantum Lifting for Invertible Permutations and Ideal Ciphers
Alexandru Cojocaru, Minki Hhan, Qipeng Liu 0001, Takashi Yamakawa, Aaram Yun
CRYPTO (2)2
2025 Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
abstract
Computing equilibrium concentrations of molecular complexes is generally analytically intractable and requires numerical approaches. In this work we focus on the polymer-monomer level, where indivisible molecules (monomers) combine to form complexes (polymers). Rather than employing free-energy parameters for each polymer, we focus on the athermic setting where all interactions preserve enthalpy. This setting aligns with the strongly bonded (domain-based) regime in DNA nanotechnology when strands can bind in different ways, but always with maximum overall bonding - and is consistent with the saturated configurations in the Thermodynamic Binding Networks (TBNs) model. Within this context, we develop an iterative algorithm for assigning polymer concentrations to satisfy detailed-balance, where on-target (desired) polymers are in high concentrations and off-target (undesired) polymers are in low. Even if not directly executed, our algorithm provides effective insights into upper bounds on concentration of off-target polymers, connecting combinatorial arguments about discrete configurations such as those in the TBN model to real-valued concentrations. We conclude with an application of our method to decreasing leak in DNA logic and signal propagation. Our results offer a new framework for design and verification of equilibrium concentrations when configurations are distinguished by entropic forces.
Hamidreza Akef, Minki Hhan, David Soloveichik
DNA2
2025 A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and More
Minki Hhan
EUROCRYPT (7)1
2025 Pseudorandom Function-Like States from Common Haar Unitary
Minki Hhan, Shogo Yamada
TCC (3)1
2024 Quantum Complexity for Discrete Logarithms and Related Problems
Minki Hhan, Takashi Yamakawa, Aaram Yun
CRYPTO (6)1
2023 From the Hardness of Detecting Superpositions to Cryptography: Quantum Public Key Encryption and Commitments
Minki Hhan, Tomoyuki Morimae, Takashi Yamakawa
EUROCRYPT (1)1
2019 Quantum Random Oracle Model with Auxiliary Input
Minki Hhan, Keita Xagawa, Takashi Yamakawa
ASIACRYPT (1)1
2019 Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map
Jung Hee Cheon, Wonhee Cho 0001, Minki Hhan, Jiseung Kim 0001, Changmin Lee 0001
CRYPTO (3)3
2019 Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation
Yilei Chen 0001, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee
TCC (1)2
2018 Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem
Jung Hee Cheon, Minki Hhan, Jiseung Kim 0001, Changmin Lee 0001
CRYPTO (3)2