A Proxy Signature Scheme as Secure as Decisional Diffie-Hellman Problem

Based on decisional Diffie-Hellman problem, we propose a simple proxy-protected signature scheme. In the random oracle model, we also carry out the strict security proof for the proposed scheme. The security of the proposed scheme is not loosely related to the discrete logarithm assumption but tightly related to the decisional Diffie-Hellman assumption in the random oracle model.     

Robust Threshold Guillou-Quisquater Signature Scheme

Tie deficiencies of the first threshold Guillou-Quisquater signature scheme presented by Li San Liu, Cheng-Kang Chu and Wen-Guey Tzeng are analysised at first, and then a new threshold Guillou-Quisquater signature scheme is presented. The new scheme is unforgeable and robust against any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable under the chosen message attack and computing the discrete logarithm modulo a prime is hard. This scheme can also achieve optimal resilience. However, the new scheme does not need the assumption that N is the product of two safe primes. The basic signature scheme underlying the new scheme is exactly Guillot-Quisquater signature scheme, and the additional strong computation assumption introduced by the first threshold Guillou-Quisquater scheme is weaken.     

An efficient identity-based anonymous signcryption scheme

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter＇s privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation.     

Threshold signature scheme based on discrete logarithm and quadratic residue

Digital signature scheme is a very important research field in computer security and modern cryptography. A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme. It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions. In this scheme, effective digital signature can not he generatedby any h 1 or fewer legal users, or only by signature executive. In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature. A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed. The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.     

Threshold Subliminal Channel Based on Designated Verifier Signature

The subliminal channel is used to send a secret message to an authorized receiver; the message cannot he discovered by any unauthorized receivers. Designated verifier signature （DVS） provide authentication of a message, we design a DVS scheme with message recovery mechanism and use it as a subliminal channel. In order to share a message among n users securely and allows t or more users can reconstruct the secret in dynamic groups, we combine both subliminal channel and （t, n） threshold cryptography. Then we proposed a threshold subliminal channel which can convey a subliminal message to a group of users based on message-recovery designated verifier signatures. Reconstructing the subliminal message relies on the cooperation of t or more users in the group and they can verify the validity of the subliminal message. Security and performance analysis show that the proposed scheme is secure and efficient.     

A Fair Off-Line Electronic Cash Scheme Based on Restrictive Partially Blind Signature

A fair off-line electronic cash scheme was presented based on a provable secure restrictive partially blind signature. The scheme is more efficient than those of previous works as the expiry date and denomination information are embedded in the electronic cash, which alleviates the storage pressure for the bank to check double spending, and the bank need not use different public keys for different coin values, shops and users need not carry a list of bank‘s public keys to verify in their electronic wallet. The modular exponentiations are reduced for both the user and the bank by letting the trustee publish the public values with different structure as those of previous electronic cash schemes. The scheme security is based on the random oracle model and the decision Diffie-Hellman assumption. The scheme can be easily extended to multi-trustees and multi-banks using threshold cryptography.     

Efficient batch verification of online/offline short signature for a multi-signer setting

In this paper,we propose a method to construct an online/offline batch verification signature scheme in a multi-signer setting.The length of the scheme is approximately 480 bits.Based on the Lysyanskaya,Rivest,Sahai and Wolf(LRSW) assumption,this scheme is proved secure in a random oracle model,and it requires only three pairing operations for verifying n signatures from a multi-signer setting.     

Efficient hierarchical identity based signature scheme in the standard model

Hierarchical identity based cryptography is a generalization of identity based encryption that mirrors an organizational hierarchy. It allows a root public key generator to distribute the workload by delegating public key generation and identity authentication to lower-level public key generators. Most hierarchical identity based signature schemes are provably secure in the random oracle model or the weak models without random oracles such as gauntlet-ID model. Currently, there is no hierarchical identity based signature scheme that is fully secure in the standard model, with short public parameters and a tight reduction. In this paper, a hierarchical identity based signature scheme based on the q-SDH problem that is fully secure in the standard model is proposed. The signature size is independent of the level of the hierarchy. Moreover, our scheme has short public parameters, high efficiency and a tight reduction.     

An attribute-based ring signature scheme in lattice

