Publications

2026

FlowShield: Cryptocurrency Anti-Money Laundering with Transaction Semantics Parsing and Fund Flow Tracking

Published in IEEE International Conference on Data Mining (ICDM 2026), Shanghai, China, 2026

A cryptocurrency anti-money-laundering framework using transaction semantics and fund-flow tracking.

Recommended citation: Qishuang Fu, Andreas Deppeler, Joseph K. Liu, Yixin Liu, Shirui Pan, Qin Wang, Weiqing Wang, and Tsz Hon Yuen. “FlowShield: Cryptocurrency Anti-Money Laundering with Transaction Semantics Parsing and Fund Flow Tracking.” To appear in IEEE International Conference on Data Mining (ICDM 2026), 2026.

Practical Private Set Union via Trusted Execution Environments.

Published in 28th International Conference on Information and Communications Security (ICICS) 2026. October 27-30, 2026, Fukui, Japan, 2026

Recommended citation: Xiaotian Zhang, Shujie Cui, Tsz Hon Yuen and Man Ho Au. Practical Private Set Union via Trusted Execution Environments. To appear in 28th International Conference on Information and Communications Security (ICICS) 2026.

HedgeSwap: Universal Hedged Atomic Swaps Against Griefing Attacks

Published in 31st European Symposium on Research in Computer Security (ESORICS 2026), Rome, Italy, 2026

A universal atomic-swap protocol that compensates parties against griefing attacks.

Recommended citation: Dongkun Hou, Ying-Teng Chen, Shujie Cui, Tsz Hon Yuen, Joseph K. Liu, and Jiangshan Yu. “HedgeSwap: Universal Hedged Atomic Swaps Against Griefing Attacks.” To appear in 31st European Symposium on Research in Computer Security (ESORICS 2026), 2026.

SuccinCT: Succinct Confidential Transaction for Miner Privacy

Published in 31st European Symposium on Research in Computer Security (ESORICS 2026), Rome, Italy, 2026

A compact confidential-transaction protocol protecting miner privacy.

Recommended citation: Ying-Teng Chen, Tsz Hon Yuen, Dongkun Hou, Jie Xu, Joseph K. Liu, Wayne Yang, and Jiangshan Yu. “SuccinCT: Succinct Confidential Transaction for Miner Privacy.” To appear in 31st European Symposium on Research in Computer Security (ESORICS 2026), 2026.

SoK: Blockchain Agent-to-Agent Payments

Published in International Conference on Blockchain Research and Applications (BCRA 2026), 2026

A systematization of blockchain-based agent-to-agent payments, their trust and security risks, and future research directions.

Recommended citation: Yuanzhe Zhang, Yuexin Xiang, Yuchen Lei, Qin Wang, Tian Qiu, Yujing Sun, Spiridon Zarkov, Tsz Hon Yuen, Andreas Deppeler, Jiangshan Yu, and Kwok-Yan Lam. “SoK: Blockchain Agent-to-Agent Payments.” To appear in International Conference on Blockchain Research and Applications (BCRA 2026), 2026.

OblivSage: Oblivious Graph Sampling for Privacy-Preserving GNN

Published in Australasian Conference on Information Security and Privacy (ACISP 2026), 2026

A privacy-preserving framework for efficient graph-neural-network training through oblivious subgraph sampling.

Recommended citation: Zhibo Xu, Yiming Qin, Shangqi Lai, Xiaoning Liu, Alsharif Abuadbba, Tsz Hon Yuen, Joseph K. Liu, and Xingliang Yuan. “OblivSage: Oblivious Graph Sampling for Privacy-Preserving GNN.” In Information Security and Privacy (ACISP 2026), Lecture Notes in Computer Science, vol. 16793, pp. 431–450, 2026. https://doi.org/10.1007/978-981-92-3015-0_20

GumSwap: Griefing-Free Universal Multi-Party Atomic Swaps

Published in IEEE International Conference on Distributed Computing Systems (ICDCS 2026), 2026

A universal multi-party atomic-swap protocol that prevents griefing attacks while supporting cross-chain exchanges.

Recommended citation: Dongkun Hou, Yuanzhe Zhang, Shujie Cui, Tsz Hon Yuen, Joseph K. Liu, and Jiangshan Yu. “GumSwap: Griefing-Free Universal Multi-Party Atomic Swaps.” In Proceedings of the 46th IEEE International Conference on Distributed Computing Systems (ICDCS 2026), pp. 1213–1223, 2026. https://doi.org/10.1109/2575-8411.2026.00119

SoK: Stablecoins in Retail Payments

Published in IEEE International Conference on Blockchain and Cryptocurrency (ICBC 2026), 2026

A systematic comparison of stablecoin payment arrangements and card networks for retail payments.

Recommended citation: Yuquan Li, Yuexin Xiang, Qin Wang, Tsz Hon Yuen, Andreas Deppeler, and Jiangshan Yu. “SoK: Stablecoins in Retail Payments.” In 2026 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 1–21, 2026. https://doi.org/10.1109/ICBC67748.2026.11575527

Measuring Memecoin Fragility

Published in IEEE International Conference on Blockchain and Cryptocurrency (ICBC 2026), 2026

A framework for measuring the volatility, ownership concentration, and sentiment-driven risks of memecoin ecosystems.

Recommended citation: Yuexin Xiang, Qishuang Fu, Yuquan Li, Qin Wang, Tsz Hon Yuen, and Jiangshan Yu. “Measuring Memecoin Fragility.” In 2026 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 1–5, 2026. https://doi.org/10.1109/ICBC67748.2026.11575489

