Kang Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kang Yang has a total of 82 co-authors. Here are the top co-authors by number of shared publications:
- Yu Yu
Shanghai Jiao Tong University, Shanghai, China
16 shared publications - Xiao Wang
Northwestern University, Evanston, USA
13 shared publications - Hanlin Liu
Northwestern University
6 shared publications - Jiang Zhang
State Key Laboratory of Cryptology
4 shared publications - Xiang Xie
Primus Labs
4 shared publications - Chenkai Weng
Arizona State University, Tempe, USA
3 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1831-1846
STRIDE: Efficient Secure Transformer Inference via Inter-Operator Protocol and Operator Co-Design
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1831-1846
Open AccessSTRIDE: Efficient Secure Transformer Inference via Inter-Operator Protocol and Operator Co-Design
- 12 August 2026
- Published by Springer Nature
- p. 3-35
Unconditionally Secure MPC for Boolean Circuits with Constant Communication
- 12 August 2026
- Published by Springer Nature
- p. 3-35
Unconditionally Secure MPC for Boolean Circuits with Constant Communication
- 23 May 2026
- Published by Springer Nature
- p. 191-222
Concretely Efficient Fluid MPC with Linear Communication
- 23 May 2026
- Published by Springer Nature
- p. 191-222
Concretely Efficient Fluid MPC with Linear Communication
- 7 May 2026
- Published by Springer Nature
- p. 214-242
HERDS: Multi-key Fully Homomorphic Encryption with Sublinear Bootstrapping
- 7 May 2026
- Published by Springer Nature
- p. 214-242
HERDS: Multi-key Fully Homomorphic Encryption with Sublinear Bootstrapping
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4121-4135
M&M: Secure Two-Party Machine Learning Through Modulus Conversion and Mixed-Mode Protocols
Secure two-party machine learning has made substantial progress through the use of mixed-mode protocols, but existing approaches often suffer from efficiency bottlenecks due to inherent mismatch between optimal domains of various cryptographic primitives. In response to these challenges, we introduce framework M&M, which features an efficient modulus conversion protocol. This breakthrough enables seamless integration of the most suitable cryptographic subprotocols within their optimal modulus domains with a minimal modulus conversion overhead. We further establish new benchmarks and practical optimizations for the performance of fundamental primitives, namely comparison and multiplication, across various two-party techniques.By incorporating these techniques, M&M demonstrates significant performance enhancements over state-of-the-art solutions: i) we report a $6\times$-$100\times$ improvement for approximated truncations with 1-bit error tolerance; ii) an average of $5\times$ (resp. $4\times$) reduction in communication (resp. runtime) for machine learning functions; iii) and a 25%-99% improvement in cost-efficiency for private inference of deep neural networks and 50% improvement in private training of gradient boosting decision trees.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (2) , 4121-4135
M&M: Secure Two-Party Machine Learning Through Modulus Conversion and Mixed-Mode Protocols
Secure two-party machine learning has made substantial progress through the use of mixed-mode protocols, but existing approaches often suffer from efficiency bottlenecks due to inherent mismatch between optimal domains of various cryptographic primitives. In response to these challenges, we introduce framework M&M, which features an efficient modulus conversion protocol. This breakthrough enables seamless integration of the most suitable cryptographic subprotocols within their optimal modulus domains with a minimal modulus conversion overhead. We further establish new benchmarks and practical optimizations for the performance of fundamental primitives, namely comparison and multiplication, across various two-party techniques.By incorporating these techniques, M&M demonstrates significant performance enhancements over state-of-the-art solutions: i) we report a $6\times$-$100\times$ improvement for approximated truncations with 1-bit error tolerance; ii) an average of $5\times$ (resp. $4\times$) reduction in communication (resp. runtime) for machine learning functions; iii) and a 25%-99% improvement in cost-efficiency for private inference of deep neural networks and 50% improvement in private training of gradient boosting decision trees.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3635-3648
Committed Vector Oblivious Linear Evaluation and Its Applications
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 3635-3648
Open AccessCommitted Vector Oblivious Linear Evaluation and Its Applications
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 354-368
Ironman: Accelerating Oblivious Transfer Extension for Privacy-Preserving AI with Near-Memory Processing
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 354-368
Open AccessIronman: Accelerating Oblivious Transfer Extension for Privacy-Preserving AI with Near-Memory Processing
- 17 August 2025
- Published by Springer Nature
- p. 652-687
Authenticated BitGC for Actively Secure Rate-One 2PC
- 17 August 2025
- Published by Springer Nature
- p. 652-687
Authenticated BitGC for Actively Secure Rate-One 2PC
- 12 May 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 3375-3412
On tweakable correlation robust hashing against key leakages
- 12 May 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (8) , 3375-3412
On tweakable correlation robust hashing against key leakages