Optimal Secure Information using Digital Watermarking and Fuzzy Rule base

Naseem, Muhammad Tahir; Nadeem, Muhammad; Qureshi, Ijaz Mansoor; Hussain, Ayyaz

doi:10.1007/s11042-018-6501-8

Cited by 5 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…At present, many scholars have proposed many solutions for information security technologies, such as digital watermarking technology, authentication technology, and access control technology [22][23][24][25][26][27][28][29][30]. However, these technologies all have one thing in common, which is that they need to modify the whole system or redevelop a new system to realize its functions; this, in turn, leads to problems such as high costs or long cycle times.…”

Section: Related Workmentioning

confidence: 99%

A Chunked and Disordered Data Privacy Protection Algorithm: Application to Resource Platform Systems

Zhang

Chen

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

This paper provides a systematic analysis of existing resource platforms, evaluating their advantages and drawbacks with respect to data privacy protection. To address the privacy and security risks associated with resource platform data, we propose a novel privacy protection algorithm based on chunking disorder. Our algorithm exchanges data within a specific range of chunk size for the position and combines the chunked data with the MD5 value in a differential way, thus ensuring data privacy. To ensure the security of the algorithm, we also discuss the importance of preventing client and server decompilation during its implementation. The findings of our experiments are as follows. Our proposed privacy-preserving algorithm is extremely secure and easy to implement. Our algorithm has a significant avalanche effect, maintaining values of 0.61–0.85, with information entropy being maintained at 4.5–4.9. This indicates that our algorithm is highly efficient without compromising data security. Furthermore, our algorithm has strong encryption and decryption time stability. The key length can be up to 594 bits, rendering it challenging to decrypt. Compared with the traditional DES algorithm, our algorithm has better security under the same conditions and approaches the levels of security offered by the AES and RC4 algorithms.

show abstract