Dr Tsz Hon Yuen (John Yuen)

Dr Tsz Hon Yuen (John Yuen)

Associate Professor, Monash University

Sitemap

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

Pages

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, December 17-19, 2021., 2021

CORE 2026 C

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, Lecture Notes in Computer Science, vol. 13107, pp. 327–344, 2021.

Paper DOI

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

Identity-Based Encryption Resilient to Continual Auxiliary Leakage.

Published in Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, 2012

CORE 2026 A* CCF 2026 A

An identity-based encryption scheme designed to remain secure under continual auxiliary leakage of secret information.

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.

DOI

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

Published in Computer Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings, 2012

CORE 2026 A CCF 2026 B

A privacy-enhanced anonymous-authentication scheme that combines reputation management with user revocation.

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.

DOI

Multi-key Leakage-resilient Threshold Cryptography.

Published in 8th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2013, Hangzhou, China - May 08 - 10, 2013, 2013

CORE 2026 A CCF 2026 B

A threshold-cryptography framework that remains secure when multiple secret keys are exposed to bounded leakage.

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 SIGSAC Symposium on Information, Computer and Communications Security, pp. 61–70, 2013.

Paper DOI

Efficient Linkable and/or Threshold Ring Signature Without Random Oracles.

Published in The Computer Journal, 2013

CORE 2020 B CCF 2026 B

An efficient linkable and threshold ring-signature construction that avoids random oracles while preserving signer anonymity.

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.

DOI

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

Published in Computer Security - ESORICS 2014 - 19th European Symposium on Research in Computer Security, Wroclaw, Poland, September 7-11, 2014. Proceedings, Part I, 2014

CORE 2026 A CCF 2026 B

An identity-based encryption scheme resilient to post-challenge auxiliary-input leakage for secure cloud and sensor-network applications.

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.

DOI

Continuous Non-malleable Key Derivation and Its Application to Related-Key Security.

Published in Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015

CORE 2026 B CCF 2026 B

A continuous non-malleable key-derivation mechanism that strengthens cryptographic schemes against related-key attacks.

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.

DOI

Related Randomness Attacks for Public Key Cryptosystems.

Published in Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2015, Singapore, April 14-17, 2015, 2015

CORE 2026 A CCF 2026 B

An analysis of related-randomness attacks against public-key cryptosystems and their implications for cryptographic design.

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, pp. 215–223, 2015.

Paper DOI

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

Published in IEEE Transactions on Computers, 2015

CORE 2020 A* CCF 2026 A

An attribute-based anonymous access-control scheme that supports repeated access while protecting users’ identities in cloud computing.

Recommended citation: Tsz Hon Yuen, Joseph K. Liu, Man Ho 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.

DOI

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

Published in Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2016, Xian, China, May 30 - June 3, 2016, 2016

CORE 2026 A CCF 2026 B

A construction of completely non-malleable chosen-ciphertext-secure public-key encryption for robust message confidentiality.

Recommended citation: Shifeng 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 on Asia Conference on Computer and Communications Security, pp. 901–906, 2016.

Paper DOI

An Efficient Non-interactive Multi-client Searchable Encryption with Support for Boolean Queries.

Published in Computer Security - ESORICS 2016 - 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I, 2016

CORE 2026 A CCF 2026 B

A non-interactive multi-client searchable-encryption scheme that supports efficient Boolean queries over encrypted data.

Recommended citation: Shifeng 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.

DOI

Efficient Privacy-Preserving Charging Station Reservation System for Electric Vehicles.

Published in The Computer Journal, 2016

CORE 2020 B CCF 2026 B

A privacy-preserving reservation system that enables electric-vehicle users to book charging stations without exposing sensitive information.

Recommended citation: Joseph K. Liu, Willy Susilo, Tsz Hon Yuen, Man Ho Au, Jun-bin 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.

DOI

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

Published in Computer Security - ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part II, 2017

CORE 2026 A CCF 2026 B

A compact accumulator-based RingCT protocol that provides confidential and linkable blockchain transactions for Monero.

Recommended citation: Shifeng 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.

DOI

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

Published in Journal of Computer and System Sciences, 2017

CORE 2020 A* CCF 2026 B

A cryptographic framework for securely sharing personal health records through cloud systems with fine-grained access control.