Dualmatrix: Conquering zkSNARK for Large Matrix Multiplication

Published in Cybersecurity, 2026

A scalable zkSNARK for large, sparse matrix multiplication with linear prover time in the number of non-zero input elements.

Recommended citation: Mingshu Cong, Tsz Hon Yuen, and Siu-Ming Yiu. “Dualmatrix: Conquering zkSNARK for Large Matrix Multiplication.” Cybersecurity, vol. 9, article 126, 2026. https://doi.org/10.1186/s42400-025-00462-6

2025

Scalable zkSNARKs for Matrix Computations: A Generic Framework for Verifiable Deep Learning

Published in International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2025), 2025

A scalable zkSNARK framework for verifiable deep learning that supports architecture privacy and efficient matrix computations.

Recommended citation: Mingshu Cong, Sherman S. M. Chow, Siu-Ming Yiu, and Tsz Hon Yuen. “Scalable zkSNARKs for Matrix Computations: A Generic Framework for Verifiable Deep Learning.” In Advances in Cryptology – ASIACRYPT 2025, Lecture Notes in Computer Science, vol. 16249, pp. 363–395, 2026. https://doi.org/10.1007/978-981-95-5116-3_12

Posterior Security: Anonymity and Message Hiding of Standard Signatures

Published in ACM Conference on Computer and Communications Security (CCS 2025), 2025

A framework for adding anonymity and message hiding to standard digital signatures after the original signature is generated.

Recommended citation: Tsz Hon Yuen, Ying-Teng Chen, Shimin Pan, Jiangshan Yu, and Joseph K. Liu. “Posterior Security: Anonymity and Message Hiding of Standard Signatures.” In Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, pp. 528–542, 2025. https://doi.org/10.1145/3719027.3744797

Plum: SNARK-Friendly Post-Quantum Signature Based on Power Residue PRFs

Published in International Conference on Provable and Practical Security (ProvSec 2025), 2025

A post-quantum signature scheme designed to be efficient for use within zero-knowledge SNARK systems.

Recommended citation: Xinyu Zhang, Qishuang Fu, Ron Steinfeld, Joseph K. Liu, Tsz Hon Yuen, and Man Ho Au. “Plum: SNARK-Friendly Post-Quantum Signature Based on Power Residue PRFs.” In Provable and Practical Security (ProvSec 2025), Lecture Notes in Computer Science, vol. 16172, pp. 111–129, 2026. https://doi.org/10.1007/978-981-95-2961-2_6

More Practical Non-interactive Encrypted Conjunctive Search with Leakage and Storage Suppression

Published in International Conference on Provable and Practical Security (ProvSec 2025), 2025

A storage-efficient encrypted conjunctive-search scheme that suppresses leakage while preserving practical search performance.

Recommended citation: Huu Ngoc Duc Nguyen, Shujie Cui, Shangqi Lai, Tsz Hon Yuen, and Joseph K. Liu. “More Practical Non-interactive Encrypted Conjunctive Search with Leakage and Storage Suppression.” In Provable and Practical Security (ProvSec 2025), Lecture Notes in Computer Science, vol. 16172, pp. 329–349, 2026. https://doi.org/10.1007/978-981-95-2961-2_17

Universally Composable Traceable Ring Signature with Verifiable Random Function in Logarithmic Size

Published in Cryptography, 2025

A universally composable traceable ring-signature scheme with logarithmic-size signatures and verifiable random functions.

Recommended citation: Kwan Yin Chan, Tsz Hon Yuen, and Siu-Ming Yiu. “Universally Composable Traceable Ring Signature with Verifiable Random Function in Logarithmic Size.” Cryptography, vol. 9, no. 3, article 59, 2025. https://doi.org/10.3390/cryptography9030059

Efficient Private Set Intersection by Utilizing Oblivious Transfer Extension

Published in ACM ASIA Conference on Computer and Communications Security (ASIA CCS 2025), 2025

An efficient private-set-intersection protocol based on oblivious-transfer extension and an oblivious key-value store.

Recommended citation: Mingli Wu, Tsz Hon Yuen, and Siu-Ming Yiu. “Efficient Private Set Intersection by Utilizing Oblivious Transfer Extension.” In Proceedings of the 20th ACM ASIA Conference on Computer and Communications Security, pp. 104–117, 2025. https://doi.org/10.1145/3708821.3733886

SoK: A Deep Dive Into Anti-money Laundering Techniques for Blockchain Cryptocurrencies

Published in Australasian Conference on Information Security and Privacy (ACISP 2025), Wollongong, Australia, 2025

A systematization of cryptocurrency anti-money-laundering techniques, transaction patterns, and public datasets.

Recommended citation: Qishuang Fu, Joseph K. Liu, Shirui Pan, and Tsz Hon Yuen. “SoK: A Deep Dive Into Anti-money Laundering Techniques for Blockchain Cryptocurrencies.” In Information Security and Privacy (ACISP 2025), Lecture Notes in Computer Science, vol. 15658, pp. 310–330, 2025. https://doi.org/10.1007/978-981-96-9095-4_16

DIDO+: Data Provenance from Restricted TLS 1.3 Websites with Selective Disclosure

Published in IEEE Transactions on Dependable and Secure Computing, 2025

A TLS 1.3 data-provenance protocol that enables selective disclosure from restricted websites without revealing users’ credentials.

Recommended citation: Kwan Yin Chan, Handong Cui, Tsz Hon Yuen, and Siu-Ming Yiu. “DIDO+: Data Provenance from Restricted TLS 1.3 Websites with Selective Disclosure.” IEEE Transactions on Dependable and Secure Computing, vol. 22, no. 6, pp. 7107–7124, 2025. https://doi.org/10.1109/TDSC.2025.3595711

