default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiang Feng Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Hong Chen
, Liang Feng Zhang:
A Dynamic Proactive Secret Sharing Scheme for Quadratic Functions. IEEE Access 12: 25749-25761 (2024)- [j25]Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang, Liang Feng Zhang:
Querying Twice to Achieve Information-Theoretic Verifiability in Private Information Retrieval. IEEE Trans. Inf. Forensics Secur. 19: 8172-8187 (2024) - [j24]Zhijie Liu, Yutian Tang, Xiapu Luo, Yuming Zhou, Liang Feng Zhang:
No Need to Lift a Finger Anymore? Assessing the Quality of Code Generation by ChatGPT. IEEE Trans. Software Eng. 50(6): 1548-1584 (2024) - [c24]Haofei Wang, Li-Ping Wang, Liang Feng Zhang, Huaxiong Wang:
Two-Server Verifiable Federated Learning: Unconditional Security and Practical Efficiency. CSCWD 2024: 163-168 - [c23]Wenhui Qiao, Liang Feng Zhang:
A Maintainable Matrix Commitment Scheme with Constant-Size Public Parameters and Incremental Aggregation. CSF 2024: 172-185 - [c22]Hong Chen, Jinyuan Li, Liang Feng Zhang:
A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property. ISIT 2024: 1860-1865 - [i17]Zhijie Liu, Yutian Tang, Meiyun Li, Xin Jin, Yunfei Long, Liang Feng Zhang, Xiapu Luo:
LLM-CompDroid: Repairing Configuration Compatibility Bugs in Android Apps with Pre-trained Large Language Models. CoRR abs/2402.15078 (2024) - [i16]Stanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang, Liang Feng Zhang:
Verifiable Information-Theoretic Function Secret Sharing. IACR Cryptol. ePrint Arch. 2024: 453 (2024) - 2023
- [j23]Xin Chen, Liang Feng Zhang, Jing Liu:
Verifiable Homomorphic Secret Sharing for Low Degree Polynomials. IEEE Trans. Dependable Secur. Comput. 20(4): 2882-2895 (2023) - [j22]Xin Chen, Liang Feng Zhang:
Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation. IEEE Trans. Inf. Forensics Secur. 18: 4609-4624 (2023) - [j21]Jing Liu, Liang Feng Zhang:
Privacy-Preserving and Publicly Verifiable Matrix Multiplication. IEEE Trans. Serv. Comput. 16(3): 2059-2071 (2023) - [j20]Shuai Feng, Liang Feng Zhang:
An Efficient Method for Realizing Contractions of Access Structures in Cloud Storage. IEEE Trans. Serv. Comput. 16(6): 4481-4492 (2023) - [c21]Pengzhen Ke, Liang Feng Zhang:
Private Information Retrieval with Result Verification for More Servers. ACNS 2023: 197-216 - [c20]Zhijie Liu, Liang Feng Zhang, Yutian Tang:
Enhancing Malware Detection for Android Apps: Detecting Fine-Granularity Malicious Components. ASE 2023: 1212-1224 - [i15]Zhijie Liu, Yutian Tang, Xiapu Luo, Yuming Zhou, Liang Feng Zhang:
No Need to Lift a Finger Anymore? Assessing the Quality of Code Generation by ChatGPT. CoRR abs/2308.04838 (2023) - [i14]Shuai Feng, Liang Feng Zhang:
An Efficient Method for Realizing Contractions of Access Structures in Cloud Storage. CoRR abs/2310.15972 (2023) - [i13]Junru Li, Pengzhen Ke, Liang Feng Zhang:
Efficient Information-Theoretic Distributed Point Function with General Output Groups. IACR Cryptol. ePrint Arch. 2023: 625 (2023) - 2022
- [j19]Lin Zhu, Wen Ming Li, Liang Feng Zhang:
On the Modulus in Matching Vector Codes. Comput. J. 65(12): 2991-2997 (2022) - [c19]Shuai Feng, Shuaijianni Xu, Liang Feng Zhang:
Multi-Key Homomorphic MACs with Efficient Verification for Quadratic Arithmetic Circuits. AsiaCCS 2022: 17-27 - [c18]Liang Feng Zhang, Huaxiong Wang, Li-Ping Wang:
Byzantine-Robust Private Information Retrieval with Low Communication and Efficient Decoding. AsiaCCS 2022: 1079-1085 - [c17]Jing Liu, Liang Feng Zhang:
Matproofs: Maintainable Matrix Commitment with Efficient Aggregation. CCS 2022: 2041-2054 - [c16]Pengzhen Ke, Liang Feng Zhang:
Two-Server Private Information Retrieval with Result Verification. ISIT 2022: 408-413 - [c15]Lin Zhu, Changlu Lin, Fuchun Lin, Liang Feng Zhang:
Post-Quantum Cheating Detectable Private Information Retrieval. SEC 2022: 431-448 - [c14]Liang Feng Zhang, Huaxiong Wang:
Multi-Server Verifiable Computation of Low-Degree Polynomials. SP 2022: 596-613 - 2021
- [j18]Yan He, Liang Feng Zhang:
Multi-matrix verifiable computation. Clust. Comput. 24(1): 475-488 (2021) - [j17]Liang Feng Zhang:
Multi-server verifiable delegation of computations: Unconditional security and practical efficiency. Inf. Comput. 281: 104740 (2021) - [j16]Xin Chen, Liang Feng Zhang:
Two-Server Delegation of Computation on Label-Encrypted Data. IEEE Trans. Cloud Comput. 9(4): 1645-1656 (2021) - [i12]Xin Chen, Liang Feng Zhang:
Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials. CoRR abs/2104.12163 (2021) - [i11]Xin Chen, Liang Feng Zhang:
Two-Server Delegation of Computation on Label-Encrypted Data. CoRR abs/2104.12330 (2021) - [i10]Liang Feng Zhang:
Multi-Server Verifiable Delegation of Computations: Unconditional Security and Practical Efficiency. CoRR abs/2104.12331 (2021) - [i9]Yan He, Liang Feng Zhang:
Multi-Matrix Verifiable Computation. CoRR abs/2104.14851 (2021) - [i8]Lin Zhu, Wen Ming Li, Liang Feng Zhang:
On the Modulus in Matching Vector Codes. CoRR abs/2107.09830 (2021) - 2020
- [j15]Jinglong Luo, Liang Feng Zhang, Fuchun Lin, Changlu Lin:
Efficient Threshold Function Secret Sharing With Information-Theoretic Security. IEEE Access 8: 6523-6532 (2020) - [j14]Yan He, Liang Feng Zhang:
Verifiable Summation of Read-Once Formula Specified Data. IEEE Access 8: 22434-22444 (2020) - [j13]Wen Ming Li, Liang Feng Zhang:
Towards Efficient Information-Theoretic Function Secret Sharing. IEEE Access 8: 28512-28523 (2020) - [j12]Liang Feng Zhang, Reihaneh Safavi-Naini:
Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions. Des. Codes Cryptogr. 88(4): 677-709 (2020) - [j11]Yan He, Liang Feng Zhang:
Cheater-identifiable homomorphic secret sharing for outsourcing computations. J. Ambient Intell. Humaniz. Comput. 11(11): 5103-5113 (2020) - [j10]Liang Feng Zhang, Reihaneh Safavi-Naini:
Privacy-preserving verifiable delegation of polynomial and matrix functions. J. Math. Cryptol. 14(1): 153-171 (2020) - [c13]Shuaijianni Xu, Liang Feng Zhang:
A Homomorphic Proxy Re-authenticators based Efficient Multi-client Non-interactive Verifiable Computation Scheme. ICISSP 2020: 195-206 - [c12]Xin Chen, Liang Feng Zhang:
Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials. ISC 2020: 75-91
2010 – 2019
- 2019
- [j9]Go Ohtake, Reihaneh Safavi-Naini, Liang Feng Zhang:
Outsourcing scheme of ABE encryption secure against malicious adversary. Comput. Secur. 86: 437-452 (2019) - 2018
- [j8]Shuaijianni Xu, Liang Feng Zhang:
Cryptanalysis of Morillo-Obrador polynomial delegation schemes. IET Inf. Secur. 12(2): 127-132 (2018) - 2017
- [c11]Shuaijianni Xu, Yan He, Liang Feng Zhang:
Cryptanalysis of Tran-Pang-Deng Verifiable Homomorphic Encryption. ICISC 2017: 59-70 - [c10]Go Ohtake, Reihaneh Safavi-Naini, Liang Feng Zhang:
Outsourcing Scheme of ABE Encryption Secure against Malicious Adversary. ICISSP 2017: 71-82 - [c9]Go Ohtake, Reihaneh Safavi-Naini, Liang Feng Zhang:
Outsourcing of Verifiable Attribute-Based Keyword Search. NordSec 2017: 18-35 - 2015
- [j7]Liang Feng Zhang, Reihaneh Safavi-Naini:
Batch verifiable computation of outsourced functions. Des. Codes Cryptogr. 77(2-3): 563-585 (2015) - [c8]Liang Feng Zhang, Reihaneh Safavi-Naini:
Batch Verifiable Computation of Polynomials on Outsourced Data. ESORICS (2) 2015: 167-185 - 2014
- [j6]Liang Feng Zhang:
A Coding-Theoretic Application of Baranyai's Theorem. IEEE Trans. Inf. Theory 60(11): 6988-6992 (2014) - [c7]Liang Feng Zhang, Reihaneh Safavi-Naini:
Verifiable Multi-server Private Information Retrieval. ACNS 2014: 62-79 - [c6]Liang Feng Zhang, Reihaneh Safavi-Naini:
Generalized homomorphic MACs with efficient verification. AsiaPKC@AsiaCCS 2014: 3-12 - [c5]Liang Feng Zhang, Reihaneh Safavi-Naini, Xiao Wei Liu:
Verifiable local computation on distributed data. SCC@ASIACCS 2014: 3-10 - [c4]Liang Feng Zhang, Reihaneh Safavi-Naini:
Verifiable Delegation of Computations with Storage-Verification Trade-off. ESORICS (1) 2014: 112-129 - 2013
- [j5]Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes of Subexponential Length. Comput. Complex. 22(1): 159-189 (2013) - [j4]Liang Feng Zhang:
On the eigenvalues of certain matrices over Zm. Discret. Math. 313(7): 886-895 (2013) - [j3]Yeow Meng Chee, San Ling, Huaxiong Wang, Liang Feng Zhang:
Upper Bounds on Matching Families in BBZpqn. IEEE Trans. Inf. Theory 59(8): 5131-5139 (2013) - [c3]Liang Feng Zhang, Reihaneh Safavi-Naini:
Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps. CANS 2013: 329-348 - [c2]Sumanta Sarkar, Reihaneh Safavi-Naini, Liang Feng Zhang:
RAFR: remote assessment of file redundancy. SCC@ASIACCS 2013: 27-32 - [i7]Yeow Meng Chee, San Ling, Huaxiong Wang, Liang Feng Zhang:
Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$. CoRR abs/1301.0980 (2013) - [i6]Liang Feng Zhang:
A Coding-Theoretic Application of Baranyai's Theorem. CoRR abs/1303.0247 (2013) - [i5]Liang Feng Zhang, Reihaneh Safavi-Naini:
Privately Outsourcing Polynomial Evaluations and Matrix Multiplications using Multilinear Maps. CoRR abs/1308.4218 (2013) - 2012
- [j2]Amos Beimel, Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
Communication-efficient distributed oblivious transfer. J. Comput. Syst. Sci. 78(4): 1142-1157 (2012) - [j1]Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
On the Bringer-Chabanne EPIR protocol for polynomial evaluation. J. Math. Cryptol. 5(3-4): 277-301 (2012) - [i4]Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
On Bringer-Chabanne EPIR Protocol for Polynomial Evaluation. CoRR abs/1208.5190 (2012) - [i3]Liang Feng Zhang:
On the Eigenvalues of Certain Matrices Over $\mathbb{Z}_m$. CoRR abs/1208.5194 (2012) - 2011
- [c1]Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang:
Oblivious Transfer and n-Variate Linear Function Evaluation. COCOON 2011: 627-637 - 2010
- [i2]Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes of Subexponential Length. CoRR abs/1008.1617 (2010) - [i1]Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang, Liang Feng Zhang:
Query-Efficient Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 18:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
