PCA-based web page watermarking

The tamper-proof of web pages is of great importance. Some watermarking schemes have been reported to solve this problem. However, both these watermarking schemes and the traditional hash methods have a problem of increasing file size. In this paper, we propose a novel watermarking scheme for the tamper-proof of web pages, which is free of this embarrassment. For a web page, the proposed scheme generates watermarks based on the principal component analysis (PCA) technique. The watermarks are then embedded into the web page through the upper and lower cases of letters in HTML tags. When a watermarked web page is tampered, the extracted watermarks can detect the modifications to the web page, thus we can keep the tampered one from being published. Extensive experiments are performed on the proposed scheme and the results show that the proposed scheme can be a feasible and efficient tool for the tamper-proof of web pages.     

A novel hyper-chaotic image encryption scheme based on quantum genetic algorithm and compressive sensing

Over the last few years, lots of chaotic image encryption schemes have been proposed. However, most of the schemes are permutation-diffusion architectures which still have some shortcomings, such as weak key streams, small key spaces, small information entropy, and so on. To eliminate the above weaknesses, in this paper, we propose a hyper-chaotic image encryption scheme based on quantum genetic algorithm (QGA) and compressive sensing (CS), which is a new image encryption scheme and has not been proposed so far. Firstly, QGA can update the population with the quantum rotation gate, which can enhance the randomness of the population and avoid falling into local optimum. Then compressive sensing technology is used to reduce data storage and speed up the encryption and decryption process. Moreover, we utilize the SHA-512 hash function of the plain image to calculate the initial values of the hyper-chaotic system, which is capable of enhancing the relationships between encryption schemes and plain images. The simulation experiments and security analysis reveal that the proposed scheme is more efficient in resisting statistical attack and plaintext attack and shows better performance in peak signal-to-noise ratio (PSNR) and information entropy compared with other image encryption schemes based on chaos theory.

     

Quasi-commutative watermarking and encryption for secure media content distribution

Commutative Watermarking and Encryption (CWE) provides a solution for interoperation between watermarking and encryption. It realizes the challenging operation that embeds a watermark into the encrypted multimedia data directly, which avoids the decryption–watermarking–encryption triples. Till now, few CWE schemes have been reported. They often obtain the commutative property by partitioning multimedia data into independent parts (i.e., the encryption part and the watermarking part). Since the two parts are isolated, it can not keep secure enough against replacement attacks. To avoid the disadvantage, a novel quasi-commutative watermarking and encryption (QCWE) scheme based on quasi-commutative operations is proposed in this paper. In the proposed scheme, the encryption operation and watermarking operation are applied to the same data part. Since the two operations are homogenous with commutative properties, their orders can be commutated. As an example, the scheme for MPEG2 video encryption and watermarking is presented. In this example, the DCs in intra macroblocks are encrypted or watermarked based on random module addition, while the DCs in other macroblocks and all the ACs’ signs are encrypted with a stream cipher or block cipher. Analysis and experiments show that the scheme obtains high perceptual security and time efficiency, and the watermarking and encryption operations can be commutated. These properties make the scheme a suitable choice for efficient media content distribution. Additionally, the paper shows the availability of constructing the commutative watermarking and encryption scheme with homogenous operations, which is expected to activate the new research topic.

应用于后量子密码的高速高效SHA-3硬件单元设计

随着量子计算技术的高速发展,传统的公钥密码体制正在遭受破译的威胁,将现有加密技术过渡到具有量子安全的后量子密码方案上是现阶段密码学界的研究热点。在现有的后量子密码(Post-Quantum Cryptography,PQC)方案中,基于格问题的密码方案由于其安全性,易实施性和使用灵活的众多优点,成为了最具潜力的PQC方案。SHA-3作为格密码方案中用于生成伪随机序列以及对关键信息散列的核心算子之一,其实现性能对整体后量子密码方案性能具有重要影响。考虑到今后PQC在多种设备场景下部署的巨大需求,SHA-3的硬件实现面临着高性能与有限资源开销相互制约的瓶颈挑战。对此,本文提出了一种高效高速的SHA-3硬件结构,这种结构可以应用于所有的SHA-3家族函数中。首先,本设计将64 bit轮常数简化为7 bit,既减少了轮常数所需的存储空间,也降低了运算复杂度。其次,提出了一种新型的流水线结构,这种新型结构相比于通常的流水线结构对关键路径分割得更加均匀。最后,将新型流水线结构与展开的优化方法结合,使系统的吞吐量大幅提高。本设计基于XilinxVirtex-6现场可编程逻辑阵列(FPGA)完成了原型实现,结果显示,所设计的SHA-3硬件单元最高工作频率可达459 MHz,效率达到14.71 Mbps/Slice。相比于现有的相关设计,最大工作频率提高了10.9%,效率提升了28.2%。     

