Query-Efficient Locally Decodable Codes. - Yeow Meng Chee; Tao Feng 001; San Ling; Huaxiong Wang; Liang Feng Zhang (Electron. Colloquium Comput. Complex., 2010)

Oblivious Transfer and n-Variate Linear Function Evaluation. - Yeow Meng Chee; Huaxiong Wang; Liang Feng Zhang (COCOON, 2011)

On the Eigenvalues of Certain Matrices Over $ mathbb{Z}_m$ - Liang Feng Zhang (CoRR, 2012)

Communication-efficient distributed oblivious transfer. - Amos Beimel; Yeow Meng Chee; Huaxiong Wang; Liang Feng Zhang (J. Comput. Syst. Sci., 2012)

On the Bringer-Chabanne EPIR protocol for polynomial evaluation. - Yeow Meng Chee; Huaxiong Wang; Liang Feng Zhang (J. Math. Cryptol., 2012)

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps. - Liang Feng Zhang; Reihaneh Safavi-Naini (CANS, 2013)

RAFR: remote assessment of file redundancy. - Sumanta Sarkar; Reihaneh Safavi-Naini; Liang Feng Zhang (SCC@ASIACCS, 2013)

Query-Efficient Locally Decodable Codes of Subexponential Length. - Yeow Meng Chee; Tao Feng 001; San Ling; Huaxiong Wang; Liang Feng Zhang (Comput. Complex., 2013)

Privately Outsourcing Polynomial Evaluations and Matrix Multiplications using Multilinear Maps. - Liang Feng Zhang; Reihaneh Safavi-Naini (CoRR, 2013)

Upper Bounds on Matching Families in $ mathbb{Z}_{pq}^n$ - Yeow Meng Chee; San Ling; Huaxiong Wang; Liang Feng Zhang (CoRR, 2013)

On the eigenvalues of certain matrices over Zm. - Liang Feng Zhang (Discret. Math., 2013)

Upper Bounds on Matching Families in BBZpqn. - Yeow Meng Chee; San Ling; Huaxiong Wang; Liang Feng Zhang (IEEE Trans. Inf. Theory, 2013)

Verifiable Multi-server Private Information Retrieval. - Liang Feng Zhang; Reihaneh Safavi-Naini (ACNS, 2014)

Generalized homomorphic MACs with efficient verification. - Liang Feng Zhang; Reihaneh Safavi-Naini (AsiaPKC@AsiaCCS, 2014)

Verifiable local computation on distributed data. - Liang Feng Zhang; Reihaneh Safavi-Naini; Xiao Wei Liu (SCC@ASIACCS, 2014)

Verifiable Delegation of Computations with Storage-Verification Trade-off. - Liang Feng Zhang; Reihaneh Safavi-Naini (ESORICS (1), 2014)

A Coding-Theoretic Application of Baranyai's Theorem. - Liang Feng Zhang (IEEE Trans. Inf. Theory, 2014)

Batch Verifiable Computation of Polynomials on Outsourced Data. - Liang Feng Zhang; Reihaneh Safavi-Naini (ESORICS (2), 2015)

Batch verifiable computation of outsourced functions. - Liang Feng Zhang; Reihaneh Safavi-Naini (Des. Codes Cryptogr., 2015)

Cryptanalysis of Tran-Pang-Deng Verifiable Homomorphic Encryption. - Shuaijianni Xu; Yan He; Liang Feng Zhang (ICISC, 2017)

Outsourcing of Verifiable Attribute-Based Keyword Search. - Go Ohtake; Reihaneh Safavi-Naini; Liang Feng Zhang (NordSec, 2017)

Cryptanalysis of Morillo-Obrador polynomial delegation schemes. - Shuaijianni Xu; Liang Feng Zhang (IET Inf. Secur., 2018)

Outsourcing scheme of ABE encryption secure against malicious adversary. - Go Ohtake; Reihaneh Safavi-Naini; Liang Feng Zhang (Comput. Secur., 2019)

A Homomorphic Proxy Re-authenticators based Efficient Multi-client Non-interactive Verifiable Computation Scheme. - Shuaijianni Xu; Liang Feng Zhang (ICISSP, 2020)

Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials. - Xin Chen; Liang Feng Zhang (ISC, 2020)

Verifiable Summation of Read-Once Formula Specified Data. - Yan He; Liang Feng Zhang (IEEE Access, 2020)

Towards Efficient Information-Theoretic Function Secret Sharing. - Wen Ming Li; Liang Feng Zhang (IEEE Access, 2020)

Efficient Threshold Function Secret Sharing With Information-Theoretic Security. - Jinglong Luo; Liang Feng Zhang; Fuchun Lin; Changlu Lin (IEEE Access, 2020)

Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions. - Liang Feng Zhang; Reihaneh Safavi-Naini (Des. Codes Cryptogr., 2020)

Cheater-identifiable homomorphic secret sharing for outsourcing computations. - Yan He; Liang Feng Zhang (J. Ambient Intell. Humaniz. Comput., 2020)

Privacy-preserving verifiable delegation of polynomial and matrix functions. - Liang Feng Zhang; Reihaneh Safavi-Naini (J. Math. Cryptol., 2020)

