Khin Mi Mi Aung
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Khin Mi Mi Aung has a total of 159 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin Hong Meng Tan
Institute for Infocomm Research, Agency for Science, Technology and Research (A*STAR I2R)
13 shared publications Bharadwaj Veeravalli
10 shared publications- Bharadwaj Veeravalli
Department of Electrical and Computer Engineering National University of Singapore 4 Engineering Drive 3 Singapore
9 shared publications - Ahmad Al Badawi
Duality Technologies
8 shared publications Jong Sou Park
8 shared publications- Chuan Heng Foh
University of Surrey
6 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 12051-12068
Single-Round Robust Secret-Shared Shuffling With Application to Deployable Shuffled Differential Privacy
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (6) , 12051-12068
Single-Round Robust Secret-Shared Shuffling With Application to Deployable Shuffled Differential Privacy
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11582-11597
EncFormer: Secure and Efficient Transformer Inference Over Encrypted Data
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11582-11597
EncFormer: Secure and Efficient Transformer Inference Over Encrypted Data
- Open Access
- 20 February 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (5)
Secure bioinformatics: privacy-preserving federated analytics using homomorphic encryption
Motivation: Large-scale bioinformatics analyses increasingly require collaboration across multiple cohorts and institutions, yet existing workflows often rely on data co-localization, which is slow, difficult to scale, and raises privacy concerns. We present a privacy-preserving federated analytics framework that enables secure statistical analysis across distributed datasets without transferring raw data, by performing all computations on encrypted data via cryptographic methods. Results: We evaluate the framework by validating polygenic risk scores and conducting meta-analyses on two real-world cohorts. The proposed solution achieves over 99.9% accuracy relative to plaintext analyses, while maintaining scalable runtime performance with increasing data size and number of participating sites. These results demonstrate the feasibility of secure federated analytics for practical bioinformatics applications involving sensitive data.
- 20 February 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (5)
Open AccessSecure bioinformatics: privacy-preserving federated analytics using homomorphic encryption
Motivation: Large-scale bioinformatics analyses increasingly require collaboration across multiple cohorts and institutions, yet existing workflows often rely on data co-localization, which is slow, difficult to scale, and raises privacy concerns. We present a privacy-preserving federated analytics framework that enables secure statistical analysis across distributed datasets without transferring raw data, by performing all computations on encrypted data via cryptographic methods. Results: We evaluate the framework by validating polygenic risk scores and conducting meta-analyses on two real-world cohorts. The proposed solution achieves over 99.9% accuracy relative to plaintext analyses, while maintaining scalable runtime performance with increasing data size and number of participating sites. These results demonstrate the feasibility of secure federated analytics for practical bioinformatics applications involving sensitive data.
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Artificial Intelligence
- Vol. 3 (1) , 38-47
The Initialization Effect: Refining Bayesian Optimization for Circuit Design
Bayesian optimization (BO) has emerged as a powerful sample efficient technique for optimizing expensive and time-consuming design of analog circuits. The BO framework leverages probabilistic models to efficiently explore design spaces, allowing for a streamlined approach to identify optimal designs that meet specific performance targets. Traditionally, BO framework is initialized with predefined or randomly generated samples, thereby failing to fully exploit the latent insights concealed within the data leading to suboptimal results and lengthy convergence time. This paper delves into the significance of initialization in BO for analog circuit design, investigating its impact on the efficiency and effectiveness of the optimization process. The study demonstrates that the model can achieve optimal design outcomes using as few as 16 data points, highlighting the potential for data-efficient learning in complex design tasks. Through empirical analysis and experimentation, we explore various initialization strategies and their influence on optimization performance, considering factors such as convergence speed, solution quality etc. The results highlight the influence of initialization strategies, with approaches such as Latin hypercube sampling (LHS) and K-center greedy achieving faster convergence compared to other methods like K-means and random initialization. This study demonstrates how effective initialization strategies in BO can reduce the need for extensive data collection, by optimizing design outcomes with fewer iterations and samples. Furthermore, we elucidate the underlying mechanisms through which different initialization approaches affect the optimization process, providing insights into the interplay between initialization, exploration, and exploitation in analog circuit design optimization. Our findings shed light on the importance of thoughtful initialization strategies in harnessing the full potential of BO for analog circuit design, offering valuable guidelines for circuit designers.
- 18 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Artificial Intelligence
- Vol. 3 (1) , 38-47
The Initialization Effect: Refining Bayesian Optimization for Circuit Design
Bayesian optimization (BO) has emerged as a powerful sample efficient technique for optimizing expensive and time-consuming design of analog circuits. The BO framework leverages probabilistic models to efficiently explore design spaces, allowing for a streamlined approach to identify optimal designs that meet specific performance targets. Traditionally, BO framework is initialized with predefined or randomly generated samples, thereby failing to fully exploit the latent insights concealed within the data leading to suboptimal results and lengthy convergence time. This paper delves into the significance of initialization in BO for analog circuit design, investigating its impact on the efficiency and effectiveness of the optimization process. The study demonstrates that the model can achieve optimal design outcomes using as few as 16 data points, highlighting the potential for data-efficient learning in complex design tasks. Through empirical analysis and experimentation, we explore various initialization strategies and their influence on optimization performance, considering factors such as convergence speed, solution quality etc. The results highlight the influence of initialization strategies, with approaches such as Latin hypercube sampling (LHS) and K-center greedy achieving faster convergence compared to other methods like K-means and random initialization. This study demonstrates how effective initialization strategies in BO can reduce the need for extensive data collection, by optimizing design outcomes with fewer iterations and samples. Furthermore, we elucidate the underlying mechanisms through which different initialization approaches affect the optimization process, providing insights into the interplay between initialization, exploration, and exploitation in analog circuit design optimization. Our findings shed light on the importance of thoughtful initialization strategies in harnessing the full potential of BO for analog circuit design, offering valuable guidelines for circuit designers.
- 5 May 2025
- Published by Springer Nature
- p. 71-101
Bootstrapping with RMFE for Fully Homomorphic Encryption
- 5 May 2025
- Published by Springer Nature
- p. 71-101
Bootstrapping with RMFE for Fully Homomorphic Encryption
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Nanotechnology Magazine
- Vol. 19 (2) , 38-47
AI-Powered Revolution
The infusion of Artificial Intelligence (AI) within the intricate realm of analog circuits presents a transformative opportunity. By seamlessly blending the precision of AI algorithms with the nuanced operation of analog components, the landscape of analog circuit design has undergone a revolutionary transformation, enabling dynamic adaptation, fine optimization, and intelligent assimilation of insights gleaned from past data. Nevertheless, analog circuits face stringent functional and technological constraints, leading to a scarcity of data for modelling, and additional data acquisition entails costly and time-consuming simulations. This article introduces novel methodologies designed to enhance simulation efficiency and reduce associated costs, thereby enabling efficient and effective AI-driven analog circuit design. By leveraging data-driven AI approaches, the focus is on exploration of promising and feasible circuit design regions, improving AI model accuracy, and substantially mitigating the reliance on extensive simulations and significant manual effort. The results demonstrate a marked advancement in analog circuit design, showcasing how data-centric AI approaches can refine the design process, making it more efficient and cost-effective. This work is poised to set the stage for future developments where analog circuit design can be conducted with greater precision and efficiency.
- 3 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Nanotechnology Magazine
- Vol. 19 (2) , 38-47
AI-Powered Revolution
The infusion of Artificial Intelligence (AI) within the intricate realm of analog circuits presents a transformative opportunity. By seamlessly blending the precision of AI algorithms with the nuanced operation of analog components, the landscape of analog circuit design has undergone a revolutionary transformation, enabling dynamic adaptation, fine optimization, and intelligent assimilation of insights gleaned from past data. Nevertheless, analog circuits face stringent functional and technological constraints, leading to a scarcity of data for modelling, and additional data acquisition entails costly and time-consuming simulations. This article introduces novel methodologies designed to enhance simulation efficiency and reduce associated costs, thereby enabling efficient and effective AI-driven analog circuit design. By leveraging data-driven AI approaches, the focus is on exploration of promising and feasible circuit design regions, improving AI model accuracy, and substantially mitigating the reliance on extensive simulations and significant manual effort. The results demonstrate a marked advancement in analog circuit design, showcasing how data-centric AI approaches can refine the design process, making it more efficient and cost-effective. This work is poised to set the stage for future developments where analog circuit design can be conducted with greater precision and efficiency.
- 17 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 6184-6196
Enabling Threshold Functionality for Private Set Intersection Protocols in Cloud Computing
Multi-party computation (MPC) allows parties to interact with cloud-based data and services while maintaining privacy and confidentiality of their private data. As a special case of MPC, private set intersection (PSI) protocols focus on securely computing the intersection between a server and a client of their private set. Our research extends the threshold functionality for PSI within the realm of cloud computing, where the server possesses a larger set than the client. This paper fills this gap by proposing new private intersection cardinality (PSI-CA) protocol, and more broadly, threshold private set intersection (tPSI) protocol using fully homomorphic encryption (FHE). In tPSI protocol, two parties holding two private sets collaboratively compute the intersection and reveal the result if and only if the size of the intersection exceeds some predefined threshold. In this process, no other information, in particular, elements not in the intersection remain hidden. The problem of PSI-CA and tPSI has many applications in online collaboration, e.g ., fingerprint matching, online dating, and ride sharing. At a high level, we use FHE to encrypt a Bloom filter (BF) that encodes the small set and homomorphically check whether the elements in the larger set belongs to the small set, e.g ., homomorphic membership test. Counting the number of positive membership directly already yields a PSI-CA protocol with optimal asymptotic communication complexity Ω( n ) = Ω(min( N , n )), where N (resp. n ) is the size of the large (resp. small) set. To construct a tPSI protocol, we develop a novel secret token generation protocol: a shared secret token is generated if and only if the intersection size satisfies the threshold condition, by exploiting the programmable bootstrapping technique in FHE. This new secret token generation protocol, when composed with any standard PSI protocol, yields a tPSI with the same asymptotic communication complexity as the chosen plain PSI. Along the way, we develop specific FHE optimizations that might be of independent interest. These optimizations overcome the weakness of low precision in programmable bootstrapping. As a result, tPSI over relatively large sets can be supported.
- 17 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 6184-6196
Enabling Threshold Functionality for Private Set Intersection Protocols in Cloud Computing
Multi-party computation (MPC) allows parties to interact with cloud-based data and services while maintaining privacy and confidentiality of their private data. As a special case of MPC, private set intersection (PSI) protocols focus on securely computing the intersection between a server and a client of their private set. Our research extends the threshold functionality for PSI within the realm of cloud computing, where the server possesses a larger set than the client. This paper fills this gap by proposing new private intersection cardinality (PSI-CA) protocol, and more broadly, threshold private set intersection (tPSI) protocol using fully homomorphic encryption (FHE). In tPSI protocol, two parties holding two private sets collaboratively compute the intersection and reveal the result if and only if the size of the intersection exceeds some predefined threshold. In this process, no other information, in particular, elements not in the intersection remain hidden. The problem of PSI-CA and tPSI has many applications in online collaboration, e.g ., fingerprint matching, online dating, and ride sharing. At a high level, we use FHE to encrypt a Bloom filter (BF) that encodes the small set and homomorphically check whether the elements in the larger set belongs to the small set, e.g ., homomorphic membership test. Counting the number of positive membership directly already yields a PSI-CA protocol with optimal asymptotic communication complexity Ω( n ) = Ω(min( N , n )), where N (resp. n ) is the size of the large (resp. small) set. To construct a tPSI protocol, we develop a novel secret token generation protocol: a shared secret token is generated if and only if the intersection size satisfies the threshold condition, by exploiting the programmable bootstrapping technique in FHE. This new secret token generation protocol, when composed with any standard PSI protocol, yields a tPSI with the same asymptotic communication complexity as the chosen plain PSI. Along the way, we develop specific FHE optimizations that might be of independent interest. These optimizations overcome the weakness of low precision in programmable bootstrapping. As a result, tPSI over relatively large sets can be supported.
- 22 August 2023
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 77
Privacy-preserving outsourcing decision tree evaluation from homomorphic encryption
- 22 August 2023
- Published by Elsevier in Journal of Information Security and Applications
- Vol. 77
Privacy-preserving outsourcing decision tree evaluation from homomorphic encryption
- Open Access
- 17 April 2023
- Published by Gavin Publishers in Journal of Community Medicine & Public Health
- Vol. 7 (2)
Impact of Environmental Factors on the Risk of Multiple Myeloma, a Case-Control Study in Myanmar
Background: Environmental factors, including exposure to chemicals and certain pathogens, may increase the risk of developing Multiple Myeloma (MM), as indicated by studies conducted primarily in industrialized countries. On the other hand, some epidemiological and experimental data also support the hypothesis that exposure to infections may enhance cancer immunosurveillance, particularly against multiple myeloma. Aim: To improve our understanding of the association between environmental factors and the risk of multiple myeloma, particularly in developing countries, this research was conducted to ascertain, in a South-East Asian setting, if environmental factors can modulate the risk of developing multiple myeloma. Methodology: A hospital-based case-control study was conducted using simple questionnaires in two large public hospitals in Myanmar from July to September 2020, with 40 multiple myeloma cases and a double control population seeking care in the medical and surgical Units of the same hospitals. Results: Even if not significant, our results suggest an increased risk of developing multiple myeloma after exposure to chemicals used in farming, and a reduced risk for those with a history of infections such as tuberculosis, hepatitis, measles, or pneumonia. The reduction was significant for malaria at the country level. Conclusion: These results support the idea that certain infections can improve cancer immunosurveillance, although they still need to be confirmed in other series of patients. Keywords: Multiple myeloma; Environmental factors; Chemicals; Infections; Cancer immunosurveillance; Myanmar
- 17 April 2023
- Published by Gavin Publishers in Journal of Community Medicine & Public Health
- Vol. 7 (2)
Open AccessImpact of Environmental Factors on the Risk of Multiple Myeloma, a Case-Control Study in Myanmar
Background: Environmental factors, including exposure to chemicals and certain pathogens, may increase the risk of developing Multiple Myeloma (MM), as indicated by studies conducted primarily in industrialized countries. On the other hand, some epidemiological and experimental data also support the hypothesis that exposure to infections may enhance cancer immunosurveillance, particularly against multiple myeloma. Aim: To improve our understanding of the association between environmental factors and the risk of multiple myeloma, particularly in developing countries, this research was conducted to ascertain, in a South-East Asian setting, if environmental factors can modulate the risk of developing multiple myeloma. Methodology: A hospital-based case-control study was conducted using simple questionnaires in two large public hospitals in Myanmar from July to September 2020, with 40 multiple myeloma cases and a double control population seeking care in the medical and surgical Units of the same hospitals. Results: Even if not significant, our results suggest an increased risk of developing multiple myeloma after exposure to chemicals used in farming, and a reduced risk for those with a history of infections such as tuberculosis, hepatitis, measles, or pneumonia. The reduction was significant for malaria at the country level. Conclusion: These results support the idea that certain infections can improve cancer immunosurveillance, although they still need to be confirmed in other series of patients. Keywords: Multiple myeloma; Environmental factors; Chemicals; Infections; Cancer immunosurveillance; Myanmar
- Open Access
- 21 December 2022
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 4
Decentralized Identity Authentication with Auditability and Privacy
Decentralized identity (DID) systems aim to give users full control over their identities by using completely decentralized technologies, such as blockchain or distributed ledgers, as identity providers. However, when user credentials are compromised, it is impossible in existing DID systems for the users to detect credential misuse. In this paper, we propose new DID authentication protocols with two properties: auditability and privacy. The former enables the detection of malicious authentication events, while the latter prevents an adversary from linking an authentication event to the corresponding user and service provider. We present two protocols that achieve auditability with varying privacy and performance guarantees. The first protocol has high performance, but it reveals information about the user. The second protocol achieves full privacy, but it incurs a higher performance overhead. We present a formal security analysis of our privacy-preserving protocols by using the Tamarin prover. We implemented them and evaluated their performance with a permissioned blockchain deployed over the Amazon AWS and a local cloud infrastructure. The results demonstrate that the first protocol is able to support realistic authentication workloads, while the second is nearly practical.
- 21 December 2022
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 4
Open AccessDecentralized Identity Authentication with Auditability and Privacy
Decentralized identity (DID) systems aim to give users full control over their identities by using completely decentralized technologies, such as blockchain or distributed ledgers, as identity providers. However, when user credentials are compromised, it is impossible in existing DID systems for the users to detect credential misuse. In this paper, we propose new DID authentication protocols with two properties: auditability and privacy. The former enables the detection of malicious authentication events, while the latter prevents an adversary from linking an authentication event to the corresponding user and service provider. We present two protocols that achieve auditability with varying privacy and performance guarantees. The first protocol has high performance, but it reveals information about the user. The second protocol achieves full privacy, but it incurs a higher performance overhead. We present a formal security analysis of our privacy-preserving protocols by using the Tamarin prover. We implemented them and evaluated their performance with a permissioned blockchain deployed over the Amazon AWS and a local cloud infrastructure. The results demonstrate that the first protocol is able to support realistic authentication workloads, while the second is nearly practical.