A Distributed Secret Sharing Method with QR Code Based on Information Hiding

QR codes are applied widely on the Internet and mobile devices in recent years.Its open standards and the characteristics of easy to generate lead to anyone can generate their QR code easily.Also,the QR code does not have the ability of hiding information,which leads to everyone can get access to read the content in any QR code,including those hiding some secret content in the bytes of QR code.Therefore,in recent years,information tampering and information leakage cases caused by poor security of two-dimensional code occur frequently,especially in the financial field and multi-party verification scenarios.QR codes are almost impossible to use in these scenarios.Therefore,this paper proposes a distributed information sharing method based on information hiding QR code.This method can make secret code in QR code safer and robust,and the secret shared between receivers can be used for decryption and attacking detection.Therefore,on the one hand,the information hiding method can maximize the capacity of embedded secret information,on the other hand,it can prevent attacks by disguised attackers and recover hidden secret information through reconstruction.This paper illustrates the feasibility of this scheme through the form of theoretical proof.

Information hiding scheme for vector maps based on fingerprint certification

An information hiding scheme for vector maps is presented to identify the source after the vector map is leaked in some key application areas. In this scheme, the fingerprint image of the map owner can be converted into a character string as the watermark, and then the watermark will be embedded into the coordinate descriptions of the attribute file by the "0-bit value" programming method. This programming algorithm ensures that the accuracy is lossless and the graphics is unchanged for any vector map. Experiments show that the presented hiding scheme has stable robustness, the average similarity rate is 97.2% for fingerprints matching and the false non-match rate is 1.38% in the blocking test. In the opening test, the former reaches 84.46% and the latter reaches 5.56%.

A Robust Digital Watermarking Algorithm Based on Finite-Set Discrete Radon Transform Tight Frame

Digital watermarking technology plays a powerful role in the effective protection of digital media copyright, image authentication, image sharing, image information transmission and other fields. Driven by strong demand, digital image watermarking technology has aroused widespread research interest and has gradually developed into one of the most active research directions in information science. In this paper, we present a novel robust digital watermarking algorithm based on discrete radon transform tight frame in finite-set (FDRT). FDRT of the zero mean image is a tight frame, the frame boundary A = B = 1, the dual of the frame is itself. The decomposition and reconstruction of the FDRT tight frame will not cause the phenomenon of image distortion. The embedding of hidden watermark is to add a weak signal to the strong background of the original image. Watermark extraction is to effectively identify the embedded weak signal. The feasibility of the watermarking algorithm is analyzed from two aspects of information hiding and robustness. We select the independent Gaussian random vector as the watermark series, and the peak signal-to-noise ratio (PSNR) as the visual degradation criterion of the watermark image. Basing the FDRT compact stand dual operator, we derived the relationship among the strength parameter, square sum of watermark series, the PSNR. Using Checkmark system, the simulation results show that the algorithm is robust enough to some very important image processing attacks such as lossy compression, MAP, filtering, segmentation, edge enhancement, jitter, quadratic modulation and general geometric attack (scaling, rotation, shearing), etc.

An Anti-Cutting Watermarking Algorithm Based on Matrix Multiplication Secret Sharing Scheme

A digital watermarking algorithm based on the matrix multiplication secret sharing scheme is proposed. It partitions the field of the image into n shares, and also partitions the watermark into n shares correspondingly. After the original image is divided, the digital watermark is embedded into the low frequency DCT domain and only needs part shares in the recovering course. Experimental results show that this algorithm has a good effect of hiding, anti-cutting and anti-compressing.

Boosting image watermarking authenticity spreading secrecy from counting-based secret-sharing

This study presents enhancing images authentication by securing watermarking hidden data via shares generated from counting-based secret sharing.The trustfulness of shares utilised secret-sharing as an applicable privacy creation tool for the authentication of real-life complex platforms.This research adjusts embedding the watermarking data over the images by innovative redistribution of shares to be embedded spread over all the images.The anticipated watermarking technique guaranteed to scatter the share bits implanting at different least significant bits of image pixels as boosting up the trust overall authentication practicality.The paper experimentation performance analysis shows that this improved image watermarking authentication(capacity)is averagely better by 33%–67%than other related exclusive-OR oriented and octagon approaches.Interestingly,these measurement improvements did not degrade the robustness and security of the system,inspiring our research for opening novel track of related future counting-based secret-sharing authentication progresses to come.