Recommended citation: Man Ho 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.

DOI

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.

DOI

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

Published in Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Leuven, Belgium, July 2-4, 2018, Proceedings, 2018

CORE 2026 B CCF 2026 C

A time-based, directly revocable ciphertext-policy attribute-based encryption scheme with a short revocation list.

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, Lecture Notes in Computer Science, vol. 10892, pp. 516–534, 2018.

DOI

Compact Ring Signature in the Standard Model for Blockchain.

Published in The 14th International Conference on Information Security Practice and Experience (ISPEC 2018), Tokyo, Japan, September 25-27, 2018. Proceedings, 2018

CORE 2026 C

A compact ring-signature construction in the standard model for privacy-preserving 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, Lecture Notes in Computer Science, vol. 11125, pp. 50–65, 2018.

DOI

Anonymity Reduction Attacks To Monero.

Published in The 14th International Conference on Information Security and Cryptology (Inscrypt 2018), Fuzhou, China, December 14-17, 2018. Proceedings, 2018

CCF 2026 C

An analysis of anonymity-reduction attacks against Monero that examines how transaction information can weaken user privacy.

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, Lecture Notes in Computer Science, vol. 11449, pp. 86–100, 2019.

DOI

PAChain: Private, Authenticated Auditable Consortium Blockchain.

Published in The 18th International Conference on Cryptology and Network Security (CANS 2019), Fuzhou, China, 25-27 October 2019, 2019

CORE 2026 B

A private, authenticated, and auditable consortium-blockchain design for accountable data management and secure collaboration.

Recommended citation: Tsz Hon Yuen. “PAChain: Private, Authenticated Auditable Consortium Blockchain.” In Cryptology and Network Security, Lecture Notes in Computer Science, vol. 11829, pp. 214–234, 2019.

DOI

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 Proceedings of the 2019 IEEE Conference on Dependable and Secure Computing (DSC 2019), pp. 1–8, 2019.

Paper DOI

Strong Known Related-Key Attacks and the Security of ECDSA.

Published in The 13th International Conference on Network and System Security (NSS 2019). Sapporo, Japan. 15-18 December 2019, 2019

CORE 2026 B CCF 2026 C

A study of strong known related-key attacks against ECDSA and their implications for signature-scheme security.

Recommended citation: Tsz Hon Yuen and Siu-Ming Yiu. “Strong Known Related-Key Attacks and the Security of ECDSA.” In Network and System Security, Lecture Notes in Computer Science, vol. 11928, pp. 130–145, 2019.

DOI

Server-aided Revocable Attribute-based Encryption for Cloud Computing Services.

Published in Concurrency and Computation Practice and Experience, 2020

CORE 2020 B CCF 2026 C

A server-aided revocable attribute-based encryption scheme for cloud services that supports efficient access revocation.

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, article e5680, 2020.

Paper DOI

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

Published in IEEE Transactions on Dependable and Secure Computing, 2020

CORE 2020 A CCF 2026 A

A practical non-interactive searchable-encryption system that supports secure search across encrypted data contributed by multiple clients.

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.

Paper DOI

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

Published in The 24-th International Conference on Financial Cryptography and Data Security (FC 2020). Kota Kinabalu, Sabah, Malaysia. February 10–14, 2020, 2020

CORE 2026 A CCF 2026 C

A compact confidential-transaction protocol for blockchain systems that reduces transaction size while strengthening privacy and security.

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, Lecture Notes in Computer Science, vol. 12059, pp. 464–483, 2020.

DOI

PAChain: Private, Authenticated & Auditable Consortium Blockchain and its Implementation.

Published in Future Generation Computer Systems. Volume 112, November 2020, Pages 913-929, 2020

CORE 2020 A CCF 2026 C

A private, authenticated, and auditable consortium-blockchain design with an implementation for accountable enterprise data management.

Recommended citation: Tsz Hon Yuen. “PAChain: Private, Authenticated & Auditable Consortium Blockchain and Its Implementation.” Future Generation Computer Systems, vol. 112, pp. 913–929, 2020.

Paper DOI

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

Published in The 16th International Conference on Information Security and Cryptology (Inscrypt 2020), Guangzhou, China, December 11-14, 2020, 2020

CCF 2026 C

