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

Changhoon Lee

dblp:93/3417 · DBLP profile ↗
← Back
41ranked-venue papers
11as first author
4since 2021 · last 2026
0000-0003-4292-5792ORCID · corroborated

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

Systems, architecture and hardware · 13 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 11 · 4 first-authorSecurity and privacy · 8 · 3 first-author · 1 since 2021Computer networks · 4 · 2 since 2021Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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
2 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
differential cryptanalysis
0.912025
A Novel Approach to Construct a Good Dataset for Differential-Neural Cryptanalysis · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis
block cipher
0.112006
HIGHT: A New Block Cipher Suitable for Low-Resource Device · CHES 2006
Cryptographic primitives and cryptanalysis › block cipher
lightweight block cipher
0.112006
HIGHT: A New Block Cipher Suitable for Low-Resource Device · CHES 2006
Cryptographic primitives and cryptanalysis
symmetric cryptography
0.112006
HIGHT: A New Block Cipher Suitable for Low-Resource Device · CHES 2006
Embedded and real-time systems › resource-constrained systems
resource-constrained devices
0.012006
HIGHT: A New Block Cipher Suitable for Low-Resource Device · CHES 2006

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

silhouette score · 0.9principal component analysis · 0.9k-means clustering · 0.9
YearPublicationVenuePosition
2026 PassDNVAE: A Lightweight Password Dictionary Generation Model Using DenseNet-Based Variational Autoencoder
Yeonsoo Cha, Minjeong Cho, Yeog Kim, Changhoon Lee
IEEE Internet Things J.4
2025 A Novel Approach to Construct a Good Dataset for Differential-Neural Cryptanalysis
abstract
Recently, differential-neural cryptanalysis, which combines deep learning with differential cryptanalysis, has gained attention as a powerful and practical cryptanalysis method. In this approach, a neural distinguisher is trained to distinguish the target cipher with specific differential properties from other ciphers, and its statistical analysis is used to guess the key. This approach offers the advantage of enabling deep learning to analyze cryptographic properties, traditionally demanding substantial time and expertise. Nevertheless, the black-box nature of deep learning models poses challenges for cryptanalysts in comprehending the construction of the differential dataset and the neural distinguisher. In particular, since the differential dataset serves as the foundation for generating the neural distinguisher, there is a pressing need for an effective methodology to construct a high-quality differential dataset. However, the existing approaches for the generation of differential dataset is based on the well-known differential characteristic or exploring through the training neural distinguisher. In this paper, we analyzed the intrinsic property of differential dataset and proposed a novel approach to construct a good differential dataset for differential-neural cryptanalysis. First, we conducted an analysis to find the difference between well-trainable differential datasets and other differential datasets using Principal Component Analysis (PCA) and K-means clustering. As a result, the well-trainable differential dataset has a property that there are some principal components who can well express the variance of the whole dataset, the data construct clusters in the principal components-based reduced dimension. Building upon our analysis results, we proposed the exploring algorithm for the generation of well-trainable differential dataset. This proposed algorithm assesses the input differences within the differential dataset by identifying significant principal components. If such components are found, a cluster evaluation is performed on the differential dataset using the silhouette score, which quantifies the quality of cluster formation. In our experiments, the proposed algorithm successfully identified favorable input differences, leading to improved accuracy in neural distinguisher training for SPECK and SIMON. Compared to the performance of the existing Gohr's neural input difference algorithm, our proposed algorithm was more effective in finding good input differences with higher accuracy. From the perspective of execution time, it showed an improvement of approximately 30%.
Byoungjin Seok, Changhoon Lee
IEEE Trans. Dependable Secur. Comput.2
2024 Conditional Cube Attack on Lightweight Sycon-AEAD-64
abstract
Huang et al. introduced the conditional cube attack at EUROCRYPT 2017, where it was presented as a conditional cube variable with specific key bit conditions that significantly reduced diffusion. This attack necessitates a set of cube variables that are not multiplied in the first round, while the conditional cube variable is not multiplied with ordinary cube variables during the initial two rounds. Sycon v1.0 is part of the first lightweight cryptography standardization processes initiated by the National Institute of Standards and Technology (NIST). Sycon was proposed as a high-performing simple permutation due to its resistance to cryptanalytic attacks. Sycon-AEAD consists of two authenticated encryption with associated data (AEAD) schemes: 1) Sycon-AEAD-64 and 2) Sycon-AEAD-96. This study presents a novel partial state recovery conditional cube attack on Sycon-AEAD-64, which can recover 141 out of 256 bits of partial secret state with a data complexity of$2^{52.21}$.
Hyejin Eom, Minjeong Cho, Changhoon Lee
IEEE Internet Things J.3
2023 Digital forensic investigation framework for the metaverse
Seunghee Seo, Byoungjin Seok, Changhoon Lee
J. Supercomput.3
2020 Smart seed selection-based effective black box fuzzing for IIoT protocol
Jaeik Cho, Changhoon Lee, Taeshik Shon
J. Supercomput.3
2018 CoWebDraw: a real-time collaborative graphical editing system supporting multi-clients based on HTML5
Liping Gao, Dongfang Gao, Naixue Xiong, Changhoon Lee
Multim. Tools Appl.4
2018 A Reliability Comparison Method for OSINT Validity Analysis
abstract
Cyber-threat intelligence (CTI) is a knowledge-based threat management system that addresses increasing cyber threats. The CTI system creates reputation information for network resources such as IP, URL, and file hash-based on security data collected from security information and event management (SIEM) systems. This information can be applied extensively in industrial infrastructures to provide an effective response process for cyber attacks. This information can also be applied to the security systems of internal IT and OT infrastructures such as Internet objects (IoT) and Surveillance Control and Data Acquisition (SCADA) networks. However, because the performance of infrastructure security using CTI depends on the accuracy of the data on which the system is based, careful consideration of the accuracy of the data is required. In this paper, we propose a new model that can analyze the reliability and validity of data by using comparative analysis between CTI data and present a criterion for evaluating the reliability of feed providing CTI data. The experiment uses approximately 40 000 datasets to provide data accuracy results for four CTI feeds. These results can serve as a basis for substantive validation to use CTI data.
Seonghyeon Gong, Jaeik Cho, Changhoon Lee
IEEE Trans. Ind. Informatics3
2016 Abnormal event detection in crowded scenes based on deep learning
Zhijun Fang 0001, Fengchang Fei, Yuming Fang 0001, Changhoon Lee, Naixue Xiong, Lei Shu 0001
Multim. Tools Appl.4
2016 Guest Editorial: Automated Big Data Analysis for Social Multimedia Network Environments
Changhoon Lee
Multim. Tools Appl.1
2016 Guest Editorial: Data Mining and Machine Learning Technologies for Multimedia Information Retrieval and Recommendation
Changhoon Lee, Geyong Min, Weifeng Chen 0001
Multim. Tools Appl.1
2016 The protocol design and New approach for SCADA security enhancement during sensors broadcasting system
Malrey Lee, Changhoon Lee, Naixue Xiong, Suntae Kim, Young Keun Lee, Kangmin Kim, Seon-Mi Woo, Gisung Jeong
Multim. Tools Appl.3
2016 Editorial: A special section on "Emerging Platform Technologies"
Changhoon Lee, Kyusuk Han
J. Supercomput.1
2016 Performance analysis for contention adaptation of M2M devices with directional antennas
Hyunhee Park, Changhoon Lee, Yang Sun Lee 0001, Eui-Jik Kim
J. Supercomput.2
2016 Security analysis of SDDO-based block cipher for wireless sensor network
Dat Phuc Tran Song, Changhoon Lee
J. Supercomput.2
2016 Capability-based semantic matching for dynamic resource allocation in tactical edge environment
Seheon Song, Changhoon Lee
J. Supercomput.2
2015 Segment-wise online learning based on greedy algorithm for real-time multi-target tracking
abstract
This paper proposes a tracklet-based algorithm for online multiple-target tracking. The algorithm performs tracking in three steps: (1) tracklet initialization, (2) tracklet refinement, and (3) tracklet association. Given detection responses, tracklets are initialized by finding a near-optimum path in the min-cost flow network using a greedy-based algorithm. Based on an appearance-based model, the tracklets are refined so that the detection responses within the tracklet become more homogeneous. Finally, the tracklets are linked based on a novel affinity measure, then by optimizing a min-cost flow network with links, the final tracks are generated. For real-time multi-target tracking, every step is processed in a segment-wise manner. On popular public datasets and strictly in an online fashion, the proposed multi-target tracking algorithm performed comparable to that of many state-of-the-art algorithms.
Changhoon Lee, Chang Dong Yoo
ICIP1
2015 Methodology and implementation for tracking the file sharers using BitTorrent
abstract
Sharing copyright protected content without the copyright holder’s permission is illegal in many countries. Regardless, the number of illegal file sharing using BitTorrent continues to grow and most of file sharers and downloader are unconcerned legal action to transfer copywrite-protected files. However, it is difficult to gather enough probative evidence to prosecute illegal file sharers in criminal court and/or sued for damages in civil court. Further, there is a lack of research on investigation techniques to reveal illegal BitTorrent sharers. This is because the role of the server in BitTorrent networks has been changed compared to servers in conventional P2P networks. As a result, it is difficult to apply previous investigation processes for investigation of conventional P2P networks to the investigation of suspected illegal file sharing using BitTorrent. This paper proposes a methodology for the investigation of illegal file sharers using BitTorrent networks through the use of a P2P digital investigation process.
Sooyoung Park, Hyunji Chung, Changhoon Lee, Sangjin Lee 0002, Kyungho Lee
Multim. Tools Appl.3
2015 Weakness of lightweight block ciphers mCrypton and LED against biclique cryptanalysis
Kitae Jeong, HyungChul Kang, Changhoon Lee, Jaechul Sung, Seokhie Hong, Jongin Lim 0001
Peer-to-Peer Netw. Appl.3
2014 Greedy algorithm for real-time multi-object tracking
abstract
Real-time multi-object tracking is one of the most challenging problem in computer vision. Based on integer linear programming (ILP) formulation for object tracking [1, 2], we propose the greedy algorithm for real-time multi-object tracking. The experimental result shows that the performance of the proposed algorithm is competitive to the previous state-of-the-art algorithms on off-line video data, and its running time is also sufficient for analyzing the tracks of object in real-time video data.
Changhoon Lee, Chang Dong Yoo
ICIP2
2014 Special section on human-centric computing
Qun Jin, Sethuraman Panchanathan, Changhoon Lee
Inf. Sci.3
2014 Knowledge management technologies for semantic multimedia services
Changhoon Lee, Wenny Rahayu, Uyen Trang Nguyen
Multim. Tools Appl.1
2014 Biclique cryptanalysis of PRESENT-80 and PRESENT-128
Changhoon Lee
J. Supercomput.1
2014 An efficient password-based three-party authenticated multiple key exchange protocol for wireless mobile networks
Hang Tu, Neeraj Kumar 0001, Debiao He, Jongsung Kim, Changhoon Lee
J. Supercomput.5
2013 Links organization for channel assignment in multi-radio wireless mesh networks
Hongju Cheng, Naixue Xiong, Laurence T. Yang, Xiaofang Zhuang, Changhoon Lee
Multim. Tools Appl.6
2013 Damaged backup data recovery method for Windows mobile
Jewan Bang, Changhoon Lee, Sangjin Lee 0002, Kyungho Lee
J. Supercomput.2
2013 Angle and ranging based localization method for ad hoc network
Jangwoo Park, Dae-Heon Park, Changhoon Lee
J. Supercomput.3
2012 Recent advances and future directions in multimedia and mobile computing
Jong Hyuk Park 0001, Oscar C. Au, Mikael Wiberg, Changhoon Lee
Multim. Tools Appl.4
2012 The effective method of database server forensics on the enterprise environment
abstract
ABSTRACT When a forensic investigation is carried out in the enterprise environment, most of the important data are stored in database servers, and data stored in them are very important elements for a forensic investigation. As for database servers with such data stored, there are over 10 various kinds, such as SQL Server and Oracle. All the methods of investigating a database system are important, but this study suggests a single methodology likely to investigate all the database systems while considering the unique characteristics of each database system. A method of detecting a server and acquiring and investigating data in the server can be effectively used for such an investigation on the enterprise environment. For the existing investigation on server systems, severs should be shut down, and disc imaging should be conducted first. However, such a method may inflict great losses on the company in some cases. That is why we need a method to acquire data of a server in on‐line state, and this study discusses this method. Besides, on the basis of methodology, this study attempts to determine a possibility that this new forensic investigation method can be practically used by directly applying this method to SQL Server and MySQL databases. Copyright © 2012 John Wiley & Sons, Ltd.
Namheun Son, Keun-Gi Lee, Sangjun Jeon, Sangjin Lee 0002, Changhoon Lee
Secur. Commun. Networks5
2012 A learning automata-based fault-tolerant routing algorithm for mobile ad hoc networks
Sudip Misra, Parimala Venkata Krishna, Akhil Bhiwal, Amardeep Singh Chawla, Bernd E. Wolfinger, Changhoon Lee
J. Supercomput.6
2011 An efficient non-interactive deniable authentication scheme based on trapdoor commitment schemes
Taek-Young Youn, Changhoon Lee, Young-Ho Park 0001
Comput. Commun.2
2010 A power-, delay- and emergency-efficient protocol of ubiquitous sensor network systems for silver town applications
YunSeop Yu, Seong-Ho Choi 0003, Hyung-Kun Park, Changhoon Lee, Young-Sik Jeong, Sang-Hoon Kim
J. Supercomput.4
2009 Security analysis of the SCO-family using key schedules
Kitae Jeong, Changhoon Lee, Jongsung Kim, Seokhie Hong
Inf. Sci.2
2008 Security analysis of the full-round DDO-64 block cipher
Changhoon Lee, Jongsung Kim, Seokhie Hong, Jaechul Sung, Sangjin Lee 0002
J. Syst. Softw.1
2007 Related-Key Amplified Boomerang Attacks on the Full-Round Eagle-64 and Eagle-128
Kitae Jeong, Changhoon Lee, Jaechul Sung, Seokhie Hong, Jongin Lim 0001
ACISP2
2006 Forgery and Key Recovery Attacks on PMAC and Mitchell's TMAC Variant
Changhoon Lee, Jongsung Kim, Jaechul Sung, Seokhie Hong, Sangjin Lee 0002
ACISP1
2006 HIGHT: A New Block Cipher Suitable for Low-Resource Device
Deukjo Hong, Jaechul Sung, Seokhie Hong, Jongin Lim 0001, Sangjin Lee 0002, Bonseok Koo, Changhoon Lee, Donghoon Chang, Jesang Lee, Kitae Jeong, Jongsung Kim, Seongtaek Chee
CHES7
2006 Provable Security for an RC6-like Structure and a MISTY-FO-like Structure Against Differential Cryptanalysis
Changhoon Lee, Jongsung Kim, Jaechul Sung, Seokhie Hong, Sangjin Lee 0002
ICCSA (3)1
2006 Sized-Based Replacement-k Replacement Policy in Data Grid Environments
HongJin Park, Changhoon Lee
ISPA2
2005 Related-Key Differential Attacks on Cobra-H64 and Cobra-H128
Changhoon Lee, Jongsung Kim, Jaechul Sung, Seokhie Hong, Sangjin Lee 0002, Dukjae Moon
IMACC1
2004 Related Key Differential Cryptanalysis of Full-Round SPECTR-H64 and CIKS-1
Youngdai Ko, Changhoon Lee, Seokhie Hong, Sangjin Lee 0002
ACISP2
2002 A Chosen Plaintext Linear Attack on Block Cipher CIKS-1
Changhoon Lee, Deukjo Hong, Sangjin Lee 0002, Jongin Lim 0001
ICICS1