Donghoon Chang

Donghoon Chang

Auto-generated profile, based on publicly available information

Donghoon Chang

Indraprastha Institute of Information Technology, Delhi (IIIT-D)

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2025
Verified
Report
Closed access
MTMeltem Sönmez Turan
Meltem Sönmez Turan
KMKerry A McKay
Kerry A McKay
DCDonghoon Chang
Donghoon Chang
JKJinkeon Kang
Jinkeon Kang
JKJohn Kelsey
John Kelsey
In 2023, the National Institute of Standards and Technology (NIST) announced the selectionof the Ascon family of algorithms designed by Dobraunig, Eichlseder, Mendel, and Schläfferto provide efficient cryptographic solutions for resource-constrained devices. This decisionemerged from a rigorous, multi-round lightweight cryptography standardization process.The Ascon family includes a suite of cryptographic primitives that provide AuthenticatedEncryption with Associated Data (AEAD), hash function, and eXtendable Output Function(XOF) capabilities. The Ascon family is characterized by lightweight, permutation-basedprimitives and providesrobustsecurity, efficiency, and flexibility, making it ideal for resourceconstrained environments, such as Internet of Things (IoT) devices, embedded systems,and low-power sensors. The family is developed to offer a viable alternative when theAdvanced Encryption Standard (AES) may not perform optimally. This standard outlinesthe technical specifications and security properties of Ascon-AEAD128, Ascon-Hash256,Ascon-XOF128, and Ascon-CXOF128.

16 June 2023
Verified
Report
Closed access
MTMeltem Sonmez Turan
Meltem Sonmez Turan
KMKerry McKay
Kerry McKay
DCDonghoon Chang
Donghoon Chang
LBLawrence E Bassham
Lawrence E Bassham
JKJinkeon Kang
Jinkeon Kang
DHDeukjo Hong
Deukjo Hong
The National Institute of Standards and Technology (NIST) initiated a public standardization process to select one or more schemes that provide Authenticated Encryption with Associated Data (AEAD) and optional hashing functionalities and are suitable for constrained environments. In February 2019, 57 candidates were submitted to NIST for consideration. Among these, 56 were accepted as first-round candidates in April 2019. After four months, NIST selected 32 of the candidates for the second round. In March 2021, NIST announced 10 finalists - namely ASCON, Elephant, GIFT-COFB, Grain-128AEAD, ISAP, PHOTON-Beetle, Romulus, SPARKLE, TinyJAMBU, and Xoodyak - to move forward to the final round of the selection process. On February 7, 2023, NIST announced the decision to standardize the ASCON family for lightweight cryptography applications. This report describes the evaluation criteria and selection process, which is based on public feedback and internal review of the finalists.

25 March 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
DCDonghoon Chang
Donghoon Chang
SGSurabhi Garg
Surabhi Garg
MHMunawar Hasan
Munawar Hasan
SMSweta Mishra
Sweta Mishra
The widespread deployment of multi-biometrics to authenticate users prompts the need for biometric systems with high recognition performance. Further, the biometric data, once leaked or stolen, remains compromised forever. Hence biometric security is of utmost importance. Existing biometric template protection schemes either degrade the recognition performance or they have issues with security and speed. We propose a cancelable multibiometric authentication approach where a novel bit-wise encryption scheme transforms a biometric template to a protected template using a secret key generated from another biometric template. It fully preserves the number of bit-errors in the original and the protected template to ensure recognition performance equivalent to the performance of the unprotected systems.We introduce Algorithm I and Algorithm II for bit-wise encryption; both are defined over cryptographic-primitives- block cipher based encryption and keyedhash function. We profile these algorithms on various hardware architectures to calculate the efficiency in terms of the time taken during enrolment and authentication phase. For Algorithm II, we observe that a 3:3 GHz desktop architecture takes about 18 milliseconds on an average of over 200 runs to authenticate a user. Additionally, we provide mathematical proof to show that the proposed scheme guarantees secrecy and irreversibility. The results of comparisons with the existing biometric template protection schemes on the various face and iris databases show that the proposed work provides significantly good recognition performance and efficiency, while it achieves high security. Finally, the bit-wise encryption scheme can be built over the commercial-off-the-shelf systems to achieve security with equivalent high performance.

9 April 2018 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
AKAkshima
Akshima
DCDonghoon Chang
Donghoon Chang
AGAarushi Goel
Aarushi Goel
SMSweta Mishra
Sweta Mishra
SSSomitra Kumar Sanadhya
Somitra Kumar Sanadhya
AAAkshima Akshima
Akshima Akshima
Breach in password databases has been a frequent phenomena in the software industry. Often these breaches go undetected for years. Sometimes, even the companies involved are not aware of the breach. Even after they are detected, publicizing such attacks might not always be in the best interest of the companies. This calls for a strong breach detection mechanism. Juels et al. (in ACM-CCS 2013) suggest a method called ‘Honeywords’, for detecting password database breaches. Their idea is to generate multiple fake passwords, called honeywords and store them along with the real password. Any login attempt with honeywords is identified as a compromise of the password database, since legitimate users are not expected to know the honeywords corresponding to their passwords. The key components of their idea are (i) generation of honeywords, (ii) typo-safety measures for preventing false alarms, (iii) alarm policy upon detection, and (iv) testing robustness of the system against various attacks.

17 March 2015
Verified
Book Chapter
Closed access
PDF file
ABAndrey Bogdanov
Andrey Bogdanov
DCDonghoon Chang
Donghoon Chang
MGMohona Ghosh
Mohona Ghosh
SSSomitra Kumar Sanadhya
Somitra Kumar Sanadhya

17 April 2018 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
DCDonghoon Chang
Donghoon Chang
AJArpan Jati
Arpan Jati
SMSweta Mishra
Sweta Mishra
SSSomitra Kumar Sanadhya
Somitra Kumar Sanadhya