New (t, n) threshold directed signature scheme with provable security

Directed signature scheme allows only a designated verifier to check the validity of the signature issued to him; and at the time of trouble or if necessary, any third party can verify the signature with the help of the signer or the designated verifier as well. Due to its merits, directed signature scheme is widely used in situations where the receiver’s privacy should be protected. Threshold directed signature is an extension of the standard directed signature, in which several signers may be required to cooperatively sign messages for sharing the responsibility and authority. To the best of our knowledge, threshold directed signature has not been well studied till now. Therefore, in this paper, we would like to formalize the threshold directed signature and its security model, then present a new (t, n) threshold directed signature scheme from bilinear pairings and use the techniques from provable security to analyze its security.     

A Convertible Multi-Authenticated Encryption scheme for group communications

Recently, Wu et al. proposed a Convertible Multi-Authenticated Encryption (CMAE) scheme, which allows a signing group with multiple signers to generate a multi-authenticated ciphertext signature on the chosen message so that only a designated verifier can recover and verify the message. In case of later dispute, the verifier can convert the multi-authenticated ciphertext signature into an ordinary one that can be verified by anyone. In this study, a CMAE scheme for group communications is proposed. This is presented by first reviewing the concepts of group-oriented encryption schemes and the merits of Wu et al.’s scheme. This shows that not only can a multi-authenticated ciphertext signature be generated by a signing group, but also the message can be recovered and verified by a verifying group with multiple verifiers. The security of the proposed scheme is based solely on the DDH problem, which provides higher security confidence than using the CDH problem in Wu et al.’s CMAE scheme.     

针对栅格地图的快速鲁棒盲水印算法

为解决大数据量栅格地图的版权保护问题,提出一种快速、鲁棒的水印算法。该算法基于分块思想将水印嵌入到傅立叶频域的半圆形区域。在提取水印时,先进行预处理校正,再利用邻域均值法将大幅面图像的频谱图映射成为标准大小的频谱图,既做到了盲提取,又解决了分块嵌入与全图提取带来的问题。实验表明该算法占用内存小、运行效率高,对裁剪、旋转、对比度和亮度变化等攻击具有较好的鲁棒性。     

基于RSA的数字签名算法及其快速实现

在基于RSA的数字签名算法中,直接决定实现效率的是大数模幂运算。对基于二进制的Montgomery算法进行了改进,并将其应用于大数的模幂运算中。改进后的算法在保证算法快速实现的同时,又节省了算法运算空间。     

一种基于椭圆曲线的多级代理盲多重签名方案

该文设计了一种新的基于椭圆曲线密码体制的多级代理盲多重签名方案,该方案允许m个原始签名人共同将自己的权力委托给1级代理人,1级代理人在许可范围内继续逐级授权。而且该方案通过盲签名实现了签名的匿名性和不可追踪性。在此数字签名的基础上,采用了椭圆曲线的签名和验证方式,极大的提高了方案的安全性和实现速度。     

基于BP神经网络的盲数字水印算法

该文将二值水印嵌入到宿主图像的小波变换域的低频分量中,利用BP神经网络很好的非线性映射和自学习、自适应学习特点实现水印信息的盲提取,仿真实验结果表明该算法既能抵抗常规的图像处理攻击,也能抵抗一定程度的几何攻击,如JPEG压缩、剪切、加噪和滤波等,具有较好的鲁棒性和不可见性。     

一种基于椭圆曲线的多级代理盲多重签名方案

该文设计了一种新的基于椭圆曲线密码体制的多级代理盲多重签名方案,该方案允许m个原始签名人共同将自己的权力委托给1级代理人,1级代理人在许可范围内继续逐级授权。而且该方案通过盲签名实现了签名的匿名性和不可追踪性。在此数字签名的基础上,采用了椭圆曲线的签名和验证方式,极大的提高了方案的安全性和实现速度。     

基于GH-PKC体制的盲签名方案

GH-PKC是一种新的基于GF(q)上三级线性反馈移位寄存器序列的公钥密码体制。其安全性基于有限域GF(q3)上的离散对数困难问题,但运算却在有限域GF(q)中进行。文中给出了一种新的基于GH-PKC的类ELGamal数字签名算法,并在此基础上构建了基于GH-PKC的盲签名方案,其安全性等价于解GF(q3)上离散对数困难问题,但是传输的数据量只有传统方案的1/3。     

抗量子计算公钥密码需求分析与技术路线

本文对国外量子计算机研究进展情况进行了分析,并针对量子计算机对于信息安全的挑战,讨论了国内下一代公钥密码技术的需求、发展思路和技术路线。     

Efficient identity-based GQ multisignatures

ISO/IEC 14888 specifies a variety of digital signature mechanisms to sign messages of arbitrary length. These schemes can be applied to provide entity authentication, data origin authentication, non-repudiation, and data integrity verification. ISO/IEC 14888 consists of three parts under the general title Information technology—Security techniques—Digital signatures. Part II, or ISO/IEC 14888-2 specifies the general structure and the fundamental procedures for the generation and verification of an identity-based signature (IBS) mechanism for messages of arbitrary length. Particularly, the IBS scheme of Guillou and Quisquater (GQ) is described in Clauses 6–8. In this paper, an efficient identity-based multisignature (IBMS) scheme is proposed for the GQ IBS scheme, which allows multiple users using the ISO/IEC 14888-2 standard GQ scheme to generate multisignatures. The scheme is efficient in the sense that both the length and the verification time of the multisignatures are fixed. The proposed ID-based multisignature scheme is also secure against forgeability under adaptive chosen-message attack and adaptive chosen-identity attack in random oracle model.