Jian Ding

Jian Ding

Auto-generated profile, based on publicly available information

Jian Ding

Anhui Xinhua University

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 July 2022 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
FLFulin Li
Fulin Li
HHHang Hu
Hang Hu
SZShixin Zhu
Shixin Zhu
JYJiayun Yan
Jiayun Yan
JDJian Ding
Jian Ding

29 October 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JDJian Ding
Jian Ding
昌林昌露 林
昌露 林
Huaxiong WangHuaxiong Wang
Huaxiong Wang
CXChaoping Xing
Chaoping Xing
Communication efficient secret sharing (CESS) schemes are a class of threshold schemes that aim to minimize the so-called decoding bandwidth, namely the necessary amount of communication between a combiner who wants to reconstruct the secret and the available participants storing shares of the secret. Previous works proved that the decoding bandwidth had a tight lower bound related to the number of available participants. Some threshold schemes that achieved the lower bound (optimal decoding bandwidth) and optimal information rate were constructed for a given number (non-universal case) or multiple distinct number ( $\triangle $ -universal case) of available participants. However, all those CESS schemes have large share sizes. Moreover, they have a common feature that each secret and share are a vector with multiple coordinates, which results in the decoding delay since the combiner must reconstruct a part of coordinates of the secret at first, and these recovered coordinates will be used to reconstruct another part of coordinates of the secret. In this work, we describe a new construction for CESS schemes of non-universal and $\triangle $ -universal cases, whereas each secret and share of our schemes are a single element of a finite field $\mathbb {F}_{q^{e}}$ , and each participant of an authorized subset provides a single element of a same subfield of $\mathbb {F}_{q^{e}}$ to the combiner to reconstruct the secret. We find that the CESS schemes of this type, termed balanced CESS schemes, have an inevitable restriction on the number of available participants, but our schemes has no decoding delay. Furthermore, our schemes have smaller share sizes than other existing works, which are realized by using a smaller sub-packetization $e$ and a smaller base field $\mathbb {F}_{q}$ . Indeed, the sub-packetizations of our schemes are minimum for given $\mathbb {F}_{q}$ among balanced CESS schemes. In addition, when our constructions are used to generate communication efficient $(n,r)$ threshold schemes, we derive a generalized Shamir’s scheme that universally achieves optimal decoding bandwidth and optimal information rate for the first time , where the restriction on the number of available participants is removed.

1 November 2019 in Chinese Journal of Electronics
Verified
Journal Article
Open access
PDF file
JDJian Ding
Jian Ding
HLHongju Li
Hongju Li
JLJing Liang
Jing Liang
YTYongsheng Tang
Yongsheng Tang
Sufficient and necessary conditions for Hermitian (1 + λu)-constacyclic self-orthogonal codes over Fpm +uFpm are obtained, where λ is a unit of Fpm + uFpm. Based on this, a new method for the construction of pm-ary quantum codes from the obtained Hermitian (1+ λu) constacyclic self-orthogonal codes over Fpm+uFpm is given. As an example, [[pm - 1; pm - 2d+ 1, d]]pm quantum MDS codes are constructed for 1 ≤ d ≤ (pm +1)/2 and p ≠ 2, as well as some other quantum codes.

31 October 2014 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
JDJian Ding
Jian Ding
HLHong-Ju Li
Hong-Ju Li

13 November 2021 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
JDJian Ding
Jian Ding
昌林昌露 林
昌露 林
Sihem MesnagerSihem Mesnager
Sihem Mesnager

6 April 2018 in Journal of Applied Mathematics and Computing
Verified
Journal Article
Closed access
PDF file
JDJian Ding
Jian Ding
HLHong-Ju Li
Hong-Ju Li
JLJing Liang
Jing Liang