Using ChatGPT for medical education: the technical perspective

Published in BMC Medical Education, vol. 25, article 201, 2025

A ChatGPT-enabled clinical history-taking chatbot for virtual bedside teaching and international medical-education collaboration.

Recommended citation: Kwan Yin Chan, Tsz Hon Yuen, and Michael Co. “Using ChatGPT for medical education: the technical perspective.” BMC Medical Education, vol. 25, article 201, 2025. https://doi.org/10.1186/s12909-025-06785-9

2024

Exponent-Inversion P-Signatures and Accountable Identity-Based Encryption from SXDH

Published in IACR Communications in Cryptology, vol. 1, no. 3, 2024

Exponent-inversion signatures, anonymous credentials, and accountable IBE secure under the SXDH assumption.

Recommended citation: Tsz Hon Yuen, Sherman S. M. Chow, Huangting Wu, Cong Zhang, and Siu-Ming Yiu. “Exponent-Inversion P-Signatures and Accountable Identity-Based Encryption from SXDH.” IACR Communications in Cryptology, vol. 1, no. 3, article 48, 2024. https://doi.org/10.62056/ahsdkmp-3y

Threshold Ring Signatures: From DualRing to the t+1 Rings

Published in International Conference on Provable and Practical Security (ProvSec 2024), Gold Coast, Australia, 2024

A practical threshold ring-signature construction with logarithmic-size signatures independent of the threshold.

Recommended citation: Tsz Hon Yuen and Shimin Pan. “Threshold Ring Signatures: From DualRing to the t+1 Rings.” In Provable and Practical Security (ProvSec 2024), Lecture Notes in Computer Science, vol. 14903, pp. 269–288, 2025. https://doi.org/10.1007/978-981-96-0954-3_14

O-Ring and K-Star: Efficient Multi-party Private Set Intersection

Published in 33rd USENIX Security Symposium (USENIX Security 2024), Philadelphia, PA, USA, 2024

Efficient multi-party private set-intersection protocols resilient to an arbitrary number of colluding parties.

Recommended citation: Mingli Wu, Tsz Hon Yuen, and Kwan Yin Chan. “O-Ring and K-Star: Efficient Multi-party Private Set Intersection.” In 33rd USENIX Security Symposium (USENIX Security 2024), pp. 6489–6506, 2024.

zkMatrix: Batched Short Proof for Committed Matrix Multiplication

Published in 19th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2024), Singapore, 2024

A batched zk-SNARK for proving multiplication of committed matrices efficiently.

Recommended citation: Mingshu Cong, Tsz Hon Yuen, and Siu-Ming Yiu. “zkMatrix: Batched Short Proof for Committed Matrix Multiplication.” In Proceedings of the 19th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2024), pp. 289–305, 2024. https://doi.org/10.1145/3634737.3645003

Reconstructing Chameleon Hash: Full Security and the Multi-Party Setting

Published in 19th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2024), Singapore, 2024

A fully secure chameleon-hash construction supporting multi-party settings and post-quantum instantiations.

Recommended citation: Kwan Yin Chan, Liqun Chen, Yangguang Tian, and Tsz Hon Yuen. “Reconstructing Chameleon Hash: Full Security and the Multi-Party Setting.” In Proceedings of the 19th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2024), pp. 1066–1081, 2024. https://doi.org/10.1145/3634737.3656291

Message Control for Blockchain Rewriting

Published in IEEE Transactions on Dependable and Secure Computing, vol. 22, no. 3, 2024

Message-controlled chameleon hashes for safe and controlled blockchain rewriting.

Recommended citation: Yingjiu Li, Binanda Sengupta, Yangguang Tian, Jiaming Yuan, and Tsz Hon Yuen. “Message Control for Blockchain Rewriting.” IEEE Transactions on Dependable and Secure Computing, vol. 22, no. 3, pp. 1864–1876, 2025. https://doi.org/10.1109/TDSC.2024.3372631

2023

Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA

Published in 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS 2023), Copenhagen, Denmark, 2023

An efficient Joye–Libert-based multiplicative-to-additive conversion for threshold ECDSA.

Recommended citation: Haiyang Xue, Man Ho Au, Mengling Liu, Kwan Yin Chan, Handong Cui, Xiang Xie, Tsz Hon Yuen, and Chengru Zhang. “Efficient Multiplicative-to-Additive Function from Joye-Libert Cryptosystem and Its Application to Threshold ECDSA.” In Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security (CCS 2023), pp. 2974–2988, 2023. https://doi.org/10.1145/3576915.3616595

DIDO: Data Provenance from Restricted TLS 1.3 Websites

Published in 18th International Conference on Information Security Practice and Experience (ISPEC 2023), Copenhagen, Denmark, 2023

Data provenance for private data from restricted TLS 1.3 websites without revealing user credentials.

Recommended citation: Kwan Yin Chan, Handong Cui, and Tsz Hon Yuen. “DIDO: Data Provenance from Restricted TLS 1.3 Websites.” In Information Security Practice and Experience (ISPEC 2023), Lecture Notes in Computer Science, vol. 14341, pp. 154–169, 2023. https://doi.org/10.1007/978-981-99-7032-2_10

Efficient Unbalanced Private Set Intersection Cardinality and User-friendly Privacy-preserving Contact Tracing

Published in 32nd USENIX Security Symposium (USENIX Security 2023), Anaheim, CA, USA, 2023