Hash key-based image encryption using crossover operator and chaos

This paper proposes a color image encryption scheme using one-time keys based on crossover operator, chaos and the Secure Hash Algorithm(SHA-2). The (SHA-2) is employed to generate a 256-bit hash value from both the plain-image and the secret hash keys to make the key stream change in each encryption process. The SHA-2 value is employed to generate three initial values of the chaotic system. The permutation-diffusion process is based on the crossover operator and XOR operator, respectively. Experimental results and security analysis show that the scheme can achieve good encryption result through only one round encryption process, the key space is large enough to resist against common attacks,so the scheme is reliable to be applied in image encryption and secure communication.     

Commutative encryption and watermarking based on orthogonal decomposition

Commutative Encryption and Watermarking (CEW) is a technology combined with encryption and watermarking, which is used for providing comprehensive security protection for multimedia information. This paper presents a novel CEW scheme based on orthogonal decomposition. Different from current CEW, the proposed CEW not only achieves the integration of encryption and watermarking in the final data but also has no specific restrictions in selecting encryption and watermarking algorithms. Therefore, the proposed CEW possesses higher security and applicability. Experimental results demonstrate that the proposed CEW can keep the performances of selected encryption and watermarking algorithm and show more robustness than other current CEW schemes.     

A self recoverable dual watermarking scheme for copyright protection and integrity verification

Dual watermarking implies embedding of robust as well as fragile watermarks into the same cover image. It facilitates integration of copyright protection and integrity verification into the same scheme. However, most of such existing state of art approaches either lacked the feature of tamper detection and original content recovery or provided an approximation using coarser block level approach. The proposed self recoverable dual watermarking scheme integrates all the aforementioned functionalities of copyright protection, tamper detection and recovery into one scheme. The scheme is independent of the order of embedding of robust and fragile watermarks as these are embedded in different regions of the cover image. It performs tamper detection and recovery, both at the pixel level. The scheme obtains recovery information for each 2×2 image block in just eight bits which are further encoded to only four bits via mapping table. This reduction in recovery bits allows efficient embedding of copyright information which is tested against comprehensive set of attacks. The scheme is found to be robust against noises, filtering, histogram equalization, rotation, jpeg compression, motion blur etc. Besides the normalized cross correlation value, the evaluation of the extracted copyright information is also being done using various objective error metrics based on mutual relation between pixels, their values and locations respectively. The imperceptibility and visual quality of the watermarked as well as recovered image is found to be satisfactorily high. Three major categories of images: natural, texture as well as satellite have been tested in the proposed scheme. Even minute alterations can be chalked out as the detection accuracy rate has been enumerated on pixel basis. The scheme can tolerate tampering ratios upto 50 percent though the visual quality of the recovered image deteriorates with increasing tampering ratio. Comparative results based on normalized cross correlation, probability of false acceptance, probability of false rejection and peak signal to noise ratio metrics validate the efficacy of the proposed scheme over other existing state of art approaches.     

A secure image encryption scheme based on chaotic maps and affine transformation

Due to the interesting nonlinear dynamic properties of chaotic maps, recently chaos-based encryption algorithms have gained much attention in cryptographic communities. However, many encryption schemes do not fulfil the minimum key space requirement, which is an essential concern in many secure data applications. In this paper, an efficient chaos-based image encryption scheme with higher key space is presented. Even with a single round of encryption, a significantly larger key space can be achieved. The proposed scheme removes correlation among image pixels via random chaotic sequences, simply by XOR and addition operations. In order to resist against numerous attacks, we apply the affine transformation to get the final ciphertext image. The security of the proposed scheme is proved through histogram, contrast, PSNR, entropy, correlation, key space, key sensitivity and differential attack analysis. Many significant properties of chaotic maps, sensitivity to initial condition and control parameters, structure and attack complexity, make the anticipated scheme very reliable, practical and robust in various secure communication applications.     

Security analysis of a key based color image watermarking vs. a non-key based technique in telemedicine applications

