A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor. - Ning Ding 001; Dawu Gu (Inscrypt, 2007)

Non-malleable Statistically Hiding Commitment from Any One-Way Function. - Zongyang Zhang; Zhenfu Cao; Ning Ding 001; Rong Ma (ASIACRYPT, 2009)

Precise Time and Space Simulatable Zero-Knowledge. - Ning Ding 001; Dawu Gu (IACR Cryptol. ePrint Arch., 2009)

Precise Bounded-Concurrent Zero-Knowledge in Almost Constant Rounds. - Ning Ding 001; Dawu Gu; Bart Preneel (IACR Cryptol. ePrint Arch., 2009)

On Obfuscating Programs with Tamper-proof Hardware. - Ning Ding 001; Dawu Gu (Inscrypt, 2010)

Disguisable Symmetric Encryption Schemes for an Anti-forensics Purpose. - Ning Ding 001; Dawu Gu; Zhiqiang Liu 001 (e-Forensics, 2010)

Precise bounded-concurrent zero-knowledge proofs for NP. - Ning Ding 001; Dawu Gu (Sci. China Inf. Sci., 2010)

A Note on (Im)Possibilities of Obfuscating Programs of Zero-Knowledge Proofs of Knowledge. - Ning Ding 001; Dawu Gu (CANS, 2011)

A General and Efficient Obfuscation for Programs with Tamper-Proof Hardware. - Ning Ding 001; Dawu Gu (ISPEC, 2011)

A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-Encryption. - Ning Ding 001; Dawu Gu (TAMC, 2011)

On Improving the Performance of Public Key Encryption with Keyword Search. - Bin Long; Dawu Gu; Ning Ding 001; Haining Lu (CDC, 2012)

Phrase Search over Encrypted Data with Symmetric Encryption Scheme. - Yinqi Tang; Dawu Gu; Ning Ding 001; Haining Lu (ICDCS Workshops, 2012)

On Constant-Round Precise Zero-Knowledge. - Ning Ding 001; Dawu Gu (ICICS, 2012)

Efficient Ciphertext-Policy Attribute Based Encryption with Hidden Policy. - Xiaohui Li; Dawu Gu; Yanli Ren; Ning Ding 001; Kan Yuan (IDCS, 2012)

Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge. - Ning Ding 001 (Inscrypt, 2014)

Obfuscation-Based Non-Black-Box Extraction and Constant-Round Zero-Knowledge Arguments of Knowledge. - Ning Ding 001 (ISC, 2014)

On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits. - Ning Ding 001 (ICITS, 2015)

Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits. - Ning Ding 001 (TAMC, 2015)

Verifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability. - Yanli Ren; Ning Ding 001; Xinpeng Zhang 001; Haining Lu; Dawu Gu (AsiaCCS, 2016)

Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits. - Ning Ding 001; Yanli Ren; Dawu Gu (COCOON, 2016)

New algorithms for verifiable outsourcing of bilinear pairings. - Yanli Ren; Ning Ding 001; Tian-Yin Wang; Haining Lu; Dawu Gu (Sci. China Inf. Sci., 2016)

Identity-Based Encryption with Verifiable Outsourced Revocation. - Yanli Ren; Ning Ding 001; Xinpeng Zhang 001; Haining Lu; Dawu Gu (Comput. J., 2016)

PAC Learning Depth-3 $ textrm{AC}^0$ Circuits of Bounded Top Fanin. - Ning Ding 001; Yanli Ren; Dawu Gu (ALT, 2017)

A Modified Fuzzy Fingerprint Vault Based on Pair-Polar Minutiae Structures. - Xiangmin Li; Ning Ding 001; Haining Lu; Dawu Gu; Shanshan Wang; Beibei Xu; Yuan Yuan; Siyun Yan (Inscrypt, 2017)

Agnostically Learning Boolean Functions with Finite Polynomial Representation. - Ning Ding 001 (ISAAC, 2017)

Learning AC0 Under k-Dependent Distributions. - Ning Ding 001; Yanli Ren; Dawu Gu (TAMC, 2017)

Secure Scheme Against Compromised Hash in Proof-of-Work Blockchain. - Fengjun Chen; Zhiqiang Liu 001; Yu Long 001; Zhen Liu 008; Ning Ding 001 (NSS, 2018)

On Exactly Learning Disjunctions and DNFs Without Equivalence Queries. - Ning Ding 001 (COCOON, 2019)

Multi-Party Private Set Intersection in Vertical Federated Learning. - Linpeng Lu; Ning Ding 001 (TrustCom, 2020)

Horizontal Privacy-Preserving Linear Regression Which is Highly Efficient for Dataset of Low Dimension. - Linpeng Lu; Ning Ding 001 (AsiaCCS, 2021)

Privacy-Preserving Support Vector Machines with Flexible Deployment and Error Correction. - Weican Huang; Ning Ding 001 (ISPEC, 2021)

New cryptographic hardness for learning intersections of halfspaces over boolean cubes with membership queries. - Ning Ding 001; Dawu Gu (Inf. Comput., 2021)

Practical Multi-party Private Set Intersection Cardinality and Intersection-Sum Under Arbitrary Collusion. - You Chen; Ning Ding 001; Dawu Gu; Yang Bian (Inscrypt, 2022)

${ sf PBT}$PBT: A New Privacy-Preserving Payment Protocol for Blockchain Transactions. - Yanxue Jia; Shifeng Sun 001; Yuncong Zhang; Qingzhao Zhang; Ning Ding 001; Zhiqiang Liu 001; Joseph K. Liu; Dawu Gu (IEEE Trans. Dependable Secur. Comput., 2022)

Multi-source domain generalization for degradation monitoring of journal bearings under unseen conditions. - Ning Ding 001; Hulin Li; Qi Xin; Bo Wu; Dan Jiang (Reliab. Eng. Syst. Saf., 2023)

MD-ML: Super Fast Privacy-Preserving Machine Learning for Malicious Security with a Dishonest Majority. - Boshi Yuan 002; Shixuan Yang; Yongxiang Zhang; Ning Ding 001; Dawu Gu; Shi-Feng Sun 001 (USENIX Security Symposium, 2024)

Practical multi-party private set intersection cardinality and intersection-sum protocols under arbitrary collusion. - You Chen; Ning Ding 001; Dawu Gu; Yang Bian (J. Comput. Secur., 2025)