Efficient unbalanced private set-intersection cardinality protocols and a practical privacy-preserving contact-tracing system.

Recommended citation: Mingli Wu and Tsz Hon Yuen. “Efficient Unbalanced Private Set Intersection Cardinality and User-friendly Privacy-preserving Contact Tracing.” In 32nd USENIX Security Symposium (USENIX Security 2023), pp. 283–300, 2023.

Practical Verifiable Random Function with RKA Security

Published in 28th Australasian Conference on Information Security and Privacy (ACISP 2023), Brisbane, Australia, 2023

A practical verifiable random function secure against related-key attacks.

Recommended citation: Tsz Hon Yuen, Shimin Pan, Sheng Huang, and Xiaoting Zhang. “Practical Verifiable Random Function with RKA Security.” In Information Security and Privacy (ACISP 2023), Lecture Notes in Computer Science, vol. 13915, pp. 503–522, 2023. https://doi.org/10.1007/978-3-031-35486-1_22

Scored Anonymous Credentials

Published in 21st International Conference on Applied Cryptography and Network Security (ACNS 2023), Kyoto, Japan, 2023

Anonymous credentials that support flexible, privacy-preserving scoring of user behaviour across authenticated sessions.

Recommended citation: Sherman S. M. Chow, Jack P. K. Ma, and Tsz Hon Yuen. “Scored Anonymous Credentials.” In Applied Cryptography and Network Security (ACNS 2023), Lecture Notes in Computer Science, vol. 13906, pp. 484–515, 2023. https://doi.org/10.1007/978-3-031-33491-7_18

Bandwidth-Efficient Zero-Knowledge Proofs for Threshold ECDSA

Published in The Computer Journal, vol. 67, no. 4, 2023

Compact zero-knowledge proofs for bandwidth-efficient, proactively secure threshold ECDSA.

Recommended citation: Handong Cui, Kwan Yin Chan, Tsz Hon Yuen, Xin Kang, and Cheng-Kang Chu. “Bandwidth-Efficient Zero-Knowledge Proofs for Threshold ECDSA.” The Computer Journal, vol. 67, no. 4, pp. 1265–1278, 2024. https://doi.org/10.1093/comjnl/bxad057

BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts

Published in 44th IEEE Symposium on Security and Privacy (IEEE S&P 2023), San Francisco, CA, USA, 2023

A Bitcoin-compatible payment-channel hub that provides relationship anonymity and supports private payments of variable amounts.

Recommended citation: Xianrui Qin, Shimin Pan, Arash Mirzaei, Zhimei Sui, Oğuzhan Ersoy, Amin Sakzad, Muhammed F. Esgin, Joseph K. Liu, Jiangshan Yu, and Tsz Hon Yuen. “BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts.” In 44th IEEE Symposium on Security and Privacy (IEEE S&P 2023), pp. 2462–2480, 2023. https://doi.org/10.1109/SP46215.2023.10179427

Practical Fully Leakage-Resilient Signatures with Auxiliary Inputs

Published in Future Generation Computer Systems, vol. 141, 2023

Practical signature schemes resilient to continual leakage, including auxiliary inputs.

Recommended citation: Cailing Cai, Shimin Pan, Tsz Hon Yuen, and Siu-Ming Yiu. “Practical Fully Leakage-Resilient Signatures with Auxiliary Inputs.” Future Generation Computer Systems, vol. 141, pp. 448–461, 2023.

A Critique on Decentralized Finance from a Social, Political, and Economic Perspective

Published in Blockchain, vol. 1, no. 1, 2023

A critical examination of decentralized finance and its social, political, and economic assumptions.

Recommended citation: Zizheng Fonghu and Tsz Hon Yuen. “A Critique on Decentralized Finance from a Social, Political, and Economic Perspective.” Blockchain, vol. 1, no. 1, article 0006, 2023. https://doi.org/10.55092/blockchain20230006

Earlier work (2022–2012)

2022

Hash Proof System with Auxiliary Inputs and Its Application

Published in 21st IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2022), 2022

A practical hash proof system with auxiliary inputs for leakage-resilient public-key encryption.

Recommended citation: Cailing Cai, Tsz Hon Yuen, and Siu-Ming Yiu. “Hash Proof System with Auxiliary Inputs and Its Application.” In Proceedings of the 2022 IEEE 21st International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2022), pp. 52–59, 2022. https://doi.org/10.1109/TrustCom56396.2022.00018

Multi-signatures for ECDSA and Its Applications in Blockchain

Published in 27th Australasian Conference on Information Security and Privacy (ACISP 2022), Wollongong, Australia, 2022

Efficient multi-signature constructions for ECDSA and their applications in blockchain systems.

Recommended citation: Shimin Pan, Kwan Yin Chan, Handong Cui, and Tsz Hon Yuen. “Multi-signatures for ECDSA and Its Applications in Blockchain.” In Information Security and Privacy (ACISP 2022), Lecture Notes in Computer Science, vol. 13494, pp. 265–285, 2022. https://doi.org/10.1007/978-3-031-22301-3_14

Attribute-Based Anonymous Credential: Optimization for Single-Use and Multi-Use

Published in 21st International Conference on Cryptology and Network Security (CANS 2022), Abu Dhabi, UAE, 2022

A unified attribute-based anonymous credential system supporting efficient single-use and multi-use presentations.

Recommended citation: Kwan Yin Chan and Tsz Hon Yuen. “Attribute-Based Anonymous Credential: Optimization for Single-Use and Multi-Use.” In Cryptology and Network Security (CANS 2022), Lecture Notes in Computer Science, pp. 89–121, 2022. https://doi.org/10.1007/978-3-031-20974-1_5

