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

ByeongHak Lee

dblp:225/9634 · also Byeonghak Lee · DBLP profile ↗
← Back
16ranked-venue papers
1as first author
11since 2021 · last 2026
0000-0003-2736-6830ORCID · corroborated

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

Security and privacy · 15 · 1 first-author · 10 since 2021Computer networks · 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
12 papers
Cryptographic primitives and cryptanalysis · 82% Cryptographic protocols and secure computation · 18%

Topics — the 22 heaviest of 24, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
authenticated encryption
2.032025
Making GCM Great Again: Toward Full Security and Longer Nonces · EUROCRYPT (1) 2025
XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation · EUROCRYPT (4) 2023
Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
homomorphic encryption
1.122022
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption · EUROCRYPT (1) 2022
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis › provable security
beyond-birthday-bound security
1.022023
XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation · EUROCRYPT (4) 2023
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model · ASIACRYPT (1) 2018
Cryptographic primitives and cryptanalysis
block cipher
0.922022
Rubato: Noisy Ciphers for Approximate Homomorphic Encryption · EUROCRYPT (1) 2022
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model · ASIACRYPT (1) 2018
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.912025
Relaxed Vector Commitment for Shorter Signatures · EUROCRYPT (4) 2025
Cryptographic primitives and cryptanalysis › authenticated encryption
GCM
0.912025
Making GCM Great Again: Toward Full Security and Longer Nonces · EUROCRYPT (1) 2025
Cryptographic primitives and cryptanalysis
message authentication codes
0.922020
Tight Security Bounds for Double-Block Hash-then-Sum MACs · EUROCRYPT (1) 2020
Improved Security Analysis for Nonce-Based Enhanced Hash-then-Mask MACs · ASIACRYPT (1) 2020
Cryptographic protocols and secure computation › commitment schemes
vector commitment
0.912025
Relaxed Vector Commitment for Shorter Signatures · EUROCRYPT (4) 2025
Cryptographic protocols and secure computation
oblivious pseudorandom function
0.812024
Revisiting OKVS-Based OPRF and PSI: Cryptanalysis and Better Construction · ASIACRYPT (8) 2024
Cryptographic protocols and secure computation
private set intersection
0.812024
Revisiting OKVS-Based OPRF and PSI: Cryptanalysis and Better Construction · ASIACRYPT (8) 2024
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
post-quantum signatures
0.712023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023
Cryptographic primitives and cryptanalysis › symmetric cryptography
symmetric primitives
0.712023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
CKKS
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis
transciphering
0.512021
Transciphering Framework for Approximate Homomorphic Encryption · ASIACRYPT (3) 2021
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
indifferentiability
0.412019
Indifferentiability of Truncated Random Permutations · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › pseudorandomness
pseudorandom permutations
0.412019
Indifferentiability of Truncated Random Permutations · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › block cipher
tweakable block cipher
0.312018
Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model · ASIACRYPT (1) 2018
Cryptographic protocols and secure computation
commitment schemes
0.312025
Relaxed Vector Commitment for Shorter Signatures · EUROCRYPT (4) 2025
Cryptographic primitives and cryptanalysis › cryptanalysis
protocol cryptanalysis
0.212024
Revisiting OKVS-Based OPRF and PSI: Cryptanalysis and Better Construction · ASIACRYPT (8) 2024
Cryptographic primitives and cryptanalysis
algebraic cryptanalysis
0.212023
AIM: Symmetric Primitive for Shorter Signatures with Stronger Security · CCS 2023
Cryptographic primitives and cryptanalysis
hash functions
0.112020
Tight Security Bounds for Double-Block Hash-then-Sum MACs · EUROCRYPT (1) 2020

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

