Improvement on threshold proxy signcryption scheme

Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and integrity at a lower computational and communication cost. This paper presents a （t, n） threshold proxy signcryption scheme in which no less than t proxy agents in the proxy group can produce the signcryption cryptogram. combines the functionality of threshold proxy signing and encryption. The proposed scheme combines the functionality of both threshold proxy signing and encryption, and provides fair protection for the sender and the proxy agents. This scheme is secure against attack of public key substitution. It also satisfies security properties such as confidentiality and authenticity.     

标准模型下群签名的批验证协议*

首次对标准模型下群签名的批验证协议进行了研究。利用小指数测试技术和双线性对映射的特殊性质,为目前效率较高的两个群签名方案按照多人签署相同消息和不同消息这两种情况,分别设计了相应的批验证协议。相较于单独验证,认证效率大大提高。     

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

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

"震网"引发网络安全新思考

本文概述了近期发生的"震网"事件.同时分析了"震网"的特点和行为特征.并根据我国的具体情况给出了安全警示和安全防范建议.     

Design of DL-based certificateless digital signatures

Public-key cryptosystems without requiring digital certificates are very attractive in wireless communications due to limitations imposed by communication bandwidth and computational resource of the mobile wireless communication devices. To eliminate public-key digital certificate, Shamir introduced the concept of the identity-based (ID-based) cryptosystem. The main advantage of the ID-based cryptosystem is that instead of using a random integer as each user’s public key as in the traditional public-key systems, the user’s real identity, such as user’s name or email address, becomes the user’s public key. However, all identity-based signature (IBS) schemes have the inherent key escrow problem, that is private key generator (PKG) knows the private key of each user. As a result, the PKG is able to sign any message on the users’ behalf. This nature violates the “non-repudiation” requirement of digital signatures. To solve the key escrow problem of the IBS while still taking advantage of the benefits of the IBS, certificateless digital signature (CDS) was introduced. In this paper, we propose a generalized approach to construct CDS schemes. In our proposed CDS scheme, the user’s private key is known only to the user himself, therefore, it can eliminate the key escrow problem from the PKG. The proposed construction can be applied to all Discrete Logarithm (DL)-based signature schemes to convert a digital signature scheme into a CDS scheme. The proposed CDS scheme is secure against adaptive chosen-message attack in the random oracle model. In addition, it is also efficient in signature generation and verification.     

认证测试理论的扩展和应用

通过在串空间中加入新的密码原语,重新定义认证测试的前提条件、扩展认证测试理论,使其能够分析有签名运算的密码协议。通过对基于Diffie—Hellman密钥交换的安全协议进行合理的假设,使其参数项具有现时值的性质,从而可以直接使用扩展的认证测试理论进行分析。使用扩展后的认证测试分析一个包含签名和Diffie—Hellman密钥交换的密码协议,得出该协议满足认证特性。     

n-挠群上基于多重生物特征身份的签名方案

针对基于单一生物特征身份的签名方案在实际应用中存在的问题,提出一种基于多重生物特征身份的签名方案,研究基于椭圆曲线的n-挠群,对不同生物特征进行融合,介绍基于生物特征身份的公钥密码体制,仿真实验结果表明,该方案在安全性、稳定性以及可靠性等方面,均具有一定优越性。     

WM平台下反病毒软件的设计与实现

手机病毒的不断增多给用户带来很大的威胁,针对Windows Mobile平台给出一款反病毒软件。在软件中设计和实现一种快速、精确的病毒扫描引擎,并利用Windows Mobile平台的文件系统过滤器实现存储管理器下文件的实时监控和病毒扫描。     

一种改进的可追踪门限签名方案

早先的一种具有追踪性的门限签名方案,已被证明不具有可追踪性。针对该方案存在的缺陷,对其进行改进。理论分析证明,改进的方案在发生纠纷时可打开群签名追踪实际签名者,签名者能证明自己是否参与签名,并有效抵御群体内部的伪造攻击和冒充攻击。     

New receipt-free voting scheme using double-trapdoor commitment

It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework, Okamoto first proposed a receipt-free voting scheme [30] for large scale elections. However, in the following paper, Okamoto [31] proved that the scheme [30] was not receipt-free and presented two improved schemes. One scheme requires the help of the parameter registration committee and the other needs a stronger physical assumption of the voting booth. In this paper, we utilize the double-trapdoor commitment to propose a new receipt-free voting scheme based on blind signatures for large scale elections. Neither the parameter registration committee nor the voting booth is required in our scheme. We also present a more efficient zero-knowledge proof for secret permutation. Therefore, our scheme is much more efficient than Okamoto’s schemes [30] and [31] with the weaker physical assumptions. Moreover, we prove that our scheme can achieve the desired security properties.