Multi-matrix verifiable computation. - Yan He; Liang Feng Zhang (Clust. Comput., 2021)

Two-Server Delegation of Computation on Label-Encrypted Data. - Xin Chen; Liang Feng Zhang (CoRR, 2021)

Multi-server verifiable delegation of computations: Unconditional security and practical efficiency. - Liang Feng Zhang (Inf. Comput., 2021)

Two-Server Delegation of Computation on Label-Encrypted Data. - Xin Chen 065; Liang Feng Zhang (IEEE Trans. Cloud Comput., 2021)

Multi-Key Homomorphic MACs with Efficient Verification for Quadratic Arithmetic Circuits. - Shuai Feng; Shuaijianni Xu; Liang Feng Zhang (AsiaCCS, 2022)

Byzantine-Robust Private Information Retrieval with Low Communication and Efficient Decoding. - Liang Feng Zhang; Huaxiong Wang; Li-Ping Wang (AsiaCCS, 2022)

Matproofs: Maintainable Matrix Commitment with Efficient Aggregation. - Jing Liu; Liang Feng Zhang (CCS, 2022)

Two-Server Private Information Retrieval with Result Verification. - Pengzhen Ke; Liang Feng Zhang (ISIT, 2022)

Post-Quantum Cheating Detectable Private Information Retrieval. - Lin Zhu; Changlu Lin; Fuchun Lin; Liang Feng Zhang (SEC, 2022)

Multi-Server Verifiable Computation of Low-Degree Polynomials. - Liang Feng Zhang; Huaxiong Wang (SP, 2022)

On the Modulus in Matching Vector Codes. - Lin Zhu; Wen Ming Li; Liang Feng Zhang (Comput. J., 2022)

Private Information Retrieval with Result Verification for More Servers. - Pengzhen Ke; Liang Feng Zhang (ACNS, 2023)

Enhancing Malware Detection for Android Apps: Detecting Fine-Granularity Malicious Components. - Zhijie Liu; Liang Feng Zhang; Yutian Tang (ASE, 2023)

Efficient Information-Theoretic Distributed Point Function with General Output Groups. - Junru Li; Pengzhen Ke; Liang Feng Zhang (IACR Cryptol. ePrint Arch., 2023)

Verifiable Homomorphic Secret Sharing for Low Degree Polynomials. - Xin Chen 065; Liang Feng Zhang; Jing Liu 069 (IEEE Trans. Dependable Secur. Comput., 2023)

Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation. - Xin Chen 065; Liang Feng Zhang (IEEE Trans. Inf. Forensics Secur., 2023)

An Efficient Method for Realizing Contractions of Access Structures in Cloud Storage. - Shuai Feng; Liang Feng Zhang (IEEE Trans. Serv. Comput., 2023)

Privacy-Preserving and Publicly Verifiable Matrix Multiplication. - Jing Liu 069; Liang Feng Zhang (IEEE Trans. Serv. Comput., 2023)

Two-Server Verifiable Federated Learning: Unconditional Security and Practical Efficiency. - Haofei Wang; Li-Ping Wang; Liang Feng Zhang; Huaxiong Wang (CSCWD, 2024)

A Maintainable Matrix Commitment Scheme with Constant-Size Public Parameters and Incremental Aggregation. - Wenhui Qiao; Liang Feng Zhang (CSF, 2024)

A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property. - Hong Chen; Jinyuan Li; Liang Feng Zhang (ISIT, 2024)

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions. - Hong Chen; Liang Feng Zhang (IEEE Access, 2024)

LLM-CompDroid: Repairing Configuration Compatibility Bugs in Android Apps with Pre-trained Large Language Models. - Zhijie Liu; Yutian Tang; Meiyun Li; Xin Jin; Yunfei Long; Liang Feng Zhang; Xiapu Luo (CoRR, 2024)

Verifiable Information-Theoretic Function Secret Sharing. - Stanislav Kruglik; Son Hoang Dau; Han Mao Kiah; Huaxiong Wang; Liang Feng Zhang (IACR Cryptol. ePrint Arch., 2024)

Querying Twice to Achieve Information-Theoretic Verifiability in Private Information Retrieval. - Stanislav Kruglik; Son Hoang Dau; Han Mao Kiah; Huaxiong Wang; Liang Feng Zhang (IEEE Trans. Inf. Forensics Secur., 2024)

No Need to Lift a Finger Anymore? Assessing the Quality of Code Generation by ChatGPT. - Zhijie Liu; Yutian Tang; Xiapu Luo; Yuming Zhou; Liang Feng Zhang (IEEE Trans. Software Eng., 2024)

KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis. - Zhijie Liu; Qiyi Tang 003; Sen Nie; Shi Wu; Liang Feng Zhang; Yutian Tang (Proc. ACM Softw. Eng., 2025)

Efficient information-theoretic distributed point functions with general output groups. - Junru Li; Pengzhen Ke; Liang Feng Zhang (Des. Codes Cryptogr., 2025)

List-Decodable Byzantine Robust PIR: Lower Communication Complexity, Higher Byzantine Tolerance, Smaller List Size. - Pengzhen Ke; Liang Feng Zhang; Huaxiong Wang; Li-Ping Wang (CoRR, 2025)