Dongdai Lin

Dongdai Lin

Auto-generated profile, based on publicly available information

Dongdai Lin

State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
21 June 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JZJianghua Zhong
Jianghua Zhong
DLDongdai Lin
Dongdai Lin
Grain is one of three hardware-oriented finalists of the eSTREAM project. A nonlinear feedback shift register (NFSR) in Grain-like structure is a cascade connection of a linear feedback shift register (LFSR) into an NFSR, in which the characteristic polynomial of the LFSR is primitive and the feedback function of the NFSR is nonsingular. In 2011 Hu and Gong pointed out that the period of the sequence generated by an NFSR in Grain-like structure is a multiple of the period of the sequence generated by its LFSR if the initial state of the LFSR is nonzero. Meanwhile, they proposed an open problem: for fixed feedback functions of an NFSR and an LFSR, determine whether the sequences generated by the NFSR in Grain-like structure can achieve the minimum period, i.e., the period of the LFSR, when the initial state of the LFSR is nonzero, and if they can achieve, provide at least one pair of the initial states of the NFSR and LFSR. Clearly, from a security point of view, it is not preferable if the sequences generated by an NFSR in Grain-like structure achieve the minimum period. This paper converts the open problem into a problem of solving an integer equation with respect to two unknown integers that uniquely correspond to the initial states of the NFSR and LFSR, by viewing the NFSR as a Boolean control network. Based on the integer equation, this paper shows that for any given initial state of an n-stage NFSR and any given nonzero initial state of an m-stage LFSR, the probability that the sequence generated by the NFSR in Grain-like structure achieves the minimum period 2m−1 is at most 2–n. This implies that the probability of the cascade connection used in Grain achieving the minimum period is very small.

25 January 2019 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AWAnyu Wang
Anyu Wang
ZZZhifang Zhang
Zhifang Zhang
DLDongdai Lin
Dongdai Lin
For locally repairable codes (LRCs), V. Cadambe and A. Mazumdar derived the first field-dependent parameter bound, known as the C-M bound. However, the C-M bound depends on an undetermined parameter k(q) opt(n; d). In this paper, a sphere-packing approach is developed for upper bounding the parameter k for [n; k; d] linear LRCs with locality r. When restricted to the binary field, three upper bounds (i.e., Bound A, Bound B, and Bound C) are derived in explicit form. More specifically, Bound A holds under the hypothesis that the local repair groups are disjoint and of equal size. Comparing with previous bounds obtained under the same hypothesis, Bound A either covers them as special cases or has an advantage due to its explicit form. Then the hypothesis is removed in Bound B and Bound C. As the price for explicit form, Bound B specially holds for d ≥ 5 and Bound C for r = 2. Through specific comparisons we show that Bound B and Bound C both tend to outperform the C-M bound as n goes large. Moreover, a family of binary linear LRCs with d ≥ 6 attaining Bound B is constructed and later extended to a wider range of parameters by a shortening technique. Lastly, most of the bounds and constructions are extended to q-ary LRCs.

1 May 2018 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
FLFei Li
Fei Li
QWQiuyan Wang
Qiuyan Wang
DLDongdai Lin
Dongdai Lin

1 July 2017 in IET Information Security
Verified
Journal Article
Open access
PDF file
YRYawei Ren
Yawei Ren
FLFeng liu
Feng liu
TGTeng Guo
Teng Guo
RFRongquan Feng
Rongquan Feng
DLDongdai Lin
Dongdai Lin
In the past decade, the researchers paid more attention to the cheating problem in visual cryptography (VC) so that many cheating prevention visual cryptography schemes (CPVCS) have been proposed. In this paper, the authors propose a novel method, which first makes use of Latin square to prevent cheating in VC. Latin squares are utilised to guide the choosing of authentication regions in different rows and columns of each divided block of the shares, which ensures that the choosing of authentication regions is both random and uniform. Without pixel expansion, the new method provides random regions authentication in each divided block of all shares. What is important is that the proposed method is applicable to both ( k , n )‐deterministic visual cryptography scheme (( k , n )‐DVCS) and ( k , n )‐probabilistic visual cryptography scheme (( k , n )‐PVCS). Experimental results and properties analysis are given to show the effectiveness of the proposed method.

8 July 2014
Verified
Book Chapter
Closed access
PDF file
BZBin Zhang
Bin Zhang
ZLZhenqi Li
Zhenqi Li
DFDengguo Feng
Dengguo Feng
DLDongdai Lin
Dongdai Lin

13 March 2020
Verified
Book Chapter
Closed access
PDF file
XMXuecheng Ma
Xuecheng Ma
DLDongdai Lin
Dongdai Lin