Jian Liu

Orcid: 0000-0001-9104-2975

Affiliations:
  • Tianjin University, School of Computer Software, Tianjin, China
  • CNRS, Paris, France
  • Nankai University, School of Mathematical Sciences, Tianjin, China (former)


According to our database1, Jian Liu authored at least 26 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
OFEI: A Semi-Black-Box Android Adversarial Sample Attack Framework Against DLaaS.
IEEE Trans. Computers, April, 2024

2023
Delay-CJ: A novel cryptojacking covert attack method based on delayed strategy and its detection.
Digit. Commun. Networks, October, 2023

A Privacy-Preserving Medical Data Sharing Scheme Based on Blockchain.
IEEE J. Biomed. Health Informatics, February, 2023

UAF-GUARD: Defending the use-after-free exploits via fine-grained memory permission management.
Comput. Secur., 2023

IGA : An Improved Genetic Algorithm to Construct Weightwise (Almost) Perfectly Balanced Boolean Functions with High Weightwise Nonlinearity.
Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, 2023

2022
Results on the nonexistence of bent-negabent rotation symmetric Boolean functions.
Cryptogr. Commun., 2022

2021
Sparse Trust Data Mining.
IEEE Trans. Inf. Forensics Secur., 2021

FNet: A Two-Stream Model for Detecting Adversarial Attacks against 5G-Based Deep Learning Services.
Secur. Commun. Networks, 2021

FIGCPS: Effective Failure-inducing Input Generation for Cyber-Physical Systems with Deep Reinforcement Learning.
Proceedings of the 36th IEEE/ACM International Conference on Automated Software Engineering, 2021

MFF-AMD: Multivariate Feature Fusion for Android Malware Detection.
Proceedings of the Collaborative Computing: Networking, Applications and Worksharing, 2021

2020
More Efficient Trapdoor-Permutation-Based Sequential Aggregate Signatures with Lazy Verification.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020

Constructions of optimal locally recoverable codes via Dickson polynomials.
Des. Codes Cryptogr., 2020

2019
Balanced $$2^k$$ 2 k -variable rotation symmetric Boolean functions with optimal algebraic immunity.
J. Appl. Math. Comput., October, 2019

Secondary constructions of RSBFs with good cryptographic properties.
Inf. Process. Lett., 2019

Weightwise perfectly balanced functions with high weightwise nonlinearity profile.
Des. Codes Cryptogr., 2019

A family of weightwise (almost) perfectly balanced boolean functions with optimal algebraic immunity.
Cryptogr. Commun., 2019

2018
New Constructions of Optimal Locally Recoverable Codes via Good Polynomials.
IEEE Trans. Inf. Theory, 2018

2017
On the Conjecture About the Linear Structures of Rotation Symmetric Boolean Functions.
Int. J. Found. Comput. Sci., 2017

On the nonlinearity of S-boxes and linear codes.
Cryptogr. Commun., 2017

2016
Partially homomorphic encryption schemes over finite fields.
IACR Cryptol. ePrint Arch., 2016

Variation on correlation immune Boolean and vectorial functions.
Adv. Math. Commun., 2016

2015
Secret Sharing Schemes with General Access Structures (Full version).
IACR Cryptol. ePrint Arch., 2015

On the Diffusion Property of Iterated Functions.
IACR Cryptol. ePrint Arch., 2015

Secret Sharing Schemes with General Access Structures.
Proceedings of the Information Security and Cryptology - 11th International Conference, 2015

2014
Highly Nonlinear Resilient Functions without Linear Structures.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

2013
On the relationships between perfect nonlinear functions and universal hash families.
Theor. Comput. Sci., 2013


  Loading...