Location-privacy-preserving schemes for mobile social networks that use ring signatures to protect users’ identities and whereabouts.

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, Lecture Notes in Computer Science, vol. 12612, pp. 288–303, 2021.

DOI

Compatible Certificateless and Identity-Based Cryptosystems for Heterogeneous IoT.

Published in The 23rd Information Security Conference (ISC) 2020, 16–20 December 2020, 2020

CORE 2026 C CCF 2026 C

Compatible certificateless and identity-based cryptosystems for secure communication across heterogeneous Internet-of-Things 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, Lecture Notes in Computer Science, vol. 12472, pp. 39–58, 2020.

DOI

Address-based Signature.

Published in The 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom 2020) Guangzhou, China, December 29, 2020 - January 1, 2021, 2020

CORE 2026 B CCF 2026 C

An address-based signature scheme for authenticating identities and messages through address-derived cryptographic mechanisms.

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), pp. 884–891, 2020.

DOI

Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup.

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

CORE 2026 B CCF 2026 B

Compact zero-knowledge proofs for threshold ECDSA that avoid a trusted setup while supporting practical collaborative signing.

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.

DOI Preprint

DualRing: Generic Construction of Ring Signatures with Efficient Instantiations.

Published in Crypto 2021, Virtual, Aug 15-19, 2021, 2021

CORE 2026 A* CCF 2026 A

A generic ring-signature framework with efficient constructions that provide signer anonymity without random oracles.

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, vol. 12825, pp. 251–281, 2021.

DOI Code

Security on SM2 and GOST Signatures against Related Key Attacks.

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

CORE 2026 B CCF 2026 C

An analysis of SM2 and GOST signature schemes under related-key attacks, with corresponding security considerations.

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), pp. 155–163, 2021.

DOI

One-more Unforgeability of Blind ECDSA.

Published in The 26th European Symposium on Research in Computer Security, (ESORICS 2021), Virtual, October 4-8, 2021, 2021

CORE 2026 A CCF 2026 B

A security analysis and construction for blind ECDSA that establishes one-more unforgeability.

Recommended citation: Xianrui Qin, Cailing Cai, and Tsz Hon Yuen. “One-More Unforgeability of Blind ECDSA.” In Computer Security – ESORICS 2021, Lecture Notes in Computer Science, vol. 12973, pp. 313–331, 2021.

DOI

Efficient Online-friendly Two-Party ECDSA Signature.

Published in The ACM Conference on Computer and Communications Security, (CCS 2021), Seoul, South Korea, November 15-19, 2021, 2021

CORE 2026 A* CCF 2026 A

An online-friendly two-party ECDSA protocol that improves the practicality of collaborative digital signing.

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, pp. 558–573, 2021.

DOI Preprint

A Trustless GQ Multi-Signature Scheme with Identifiable Abort.

Published in The 26th Australasian Conference on Information Security and Privacy, (ACISP 2021) Perth, Australia, December 1-3, 2021, 2021

CORE 2026 Australasian B CCF 2026 C

A trustless GQ-based multi-signature scheme that identifies participants responsible for an aborted signing session.

Recommended citation: Handong Cui and Tsz Hon Yuen. “A Trustless GQ Multi-Signature Scheme with Identifiable Abort.” In Information Security and Privacy, Lecture Notes in Computer Science, vol. 13090, pp. 673–693, 2021.

DOI

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, December 17-19, 2021., 2021

CORE 2026 C

A zero-knowledge-proof-based contact-tracing protocol for mobile devices that protects users’ privacy during exposure notification.

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, Lecture Notes in Computer Science, vol. 13107, pp. 327–344, 2021.

DOI Preprint

Tight Leakage-Resilient Identity-based Encryption under Multi-challenge Setting.

Published in The ACM Asia Conference on Computer and Communications Security, (AsiaCCS 2022) Nagasaki, Japan, May 30 - June 3, 2022, 2022

CORE 2026 A CCF 2026 B

A leakage-resilient identity-based encryption scheme that supports security in the 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 2022 ACM Asia Conference on Computer and Communications Security, pp. 42–53, 2022.

DOI

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, article e09751, 2022.

Paper DOI

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

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

CORE 2026 B CCF 2026 C