Fragile Watermarking Based on Robust Hidden Information

Block-wise fragile watermarks can be used to reveal maliciously tampered areas in multimedia products. However a forged content containing a cloned fragile watermark can be constructed by using a series of watermarked data. To defeat this type of counterfeit attack, a novel fragile watermarking technique is proposed in which different pseudo-random data are selected for different host products, and the generated fragile watermark is dependent upon the selected information. While inserting the fragile watermark, the pseudo-random information is also robustly embedded into the host data. Because of the difference between the selected information, different watermarked data cannot be used to forge illegal contents containing a valid fragile watermark.

Digital Watermarking Scheme for Securing Textual Database Using Histogram Shifting Model

Information security is one of the most important methods of protecting the confidentiality and privacy of internet users.The greater the volume of data,the more the need to increase the security methods for protecting data from intruders.This task can be challenging for researchers in terms of managing enormous data and maintaining their safety and effectiveness.Protection of digital content is a major issue in maintaining the privacy and secrecy of data.Toward this end,digital watermarking is based on the concept of information security through the insertion and detection of an embedded watermark in an efficient manner.Recent methodologies in the research on digital watermarking result in data distortion after embedding the watermark.This scenario can reduce the efficiency of detecting watermarks as well as violate data confidentiality.This study adapts a robust reversible histogram shifting(HS)technique for textual data in relational databases.Furthermore,the study presents a digital watermarking scheme intended for document copyright protection and proof of ownership.The major advantage of the proposed watermarking scheme is that it can protect digital data and preserve data quality.To the best of our knowledge,this research methodology is promising for use in the HS expansion model for watermarking data on nonnumeric databases.In addition,the results showed that despite exposing the database to an insertion attacks at 50%and 75%of the watermark,the proposed algorithm can recovermore than half of the embedded watermark in all addition and alteration attacks cases.As a result,the watermark information can be retained and restored completely.

Wavelet neural network based watermarking technology of 2D vector maps

A novel lossless information hiding algorithm based on wavelet neural network for digital vector maps is introduced. Wavelet coefficients being manipulated are embedded into a vector map, which could be restored by adjusting the weights of neurons in the designed neural network. When extracting the watermark extraction, those coefficients would be extracted by wavelet decomposition. With the trained multilayer feed forward neural network, the watermark would be obtained finally by measuring the weights of neurons. Experimental results show that the average error coding rate is only 6% for the proposed scheme and compared with other classical algorithms on the same tests, it is indicated that the proposed algorithm hashigher robustness, better invisibility and less loss on precision.

A QR Data Hiding Method Based on Redundant Region and BCH

In recent years,QR code has been widely used in the Internet and mobile devices.It is based on open standards and easy to generate a code,which lead to that anyone can generate their own QR code.Because the QR code does not have the ability of information hiding,any device can access the content in QR code.Thus,hiding the secret data in QR code becomes a hot topic.Previously,the information hiding methods based on QR code all use the way of information hiding based on image,mostly using digital watermarking technology,and not using the coding rules of QR code to hide information.Therefore,we propose a distributed information sharing method based on QR code information hiding.On the one hand,we can start from the coding rules of QR code and use the information hiding method to maximize the capacity of secret information embedded in QR code.On the other hand,the distributed information sharing method is used to decentralize.At the same time,experimental results and analysis show that the proposed scheme can prevent the attack of camouflage attacker,and finally recover hidden information by secret reconstruction.

基于图像的信息隐藏分析技术综述

信息隐藏分析技术就是对信息隐藏系统进行攻击的技术。该文简要介绍了信息隐藏技术和信息隐藏分析技术，分析了基于数字图像的信息隐藏分析技术，并对现有的多种信息隐藏分析方法和研究现状进行了深入讨论。

一种基于矢量共享方案的DCT域上数字水印分存算法

数字水印分存是将秘密共享的思想用于数字水印 ,将原始水印信息分解成n份分存水印信息 ,获得其中部分分存水印信息就能恢复出原始水印信息 .该文提出一种基于矢量共享方案的DCT域上的数字水印分存算法 .它将矢量共享的思想用于数字水印 .原始载体图像分块后 ,在DCT变换的低频域上加载分存后的水印数据 .水印信息隐藏前 ,对原始水印和分块水印都进行扰乱处理 ,同时分存也具有加密作用 .算法具有很高的安全性和较好的稳健性 .实验表明 ,算法还具有较好的隐藏效果和很好的抗剪切、抗压缩等功能 .

