Liang Feng Zhang

Orcid: 0000-0003-3543-1524

According to our database1, Liang Feng Zhang authored at least 56 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
No Need to Lift a Finger Anymore? Assessing the Quality of Code Generation by ChatGPT.
IEEE Trans. Software Eng., June, 2024

Querying Twice to Achieve Information-Theoretic Verifiability in Private Information Retrieval.
IEEE Trans. Inf. Forensics Secur., 2024

Verifiable Information-Theoretic Function Secret Sharing.
IACR Cryptol. ePrint Arch., 2024

LLM-CompDroid: Repairing Configuration Compatibility Bugs in Android Apps with Pre-trained Large Language Models.
CoRR, 2024

A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions.
IEEE Access, 2024

A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property.
Proceedings of the IEEE International Symposium on Information Theory, 2024

A Maintainable Matrix Commitment Scheme with Constant-Size Public Parameters and Incremental Aggregation.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

Two-Server Verifiable Federated Learning: Unconditional Security and Practical Efficiency.
Proceedings of the 27th International Conference on Computer Supported Cooperative Work in Design, 2024

2023
Privacy-Preserving and Publicly Verifiable Matrix Multiplication.
IEEE Trans. Serv. Comput., 2023

An Efficient Method for Realizing Contractions of Access Structures in Cloud Storage.
IEEE Trans. Serv. Comput., 2023

Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation.
IEEE Trans. Inf. Forensics Secur., 2023

Verifiable Homomorphic Secret Sharing for Low Degree Polynomials.
IEEE Trans. Dependable Secur. Comput., 2023

Efficient Information-Theoretic Distributed Point Function with General Output Groups.
IACR Cryptol. ePrint Arch., 2023

Enhancing Malware Detection for Android Apps: Detecting Fine-Granularity Malicious Components.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

Private Information Retrieval with Result Verification for More Servers.
Proceedings of the Applied Cryptography and Network Security, 2023

2022
On the Modulus in Matching Vector Codes.
Comput. J., 2022

Multi-Server Verifiable Computation of Low-Degree Polynomials.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Post-Quantum Cheating Detectable Private Information Retrieval.
Proceedings of the ICT Systems Security and Privacy Protection, 2022

Two-Server Private Information Retrieval with Result Verification.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Matproofs: Maintainable Matrix Commitment with Efficient Aggregation.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Byzantine-Robust Private Information Retrieval with Low Communication and Efficient Decoding.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

Multi-Key Homomorphic MACs with Efficient Verification for Quadratic Arithmetic Circuits.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

2021
Two-Server Delegation of Computation on Label-Encrypted Data.
IEEE Trans. Cloud Comput., 2021

Multi-server verifiable delegation of computations: Unconditional security and practical efficiency.
Inf. Comput., 2021

Multi-matrix verifiable computation.
Clust. Comput., 2021

2020
Privacy-preserving verifiable delegation of polynomial and matrix functions.
J. Math. Cryptol., 2020

Cheater-identifiable homomorphic secret sharing for outsourcing computations.
J. Ambient Intell. Humaniz. Comput., 2020

Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions.
Des. Codes Cryptogr., 2020

Efficient Threshold Function Secret Sharing With Information-Theoretic Security.
IEEE Access, 2020

Towards Efficient Information-Theoretic Function Secret Sharing.
IEEE Access, 2020

Verifiable Summation of Read-Once Formula Specified Data.
IEEE Access, 2020

Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials.
Proceedings of the Information Security - 23rd International Conference, 2020

A Homomorphic Proxy Re-authenticators based Efficient Multi-client Non-interactive Verifiable Computation Scheme.
Proceedings of the 6th International Conference on Information Systems Security and Privacy, 2020

2019
Outsourcing scheme of ABE encryption secure against malicious adversary.
Comput. Secur., 2019

2018
Cryptanalysis of Morillo-Obrador polynomial delegation schemes.
IET Inf. Secur., 2018

2017
Outsourcing of Verifiable Attribute-Based Keyword Search.
Proceedings of the Secure IT Systems, 2017

Cryptanalysis of Tran-Pang-Deng Verifiable Homomorphic Encryption.
Proceedings of the Information Security and Cryptology - ICISC 2017 - 20th International Conference, Seoul, South Korea, November 29, 2017

2015
Batch verifiable computation of outsourced functions.
Des. Codes Cryptogr., 2015

Batch Verifiable Computation of Polynomials on Outsourced Data.
Proceedings of the Computer Security - ESORICS 2015, 2015

2014
A Coding-Theoretic Application of Baranyai's Theorem.
IEEE Trans. Inf. Theory, 2014

Verifiable Delegation of Computations with Storage-Verification Trade-off.
Proceedings of the Computer Security - ESORICS 2014, 2014

Verifiable local computation on distributed data.
Proceedings of the Second International Workshop on Security in Cloud Computing, 2014

Generalized homomorphic MACs with efficient verification.
Proceedings of the ASIAPKC'14, 2014

Verifiable Multi-server Private Information Retrieval.
Proceedings of the Applied Cryptography and Network Security, 2014

2013
Upper Bounds on Matching Families in BBZ<sub>pq</sub><sup>n</sup>.
IEEE Trans. Inf. Theory, 2013

On the eigenvalues of certain matrices over <i>Z</i><sub><i>m</i></sub>.
Discret. Math., 2013

Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$
CoRR, 2013

Privately Outsourcing Polynomial Evaluations and Matrix Multiplications using Multilinear Maps.
CoRR, 2013

Query-Efficient Locally Decodable Codes of Subexponential Length.
Comput. Complex., 2013

RAFR: remote assessment of file redundancy.
Proceedings of the 2013 International Workshop on Security in Cloud Computing, 2013

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

2012
On the Bringer-Chabanne EPIR protocol for polynomial evaluation.
J. Math. Cryptol., 2012

Communication-efficient distributed oblivious transfer.
J. Comput. Syst. Sci., 2012

On the Eigenvalues of Certain Matrices Over $\mathbb{Z}_m$
CoRR, 2012

2011
Oblivious Transfer and n-Variate Linear Function Evaluation.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Query-Efficient Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2010


  Loading...