Weak Invertibiity of Finite Automata and Cryptanalysis on FAPKC. - Zong-Duo Dai; Dingfeng Ye; Kwok-Yan Lam (ASIACRYPT, 1998)

Cryptanalysis of "2 R" Schemes. - Dingfeng Ye; Kwok-Yan Lam; Zong-Duo Dai (CRYPTO, 1999)

Cryptanalysis of the m-Permutation Protection Schemes. - Hongjun Wu 001; Feng Bao 001; Dingfeng Ye; Robert H. Deng (ACISP, 2000)

Cryptanalysis of Polynominal Authentication and Signature Scheme. - Hongjun Wu 001; Feng Bao 001; Dingfeng Ye; Robert H. Deng (ACISP, 2000)

Attacks on Two Digital Signature Schemes Based on Error Correcting Codes. - Dingfeng Ye; Junhui Yang; Zongduo Dai; Haiwen Ou (ICICS, 2001)

Decomposing Attacks on Asymmetric Cryptography Based on Mapping Compositions. - Dingfeng Ye; Zongduo Dai; Kwok-Yan Lam (J. Cryptol., 2001)

Perturbed Hidden Matrix Cryptosystems. - Zhiping Wu; Jintai Ding; Jason E. Gower; Dingfeng Ye (ICCSA (2), 2005)

Perturbed Variant of TTM Cryptosystem. - Zhiping Wu; Dingfeng Ye; Weiju Ma (J. Comput. Res. Dev., 2006)

Provably Secure Convertible Nominative Signature Scheme. - Wei Zhao; Changlu Lin; Dingfeng Ye (Inscrypt, 2008)

Modified Huang-Wang's Convertible Nominative Signature Scheme. - Wei Zhao; Dingfeng Ye (IACR Cryptol. ePrint Arch., 2008)

Anonymous Identity Based Encryption with Plaintext Awareness in the Two Identities Setting. - Changlu Lin; Yong Li 002; Qiupu Zhang; Dingfeng Ye (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Ideal Perfect Multilevel Threshold Secret Sharing Scheme. - Changlu Lin; Lein Harn; Dingfeng Ye (IAS, 2009)

Delegate predicate encryption and its application to anonymous authentication. - Ribao Wei; Dingfeng Ye (AsiaCCS, 2009)

Pairing-Based Nominative Signatures with Selective and Universal Convertibility. - Wei Zhao; Dingfeng Ye (Inscrypt, 2009)

Information-theoretically Secure Strong Verifiable Secret Sharing. - Changlu Lin; Lein Harn; Dingfeng Ye (SECRYPT, 2009)

Another Elliptic Curve Model for Faster Pairing Computation. - Lijun Zhang 013; Kunpeng Wang 001; Hong Wang; Dingfeng Ye (ISPEC, 2011)

Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period p. - Zongduo Dai; Guang Gong; Hong-Yeop Song; Dingfeng Ye (IEEE Trans. Inf. Theory, 2011)

Certificateless undeniable signatures from bilinear maps. - Wei Zhao; Dingfeng Ye (Inf. Sci., 2012)

Obfuscation without Multilinear Maps. - Dingfeng Ye; Peng Liu 005 (IACR Cryptol. ePrint Arch., 2016)

Towards Practical Obfuscation of General Circuits. - Dingfeng Ye; Peng Liu 005; Jun Xu 024 (IACR Cryptol. ePrint Arch., 2017)

Lightweight AE and HASH in a Single Round Function. - Dingfeng Ye; Danping Shi; Peng Wang 009 (IACR Cryptol. ePrint Arch., 2018)

Ubiquitous Weak-key Classes of BRW-polynomial Function. - Kaiyan Zheng; Peng Wang 009; Dingfeng Ye (IACR Cryptol. ePrint Arch., 2018)

Evaluating the Cache Side Channel Attacks Against ECDSA. - Ziqiang Ma; Quanwei Cai 001; Jingqiang Lin 001; Jiwu Jing; Dingfeng Ye; Lingjia Meng (Inscrypt, 2019)

Revisiting Construction of Online Cipher in Hash-ECB-Hash Structure. - Gang Liu; Peng Wang 009; Rong Wei; Dingfeng Ye (Inscrypt, 2020)

Attack Beyond-Birthday-Bound MACs in Quantum Setting. - Tingting Guo; Peng Wang 009; Lei Hu 003; Dingfeng Ye (IACR Cryptol. ePrint Arch., 2020)

Attacks on Beyond-Birthday-Bound MACs in the Quantum Setting. - Tingting Guo; Peng Wang 009; Lei Hu 003; Dingfeng Ye (PQCrypto, 2021)

Can Lattice Signature be as Efficient as Lattice Encryption? - Dingfeng Ye (IACR Cryptol. ePrint Arch., 2021)

An Efficient Key Recovery Attack Against NTRUReEncrypt from AsiaCCS 2015. - Zijian Song; Jun Xu 024; Zhiwei Li; Dingfeng Ye (INDOCRYPT, 2022)

Quantum Attacks on PRFs Based on Public Random Permutations. - Tingting Guo; Peng Wang 009; Lei Hu 003; Dingfeng Ye (IACR Cryptol. ePrint Arch., 2022)

Lattice Signature can be as Simple as Lattice Encryption. - Dingfeng Ye; Jun Xu 022; Guifang Huang; Lei Hu 003 (IACR Cryptol. ePrint Arch., 2022)

Fast and Parallel Modular Multiplication without Borrow for ECC on ARM-NEON. - Wenjie Wang; Wei Wang 314; Jingqiang Lin 001; Lina Shang; Fan Lang; Dingfeng Ye (ICC, 2023)

ESCORT: Efficient Status Check and Revocation Transparency for Linkage-Based Pseudonym Certificates in VANETs. - Huiqing Wan; Qiongxiao Wang; Cunqing Ma; Yajun Teng; Jingqiang Lin 001; Dingfeng Ye (ISCC, 2023)

Protecting Private Keys of Dilithium Using Hardware Transactional Memory. - Lingjia Meng; Yu Fu; Fangyu Zheng; Ziqiang Ma; Mingyu Wang; Dingfeng Ye; Jingqiang Lin 001 (ISC, 2023)

Enhanced Ticket Transparency (eTT) Framework for Single Sign-On Services with Pseudonyms. - Guangqi Liu; Jingqiang Lin 001; Dawei Chu; Xiaokun Zhang; Qiongxiao Wang; Cunqing Ma; Fengjun Li; Dingfeng Ye (TrustCom, 2023)

The Broken Verifying: Inspections at Verification Tools for Windows Code-Signing Signatures. - Guangqi Liu; Qiongxiao Wang; Cunqing Ma; Jingqiang Lin 001; Yanduo Fu; Bingyu Li; Dingfeng Ye (TrustCom, 2023)

New Result for Breaking NTRU Encryption with Multiple Keys in Polynomial Time. - Zijian Song; Jun Xu; Binwu Xiang; Weijie Li; Dingfeng Ye (ICICS (1), 2024)