Recently, digital watermarking has become an important technique to preserve patients’ privacy in telemedicine applications. Since, medical information are highly sensitive, security of watermarked medical images becomes a critical issue in telemedicine applications. In this paper, two targeted attacks have been proposed against a key based color image watermarking scheme and also a non-key based one, in order to evaluate their security in telemedicine applications. The target schemes are SVD-based and QR-based color image watermarking algorithms, which their embedding procedures are quit the same. The proposed attacks exploit the prior knowledge of the watermarking algorithms to make changes in the exact embedding spaces. Thus, these changes would cause disruption in extraction procedure. Our experimental results show that the key based watermarking scheme is more secure than the non-key based one. This is because the proposed targeted attack needs to distort the key based watermarked images more than non-key based ones to remove the embedded watermarks. Our proposed targeted attacks also have more efficient performance in removing watermarks than other general attacks such as JPEG compression, Gaussian noise and etc. Finally, these attacks have been proposed to show the vulnerabilities of watermarking schemes in order to help the designers to implement more secure schemes.     

A Novel Watermarking Scheme for Secure Relational Databases

ABSTRACT

Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection and tamper detection and to maintain the integrity of data. Sectors such as defense, finance, and human resources require reliable schemes, especially for data alteration and integrity checking. Many watermarking techniques have been proposed in the literature to address the above-mentioned problems subject to their limitations on numeric attributes. However, these techniques do not yield satisfactory results in the case of small numeric values. To overcome these limitations, we have proposed a watermarking scheme in which the third most significant bit of numeric and nonnumeric attributes is replaced with the watermark bit without loss of originality. The proposed scheme must be suitable for the above-mentioned sectors, including commercial banks where fraud and forgery cases are common.     

Improvements of authenticated encryption schemes with message linkages for message flows

Recently, Tseng et al. proposed two authenticated encryption schemes (basic scheme and generalized scheme) with message linkages, which are efficient in terms of the communication and computation costs in comparison with all the previously proposed schemes. The basic authenticated encryption scheme suited for only after receiving the entire signature blocks, the recipient can then recover the message blocks. In order to allow the receiver to perform the receiving and the recovering processes simultaneously according to application requirements and the transmission efficiency of the network, the generalized authenticated encryption scheme was then proposed. In this paper, we show that both Tseng et al.’s authenticated encryption schemes do not achieve integrity and authentication. Improvements are then proposed to repair the weaknesses.     

A new fast double-chaotic based Image encryption scheme

In this paper, a new scheme for image encryption based on a double chaotic pseudo random generator (DCPG), simple XOR and shift rotations operations is proposed. The DCPG is a combination of both Tent and Chebyshev chaotic and so it needs three values of control parameters which are used as shared secret keys. The encryption consists of two rounds. In the first round, the hash value of the input image is computed using SHA-512. This value also is used as a forth shared secret key and from which, 4 amounts of the shift rotations are extracted. A pseudorandom sequence is generated using the proposed DCPG with the same size of the input image. This sequence and also the input image are divided into blocks of size 1?×?8. Each block of input image is processed with the corresponding block of the pseudorandom sequence using simple shift rotation and XOR operation. To extend the effect of the original image one pixel change to all the pixels of the cipher image, a second round of XOR operation is added. The proposed scheme has many advantages. It is highly secure due to two reasons. Firstly, it uses four secret keys for encryption which provides a large key space to overcome all types of brute force attacks. Secondly, the amounts of shift rotation used are input image dependent which achieves a strong resistance against chosen plaintext attacks. Also, it is more efficient compared to other recently existing schemes as it consists only of two rounds of simple operations. Security analysis of scheme has been provided. Based on the results, our scheme is highly secure with a reduced encryption time and so it can be used for many applications which require real time secure image communications.

     

无高斯噪声的全同态加密方案

基于带舍入学习（LWR）问题,一个分级全同态加密方案最近被提出。LWR问题是带误差学习（LWE）问题的变型,但它省掉了代价高昂的高斯噪声抽样,因此与现有基于LWE问题的全同态加密方案相比,该基于LWR问题的全同态加密方案具有更高的计算效率。然而,该基于LWR问题的全同态加密方案在同态运算时需要输入用户的运算密钥。因此,基于LWR问题构造了一个新的分级全同态加密方案,该方案在同态运算时不需要输入用户的运算密钥。鉴于所提方案可应用于构造基于身份的全同态加密方案、基于属性的全同态加密方案等,它具有比最近所提出的基于LWR问题的全同态加密方案更广泛的应用场景。     

Authenticated encryption schemes with message linkages for message flows