基于矢量共享方案的数字水印分存算法

提出一种基于矢量共享方案的数字水印算法,将矢量共享的思想用于数字水印.算法在对水印信息隐藏前,对原始水印和分块水印都进行扰乱处理,同时分存也具有加密作用,算法具有很高的安全性.实验表明,算法还具有很好的隐藏效果和抗剪切功能.

GIS空间数据水印信息隐藏与加密技术方法研究

提出了在GIS空间数据中隐藏标识数据生产单位版权以及用户使用权属的数字水印 ,并对其进行压缩、加密 ,以此来跟踪、抵制GIS空间数据产品的非法流通、非法复制 ,有效地保护数据生产单位的合法权益。运用本文方法已开发出了相应的应用软件 。

基于图像的信息隐藏检测算法和实现技术研究综述

基于图像的信息隐藏及分析技术是信息安全领域的一个重要方面 信息隐藏技术包括了隐写术和数字水印 信息隐藏检测技术是信息隐藏技术的攻击技术 通过基于图像的信息隐藏检测技术 ,可以判断图像中是否存在信息的隐藏和嵌入 基于图像的信息隐藏检测技术包括了数字图像特征分析、检测算法和实现技术 提出了基于图像的信息隐藏检测技术的知识体系 重点阐述了多种基于图像的信息隐藏检测算法 ,并进行了理论分析和实验测试 分析了现有的几种基于图像的信息隐藏的实现技术 。

数字水印技术及进展

阐述了数字水印技术产生的必然性 ,分析了数字水印技术的研究现状 ,并简要叙述了云数字水印技术 ,探讨了数字水印技术的特点及其各种攻击方式 ,举例说明了目前数字水印在商业上的应用。数字水印技术的研究对数字内容的版权保护有重大实用价值和实践意义。

数字水印技术研究进展

随着因特网的日益普及 ,多媒体信息交流达到了前所未有的深度和广度 ,但作品侵权也随之更加容易 ,篡改也更加方便 ,因此 ,如何保护作品版权已受到人们的高度重视 ,而如今信息隐藏技术 ,特别是数字水印技术作为版权保护的重要手段 ,已得到广泛的研究和应用 .为了使人们对该技术有一个较全面的了解 ,因而对数字水印技术的研究与进展情况进行了较系统的论述 ,即首先对信息隐藏技术进行了介绍 ,并对该技术进行了分类 ,然后重点分析了数字水印技术的模型、典型算法及其攻击方法 。

视频水印技术综述

介绍了视频水印技术的原理和主要应用领域,分析了视频水印技术的特点和面临的挑 战,阐述了视频水印的模型及算法分类,探讨了视频水印的发展趋势。

基于小波变换的数字水印隐藏与检测算法

主要研究了在数字语音信号中加入数字水印的方法 ,提出了一种基于小波变换的数字水印隐藏与检测算法 ,用这种算法隐藏水印具有很强的隐蔽性 ,对原始语音的影响基本上察觉不出来 .叠加了水印的语音在经过多种强干扰及各种信号处理的变换之后 ,使用本算法仍能正确检测出水印的存在 ,如它可以抵抗强噪声干扰、去噪算法对信号进行去噪处理、语音信号的有损压缩以及信号的重新采样等 .

信息隐藏理论与关键技术研究

本项目主要研究了信息隐藏的基本模型,在数字图像、音频、视频、文本中的信息隐藏和数字水印算法,以及信息隐藏检测的基本方法。

一种基于动直线的多幅图像分存方法

Shamir给出了一种基于拉格朗日插值的密码学分存方案 ,该文将其思想引入到图像信息安全处理当中 ,提出了用动直线进行多幅图像分存的方法 ,并阐述了这一算法的数学基础 .此外 ,在进行图像分存时考虑了更多的原始图像 ,采用高次有理曲线进行图像分存计算 ,并分析比较了基于拉格朗日插值的分存算法和基于动直线的分存算法在多幅图像分存上的异同 ,指出了基于拉格朗日插值的图像分存算法在实际应用中存在的问题 .最后 ,给出了采用动直线进行图像分存的实验结果 .