An identity-based encryption construction that strengthens dual-system encryption against polynomial related-key attacks.

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, Lecture Notes in Computer Science, vol. 13269, pp. 419–439, 2022.

DOI

GCD-Filter: Private Set Intersection Without Encryption

Published in The 17th International Conference on Wireless Algorithms, Systems, and Applications, (WASA 2022) Dalian, China, October 28-30, 2022, 2022

CCF 2026 C

A private set-intersection approach based on greatest-common-divisor filtering that avoids conventional encryption operations.

Recommended citation: Mingli Wu and Tsz Hon Yuen. “GCD-Filter: Private Set Intersection Without Encryption.” In Wireless Algorithms, Systems, and Applications, Lecture Notes in Computer Science, vol. 13472, pp. 429–440, 2022.

DOI

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

Published in The 21st International Conference on Cryptology and Network Security, (CANS 2022) Abu Dhabi, UAE, November 13-16, 2022, 2022

CORE 2026 B

An attribute-based anonymous-credential scheme optimised for efficient single-use and multi-use credential presentation.

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, Lecture Notes in Computer Science, vol. 13641, pp. 89–121, 2022.

DOI

Multi-signatures for ECDSA and its Applications in Blockchain

Published in The 27th Australasian Conference on Information Security and Privacy, (ACISP 2022) Wollongong, Australia, November 28-30, 2022, 2022

CORE 2026 Australasian B CCF 2026 C

Multi-signature constructions for ECDSA that support secure joint signing and blockchain applications.

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, Lecture Notes in Computer Science, vol. 13494, pp. 265–285, 2022.

DOI

Hash Proof System With Auxiliary Inputs and Its Application

Published in The 21st IEEE International Conference on Trust, Security and Privacy in Computing and Communications, (Trustcom 2022) Wuhan, China, December 9-11, 2022, 2022

CORE 2026 B CCF 2026 C

A hash-proof system with auxiliary inputs and applications to cryptographic protocols requiring security under additional leakage.

Recommended citation: Cailing Cai, Tsz Hon Yuen, and Siu-Ming Yiu. “Hash Proof System with Auxiliary Inputs and Its Application.” In 2022 IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 52–59, 2022.

Paper DOI

Practical fully leakage resilient signatures with auxiliary inputs.

Published in Future Generation Computer Systems. Volume 141, April 2023, Pages 448-461, 2023

CORE 2020 A CCF 2026 C

A practical digital-signature construction designed to remain secure under continual leakage of auxiliary information.

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.

Paper DOI

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

Published in 44th IEEE Symposium on Security and Privacy, San Francisco, USA. May 22-25, 2023, 2023

CORE 2026 A* CCF 2026 A

A Bitcoin-compatible privacy-preserving payment-channel hub that supports variable-value payments without revealing transaction 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.

DOI Preprint

Bandwidth-Efficient Zero-Knowledge Proofs For Threshold ECDSA.

Published in The Computer Journal. bxad057, 2023

CORE 2020 B CCF 2026 B

Bandwidth-efficient zero-knowledge proofs that reduce communication costs in threshold ECDSA protocols.

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.

Paper DOI

Scored Anonymous Credentials.

Published in 21st International Conference on Applied Cryptography and Network Security (ACNS 2023). Kyoto, Japan. June 19-22, 2023, 2023

CORE 2026 B CCF 2026 C

An anonymous-credential system that supports score-based attributes while preserving privacy during credential presentation.

Recommended citation: Sherman S. M. Chow, Jack P. K. Ma, and Tsz Hon Yuen. “Scored Anonymous Credentials.” In Applied Cryptography and Network Security, Lecture Notes in Computer Science, vol. 13906, pp. 484–515, 2023.

Paper DOI

Practical Verifiable Random Function with RKA Security.

Published in 28th Australasian Conference on Information Security and Privacy, ACISP 2023. Brisbane, Australia, July 5–7, 2023, 2023

CORE 2026 Australasian B CCF 2026 C

A practical verifiable-random-function construction that remains 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, Lecture Notes in Computer Science, vol. 13915, pp. 503–522, 2023.

DOI

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

Published in The 32nd USENIX Security Symposium (USENIX 2023). Anaheim, US. August 9-11, 2023, 2023

CORE 2026 A* CCF 2026 A

