Leo Yu Zhang

Dr. Leo Yu Zhang


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
7 December 2018 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Closed access
NSNan Sun
Nan Sun
JZJun Zhang
Jun Zhang
PRPaul Rimba
Paul Rimba
SGShang Gao
Shang Gao
LZLeo Yu Zhang
Leo Yu Zhang
YXYang Xiang
Yang Xiang
Driven by the increasing scale and high profile cybersecurity incidents related public data, recent years we have witnessed a paradigm shift in understanding and defending against the evolving cyber threats, from primarily reactive detection towards proactive prediction. Meanwhile, governments, businesses, and individual internet users show the growing public appetite to improve cyber resilience that refers to their ability to prepare for, combat and recover from cyber threats and incidents. Undoubtedly, predicting cybersecurity incidents is deemed to have excellent potential for proactively advancing cyber resilience. Research communities and industries have begun proposing cybersecurity incident prediction schemes by utilizing different types of data sources, including organization’s reports and datasets, network data, synthetic data, data crawled from webpages, and data retrieved from social media. With a focus on the dataset, this survey paper investigates the emerging research by reviewing recent representative works appeared in the dominant period. We also extract and summarize the data-driven research methodology commonly adopted in this fast-growing area. In consonance with the phases of the methodology, each work that predicts cybersecurity incident is comprehensively studied. Challenges and future directions in this field are also discussed.

19 May 2016 in IEEE Access
Verified
Journal Article
Open access
YZYushu Zhang
Yushu Zhang
LZLeo Yu Zhang
Leo Yu Zhang
JZJiantao Zhou
Jiantao Zhou
LLLicheng Liu
Licheng Liu
FCFei Chen
Fei Chen
XHXing He
Xing He
The applications of compressive sensing (CS) in the field of information security have captured a great deal of researchers' attention in the past decade. To supply guidance for researchers from a comprehensive perspective, this paper, for the first time, reviews CS in information security field from two aspects: theoretical security and application security. Moreover, the CS applied in image cipher is one of the most widespread applications, as its characteristics of dimensional reduction and random projection can be utilized and integrated into image cryptosystems, which can achieve simultaneous compression and encryption of an image or multiple images. With respect to this application, the basic framework designs and the corresponding analyses are investigated. Specifically, the investigation proceeds from three aspects, namely, image ciphers based on chaos and CS, image ciphers based on optics and CS, and image ciphers based on chaos, optics, and CS. A total of six frameworks are put forward. Meanwhile, their analyses in terms of security, advantages, disadvantages, and so on are presented. At last, we attempt to indicate some other possible application research topics in future.

1 June 2020 in Information Sciences
Verified
Journal Article
Closed access
YWYong Wang
Yong Wang
ZZZhiqiang Zhang
Zhiqiang Zhang
LZLeo Yu Zhang
Leo Yu Zhang
Jun FengJun Feng
Jun Feng
JGJerry Gao
Jerry Gao
PLPeng Lei
Peng Lei

11 October 2012 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
CLChengqing Li
Chengqing Li
LZLeo Yu Zhang
Leo Yu Zhang
RORong Ou
Rong Ou
KWKwok-Wo Wong
Kwok-Wo Wong
SSShi Shu
Shi Shu

28 March 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Open access
LZLeo Yu Zhang
Leo Yu Zhang
YLYuansheng Liu
Yuansheng Liu
Fabio PareschiFabio Pareschi
Fabio Pareschi
YZYushu Zhang
Yushu Zhang
KWKwok-Wo Wong
Kwok-Wo Wong
GSGianluca Setti
Gianluca Setti
The need for fast and strong image cryptosystems motivates researchers to develop new techniques to apply traditional cryptographic primitives in order to exploit the intrinsic features of digital images. One of the most popular and mature technique is the use of complex dynamic phenomena, including chaotic orbits and quantum walks, to generate the required key stream. In this paper, under the assumption of plaintext attacks we investigate the security of a classic diffusion mechanism (and of its variants) used as the core cryptographic primitive in some image cryptosystems based on the aforementioned complex dynamic phenomena. We have theoretically found that regardless of the key schedule process, the data complexity for recovering each element of the equivalent secret key from these diffusion mechanisms is only O(1). The proposed analysis is validated by means of numerical examples. Some additional cryptographic applications of this paper are also discussed.

1 September 2016 in Neurocomputing
Verified
Journal Article
Closed access
YZYushu Zhang
Yushu Zhang
JZJiantao Zhou
Jiantao Zhou
FCFei Chen
Fei Chen
LZLeo Yu Zhang
Leo Yu Zhang
KWKwok-Wo Wong
Kwok-Wo Wong
DXDi Xiao
Di Xiao