2 citations · 3 across the 5 of their papers we have counts for
6 papers
Efficient DPF-based Error-Detecting Information-Theoretic Private Information Retrieval Over Rings
Pengzhen Ke, Liang Feng Zhang, Huaxiong Wang +1
Authenticated private information retrieval (APIR) is the state-of-the-art error-detecting private information retrieval (ED-PIR), using Distributed Point Functions (DPFs) for subp…
List-Decodable Byzantine Robust PIR: Lower Communication Complexity, Higher Byzantine Tolerance, Smaller List Size
Pengzhen Ke, Liang Feng Zhang, Huaxiong Wang +1
Private Information Retrieval (PIR) is a privacy-preserving primitive in cryptography. Significant endeavors have been made to address the variant of PIR concerning the malicious s…
A Coding-Theoretic Application of Baranyai's Theorem
Liang Feng Zhang
Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all -subsets of an -element set…
Upper Bounds on Matching Families in
Yeow Meng Chee, San Ling, Huaxiong Wang +1
\textit{Matching families} are one of the major ingredients in the construction of {\em locally decodable codes} (LDCs) and the best known constructions of LDCs with a constant num…
On Bringer-Chabanne EPIR Protocol for Polynomial Evaluation
Yeow Meng Chee, Huaxiong Wang, Liang Feng Zhang
Extended private information retrieval (EPIR) was defined by \cite{BCPT07} at CANS'07 and generalized by \cite{BC09} at AFRICACRYPT'09. In the generalized setting, EPIR allows a us…
Query-Efficient Locally Decodable Codes of Subexponential Length
Yeow Meng Chee, Tao Feng, San Ling +2
We develop the algebraic theory behind the constructions of Yekhanin (2008) and Efremenko (2009), in an attempt to understand the ``algebraic niceness'' phenomenon in $\mathbb{Z}_m…