Ren Lijing

Dr. Ren Lijing


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
10 May 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
RLRen Lijing
Ren Lijing
ZDzhang denghui
zhang denghui
Benefiting from the development of the Internet and smart devices, it is now convenient to transmit images anywhere and anytime, which poses a new challenge for image security. The Visual Cryptography Scheme (VCS) is a secret sharing method for protecting an image without a key, the merit of VCS is the human visual system (HVS) can restore the secret image by simply superimposing qualified shares, without any computation. To eliminate noise-like shares in traditional VCS, this paper presents a novel QR code-based expansion-free and meaningful visual cryptography scheme (QEVCS), which generates visually appealing QR codes for transmitting meaningful shares. When distributing on public networks, this scheme does not attract the attention of potential attackers. By limiting the gray-level of a halftoned image, QEVCS both keep the computation-free of visual cryptography and the size of recovery image same as the secret images. The experimental results show the effectiveness of QEVCS when preserving the privacy of images.

29 July 2021 in Advances in Multimedia
Verified
Journal Article
Open access
PDF file
RLRen Lijing
Ren Lijing
Raster map is an image that has been discretized in space and brightness, and it is an important carrier of geospatial data. With the rapid development of Internet and big data technologies, preserving the privacy of raster map has become an urgent task. To solve these issues, we propose a novel extended visual cryptography scheme to securely store a raster map into other two meaningful halftone maps in the paper. The scheme avoids the random-looking shares of visual cryptography schemes which are vulnerable and hard to manage. We first apply the halftone and color decomposition methods to transform a color secret map into halftone images. After that, we encode the secret map block by block to avoid pixel expansion. At last, by optimizing the selection of encrypted blocks, we achieve a high-quality secret recovery from generated multiple equal-sized shares. The technique used is to employ a versatile and secure raster map exchange. Experimental results show that, compared with previous work, the proposed scheme significantly improves the performance of recovered raster maps.

22 March 2022 in Advances in Multimedia
Verified
Journal Article
Open access
PDF file
RLRen Lijing
Ren Lijing
ZDzhang denghui
zhang denghui
The popularity of more powerful and smarter digital devices has improved the quality of life and poses new challenges to the privacy protection of personal information. In this paper, we propose a biometric recognition system with visual cryptography, which preserves the privacy of biometric features by storing biometric features in separate databases. Visual cryptography combines perfect ciphers and secret sharing in cryptography with images, thus eliminating the complex operations in existing privacy-preserving schemes based on cryptography or watermarking. Since shares do not reveal any feature about biometric information, we can efficiently transmit sensitive information among sensors and smart devices in plain. To abate the influence of noise in visual cryptography, we leverage the generalization ability of transfer learning to train a visual cryptography-based recognition network. Experimental results show that our proposed method keeps the high accuracy of the feature recognition system when providing security.

25 February 2022 in Processes
Verified
Journal Article
Open access
PDF file
RLRen Lijing
Ren Lijing
ZDzhang denghui
zhang denghui
Porous structures are kinds of structures with excellent physical properties and mechanical characteristics through components and internal structure. However, the irregular internal morphology of porous structures poses new challenges to product modeling techniques. Traditional computer-aided design (CAD) modeling methods can only represent the external geometric and topological information of models, lacking the description of the internal structure and conformation, which limits the development of new porous products. In this paper, a new simple and effective modeling method for 3D irregular porous structures is proposed, which improves the controllability of pore shape and porosity, thus overcoming the limitations of existing methods in 3D and concave structures. The key idea is to solve isothermal for modeling the porosity of porous units. Experimental results show that the method can easily obtain smooth and approximate porous structures from arbitrary irregular 3D surfaces.

14 September 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZDzhang denghui
zhang denghui
RLRen Lijing
Ren Lijing
ZGZhaoquan Gu
Zhaoquan Gu
The addressing and discovering service is a vital infrastructure of the Internet. New applications and scenarios in next-generation networks rely on the secure and stable operation of domain name services, which puts forward new security challenges for the original domain name mechanism. While previous security enhancements of network services struggled to strike a balance between security, performance, and compatibility, hindering further use of core network services, the TEE (Trusted Computing Environment) technology can provide trusted and confidential services in untrusted network environments by verifiable hardware signatures. In this paper, we present a novel trustworthy service architecture with the preservation of security and privacy for addressing messages. The scheme provides a secure enclave to generate authenticatable responses between clients and targets, thus ensuring the privacy of services. We further build a new TEE compilation model to ensure that the built resolver application can provide trusted and secure services within TEE while keeping the availability without the TEE hardware. Experimental results show that our approach can enhance the privacy and security of addressing services such as DNS (Domain Name System) without sacrificing the quality of service and breaking the infrastructures of existing services.

27 July 2022 in Buildings
Verified
Journal Article
Open access
PDF file
RLRen Lijing
Ren Lijing
ZDzhang denghui
zhang denghui
Engineering data, including product data-conversion networks and software dependency networks, are very important for the long-term preservation of product information. With the explosive growth of data in recent years, product information has become increasingly diversified and complex, which poses new challenges to the long-term preservation of product data. A better understanding of the functions of complex networks can help us take more effective measures to maintain and control such complex systems, and then adopt more effective methods to achieve life cycle management. It is currently difficult for traditional heuristic methods to deal with such large-scale complex systems. In recent years, however, the use of graph neural networks to identify key nodes attracted widespread attention, but this requires a large amount of training data. It is difficult to obtain large-scale relational data and establish identification models in engineering fields. Combining a graph convolution network with a data-mining method, a key node identification method in a graph convolution network based on data mining is proposed. The method first determines the type of complex network according to the power-law distribution and centrality of the network and then uses the corresponding evolutionary model to generate a large-scale synthetic network to effectively train the model. The experimental results from two real networks show that this method improves the identification performance of key nodes by using synthetic data with the same characteristics as the real network, and provides a new perspective for product life cycle management.