activity
20122026
most citedTwo-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

12 citations · 31 across the 8 of their papers we have counts for

collaborators

8 papers

cs.CR2026

FlexProofs: A Vector Commitment with Flexible Linear Time for Computing All Proofs

Jing Liu, Liang Feng Zhang

In this paper, we introduce FlexProofs, a new vector commitment (VC) scheme that achieves two key properties: (1) the prover can generate all individual opening proofs for a vector…

cs.LG2025

Consistent Estimation of Numerical Distributions under Local Differential Privacy by Wavelet Expansion

Puning Zhao, Zhikun Zhang, Bo Sun +4

Distribution estimation under local differential privacy (LDP) is a fundamental and challenging task. Significant progresses have been made on categorical data. However, due to dif…

cs.CR2021★ 3 cited

Multi-Matrix Verifiable Computation

Yan He, Liang Feng Zhang

The problem of securely outsourcing computation to cloud servers has attracted a large amount of attention in recent years. The verifiable computation of Gennaro, Gentry, Parno (Cr…

cs.CR2021★ 6 cited

Multi-Server Verifiable Delegation of Computations: Unconditional Security and Practical Efficiency

Liang Feng Zhang

Outsourcing computation has gained significant popularity in recent years due to the prevalence of cloud computing. There are two main security concerns in outsourcing computation:…

cs.CR2021★ 8 cited

Two-Server Delegation of Computation on Label-Encrypted Data

Xin Chen, Liang Feng Zhang

Catalano and Fiore propose a scheme to transform a linearly-homomorphic encryption into a homomorphic encryption scheme capable of evaluating quadratic computations on ciphertexts.…

cs.CR2021★ 12 cited

Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

Xin Chen, Liang Feng Zhang

Homomorphic secret sharing (HSS) allows multiple input clients to secret-share their data among multiple servers such that each server is able to locally compute a function on its…

cs.CR2013★ 2 cited

Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps

Liang Feng Zhang, Rehanehi Safavi-Naini

{\em Verifiable computation} (VC) allows a computationally weak client to outsource the evaluation of a function on many inputs to a powerful but untrusted server. The client inves…

cs.DM2012

On the Eigenvalues of Certain Matrices Over

Liang Feng Zhang

Let be integers and be the point set of the projective -space (defined by [2]) over the ring of integers modulo . Let $A_{n,m}=(a…