Min Luo
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
Research Interests
Min Luo has a total of 153 co-authors. Here are the top co-authors by number of shared publications:
- Debiao He
Wuhan University
67 shared publications - Cong Peng
Wuhan University
40 shared publications - Qi Feng
Wuhan University
20 shared publications - Kim-Kwang Raymond Choo
Department of Information Systems and Cybersecurity, The University of Texas at San Antonio, San Antonio, USA
15 shared publications - Zijian Bao
Wuhan University
15 shared publications - Xinyi Huang
Nanjing University of Aeronautics and Astronautics
9 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2432-2445
LightShark: Actively Secure Machine-Learning Inference Based on Lightweight Authenticated Distributed Comparison Function
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2432-2445
Open AccessLightShark: Actively Secure Machine-Learning Inference Based on Lightweight Authenticated Distributed Comparison Function
- 24 May 2026
- Published by Springer Nature
- p. 401-430
On the Preimage Leakage of Property-Preserving Hash
- 24 May 2026
- Published by Springer Nature
- p. 401-430
On the Preimage Leakage of Property-Preserving Hash
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 5779-5793
Threshold Issuance Selective Disclosure Credentials With Equivalence Class Signature
Anonymous credentials offer privacy-preserving authentication and authorization by making assertions about identity in the digital realm. To overcome the reliance on a single trusted issuer, decentralized variants have emerged. A classic approach is to split the responsibility of issuing credentials among multiple issuers in a threshold manner (e.g., t-out-of-n). Unfortunately, among existing threshold protocols, non-interactive practical constructions can only guarantee security in honest majority settings, while interactive constructions face two primary efficiency bottlenecks: either they require an excessive number of interaction rounds, or they fail to support constant-size credential showings for selective disclosure. In this work, we address these challenges by presenting a threshold issuance anonymous credential (TIAC) protocol, built upon the recent advanced signatures, i.e., Equivalence Class Signatures (EQS). Our proposed solution involves a three-round protocol that realizes a standard threshold issuing functionality, providing composable security against a malicious adversary corrupting the majority of issuers. We thereafter introduce a provably secure construction of the TIAC protocol with constant-size showings by combining the proposed threshold issuing protocol and set commitments. We rigorously prove our protocol in the universal composability (UC) framework. The practicality of our protocol is demonstrated through benchmark comparisons with the state-of-the-art EQS-based solution (ASIACRYPT ’24). The benchmarking results show that, with 64 participating issuers, our improvements go up to 6.72× for the threshold issuance phase when observed over WAN.
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 5779-5793
Threshold Issuance Selective Disclosure Credentials With Equivalence Class Signature
Anonymous credentials offer privacy-preserving authentication and authorization by making assertions about identity in the digital realm. To overcome the reliance on a single trusted issuer, decentralized variants have emerged. A classic approach is to split the responsibility of issuing credentials among multiple issuers in a threshold manner (e.g., t-out-of-n). Unfortunately, among existing threshold protocols, non-interactive practical constructions can only guarantee security in honest majority settings, while interactive constructions face two primary efficiency bottlenecks: either they require an excessive number of interaction rounds, or they fail to support constant-size credential showings for selective disclosure. In this work, we address these challenges by presenting a threshold issuance anonymous credential (TIAC) protocol, built upon the recent advanced signatures, i.e., Equivalence Class Signatures (EQS). Our proposed solution involves a three-round protocol that realizes a standard threshold issuing functionality, providing composable security against a malicious adversary corrupting the majority of issuers. We thereafter introduce a provably secure construction of the TIAC protocol with constant-size showings by combining the proposed threshold issuing protocol and set commitments. We rigorously prove our protocol in the universal composability (UC) framework. The practicality of our protocol is demonstrated through benchmark comparisons with the state-of-the-art EQS-based solution (ASIACRYPT ’24). The benchmarking results show that, with 64 participating issuers, our improvements go up to 6.72× for the threshold issuance phase when observed over WAN.
- 9 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 323
Federated learning of diffusion networks
- 9 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 323
Federated learning of diffusion networks
- Open Access
- 20 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (2) , 1-22
Secure and Dropout-Resilient Three-Party Clustering Based on Cloud-Edge-Client Collaboration
Clustering algorithms, as the core technology in data analysis, can extract potential patterns and regularities from complex data. However, deploying k -means clustering on resource-limited devices remains a challenge. Despite the promise of cloud computing, outsourcing data to a remote cloud leads to high latency and privacy risks. Moreover, the stability and speed of cloud can be affected by the state of network and configuration, which leads to computation error. Therefore, we design a secure and dropout-resilient k -means clustering scheme based on cloud-edge-client collaboration architecture. In our scheme, cloud server simply generates multiplication triples in pre-processing phase and can be offline. In online phase, IoT devices secretly share the raw sensing data with three edge servers. Then edge servers accomplish the clustering task interactively. We propose four basic protocols based on vector space secret sharing, including Euclidean distance, comparison, minimum and division protocols. By applying these protocols, we construct a clustering scheme that can tolerate the exit of one edge server and corruption of two edge servers. Since edge servers are generally located in trusted environment, we allow them to reconstruct clustering result and provide low-latency and high-reliability service. We prove that the basic protocols and clustering scheme are secure against semi-honest adversary. We conduct the experiments on two realistic datasets, showing that our scheme has good efficiency and is suitable for practical application.
- 20 January 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Internet Technology
- Vol. 26 (2) , 1-22
Open AccessSecure and Dropout-Resilient Three-Party Clustering Based on Cloud-Edge-Client Collaboration
Clustering algorithms, as the core technology in data analysis, can extract potential patterns and regularities from complex data. However, deploying k -means clustering on resource-limited devices remains a challenge. Despite the promise of cloud computing, outsourcing data to a remote cloud leads to high latency and privacy risks. Moreover, the stability and speed of cloud can be affected by the state of network and configuration, which leads to computation error. Therefore, we design a secure and dropout-resilient k -means clustering scheme based on cloud-edge-client collaboration architecture. In our scheme, cloud server simply generates multiplication triples in pre-processing phase and can be offline. In online phase, IoT devices secretly share the raw sensing data with three edge servers. Then edge servers accomplish the clustering task interactively. We propose four basic protocols based on vector space secret sharing, including Euclidean distance, comparison, minimum and division protocols. By applying these protocols, we construct a clustering scheme that can tolerate the exit of one edge server and corruption of two edge servers. Since edge servers are generally located in trusted environment, we allow them to reconstruct clustering result and provide low-latency and high-reliability service. We prove that the basic protocols and clustering scheme are secure against semi-honest adversary. We conduct the experiments on two realistic datasets, showing that our scheme has good efficiency and is suitable for practical application.
- 2 January 2026
- Published by Springer Nature
- p. 42-61
A Framework for Efficient Enhanced Privacy ID from Group Actions
- 2 January 2026
- Published by Springer Nature
- p. 42-61
A Framework for Efficient Enhanced Privacy ID from Group Actions
- 2 January 2026
- Published by Springer Nature
- p. 211-230
Vertical Federated Convolutional Framework Based on Function Secret Sharing
- 2 January 2026
- Published by Springer Nature
- p. 211-230
Vertical Federated Convolutional Framework Based on Function Secret Sharing
- Open Access
- 1 January 2026
- Published by KEAI Publishing in Cyber Security and Applications
- Vol. 4
A practical secure outsourced computation scheme for resource constrained clients
- 1 January 2026
- Published by KEAI Publishing in Cyber Security and Applications
- Vol. 4
Open AccessA practical secure outsourced computation scheme for resource constrained clients
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3625-3644
SEGS: Self-Enforcing Group Signature for Voting Systems
Group signatures provide anonymity for signers while allowing a group manager to reveal identities when necessary. However, traditional schemes lack mechanisms to automatically enforce protocol compliance, requiring trusted authorities to detect and penalize violations. This paper introduces Self-Enforcing Group Signatures (SEGS), a novel cryptographic primitive that maintains the anonymity of group signatures while incorporating automatic self-enforcement properties. SEGS ensures that if a group member signs two messages that share the same address but have different payloads—referred to as colliding messages—then anyone can efficiently extract the member's secret signing key from the two signatures without trusted intervention. We demonstrate SEGS's practical utility through a privacy-preserving voting application that prevents double voting while maintaining anonymity. Experimental evaluation on computational cost, signature size, and smart contract performance confirms the practicality of our SEGS and voting system. Our work bridges the gap between passive detection and active enforcement in anonymous authentication systems, offering a new direction for self-enforcing cryptographic protocols.
- 14 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 3625-3644
SEGS: Self-Enforcing Group Signature for Voting Systems
Group signatures provide anonymity for signers while allowing a group manager to reveal identities when necessary. However, traditional schemes lack mechanisms to automatically enforce protocol compliance, requiring trusted authorities to detect and penalize violations. This paper introduces Self-Enforcing Group Signatures (SEGS), a novel cryptographic primitive that maintains the anonymity of group signatures while incorporating automatic self-enforcement properties. SEGS ensures that if a group member signs two messages that share the same address but have different payloads—referred to as colliding messages—then anyone can efficiently extract the member's secret signing key from the two signatures without trusted intervention. We demonstrate SEGS's practical utility through a privacy-preserving voting application that prevents double voting while maintaining anonymity. Experimental evaluation on computational cost, signature size, and smart contract performance confirms the practicality of our SEGS and voting system. Our work bridges the gap between passive detection and active enforcement in anonymous authentication systems, offering a new direction for self-enforcing cryptographic protocols.
- Open Access
Plaintext Structure Vulnerability: Robust Cipher Identification via a Distributional Randomness Fingerprint Feature Extractor
Modern encryption algorithms form the foundation of digital security. However, the widespread use of encryption algorithms results in significant challenges for network defenders in identifying which specific algorithms are being employed. More importantly, we find that when the plaintext distribution of test data departs from the training data, the performance of classifiers often declines significantly. This issue exposes the feature extractor's hidden dependency on plaintext features. To reduce this dependency, we adopt a method that does not learn end-to-end from ciphertext bytes. Specifically, this method is based on a set of statistical tests to compute the randomness feature of the ciphertext, and then uses the frequency distribution pattern of this feature to construct the algorithms' respective fingerprints. The experimental results demonstrate that our method achieves high discriminative performance (e.g., AUC > 0.98) in the Canterbury Corpus dataset, which contains a diverse set of data types. Furthermore, in our cross-domain evaluation, baseline models' performance degrades significantly when tested on data with a reduced proportion of structured plaintext. In sharp contrast, our method demonstrates high robustness: performance degradation is minimal when transferring between different structured domains, and even on the most challenging purely random dataset, it maintains a high level of ranking ability (AUC > 0.90).
Open AccessPlaintext Structure Vulnerability: Robust Cipher Identification via a Distributional Randomness Fingerprint Feature Extractor
Modern encryption algorithms form the foundation of digital security. However, the widespread use of encryption algorithms results in significant challenges for network defenders in identifying which specific algorithms are being employed. More importantly, we find that when the plaintext distribution of test data departs from the training data, the performance of classifiers often declines significantly. This issue exposes the feature extractor's hidden dependency on plaintext features. To reduce this dependency, we adopt a method that does not learn end-to-end from ciphertext bytes. Specifically, this method is based on a set of statistical tests to compute the randomness feature of the ciphertext, and then uses the frequency distribution pattern of this feature to construct the algorithms' respective fingerprints. The experimental results demonstrate that our method achieves high discriminative performance (e.g., AUC > 0.98) in the Canterbury Corpus dataset, which contains a diverse set of data types. Furthermore, in our cross-domain evaluation, baseline models' performance degrades significantly when tested on data with a reduced proportion of structured plaintext. In sharp contrast, our method demonstrates high robustness: performance degradation is minimal when transferring between different structured domains, and even on the most challenging purely random dataset, it maintains a high level of ranking ability (AUC > 0.90).