Two efficient authenticated encryption schemes with message linkages are proposed. One is a basic scheme, that it has the better performance in comparison with the all previously proposed schemes in terms of the communication and the computation costs. However, it has a property as same as the previously proposed schemes, that the message blocks can be recovered only after the entire signature blocks have been received. Therefore, the basic scheme is applicable to encrypt all-or-nothing flow. Thus, we improve the basic scheme and also propose a generalized scheme, which allows the receiver to recover the partial message blocks before receiving the entire signature blocks. That is, the receiver may perform the receiving and the recovering processes simultaneously. Therefore, the generalized scheme is applicable to message flows. The generalized scheme requires smaller bandwidth and computational time as compared to the previously proposed authenticated encryption schemes with message linkages for message flows.     

非对称水印

由于密码学和数字水印技术在产权保护等方面有着相互补充的功能和一些类似之处,人们开始将加密技术中的“密钥”引入水印技术中,从而出现了公开密钥水印和非公开密钥水印。只是当将公开密钥的“思想”引入水印后,才对水印的基本方式和理解进行了改变,这就是“非对称水印”。论文从非对称水印产生的必然性等方面对非对称水印进行比较深入的探讨,指出它与传统水印技术的不同之处及优点,同时指出当前它的发展现状及不足。     

云环境下集合隐私计算

多方保密计算是网络空间安全与隐私保护的关键技术,基于同态加密算法的多方保密计算协议是解决云计算安全的一个重要工具.集合隐私计算是多方保密计算的一个基本问题,具有广泛的应用.现有的集合隐私计算方案多是基于两方的情况,基于多方的方案较少,效率较低,且这些方案都不能扩展到云计算平台.本文首先设计了一种新的编码方案,根据新的编码方案和同态加密算法在云计算环境下构造了一个具有普遍适用性且抗合谋的保密计算集合并集问题解决方案.该方案中的同态加密算法既可以是加法同态又可以是乘法同态的加密算法.本文进一步利用哥德尔编码和ElGamal公钥加密算法构造了一种适用于云计算的高效集合并集计算方案.这些方案还可以对多个集合中的所有数据进行保密排序,并证明这些方案在半诚实模型下是安全的.本文中的方案经过简单改造,也可以保密地计算多个集合的交集.     

标准模型下的高效强安全混合加密方案

如何设计标准模型下满足适应性选择密文安全（IND-CCA2）的高效加密方案,是公钥密码学领域的一个重要研究课题。基于判定型双线性Diffie-Hellman问题,提出了一个高效、短公/私钥长度、强安全的,基于对称加密算法、消息认证码算法、密钥分割算法等基础算法的一次一密型混合加密方案,分析了方案的安全性和效率。方案在标准模型下被证明具有IND-CCA2安全性,支持公开的密文完整性验证,与同类方案相比计算效率高。     

高效无双线性对的带关键词搜索的基于证书加密方案

针对已有带关键词搜索的公钥加密方案中存在的复杂的证书管理、密钥托管以及密钥分发等问题,提出一种带关键词搜索的基于证书加密的方案。首先,给出带关键词搜索的基于证书加密方案及其安全模型的形式化定义;然后,基于椭圆曲线构造一个高效无双线性对的带关键词搜索的基于证书加密方案,并基于计算Diffie-Hellman问题（CDHP）证明了该方案满足适应性选择关键词攻击下的关键词密文不可区分性;最后,对所提出方案进行仿真模拟,并就方案特性和性能两个方面与已有的带关键词搜索的公钥加密方法进行对比。对比分析表明,所提出方案不仅具有隐认证、无密钥托管以及无密钥分发的优良特性,而且在计算效率和通信代价上要优于已有的带关键词搜索的无证书加密方案。     

基于奇异值分解的同态可交换脆弱零水印研究

现有的水印和加密方案大多难以确保水印和加密过程的交换性以及受保护图像的视觉质量,这些方案的水印嵌入和加密过程固定且对受保护图像的内容进行了或多或少的修改,很少有方案在不影响受保护图像内容质量的前提下完成水印和加密过程的交换.因此,提出了一种基于奇异值分解的同态可交换脆弱零水印方案.在发送端,内容所有者采取同态加密对原始...     

水印能量估计的一般性框架

数字图像水印技术为网络环境下多媒体数据的传输提供了一个有效的版权保护方案 ,当前大多数的水印算法均利用实验来确定嵌入的水印的最佳能量。该文提出了一个一般性的水印算法框架,可以从理论上计算需嵌入水印的最佳容量或能量,对基于酉变换域方法的数字水印算法而言,该框架可以作为一个有用的指导方法。