Munawar Hasan

Munawar Hasan

Auto-generated profile, based on publicly available information

Munawar Hasan

National Institute of Standards and Technology

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
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.

1 October 2019
Verified
Conference Paper
Closed access
DCDonghoon Chang
Donghoon Chang
VCVinjohn Chirakkal
Vinjohn Chirakkal
SGShubham Goswami
Shubham Goswami
MHMunawar Hasan
Munawar Hasan
TJTaekwon Jung
Taekwon Jung
ASAjit Pratap Singh
Ajit Pratap Singh

19 December 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
MHMunawar Hasan
Munawar Hasan
DCDonghoon Chang
Donghoon Chang
The widespread deployment of low-power and handheld devices opens an opportunity to design lightweight authenticated encryption schemes. The schemes so proposed must also prove their resilience under various security notions. Romulus-N1 is an authenticated encryption scheme with associated data based on a tweakable blockcipher, a primary variant of Romulus-N family which is NIST (National Institute of Standards and Technology) lightweight cryptography competition finalist; provides beyond birthday bound security for integrity security in nonce respecting scenario but fails to provide the integrity security in nonce misuse and RUP (release of unverified plaintext) scenarios. In this paper, we propose lynx, a family with 14 members of 1-pass and rate-1 lightweight authenticated encryption schemes with associated data based on a tweakable blockcipher, that provides birthday bound security for integrity security in both nonce respecting as well as nonce misuse and RUP scenarios and birthday bound security for privacy in nonce respecting scenario. For creating such a family of schemes, we propose a family of functions called F, that provides a total of 72 cases out of which we show that only 14 of them can be used for creating authenticated encryption schemes. We provide the implementation of one of the members of lynx family on four different hardware platforms and compare it with Romulus-N1. The comparison clearly shows that the lynx member outperforms Romulus-N1 on all the four platforms.

29 November 2022
Verified
Book Chapter
Closed access
PDF file
DCDonghoon Chang
Donghoon Chang
SGSurabhi Garg
Surabhi Garg
MHMunawar Hasan
Munawar Hasan
SMSweta Mishra
Sweta Mishra

11 September 2026 in ACM Journal on Autonomous Transportation Systems
Verified
Journal Article
Open access
AVApostol Vassilev
Apostol Vassilev
MHMunawar Hasan
Munawar Hasan
TGThoshitha Gamage
Thoshitha Gamage
PPPavel Piliptchak
Pavel Piliptchak
MAMahima Arora
Mahima Arora
HJHonglan Jin
Honglan Jin
The viability of automated driving is heavily dependent on the performance of perception systems to deliver real-time, accurate, and reliable information for robust decision-making and vehicle maneuvers. These systems must perform reliably not only under ideal conditions but also when challenged by natural and adversarial driving factors, including inclement weather and occluded objects. Such interferences can introduce perception errors and delays in detection and classification. Therefore, it is essential to assess the robustness of perception systems in automated vehicles (AVs) and explore strategies to enhance their reliability. The paper approaches this problem by evaluating vision-based (camera) perception performance using predictive sensitivity quantification. By using an ensemble of models, we capture model disagreement and inference variability across multiple models, under adverse driving scenarios in both simulated and real-world environments. A notional architecture is proposed for assessing perception performance, incorporating multiple input sources, including a ROS-based interface to AI models and an extensible AI architecture that provides detection and classification outputs along with predictive sensitivity and post-processing. Inputs include adversarial video data collected from CARLA scenario simulations and real vehicles. To operationalize this evaluation, a generalized perception assessment criterion is introduced, empirically demonstrating it using a representative use-case based on an AV’s stopping distance at a stop sign under varying road surface conditions and vehicle speeds. Five state-of-the-art computer vision models are used in our experiments, including YOLO (v8-v9), DEtection TRansformer (DETR50, DETR101), Real-Time DEtection TRansformer (RT-DETR). Diminished lighting conditions, e.g., from the presence of fog and low sun altitude, are seen to have the greatest impact on the perception performance. Adversarial road conditions, including object occlusions, further increase predictive sensitivity and degrade model performance, particularly when combined with inclement weather. Also, it is demonstrated that the greater the distance to a roadway object, the greater the impact on perception performance, hence diminished perception robustness.

24 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
AVApostol Vassilev
Apostol Vassilev
HJHonglan Jin
Honglan Jin
MHMunawar Hasan
Munawar Hasan
Detecting out of policy speech (OOPS) content is important but difficult. While machine learning is a powerful tool to tackle this challenging task, it is hard to break the performance ceiling due to factors like quantity and quality limitations on training data and inconsistencies in OOPS definition and data labeling. To realize the full potential of available limited resources, we propose a meta learning technique (MLT) that combines individual models built with different text representations. We analytically show that the resulting technique is numerically stable and produces reasonable combining weights. We combine the MLT with a threshold-moving (TM) technique to further improve the performance of the combined predictor on highly-imbalanced in-distribution and out-of-distribution datasets. We also provide computational results to show the statistically significant advantages of the proposed MLT approach. All authors contributed equally to this work.