高效的无证书广义指定验证者聚合签名方案

研究无证书广义指定验证者聚合签名的安全模型,基于双线性映射提出无证书广义指定验证者聚合签名方案。在随机预言模型和计算Diffie-Hellman困难问题假设下,证明方案不仅可以抵抗无证书广义指定验证者聚合签名的3类伪造攻击,而且满足指定验证性和不可传递性。方案的聚合签名长度和单用户签名长度相当,签名公共验证和指定验证需要的双线性对数固定。     

高效的具有指定验证者的代理签名方案*

基于计算性Diffie-Hellman问题的困难假设和司光东等人的短签名方案,构造了一个具有指定验证者的代理签名方案。该方案满足代理签名方案的各种安全性要求,同时具有签名长度短、效率高等优点,是一种安全且高效的代理签名方案。     

基于身份的强指定验证人签名方案*

在有些情况下, 需要将验证者限定为某一个人。 利用基于身份的密码体制, 提出了一种强指定验证人签名和一种强指定验证人多重代理签名, 并对其安全性进行了分析。 在签名代价和验证代价上, 提出的强指定验证人签名比Kang等人的方案要低。提出的强指定验证人多重代理签名可以同时授权给n个代理人, 可以有效防止代理签名人对签名权的滥用。     

短群签名的高效批验证

进入普适通信的时代,从车辆到心脏监听器等大量设备都需要与它们的环境彼此交流信息,从而对验证和安全通信的要求不断上升：①密码费用较低;②能够快速验证大量不同来源的消息;③隐私保护。文章针对一个高效的短群签名体制提出了一个批验证算法,其中验证运算的主要部分只需要2个双线性对,就可满足上面的全部3个要求。     

标准模型下的限制性广义指定验证者签名

基于Waters签名方案,首次提出了一个在标准模型下安全的限制性广义指定验证者签名方案。在弱Gap双线性Diffie-Hellman问题困难假设下,该方案被证明是安全的。     

Checking secure information flow in Java bytecode by code transformation and standard bytecode verification

A method is presented for checking secure information flow in Java bytecode, assuming a multilevel security policy that assigns security levels to the objects. The method exploits the type‐level abstract interpretation of standard bytecode verification to detect illegal information flows. We define an algorithm transforming the original code into another code in such a way that a typing error detected by the Verifier on the transformed code corresponds to a possible illicit information flow in the original code. We present a prototype tool that implements the method and we show an example of application. Copyright © 2004 John Wiley & Sons, Ltd.     

带消息恢复功能的代理盲签名方案分析与改进

对俞建英等人提出的具有消息恢复功能的代理盲签名方案(计算机应用与软件,2011年第2期)进行安全性分析,指出在该方案中指定验证者可以冒充代理签名者对任意消息伪造代理盲签名,且代理签名者和指定验证者合谋可以追踪消息拥有者。为此,提出一种可以抵抗指定验证者的伪造攻击和链接攻击的代理盲签名方案。分析结果表明,改进的方案具有强不可伪造性、不可否认性、不可链接性和保密性等安全性质。     

具有多种特性的门限多代理多签名方案

为了提高多代理多签名的灵活性和实用性,在Schnorr签名的基础上,提出2个具有消息恢复特性的门限多代理多签名新方案,其中的不同类成员具有不等权限,只有指定验证者才能恢复消息并验证签名。分析结果表明,在离散对数假设和随机预言机模型下,该方案是安全的。     

Identity-based strong designated verifier signature schemes: Attacks and new construction

A strong designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third party, and no third party can even verify the validity of a designated verifier signature. We show that anyone who intercepts one signature can verify subsequent signatures in Zhang-Mao ID-based designated verifier signature scheme and Lal-Verma ID-based designated verifier proxy signature scheme. We propose a new and efficient ID-based designated verifier signature scheme that is strong and unforgeable. As a direct corollary, we also get a new efficient ID-based designated verifier proxy signature scheme.     

An efficient certificateless undeniable signature scheme

Certificateless cryptography addresses the private key escrow problem in identity-based systems, while overcoming the costly issues in traditional public key cryptography. Undeniable signature schemes were proposed with the aim of limiting the public verifiability of ordinary digital signatures. The first certificateless undeniable signature scheme was put forth by Duan. The proposed scheme can be considered as the certificateless version of the identity-based undeniable signature scheme which was introduced by Libert and Quisquater. In this paper, we propose a new scheme which is much more efficient comparing to Duan's scheme. Our scheme requires only one pairing evaluation for signature generation and provides more efficient confirmation and disavowal protocols for both the signer and the verifier. We also prove the security of our scheme in the strong security model based on the intractability of some well-known pairing-based assumptions in the random oracle model.