An efficient unbalanced private set-intersection cardinality protocol with an application to privacy-preserving contact tracing.

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

Paper

DIDO: Data Provenance from Restricted TLS 1.3 Websites.

Published in Information Security Practice and Experience - 18th International Conference, ISPEC 2023. Copenhagen, Denmark. August 24-25, 2023, 2023

CORE 2026 C

A data-provenance framework for restricted TLS 1.3 websites that enables authenticated evidence from web content.

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, Lecture Notes in Computer Science, vol. 14341, pp. 154–169, 2023.

DOI

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

Published in The 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023. Copenhagen, Denmark. November 26-30, 2023, 2023

CORE 2026 A* CCF 2026 A

A multiplicative-to-additive function derived from the Joye-Libert cryptosystem for efficient threshold ECDSA protocols.

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, pp. 2974–2988, 2023.

DOI

Message Control for Blockchain Rewriting.

Published in IEEE Transactions on Dependable and Secure Computing. March 2024, 2024

CORE 2020 A CCF 2026 A

A message-control mechanism for blockchain rewriting that supports controlled modifications while maintaining security and accountability.

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.

Paper DOI

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

Published in The 19th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS 2024). Singapore. July 1-5, 2024, 2024

CORE 2026 A CCF 2026 B

A full-security treatment of chameleon hashes, including constructions and analysis for the multi-party setting.

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, pp. 1066–1081, 2024.

DOI Code

zkMatrix: Batched Short Proof for Committed Matrix Multiplication.

Published in The 19th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS 2024). Singapore. July 1-5, 2024, 2024

CORE 2026 A CCF 2026 B

A batched zero-knowledge proof system for efficiently verifying committed matrix-multiplication computations.

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, pp. 289–305, 2024.

Paper DOI

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

Published in 33rd USENIX Security Symposium. USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024, 2024

CORE 2026 A* CCF 2026 A

Efficient multi-party private set-intersection protocols that support scalable set matching while protecting participants’ inputs.

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

Paper

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

Published in The 18th International Conference on Provable and Practical Security (ProvSec 2024), Gold Coast, Australia. September 25-27, 2024, 2024

CORE 2026 C

A threshold ring-signature construction that extends DualRing to support threshold signing with anonymity among ring members.

Recommended citation: Tsz Hon Yuen and Shimin Pan. “Threshold Ring Signatures: From DualRing to the t+1 Rings.” In Provable and Practical Security, Lecture Notes in Computer Science, vol. 14903, pp. 269–288, 2025.

DOI

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.

Paper DOI

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.

Paper DOI

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

Published in IEEE Transactions on Dependable and Secure Computing, 2025

CORE 2020 A CCF 2026 A

A data-provenance system for restricted TLS 1.3 websites that enables selective disclosure of authenticated web content.

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.

Paper DOI

SoK: A Deep Dive into Anti-Money Laundering Techniques for Blockchain Cryptocurrencies.

Published in The 30th Australasian Conference on Information Security and Privacy (ACISP 2025). July 14 - 16, 2025, Wollongong, Australia, 2025

CORE 2026 Australasian B CCF 2026 C

A systematisation of anti-money-laundering techniques for blockchain cryptocurrencies, covering detection methods, limitations, and future directions.

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, Lecture Notes in Computer Science, vol. 15658, pp. 310–330, 2025.

DOI

Efficient Private Set Intersection by Utilizing Oblivious Transfer Extension.

Published in ACM Asia Conference on Computer and Communications Security (ASIA CCS ’25). August 25–29, 2025, Hanoi, Vietnam, 2025

CORE 2026 A CCF 2026 B

An efficient private set-intersection protocol that uses oblivious-transfer extension to reduce the cost of secure set matching.

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.

DOI

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

Published in The 19th International Conference on Provable and Practical Security (Provsec 2025). October 10 - 12, 2025, Yokohama, Japan, 2025

CORE 2026 C

A non-interactive encrypted conjunctive-search scheme that reduces leakage and storage costs for practical encrypted-data retrieval.

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, Lecture Notes in Computer Science, vol. 16172, pp. 329–349, 2026.

DOI Preprint

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

Published in The 19th International Conference on Provable and Practical Security (Provsec 2025). October 10 - 12, 2025, Yokohama, Japan, 2025