GCD-Filter: Private Set Intersection Without Encryption

Published in 17th International Conference on Wireless Algorithms, Systems, and Applications (WASA 2022), Dalian, China, 2022

A private set-intersection approach using greatest-common-divisor filtering without encryption.

Recommended citation: Mingli Wu and Tsz Hon Yuen. “GCD-Filter: Private Set Intersection Without Encryption.” In Wireless Algorithms, Systems, and Applications (WASA 2022), Lecture Notes in Computer Science, vol. 13472, pp. 429–440, 2022. https://doi.org/10.1007/978-3-031-19214-2_36

Don’t Tamper with Dual System Encryption: Beyond Polynomial Related-Key Security of IBE

Published in 20th International Conference on Applied Cryptography and Network Security (ACNS 2022), Rome, Italy, 2022

A dual-system-encryption approach achieving security beyond polynomial related-key attacks for identity-based encryption.

Recommended citation: Tsz Hon Yuen, Cong Zhang, and Sherman S. M. Chow. “Don’t Tamper with Dual System Encryption: Beyond Polynomial Related-Key Security of IBE.” In Applied Cryptography and Network Security (ACNS 2022), Lecture Notes in Computer Science, vol. 13269, pp. 419–439, 2022. https://doi.org/10.1007/978-3-031-09234-3_21

Using Clinical History Taking Chatbot Mobile App for Clinical Bedside Teachings: A Prospective Case Control Study

Published in Heliyon, vol. 8, no. 6, 2022

A prospective study evaluating a mobile chatbot app for teaching clinical history taking to medical students.

Recommended citation: Michael Co, Tsz Hon John Yuen, and Ho Hung Cheung. “Using Clinical History Taking Chatbot Mobile App for Clinical Bedside Teachings: A Prospective Case Control Study.” Heliyon, vol. 8, no. 6, e09751, 2022. https://doi.org/10.1016/j.heliyon.2022.e09751

Tight Leakage-Resilient Identity-Based Encryption under Multi-Challenge Setting

Published in 17th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2022), Nagasaki, Japan, 2022

Tightly secure leakage-resilient identity-based encryption in a multi-challenge setting.

Recommended citation: Cailing Cai, Xianrui Qin, Tsz Hon Yuen, and Siu-Ming Yiu. “Tight Leakage-Resilient Identity-Based Encryption under Multi-Challenge Setting.” In Proceedings of the 17th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2022), pp. 42–53, 2022. https://doi.org/10.1145/3488932.3517422

2021

Privacy-Preserving Contact Tracing Protocol for Mobile Devices: A Zero-Knowledge Proof Approach

Published in International Conference on Information Security Practice and Experience (ISPEC 2021), Nanjing, China, 2021

A privacy-preserving mobile contact-tracing protocol using zero-knowledge proofs.

Recommended citation: Joseph K. Liu, Man Ho Au, Tsz Hon Yuen, Cong Zuo, Jiawei Wang, Amin Sakzad, Xiapu Luo, Li Li, and Kim-Kwang Raymond Choo. “Privacy-Preserving Contact Tracing Protocol for Mobile Devices: A Zero-Knowledge Proof Approach.” In Information Security Practice and Experience (ISPEC 2021), pp. 327–344, 2021. https://doi.org/10.1007/978-3-030-93206-0_20

A Trustless GQ Multi-Signature Scheme with Identifiable Abort

Published in 26th Australasian Conference on Information Security and Privacy (ACISP 2021), Perth, Australia, 2021

A trustless, efficient Guillou–Quisquater multi-signature scheme with identifiable abort.

Recommended citation: Handong Cui and Tsz Hon Yuen. “A Trustless GQ Multi-Signature Scheme with Identifiable Abort.” In Information Security and Privacy (ACISP 2021), Lecture Notes in Computer Science, vol. 13083, pp. 673–693, 2021. https://doi.org/10.1007/978-3-030-90567-5_34

Efficient Online-Friendly Two-Party ECDSA Signature

Published in 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS 2021), Virtual, 2021

An efficient two-party ECDSA protocol with a lightweight online signing phase.

Recommended citation: Haiyang Xue, Man Ho Au, Xiang Xie, Tsz Hon Yuen, and Handong Cui. “Efficient Online-Friendly Two-Party ECDSA Signature.” In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS 2021), pp. 558–573, 2021. https://doi.org/10.1145/3460120.3484803

One-More Unforgeability of Blind ECDSA

Published in 26th European Symposium on Research in Computer Security (ESORICS 2021), Virtual, 2021

The first formal analysis and construction of blind ECDSA with one-more unforgeability.

Recommended citation: Xianrui Qin, Cailing Cai, and Tsz Hon Yuen. “One-More Unforgeability of Blind ECDSA.” In Computer Security – ESORICS 2021, pp. 313–331, 2021. https://doi.org/10.1007/978-3-030-88428-4_16

Security on SM2 and GOST Signatures against Related-Key Attacks

Published in 20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2021), Shenyang, China, 2021

An analysis of SM2 and GOST digital signatures in the presence of related-key attacks.

Recommended citation: Handong Cui, Xianrui Qin, Cailing Cai, and Tsz Hon Yuen. “Security on SM2 and GOST Signatures against Related-Key Attacks.” In Proceedings of the 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2021), pp. 155–163, 2021. https://doi.org/10.1109/TrustCom53373.2021.00038

DualRing: Generic Construction of Ring Signatures with Efficient Instantiations

Published in 41st Annual International Cryptology Conference (CRYPTO 2021), Virtual, 2021

