Yang Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yang Li has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Qing Wang
The Australian National University
3 shared publications - Baobao Song
University of Technology Sydney
2 shared publications - Gang Li
Deakin University
2 shared publications - Gathika Ratnayaka
The Australian National University
2 shared publications - James Nichols
The Australian National University
2 shared publications - Kee Siong Ng
Australian National University
2 shared publications
Latest Publications
- Open Access
- 30 June 2026
- Published by Elsevier in Journal of Economic Criminology
- Vol. 13
Privacy technologies for financial intelligence
- 30 June 2026
- Published by Elsevier in Journal of Economic Criminology
- Vol. 13
Open AccessPrivacy technologies for financial intelligence
- Open Access
- 1 February 2026
- Published by Springer Nature
- p. C1
Correction to: Solving Partial Graph Matching as a Stable Matching Problem
- 1 February 2026
- Published by Springer Nature
- p. C1
Open AccessCorrection to: Solving Partial Graph Matching as a Stable Matching Problem
- 25 November 2025
- Published by Springer Nature
- p. 458-470
Solving Partial Graph Matching as a Stable Matching Problem
- 25 November 2025
- Published by Springer Nature
- p. 458-470
Solving Partial Graph Matching as a Stable Matching Problem
- 25 October 2025
- Published by Springer Nature
- p. 213-217
Private LGBTQ Searches Without a Trace
- 25 October 2025
- Published by Springer Nature
- p. 207-212
Optimized Noise Bound in BFV Homomorphic Encryption
- 25 October 2025
- Published by Springer Nature
- p. 207-212
Optimized Noise Bound in BFV Homomorphic Encryption
- Open Access
- 22 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (11) , 1-39
Private Graph Data Release: A Survey
The application of graph analytics to various domains has yielded tremendous societal and economical benefits in recent years. However, the increasingly widespread adoption of graph analytics comes with a commensurate increase in the need to protect private information in graph data, especially in light of the many privacy breaches in real-world graph data that were supposed to preserve sensitive information. This article provides a comprehensive survey of private graph data release algorithms that seek to achieve the fine balance between privacy and utility, with a specific focus on provably private mechanisms. Many of these mechanisms are natural extensions of the Differential Privacy framework to graph data, but we also investigate more general privacy formulations like Pufferfish Privacy that address some of the limitations of Differential Privacy. We also provide a wide-ranging survey of the applications of private graph data release mechanisms to social networks, finance, supply chain, and health care. This article should benefit practitioners and researchers alike in the increasingly important area of private analytics and data release.
- 22 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 55 (11) , 1-39
Open AccessPrivate Graph Data Release: A Survey
The application of graph analytics to various domains has yielded tremendous societal and economical benefits in recent years. However, the increasingly widespread adoption of graph analytics comes with a commensurate increase in the need to protect private information in graph data, especially in light of the many privacy breaches in real-world graph data that were supposed to preserve sensitive information. This article provides a comprehensive survey of private graph data release algorithms that seek to achieve the fine balance between privacy and utility, with a specific focus on provably private mechanisms. Many of these mechanisms are natural extensions of the Differential Privacy framework to graph data, but we also investigate more general privacy formulations like Pufferfish Privacy that address some of the limitations of Differential Privacy. We also provide a wide-ranging survey of the applications of private graph data release mechanisms to social networks, finance, supply chain, and health care. This article should benefit practitioners and researchers alike in the increasingly important area of private analytics and data release.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 503-513
Distributed Differentially Private Ranking Aggregation
A key step in cooperative decision-making is for all participants to achieve a consensus that avoids individual favoritism. To reach a consensus, a quantitative systematic mechanism is sometimes preferred. An example of such a mechanism is ranking aggregation, where the task is to rank elements in a certain order. While participating in ranking activities, it is also critical under certain circumstances to protect each decision maker’s preference. A promising privacy-preserving technique that is suitable for such a need is differential privacy (DP), which ensures plausible deniability of the protected information with rigorous mathematical guarantee and adjustable privacy level. A concern of the standard DP model is its assumption of letting a curator collect and analyze sensitive information, where in practical situations such a trusted independent curator may not exist. This article proposed a mechanism to solve the above issue using the distributed DP (DDP) framework. The proposed mechanism collects locally differential private rankings from individuals, and then randomly permutes pairwise rankings using a shuffle model to further amplify privacy protection. The final representative is produced by hierarchical rank aggregation (HRA). The mechanism was theoretically analyzed and experimentally compared against the existing methods and demonstrated competitive results in both output accuracy and privacy protection.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (1) , 503-513
Distributed Differentially Private Ranking Aggregation
A key step in cooperative decision-making is for all participants to achieve a consensus that avoids individual favoritism. To reach a consensus, a quantitative systematic mechanism is sometimes preferred. An example of such a mechanism is ranking aggregation, where the task is to rank elements in a certain order. While participating in ranking activities, it is also critical under certain circumstances to protect each decision maker’s preference. A promising privacy-preserving technique that is suitable for such a need is differential privacy (DP), which ensures plausible deniability of the protected information with rigorous mathematical guarantee and adjustable privacy level. A concern of the standard DP model is its assumption of letting a curator collect and analyze sensitive information, where in practical situations such a trusted independent curator may not exist. This article proposed a mechanism to solve the above issue using the distributed DP (DDP) framework. The proposed mechanism collects locally differential private rankings from individuals, and then randomly permutes pairwise rankings using a shuffle model to further amplify privacy protection. The final representative is produced by hierarchical rank aggregation (HRA). The mechanism was theoretically analyzed and experimentally compared against the existing methods and demonstrated competitive results in both output accuracy and privacy protection.
- Open Access
A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption
Why study Lattice-based Cryptography? There are a few ways to answer this question. 1. It is useful to have cryptosystems that are based on a variety of hard computational problems so the different cryptosystems are not all vulnerable in the same way. 2. The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3. Lattice-based cryptosystems have lower encryption/decryption computational complexities compared to popular cryptosystems that are based on the integer factorisation or the discrete logarithm problems. 4. Lattice-based cryptosystems enjoy strong worst-case hardness security proofs based on approximate versions of known NP-hard lattice problems. 5. Lattice-based cryptosystems are believed to be good candidates for post-quantum cryptography, since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best-known classical (non-quantum) algorithms, unlike for integer factorisation and (elliptic curve) discrete logarithm problems. 6. Last but not least, interesting structures in lattice problems have led to significant advances in Homomorphic Encryption, a new research area with wide-ranging applications.
Open AccessA Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption
Why study Lattice-based Cryptography? There are a few ways to answer this question. 1. It is useful to have cryptosystems that are based on a variety of hard computational problems so the different cryptosystems are not all vulnerable in the same way. 2. The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3. Lattice-based cryptosystems have lower encryption/decryption computational complexities compared to popular cryptosystems that are based on the integer factorisation or the discrete logarithm problems. 4. Lattice-based cryptosystems enjoy strong worst-case hardness security proofs based on approximate versions of known NP-hard lattice problems. 5. Lattice-based cryptosystems are believed to be good candidates for post-quantum cryptography, since there are currently no known quantum algorithms for solving lattice problems that perform significantly better than the best-known classical (non-quantum) algorithms, unlike for integer factorisation and (elliptic curve) discrete logarithm problems. 6. Last but not least, interesting structures in lattice problems have led to significant advances in Homomorphic Encryption, a new research area with wide-ranging applications.
- 10 May 2022
- Published by Springer Nature
- p. 194-207
dK-Personalization: Publishing Network Statistics with Personalized Differential Privacy
- 10 May 2022
- Published by Springer Nature
- p. 194-207
dK-Personalization: Publishing Network Statistics with Personalized Differential Privacy