stream cipher · 0.5security proof · 0.5security analysis · 0.4indistinguishability proof · 0.4ideal cipher model · 0.3
YearPublicationVenuePosition
2026 Security of NIST SP800-90A Hash-based DRBGs in the Seedless Model
Woohyuk Chung, ByeongHak Lee, Seongha Hwang, Seongkwang Kim, Jooyoung Lee 0001
EuroS&P2
2025 Making GCM Great Again: Toward Full Security and Longer Nonces
Woohyuk Chung, Seongha Hwang, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee 0001
EUROCRYPT (1)4
2025 Relaxed Vector Commitment for Shorter Signatures
Seongkwang Kim, ByeongHak Lee, Mincheol Son
EUROCRYPT (4)2
2025 Efficient Implementations of AIMer Post-Quantum Signature Scheme for Low-End to High-End IoT Devices
abstract
Post-quantum cryptography (PQC) is becoming increasingly critical for securing Internet of Things (IoT) applications against potential threats posed by quantum computers. However, cryptographic schemes based on mathematically hard problems, such as lattice-based constructions, may face reduced security margins due to ongoing cryptanalytic advancements. In IoT use cases requiring long-term deployment without guaranteed secure updates, symmetric-based signature schemes, such as$\mathsf {SPHINCS+}$, whose security relies solely on symmetric primitives, are considered robust alternatives. Among these,$\textsf {AIMer}$, selected as a finalist in the KpqC competition, is emerging as a promising candidate. This article presents optimized software implementations of$\textsf {AIMer}$for various IoT platforms, ranging from low-end to high-end devices. We propose memory-optimized and time–memory tradeoff implementations for resource-constrained ARM Cortex-M4 devices, and single instruction multiple data (SIMD)-accelerated implementations for AArch64 and AVX2 architectures. Furthermore, we conduct a comprehensive performance evaluation comparing our optimized implementations with other PQC signature schemes. Our results show that$\textsf {AIMer}$achieves significantly smaller signature sizes and faster key generation and signing compared to$\mathsf {SPHINCS+}$across all security levels, making it a viable option for long-term IoT deployment.
Jihoon Kwon, Sangyub Lee 0002, ByeongHak Lee, Hwajeong Seo
IEEE Internet Things J.3
2024 Revisiting OKVS-Based OPRF and PSI: Cryptanalysis and Better Construction
Kyoohyung Han, Seongkwang Kim, ByeongHak Lee, Yongha Son
ASIACRYPT (8)3
2024 ZLR: a fast online authenticated encryption scheme achieving full security
abstract
Abstract Online authenticated encryption has been considered of practical relevance in light-weight environments due to low latency and constant memory usage. In this paper, we propose a new tweakable block cipher-based online authenticated encryption scheme, dubbed , and its domain separation variant, dubbed . and follow the Encrypt-Mix-Encrypt paradigm. However, in contrast to existing schemes using the same paradigm such as and , and enjoy n-bit security by using larger internal states with an efficient -like hashing algorithm. In this way, 2n-bit blocks are processed with only a single primitive call for hashing and two primitive calls for encryption and decryption, when they are based on an n-bit tweakable block cipher using n-bit (resp. 2n-bit) tweaks for (resp. ). Furthermore, they support pipelined computation as well as online nonce-misuse resistance. To the best of our knowledge, and are the first pipelineable tweakable block cipher-based online authenticated encryption schemes of rate-2/3 that provide n-bit security with online nonce-misuse resistance.
Wonseok Choi 0002, Seongha Hwang, ByeongHak Lee, Jooyoung Lee 0001
Des. Codes Cryptogr.3
2023 AIM: Symmetric Primitive for Shorter Signatures with Stronger Security
abstract
Post-quantum signature schemes based on the MPC-in-the-Head (MPCitH) paradigm are recently attracting significant attention as their security solely depends on the one-wayness of the underlying primitive, providing diversity for the hardness assumption in post-quantum cryptography. Recent MPCitH-friendly ciphers have been designed using simple algebraic S-boxes operating on a large field in order to improve the performance of the resulting signature schemes. Due to their simple algebraic structures, their security against algebraic attacks should be comprehensively studied.
Seongkwang Kim, Jincheol Ha, Mincheol Son, ByeongHak Lee, Dukjae Moon, Joohee Lee, Sangyub Lee 0002, Jihoon Kwon, Jooyoung Lee 0001
CCS4
2023 XOCB: Beyond-Birthday-Bound Secure Authenticated Encryption Mode with Rate-One Computation
Zhenzhen Bao, Seongha Hwang, Akiko Inoue, ByeongHak Lee, Jooyoung Lee 0001, Kazuhiko Minematsu
EUROCRYPT (4)4
2022 Rubato: Noisy Ciphers for Approximate Homomorphic Encryption
Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Jooyoung Lee 0001, Mincheol Son
EUROCRYPT (1)3
2021 Transciphering Framework for Approximate Homomorphic Encryption
Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Joohee Lee, Jooyoung Lee 0001, Dukjae Moon
ASIACRYPT (3)4
2021 Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom Permutation
Wonseok Choi 0002, ByeongHak Lee, Jooyoung Lee 0001, Yeongmin Lee
ASIACRYPT (3)2
2020 Improved Security Analysis for Nonce-Based Enhanced Hash-then-Mask MACs
Wonseok Choi 0002, ByeongHak Lee, Yeongmin Lee, Jooyoung Lee 0001
ASIACRYPT (1)2
2020 FPL: White-Box Secure Block Cipher Using Parallel Table Look-Ups
Jihoon Kwon, ByeongHak Lee, Jooyoung Lee 0001, Dukjae Moon
CT-RSA2
2020 Tight Security Bounds for Double-Block Hash-then-Sum MACs
Seongkwang Kim, ByeongHak Lee, Jooyoung Lee 0001
EUROCRYPT (1)2
2019 Indifferentiability of Truncated Random Permutations
Wonseok Choi 0002, ByeongHak Lee, Jooyoung Lee 0001
ASIACRYPT (1)2
2018 Tweakable Block Ciphers Secure Beyond the Birthday Bound in the Ideal Cipher Model
ByeongHak Lee, Jooyoung Lee 0001
ASIACRYPT (1)1