An attribute-based ring signature scheme in lattice was proposed in this paper. In this signature scheme, an entity’s attributes correspond to the columns of a lattice matrix, and the signature was generated by using a subset of these attributes. The entities possessing these attributes form a ring. The scheme is computationally efficient than the schemes based on the integer factor problem and discrete logarithm problem, furthermore it is still secure in quantum computing environment.     

New multivariate-based certificateless hybrid signcryption scheme for multi-recipient

With the development of quantum computer,multivariate public key cryptography withstanding quantum attack has became one of the research focus.The existed signcryption schemes from discrete logarithm and bilinear paring are facing the serious threats.Based on multivariate public key cryptography,a new certificateless multi-receiver hybrid signcryption scheme has been proposed.The proposal reduced the cipher text and could handle arbitrary length messages by employing randomness reusing and hybrid encryption,as well as keeping security.In the random oracle model,the scheme’s confidentiality could withstand the IND-CCA2 adversary and its unforgeability could withstand the UF-CMA adversary under the hardness of multivariate quadratic(MQ)problem and isomorphism of polynomials(IP)assumption.It has less computation overhead and higher transmission efficiency than others.It reduced 33%cipher data compared with the existed similar scheme.     

A New （ t, n） Threshold Signature Scheme Withstanding the Conspiracy Attack

A conspiracy attack is proposed to show that Wang-Li‘s scheme is insecure, because any t or more group members can impersonate other t members to sign any message without holding the responsibility. To avoid the conspiracy attack, this paper presents a new (t, n) threshold signature scheme with traceable signers.     

Verifiable （ t, n） Threshold Signature Scheme Based on Elliptic Curve

Based on the difficulty of solving the ECDLP (elliptic curve discrete logarithm problem) on the finite field, we present a (t, n) threshold signature scheme and a verifiable key agreement scheme without trusted party. Applying a modified elliptic curve signature equation, we get a more efficient signature scheme than the existing ECDSA (ellipticcurve digital signature algorithm) from the computability and security view. Our scheme has a shorter key, faster computation, and better security.     

一种基于椭圆曲线的门限代理签名方案

在(t,n)门限代理签名方案中,原始签名人可将签名权授权给成员数为n的代理群,代理群中任何不少于t个代理签名人可代表原始签名人生成有效的签名.门限代理签名的特点使之具有广泛的实用性.目前所提出的门限代理签名方案多基于有限域上的离散对数问题.由于椭圆曲线密码体制在相同安全级别下,具有密钥短、速度快的优点,为此提出了一种基于椭圆曲线的不可否认门限代理签名方案,其安全性基于椭圆曲线离散对数问题难解性,同时可以在需要时实现对签名者的追查.安全性分析表明,该方案可有效地挫败合谋攻击和伪造攻击.同时由于椭圆曲线密码体制的特点,使该方案的计算量和通讯量都较小.     

对一个无证书部分盲签名方案的分析与改进

对汤鹏志等提出的一种无证书部分盲签名方案进行了密码分析,指出方案中签名请求者可以非法修改协商信息.为了有效抵抗篡改协商信息攻击,提出了一种改进的无证书部分盲签名方案.在随机预言机模型下证明了改进方案对无证书密码体制的两类敌手的自适应选择消息和身份攻击是存在性不可伪造的,其安全性可以归约为k-CAA问题和ICDH问题.     

一种群体组门限签名方案

门限签名是一种特殊的数字签名,它在现实生活中具有广泛的用途;一个门限签名方案是指n个成员组成的群中,群中任何不少于t个成员合作就能产生签名,然而任何少于t个成员合作都无法伪造签名,文章提出了一种新的基于离散对数问题和分组秘密共享的门限签名方案,该方案具有消息保密性、可公开验证性和公开信道授权的优点.     

具有前向安全性的代理签名方案

该文提出了一种前向安全的代理签名方案,该方案基于零知识证明协议,在离散对数和二次剩余问题困难性的假设和随机oracle模型下系统是安全的.并且该系统使得原始签名者和代理签名者的秘密钥都具有前向安全性.该方案弥补了代理签名体制在密钥安全性上的不足,秘密钥的前向安全性有效控制了密钥安全风险.