Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jie Zhang 0004

dblp:84/6889-4 · DBLP profile ↗
← Back
10ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › boolean functions
algebraic immunity
0.112012
On the construction of multi-output Boolean functions with optimal algebraic immunity · Sci. China Inf. Sci. 2012
Cryptographic primitives and cryptanalysis
boolean functions
0.112012
On the construction of multi-output Boolean functions with optimal algebraic immunity · Sci. China Inf. Sci. 2012
Coding theory
boolean functions
0.012012
On the construction of multi-output Boolean functions with optimal algebraic immunity · Sci. China Inf. Sci. 2012

Methods — techniques the papers use, named apart from their topics

algebraic immunity · 0.3
YearPublicationVenuePosition
2026 Versatile and harmless deepfake proactive forensics via conditional watermarking
Xiaoshuai Wu, Xin Liao 0001, Jie Zhang 0004, Jinlin Guo
Inf. Sci.3
2016 Linear complexity of generalised cyclotomic quaternary sequences of length 2p m+1 q n+1
abstract
Sequences with high linear complexity play a fundamental part in cryptography. In this study, the authors construct general forms of Whiteman's generalised cyclotomic quaternary sequences with period 2 p m +1 q n +1 of order two over 𝔽 4 and give the linear complexity of the proposed sequences. The conclusions reveal that such sequences have good balance property and high linear complexity.
Zuling Chang, Qiaoyan Wen, Jie Zhang 0004
IET Inf. Secur.4
2014 Constructions of resilient rotation symmetric boolean functions on given number of variables
abstract
In this study, the properties of the support tables of rotation symmetric Boolean functions (RSBFs for simplicity) are studied, and two sufficient and necessary conditions for RSBFs being 1‐ and 2‐resilient are obtained, respectively. Based on the relations between resilient functions and orthogonal arrays, with the help of the properties about the support tables of RSBFs, it is shown that the constructions of 1‐resilient RSBFs on given number of variables are equivalent to solving an equation system, and the number of functions is equal to the number of solutions of the equation system. Moreover, similar results are also obtained for 2‐resilient RSBFs. Lastly, a simple example is given to demonstrate our method. The results indicate that the constructions of n ‐variable 1‐resilient RSBFs are equivalent to studying the cyclotomic cosets C s modulo 2 n − 1 with respect to 2.
Jiao Du, Qiaoyan Wen, Jie Zhang 0004, Shanqi Pang
IET Inf. Secur.3
2013 On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p m
Pinhui Ke, Jie Zhang 0004, Shengyuan Zhang
Des. Codes Cryptogr.2
2012 On the construction of multi-output Boolean functions with optimal algebraic immunity
Jie Zhang 0004, ShouChao Song, Jiao Du, Qiaoyan Wen
Sci. China Inf. Sci.1
2012 A Novel Steganographic Method with Four-Pixel Differencing and Modulus Function
abstract
To improve the stego-image quality and provide a larger embedding capacity, a novel steganographic method based on four-pixel differencing and modulus function is presented. We process a block of four neighboring pixels, and form three two-pixel groups to record the information of secret data. In each group, the difference value between two pixels is exploited to estimate how many secret bits will be embedded. Two pixels will be adjusted so that the sum of the remainders of them is equal to secret data. In order to extract the secret data exactly, four pixel values in a block are adjusted synchronously by using modulus function. An optimization problem is formulated to minimize the embedding distortion. A theoretical proof is given to ensure the solvability of the problem. The experimental results show the proposed method not only has a larger embedding capacity but also provides better stego-image quality.
Xin Liao 0001, Qiaoyan Wen, Ze-li Zhao, Jie Zhang 0004
Fundam. Informaticae4
2011 A steganographic method for digital images with four-pixel differencing and modified LSB substitution
Xin Liao 0001, Qiaoyan Wen, Jie Zhang 0004
J. Vis. Commun. Image Represent.3
2010 Multi-party covert communication with steganography and quantum secret sharing
Xin Liao 0001, Qiaoyan Wen, Jie Zhang 0004
J. Syst. Softw.4
2006 Results on Almost Resilient Functions
Pinhui Ke, Jie Zhang 0004, Qiaoyan Wen
ACNS2
2006 New Constructions of Large Binary Sequences Family with Low Correlation
Jie Zhang 0004, Qiaoyan Wen
Inscrypt2