A generic ring-signature construction with efficient discrete-logarithm and lattice-based instantiations.

Recommended citation: Tsz Hon Yuen, Muhammed F. Esgin, Joseph K. Liu, Man Ho Au, and Zhimin Ding. “DualRing: Generic Construction of Ring Signatures with Efficient Instantiations.” In Advances in Cryptology – CRYPTO 2021, Lecture Notes in Computer Science, pp. 251–281, 2021. https://doi.org/10.1007/978-3-030-84242-0_10

Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup

Published in 24th International Conference on Practice and Theory of Public-Key Cryptography (PKC 2021), Virtual, 2021

Compact zero-knowledge proofs that reduce communication and computation costs in threshold ECDSA.

Recommended citation: Tsz Hon Yuen, Handong Cui, and Xiang Xie. “Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup.” In Public-Key Cryptography – PKC 2021, Lecture Notes in Computer Science, vol. 12710, pp. 481–511, 2021. https://doi.org/10.1007/978-3-030-75245-3_18

2020

Address-Based Signature

Published in 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2020), Guangzhou, China, 2020

A signature mechanism using blockchain addresses as public identifiers.

Recommended citation: Handong Cui and Tsz Hon Yuen. “Address-Based Signature.” In Proceedings of the 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2020), pp. 884–891, 2020. https://doi.org/10.1109/TrustCom50675.2020.00119

Compatible Certificateless and Identity-Based Cryptosystems for Heterogeneous IoT

Published in 23rd Information Security Conference (ISC 2020), Virtual, 2020

Compatible certificateless and identity-based cryptosystems for secure communication in heterogeneous IoT environments.

Recommended citation: Rouzbeh Behnia, Attila Altay Yavuz, Muslum Ozgur Ozmen, and Tsz Hon Yuen. “Compatible Certificateless and Identity-Based Cryptosystems for Heterogeneous IoT.” In Information Security (ISC 2020), Lecture Notes in Computer Science, vol. 12472, pp. 39–58, 2020. https://doi.org/10.1007/978-3-030-62974-8_3

LPPRS: New Location Privacy-Preserving Schemes Based on Ring Signature over Mobile Social Networks

Published in 16th International Conference on Information Security and Cryptology (Inscrypt 2020), Guangzhou, China, 2020

Ring-signature-based schemes for identity, location, and query privacy in mobile social networks.

Recommended citation: Cailing Cai, Tsz Hon Yuen, Handong Cui, Mingli Wu, and Siu-Ming Yiu. “LPPRS: New Location Privacy-Preserving Schemes Based on Ring Signature over Mobile Social Networks.” In Information Security and Cryptology (Inscrypt 2020), Lecture Notes in Computer Science, vol. 12612, pp. 288–303, 2021. https://doi.org/10.1007/978-3-030-71852-7_19

RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security

Published in 24th International Conference on Financial Cryptography and Data Security (FC 2020), Kota Kinabalu, Malaysia, 2020

A more compact and strongly secure RingCT construction for confidential blockchain transactions.

Recommended citation: Tsz Hon Yuen, Shi-Feng Sun, Joseph K. Liu, Man Ho Au, Muhammed F. Esgin, Qingzhao Zhang, and Dawu Gu. “RingCT 3.0 for Blockchain Confidential Transaction: Shorter Size and Stronger Security.” In Financial Cryptography and Data Security (FC 2020), Lecture Notes in Computer Science, vol. 12059, pp. 464–483, 2020. https://doi.org/10.1007/978-3-030-51280-4_25

Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation

Published in IEEE Transactions on Dependable and Secure Computing, vol. 19, no. 1, 2020

Practical multi-client searchable encryption without per-query interaction between data owner and client.

Recommended citation: Shifeng Sun, Cong Zuo, Joseph K. Liu, Amin Sakzad, Ron Steinfeld, Tsz Hon Yuen, Xingliang Yuan, and Dawu Gu. “Non-Interactive Multi-Client Searchable Encryption: Realization and Implementation.” IEEE Transactions on Dependable and Secure Computing, vol. 19, no. 1, pp. 452–467, 2022. https://doi.org/10.1109/TDSC.2020.2973633

Server-Aided Revocable Attribute-Based Encryption for Cloud Computing Services

Published in Concurrency and Computation: Practice and Experience, vol. 32, no. 14, 2020

A server-aided revocable attribute-based encryption scheme for fine-grained cloud access control.

Recommended citation: Hui Cui, Tsz Hon Yuen, Robert H. Deng, and Guilin Wang. “Server-Aided Revocable Attribute-Based Encryption for Cloud Computing Services.” Concurrency and Computation: Practice and Experience, vol. 32, no. 14, e5680, 2020. https://doi.org/10.1002/cpe.5680

2019

Strong Known Related-Key Attacks and the Security of ECDSA

Published in 13th International Conference on Network and System Security (NSS 2019), Sapporo, Japan, 2019

A strong known related-key attack model and its implications for ECDSA and Schnorr signatures.

Recommended citation: Tsz Hon Yuen and Siu-Ming Yiu. “Strong Known Related-Key Attacks and the Security of ECDSA.” In Network and System Security (NSS 2019), Lecture Notes in Computer Science, vol. 11928, pp. 130–145, 2019. https://doi.org/10.1007/978-3-030-36938-5_8

Securely Perturb Big Data by Using Inner Product Encryption

Published in 2019 IEEE Conference on Dependable and Secure Computing (DSC 2019), Hangzhou, China, 2019

A privacy-preserving approach to perturbing big data using inner-product encryption.