CORE 2026 C

A SNARK-friendly post-quantum signature scheme built from power-residue pseudorandom functions.

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, Lecture Notes in Computer Science, vol. 16172, pp. 111–129, 2026.

DOI

Posterior Security: Anonymity and Message Hiding of Standard Signatures.

Published in ACM Conference on Computer and Communications Security (CCS 2025). October 13 - 17, 2025, Taipei, Taiwan, 2025

CORE 2026 A* CCF 2026 A

A study of posterior security properties that provides anonymity and message hiding for standard digital-signature constructions.

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.

DOI Preprint

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

Published in The International Conference on the Theory and Application of Cryptology and Information Security 2025 (Asiacrypt 2025). December 8 - 12, 2025, Melbourne, Australia, 2025

CORE 2026 A CCF 2026 B

A generic zkSNARK framework for scalable verification of matrix computations, with applications to verifiable deep-learning workloads.

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.

DOI Preprint

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.

Paper DOI Preprint

Measuring Memecoin Fragility.

Published in IEEE International Conference on Blockchain and Cryptocurrency 2026 (ICBC 2026). June 1 - 5, 2026, Brisbane, Australia, 2026

CORE 2026 C

An empirical study that characterises and measures the structural and market fragility of memecoin ecosystems.

Recommended citation: Yuexin Xiang, Qishuang Fu, Yuquan Li, Qin Wang, Tsz Hon Yuen, and Jiangshan Yu. “Measuring Memecoin Fragility.” In Proceedings of the 2026 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), pp. 1–5, 2026.

DOI Preprint

SoK: Stablecoins in Retail Payments.

Published in IEEE International Conference on Blockchain and Cryptocurrency 2026 (ICBC 2026). June 1 - 5, 2026, Brisbane, Australia, 2026

CORE 2026 C

A systematisation of stablecoins in retail payments, examining their designs, payment roles, risks, and open research challenges.

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

DOI

GumSwap: Griefing-Free Universal Multi-Party Atomic Swaps

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

CORE 2026 A CCF 2026 B

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.

DOI Preprint

OblivSage: Oblivious Graph Sampling for Privacy-Preserving GNN

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

CORE 2026 Australasian B CCF 2026 C

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.

DOI

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.

Preprint

SuccinCT: Succinct Confidential Transaction for Miner Privacy.

Published in 31st European Symposium on Research in Computer Security (ESORICS) 2026. September 14-18, 2026, Rome, Italy, 2026

CORE 2026 A CCF 2026 B

A succinct confidential-transaction design that protects miner privacy while preserving the verifiability of blockchain transactions.

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.

HedgeSwap: Universal Hedged Atomic Swaps Against Griefing Attack.

Published in 31st European Symposium on Research in Computer Security (ESORICS) 2026. September 14-18, 2026, Rome, Italy, 2026

CORE 2026 A CCF 2026 B

A universal atomic-swap protocol designed to prevent griefing attacks while supporting secure cross-chain asset exchanges.

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 Attack. To appear in 31st European Symposium on Research in Computer Security (ESORICS) 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

CORE 2026 C CCF 2026 C

A private set-union protocol that uses trusted execution environments to enable efficient privacy-preserving aggregation across multiple parties.

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.

FlowShield: cryptocurrency anti-money laundering with transaction semantics parsing and fund flow tracking.

Published in The IEEE International Conference on Data Mining (ICDM) 2026. November 12-15, 2026, Shanghai, China, 2026

CORE 2026 A* CCF 2026 B

A transaction-semantics and fund-flow analysis framework for detecting and investigating money-laundering activity in cryptocurrency systems.

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 the IEEE International Conference on Data Mining (ICDM) 2026.

Verifiable Weighted Secret Sharing based on Chinese Remainder Theorem.

Published in Asiacrypt 2026. December 7-11, 2026, Hong Kong, China, 2026

CORE 2026 A CCF 2026 B

A verifiable weighted secret-sharing construction based on the Chinese remainder theorem that supports weighted reconstruction and participant accountability.

Recommended citation: Xinyu Zhang, Weiping Ji, Tsz Hon Yuen, Ron Steinfeld, Joseph K. Liu and Shujie Cui. Verifiable Weighted Secret Sharing based on Chinese Remainder Theorem. To appear in Asiacrypt 2026.

