activity
20102023
most citedOn the Placement Delivery Array Design in Centralized Coded Caching Scheme

222 citations · 844 across the 56 of their papers we have counts for

collaborators
Showing 2021Show all

8 papers · 1 filter

cs.IT2021

Multi-User Blind Symmetric Private Information Retrieval from Coded Servers

Jinbao Zhu, Qifa Yan, Xiaohu Tang

The problem of Multi-user Blind -secure -colluding Symmetric Private Information Retrieval from Maximum Distance Separable (MDS) coded storage system with Byzantine and $…

cs.IT2021

A subfield-based construction of optimal linear codes over finite fields

Zhao Hu, Nian Li, Xiangyong Zeng +2

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can p…

cs.IT2021

Several classes of bent functions over finite fields

Xi Xie, Nian Li, Xiangyong Zeng +2

Let be the finite field with elements and be the trace function from to , where is a…

cs.IT2021

A Generic Transformation to Generate MDS Storage Codes with -Optimal Access Property

Yi Liu, Jie Li, Xiaohu Tang

For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practica…

cs.IT2021★ 3 cited

A class of APcN power functions over finite fields of even characteristic

Ziran Tu, Xiangyong Zeng, Yupeng Jiang +1

In this paper, we investigate the power functions over the finite field , where is a positive integer and . It is prove…

cs.CR2021

Achieve Efficient Position-Heap-based Privacy-Preserving Substring-of-Keyword Query over Cloud

Fan Yin, Rongxing Lu, Yandong Zheng +3

The cloud computing technique, which was initially used to mitigate the explosive growth of data, has been required to take both data privacy and users' query functionality into co…

cs.IT2021★ 3 cited

Improved Constructions for Secure Multi-Party Batch Matrix Multiplication

Jinbao Zhu, Qifa Yan, Xiaohu Tang

This paper investigates the problem of Secure Multi-party Batch Matrix Multiplication (SMBMM), where a user aims to compute the pairwise products $\mathbf{A}\divideontimes\mathbf{B…

cs.IT2021

Capacity-Achieving Private Information Retrieval Schemes from Uncoded Storage Constrained Servers with Low Sub-packetization

Jinbao Zhu, Qifa Yan, Xiaohu Tang +1

This paper investigates reducing sub-packetization of capacity-achieving schemes for uncoded Storage Constrained Private Information Retrieval (SC-PIR) systems. In the SC-PIR syste…