Recommended citation: Mingli Wu and Tsz Hon Yuen. “Securely Perturb Big Data by Using Inner Product Encryption.” In 2019 IEEE Conference on Dependable and Secure Computing (DSC 2019), pp. 1–8, 2019.

PAChain: Private, Authenticated and Auditable Consortium Blockchain

Published in 18th International Conference on Cryptology and Network Security (CANS 2019), Fuzhou, China, 2019

A private, authenticated, and auditable blockchain design for consortium settings.

Recommended citation: Tsz Hon Yuen. “PAChain: Private, Authenticated and Auditable Consortium Blockchain.” In Cryptology and Network Security (CANS 2019), Lecture Notes in Computer Science, vol. 11829, pp. 214–234, 2019. https://doi.org/10.1007/978-3-030-31578-8_12

2018

Anonymity Reduction Attacks to Monero

Published in 14th International Conference on Information Security and Cryptology (Inscrypt 2018), Fuzhou, China, 2018

An analysis of attacks that reduce transaction anonymity in Monero.

Recommended citation: Dimaz Ankaa Wijaya, Joseph K. Liu, Ron Steinfeld, Dongxi Liu, and Tsz Hon Yuen. “Anonymity Reduction Attacks to Monero.” In Information Security and Cryptology (Inscrypt 2018), Lecture Notes in Computer Science, vol. 11449, pp. 86–100, 2019. https://doi.org/10.1007/978-3-030-14234-6_5

Compact Ring Signature in the Standard Model for Blockchain

Published in 14th International Conference on Information Security Practice and Experience (ISPEC 2018), Tokyo, Japan, 2018

A compact standard-model ring signature for blockchain applications.

Recommended citation: Hao Ren, Peng Zhang, Qingchun Shentu, Joseph K. Liu, and Tsz Hon Yuen. “Compact Ring Signature in the Standard Model for Blockchain.” In Information Security Practice and Experience (ISPEC 2018), Lecture Notes in Computer Science, vol. 11125, pp. 50–65, 2018. https://doi.org/10.1007/978-3-319-99807-7_4

Time-Based Direct Revocable Ciphertext-Policy Attribute-Based Encryption with Short Revocation List

Published in 16th International Conference on Applied Cryptography and Network Security (ACNS 2018), Leuven, Belgium, 2018

A time-based revocable CP-ABE scheme that keeps revocation lists short.

Recommended citation: Joseph K. Liu, Tsz Hon Yuen, Peng Zhang, and Kaitai Liang. “Time-Based Direct Revocable Ciphertext-Policy Attribute-Based Encryption with Short Revocation List.” In Applied Cryptography and Network Security (ACNS 2018), Lecture Notes in Computer Science, vol. 10892, pp. 516–534, 2018. https://doi.org/10.1007/978-3-319-93387-0_27

Security-Mediated Certificateless Undeniable Signature Scheme

Published in Third International Congress on Information and Communication Technology (ICICT 2018), London, United Kingdom, 2018

A certificateless undeniable-signature scheme with security mediation and immediate revocation.

Recommended citation: Tsz Hon Yuen and Swee-Huay Heng. “Security-Mediated Certificateless Undeniable Signature Scheme.” In Third International Congress on Information and Communication Technology, Advances in Intelligent Systems and Computing, vol. 797, pp. 25–32, 2019. https://doi.org/10.1007/978-981-13-1165-9_3

2017

A General Framework for Secure Sharing of Personal Health Records in Cloud System

Published in Journal of Computer and System Sciences, 2017

A privacy-preserving framework for sharing personal health records through the cloud.

Recommended citation: Man Ho Allen Au, Tsz Hon Yuen, Joseph K. Liu, Willy Susilo, Xinyi Huang, Yang Xiang, and Zoe L. Jiang. “A General Framework for Secure Sharing of Personal Health Records in Cloud System.” Journal of Computer and System Sciences, vol. 90, pp. 46–62, 2017. https://doi.org/10.1016/j.jcss.2017.03.002

RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero

Published in 22nd European Symposium on Research in Computer Security (ESORICS 2017), Oslo, Norway, 2017

A compact RingCT protocol for privacy-preserving Monero transactions.

Recommended citation: Shi-Feng Sun, Man Ho Au, Joseph K. Liu, and Tsz Hon Yuen. “RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero.” In Computer Security – ESORICS 2017, Lecture Notes in Computer Science, vol. 10493, pp. 456–474, 2017. https://doi.org/10.1007/978-3-319-66399-9_25

2016

Efficient Privacy-Preserving Charging Station Reservation System for Electric Vehicles

Published in The Computer Journal, 2016

A privacy-preserving reservation system for electric-vehicle charging stations.

Recommended citation: Joseph K. Liu, Willy Susilo, Tsz Hon Yuen, Man Ho Allen Au, Junbin Fang, Zoe L. Jiang, and Jianying Zhou. “Efficient Privacy-Preserving Charging Station Reservation System for Electric Vehicles.” The Computer Journal, vol. 59, no. 7, pp. 1040–1053, 2016. https://doi.org/10.1093/comjnl/bxv117

An Efficient Non-Interactive Multi-Client Searchable Encryption with Support for Boolean Queries

Published in 21st European Symposium on Research in Computer Security (ESORICS 2016), Heraklion, Greece, 2016

A non-interactive multi-client searchable-encryption scheme supporting Boolean queries.

Recommended citation: Shi-Feng Sun, Joseph K. Liu, Amin Sakzad, Ron Steinfeld, and Tsz Hon Yuen. “An Efficient Non-Interactive Multi-Client Searchable Encryption with Support for Boolean Queries.” In Computer Security – ESORICS 2016, Lecture Notes in Computer Science, vol. 9878, pp. 154–172, 2016. https://doi.org/10.1007/978-3-319-45744-4_8

Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption

Published in 11th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2016), Xi'an, China, 2016

An efficient public-key encryption scheme with complete non-malleability under chosen-ciphertext attacks.

Recommended citation: Shi-Feng Sun, Dawu Gu, Joseph K. Liu, Udaya Parampalli, and Tsz Hon Yuen. “Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption.” In Proceedings of the 11th ACM Asia Conference on Computer and Communications Security (AsiaCCS 2016), pp. 901–906, 2016. https://doi.org/10.1145/2897845.2897921

2015

k-Times Attribute-Based Anonymous Access Control for Cloud Computing

Published in IEEE Transactions on Computers, 2015

Anonymous, attribute-based cloud access control with a configurable access limit.

Recommended citation: Tsz Hon Yuen, Joseph K. Liu, Man Ho Allen Au, Xinyi Huang, Willy Susilo, and Jianying Zhou. “k-Times Attribute-Based Anonymous Access Control for Cloud Computing.” IEEE Transactions on Computers, vol. 64, no. 9, pp. 2595–2608, 2015. https://doi.org/10.1109/TC.2014.2366741

Related Randomness Attacks for Public Key Cryptosystems

Published in 10th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2015), Singapore, 2015

An analysis of public-key cryptosystems under related-randomness attacks.

Recommended citation: Tsz Hon Yuen, Cong Zhang, Sherman S. M. Chow, and Siu-Ming Yiu. “Related Randomness Attacks for Public Key Cryptosystems.” In Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2015), pp. 215–223, 2015. https://doi.org/10.1145/2714576.2714622

Continuous Non-Malleable Key Derivation and Its Application to Related-Key Security

Published in 18th IACR International Conference on Practice and Theory in Public-Key Cryptography (PKC 2015), Gaithersburg, MD, USA, 2015

A continuous non-malleable key-derivation primitive and its application to related-key security.

Recommended citation: Baodong Qin, Shengli Liu, Tsz Hon Yuen, Robert H. Deng, and Kefei Chen. “Continuous Non-Malleable Key Derivation and Its Application to Related-Key Security.” In Public-Key Cryptography – PKC 2015, Lecture Notes in Computer Science, vol. 9020, pp. 557–578, 2015. https://doi.org/10.1007/978-3-662-46447-2_25

2014

Identity-Based Encryption with Post-Challenge Auxiliary Inputs for Secure Cloud Applications and Sensor Networks

Published in 19th European Symposium on Research in Computer Security (ESORICS 2014), Wroclaw, Poland, 2014

Leakage-resilient identity-based encryption for cloud applications and sensor networks.

Recommended citation: Tsz Hon Yuen, Ye Zhang, Siu Ming Yiu, and Joseph K. Liu. “Identity-Based Encryption with Post-Challenge Auxiliary Inputs for Secure Cloud Applications and Sensor Networks.” In Computer Security – ESORICS 2014, Lecture Notes in Computer Science, vol. 8712, pp. 130–147, 2014. https://doi.org/10.1007/978-3-319-11203-9_8

2013

Efficient Linkable and/or Threshold Ring Signature Without Random Oracles

Published in The Computer Journal, 2013

A linkable and threshold ring-signature construction secure without random oracles.

Recommended citation: Tsz Hon Yuen, Joseph K. Liu, Man Ho Au, Willy Susilo, and Jianying Zhou. “Efficient Linkable and/or Threshold Ring Signature Without Random Oracles.” The Computer Journal, vol. 56, no. 4, pp. 407–421, 2013. https://doi.org/10.1093/comjnl/bxs115

Multi-Key Leakage-Resilient Threshold Cryptography

Published in 8th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2013), Hangzhou, China, 2013

Threshold cryptography designed to withstand leakage across multiple secret keys.

Recommended citation: Cong Zhang, Tsz Hon Yuen, Hao Xiong, Sherman S. M. Chow, Siu-Ming Yiu, and Yi Jun He. “Multi-Key Leakage-Resilient Threshold Cryptography.” In Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2013), pp. 61–70, 2013. https://doi.org/10.1145/2484313.2484321

2012

PE(AR)2: Privacy-Enhanced Anonymous Authentication with Reputation and Revocation

Published in 17th European Symposium on Research in Computer Security (ESORICS 2012), Pisa, Italy, 2012

Anonymous authentication with privacy, reputation, and revocation support.

Recommended citation: Kin Ying Yu, Tsz Hon Yuen, Sherman S. M. Chow, Siu-Ming Yiu, and Lucas Chi Kwong Hui. “PE(AR)2: Privacy-Enhanced Anonymous Authentication with Reputation and Revocation.” In Computer Security – ESORICS 2012, Lecture Notes in Computer Science, vol. 7459, pp. 679–696, 2012. https://doi.org/10.1007/978-3-642-33167-1_39

Identity-Based Encryption Resilient to Continual Auxiliary Leakage

Published in 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2012), Cambridge, United Kingdom, 2012

An identity-based encryption scheme resilient to continual auxiliary leakage.

Recommended citation: Tsz Hon Yuen, Sherman S. M. Chow, Ye Zhang, and Siu-Ming Yiu. “Identity-Based Encryption Resilient to Continual Auxiliary Leakage.” In Advances in Cryptology – EUROCRYPT 2012, Lecture Notes in Computer Science, vol. 7237, pp. 117–134, 2012. https://doi.org/10.1007/978-3-642-29011-4_9