talks

Blockchain: How crypto meets the industry?

Published:

Blockchain, the core component of Bitcoin, has been extremely popular among the finance, supply chain and many other industries in the last few years. Many governments and companies are experimenting blockchain with proof of concepts. The growing interest in blockchain drives a lot of new security research areas, including security model and analysis of blockchain, consensus algorithms built from cryptographic primitives, privacy enhancing technologies in blockchain (e.g. linkable ring signatures, zk-SNARKs), etc. There are still some gap between the research community and the blockchain applications. In this talk, we will introduce some challenges we faced, such as implementation difficulties, research problems and application level challenges. We present our views and some solutions on these issues.

Privacy-Enhancing Consortium Blockchain

Published:

Blockchain provides an immutable, global transaction history in distributed system. All transactions can be seen by all of the nodes on the network. However, it may not be desirable in business use cases that require strong privacy. In public blockchain, several cryptographic techniques are used to provide anonymity of users and confidentiality of transaction amount (such as linkable ring signature in Monero, and zk-SNARK in ZCash). However, they are not efficient enough for systems with high throughput. Therefore, we propose and implement some new privacy-enhancing techniques which can be used in consortium blockchain.

zkMatrix: Batched Short Proof for Committed Matrix Multiplication

Published:

Matrix multiplication is a common operation in applications like machine learning and data analytics. To demonstrate the correctness of such an operation in a privacy-preserving manner, we propose zkMatrix, a zero-knowledge proof for the multiplication of committed matrices. Among the succinct non-interactive zero-knowledge protocols that have an O(log n) transcript size and O(log n) verifier time, zkMatrix stands out as the first to achieve O(n^2) prover time and O(n^2) RAM usage for multiplying two n×n matrices. Significantly, zkMatrix distinguishes itself as the first zk-SNARK protocol specifically designed for matrix multiplication. By batching multiple proofs together, each additional matrix multiplication only necessitates O(n) group operations in prover time.

AML Challenges in Cryptocurrency Transactions

Published:

Traditional AML struggles in cryptocurrency transactions. In this talk, we understand the structural differences between traditional finance and cryptocurrency. It demonstrate the need for the use of AI-based detection.

AML Challenges in Cryptocurrency Transactions (2)

Published:

Traditional AML struggles in cryptocurrency transactions. In this talk, we understand the structural differences between traditional finance and cryptocurrency. It demonstrate the need for the use of AI-based detection.

Implications of Cryptocurrencies for the Pacific

Published:

This talk examines how cryptocurrencies, digital assets, blockchain technologies, and broader digital finance developments may affect Pacific Island Countries. The Pacific presents a particularly interesting context because many countries face a combination of financial exclusion, high remittance dependence, geographic isolation, limited banking access, and increasing digital connectivity.

teaching

COMP4801. Final Year Project 2018-19

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2018

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

COMP3320. Electronic Commerce Technology. [2018 - 2022]

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2019

This course aims to help students to understand the technical and managerial challenges they will face as electronic commerce becomes a new locus of economics activities. Topics include Internet and WWW technology, information security technologies, public-key crypto-systems, public-key infrastructure, electronic payment systems, and electronic commerce activities in different sectors.

FITE 1010. Introduction to Financial Technologies. [2019 - 2023]

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2019

This course introduces the basic concepts of financial technologies, including money and payment, digital finance and alternative finance. Major technological trends, such as e-payment system, cryptocurrency, blockchain, data mining and artificial intelligence, are introduced. Students are expected to understand recent FinTech developments and its impact in the financial industries.

COMP4801. Final Year Project 2019-20

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2019

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

ECOM 7001. MSc(ECom&IComp) Case Study Project [2020 - 2022]

Graduate course, Department of Computer Science, The University of Hong Kong, 2020

The case study project is to provide an opportunity for the student to dive in depth into either a business case or a technology development in the e-commerce and Internet computing, and apply their body of knowledge learned in the programme to understand and critically analysis the particular case. This would involve substantive research into the “Subject”, collect appropriate data by suitable means, research into reports and publicly available information, and consolidate their findings and conclusion in a case study report.

FITE 7001. MSc(FTDA) Project [2022]

Graduate course, Department of Computer Science, The University of Hong Kong, 2020

This project-based course aims to provide students with capstone experience to work on a real-world problem and carry out a substantial fintech project which requires integration of the knowledge they have learnt in the curriculum. Students will work in small groups under the guidance of their supervisor(s). A substantial written report is required.

COMP4801. Final Year Project 2020-21

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2020

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

DASC7600. MDASC Data science project. [2020 - 2023]

Graduate course, Department of Statistics and Actuarial Science, The University of Hong Kong, 2020

This course is designed for students of the Master of Data Science Programme. Students enrolled in DASC7600 Data Science Project are expected to work in a small group on a provided or self-proposed project under the supervision of their supervisor.

COMP7705. MSc(CompSc) Project [2020 - 2022]

Graduate course, Department of Computer Science, The University of Hong Kong, 2020

Candidate will be required to carry out independent work on a major project under the supervision of individual staff member. A written report is required.

COMP4801. Final Year Project 2021-22

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2021

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

COMP4801/FITE4801. Final Year Project 2022-23

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2022

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

COMP4805. CS 2nd Major Project 2022

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2022

Student individuals or groups, during the final year of their studies, undertake full end-to-end development of a substantial project, taking it from initial concept through to final delivery. Topics range from applied software development to assignments on basic research. In case of a team project, significant contribution is required from each member and students are assessed individually, such that each student is given a separate project title. Strict standards of quality will be enforced throughout the project development.

FITE2010. Distributed Ledger & Blockchain. [2022]

Undergraduate course, Department of Computer Science, The University of Hong Kong, 2022

This course aims to help students to identify key components behind the design of a distributed ledger (and blockchain) and evaluate different designs/solutions for implementing a distributed ledger. The student will understand the types of applications that best fit the model of distributed ledger; program applications on some popular platforms; understand the technologies behind different cryptocurrencies, their applications, and related issues (e.g. Regulations).

FITE7409. Blockchain and cryptocurrency. [2022-2023]

Postgraduate course, Department of Computer Science, The University of Hong Kong, 2023

Identify key components behind the design of blockchain and to understand the types of applications that best fit the model of blockchain. Understand why blockchain is considered “secure” and “immutable” and the design of Bitcoin and other cryptocurrencies. Understand the limitations, pros and cons of blockchains and cryptocurrencies, their downsides, and possible enhancements.

FIT9130. Systems analysis and design. [2024]

Postgraduate course, Department of Software Systems and Cybersecurity, Monash University, 2024

This unit introduces students to the key principles which underlie the analysis and design of information systems to support business and other organisational undertakings. It covers design and design thinking, requirements elicitation, consulting skills and conceptual and logical systems modelling.

FIT9138. Information systems analysis, design and systems thinking. [2025]

Postgraduate course, Department of Software Systems and Cybersecurity, Monash University, 2025

This unit aims to introduce students to human-centred information systems design, design thinking process and a way of making sense of the interrelated parts of a system and how the system works over time. Students will practice designing an information system by applying the design concepts introduced in this unit.

FIT9137. Introduction to computer architecture and networks. [2026]

Postgraduate course, Department of Software Systems and Cybersecurity, Monash University, 2026

This unit introduces students to fundamentals of computer systems, with a focus on two modules: Module 1 (computer architecture and modern operating systems) and Module 2 (networking technology). Module 1 covers: CPU, memory, storage and peripherals; and operating system basics. Module 2 covers: TCP/IP layered protocols; networking fundamentals such as LAN and WLAN; internetworking and transport protocols; and basic concepts of computer and network security.

FIT1093. Cybersecurity tools and techniques. [2026]

Undergraduate course, Department of Software Systems and Cybersecurity, Monash University, 2026

This unit will provide students with an introduction to fundamental tools and techniques for designing secure systems. Students will learn how common cryptographic encryption and authentication algorithms work, their limitations and common pitfalls, and how to apply them to protect against confidentiality and integrity threats. Students will learn how to apply and evaluate techniques for user authentication and access control to protect systems against unauthorised access. Students will further learn about common security vulnerabilities in software systems, how attackers can exploit such vulnerabilities, and how software vulnerabilities can be identified and protected against. Additionally, students will be required to analyse and assess recent developments and future trends in cyber security technologies.