对来自双线性配对的三种代理签名体制的密码学分析*

纪家慧等人利用双线性配对提出了三类代理签名体制:代理多签名、多代理签名和多代理多签名,但这三类代理签名方案都是不安全的.分析说明了这三类代理签名存在伪造攻击,任何一个原始签名人或代理签名人都可以伪造合法的代理签名.     

Quantum homomorphic signature based on Bell-state measurement

In this paper, a novel quantum homomorphic signature scheme based solely on Bell-state measurement is proposed. It allows an aggregator to merge two signature nodes’ signatures of their classical messages into one signature, which is an effective approach to identity authentication for multiple streams to enhance the security of quantum networks. And it is easy to generalize this scheme to multiple nodes. Bell-state measurement has been realized by using only linear optical elements in many experimental measurement-device-independent quantum key distribution schemes, which makes us believe that our scheme can be realized in the near future. It is shown that our scheme is a quantum group homomorphic signature scheme and is secure by the scheme analysis.     

Short signature scheme for multi-source network coding

It has been proven that network coding can provide significant benefits to networks. However, network coding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against these attacks, but as far as we know almost all of them are inapplicable for multi-source network coding system. This paper proposed a novel homomorphic signature scheme based on bilinear pairings to stand against pollution attacks for multi-source network coding, which has a broader application background than single-source network coding. Our signatures are publicly verifiable and the public keys are independent of the files so that our scheme can be used to authenticate multiple files without having to update public keys. The signature length of our proposed scheme is as short as the shortest signatures of a single-source network coding. The verification speed of our scheme is faster than those signature schemes based on elliptic curves in the single-source network.     

多重数字签名方案及其安全性证明

基于因数分解和二次剩余困难性假设,构造了一个新的按序多重数字签名方案和广播多重数字签名方案.新方案的特点是:多重签名不是由签名成员所生成的多个单签名的累加,而是每个签名成员生成部分签名,以合作的方式生成多重签名;部分签名的长度固定,不随签名人数的改变而变化;部分签名算法和验证算法的复杂度与签名人数的多少无关;新的按序多重签名方案的签名成员不能擅自改变签名顺序.新方案抗现存的对多重签名方案的几种攻击.基于因数分解和二次剩余困难性假设,在随机预言模型下证明了方案的安全性.     

对两个代理盲多重签名的分析和改进

盲签名和代理多重签名在电子商务和电子现金系统中有着广泛的应用.结合这两种签名的特点,人们提出了代理盲多重签名方案.在代理盲多重签名中,一个原始签名组将签名权委托给代理签名人,由其对签名请求者发送来的盲化消息进行代理签名.通过分别对秦艳琳等人和周立章提出的代理盲多重签名方案的安全性分析,发现秦的方案中一个恶意的原始签名人可以伪造出代理签名密钥,从而生成代理盲多重签名;并同时指出周的方案无法抵挡代理签名伪造攻击,不满足不可伪造性.针对上述两种攻击,在秦方案的基础上提出了一种新的方案,证明及分析了新方案的正确性和安全性.该方案有效地克服了原方案的缺陷,并满足代理盲多重签名的各种要求,提高了系统的安全性.     

电子公文的XML签名的实现

由于传统的数字签名技术没有考虑到上下文,签名的只是纯粹的字节,因此实现的是整体签名,不能实现部分签名和难于实现多重签名.本文提出了一个基于XML的签名方案,充分利用XML的结构化特点,实现对电子公文的部分签名和多重签名.     

基于双线性对的代理签名

双线性映射作为一种构建密码体制的新工具,在密码学领域中引起了普遍的关注,并在数字签名中得到应用。在代理签名方案中,代理签名人可以代表原始签名人生成签名;在代理多签名方案中,一个代理签名人可以同时代表多个原始签名人在文件上签名。利用椭圆曲线上的Weil配对的双线性性质构造了一个代理数字签名方案和一个代理多签名方案,并对它们的正确性和安全性做了分析。在代理多签名方案中,代理签名的长度均独立于原始签名人的个数,其验证也与一般的代理签名类似。     

格上基于身份的代理签名方案

为抵抗量子计算攻击,降低代理签名中用户私钥泄露的风险,构造了一个格上基于身份的代理签名方案.方案的设计基于安全高效的GPV签名框架,结合用户身份信息生成验证公钥,使用格基委派技术生成用户签名私钥,并使用盆景树代理委托算法提升签名效率.方案的安全性可规约至格上最小整数解问题,满足基于身份代理签名的安全属性,且在随机谕言和量子随机谕言下均具有存在性不可伪造性.     

来自双线性配对的新的代理多签名、多代理签名和多代理多签名体制

作者提出三类新的来自双线性配对的涉及多个签名人的代理签名体制．第一类称为代理多签名体制，它允许一组原始签名人授权给一个代理签名人来代表他们；第二类称为多代理签名体制，意思是一个原始签名人可以授权给一组代理签名人来代表他(她)；第三类称为多代理多签名体制，因为在此体制中，多个原始签名人把他们的签名权利委托给一组代理签名人．作为准备，作者提出了基于Hess的基于身份签名体制的多签名体制，这是第一个来自双线性配对的基于身份的多签名体制，后两类代理签名体制将用到它．关于作者提出的新体制，最重要的一点是在这三类体制中，代理签名的长度均独立于原始签名人或代理签名人的个数．它们的验证也与一般的代理签名类似．     

Ring signature scheme based on multivariate public key cryptosystems

The ring signature scheme is an important cryptographic primitive that enables a user to sign a message on behalf of a group in authentic and anonymous way, i.e. the recipient of the message is convinced that the message is valid and it comes from one of the group members, but does not know who the actual signer is. Currently, all the existing ring signatures are based on traditional cryptosystems. However, the rapid advances in the field of quantum computing indicate a growing threat to traditional cryptosystems. Multivariate public key cryptosystems (MPKCs) is one of the promising alternatives which may resist future quantum computing attacks. In this work, we propose a novel ring signature scheme based on multivariate polynomials with the security model for the first time. Our ring signature scheme has a great advantage in efficiency compared to many existing ring signature schemes, and currently it seems to be immune to quantum computing attacks.     

不需要可信任方的匿名代理签名方案

匿名代理签名是特殊的代理签名,设计不需要可信任方参与的匿名代理签名方案是代理签名的一个重要研究方向。该文分析了两个该类方案的安全性,在此基础上给出了一个新的不需要可信任方的匿名代理签名方案。该方案具有强不可伪造性,且签名结果不含冗余数据。并以新方案为基础设计了两个匿名代理多重签名方案。     

基于混淆的广播多重签名方案

基于Lin等人于2016年提出的不可区分混淆,提出了一个新的广播多重签名方案,其使用混淆后的验证电路作为验证密钥,对部分签名和多重签名进行验证。在本方案中,每个签名成员生成自己的部分签名,签名收集方只需要将每个成员的部分签名进行模乘,即可得到多重签名。每个签名方的部分签名的长度、签名算法和验证算法的复杂度不随签名人数的多少而变化。本方案满足不可伪造性和不可否认性等性质,同时可以抵抗外部量子攻击。     

一个改进的强代理签名方案

数字签名是密码学的重要问题之一;代理签名是一种特殊的数字签名,它是指当某个签名人（原始签名人）由于某种原因不能签名时,将签名权委托给他人（代理签名人）替自己行使签名权。回顾了Lee等人提出的强代理签名方案和代理多签名方案以及Sun等人提出对其强不可伪造性的分析。在强代理签名方案的基础上,提出了改进的强代理签名方案,该方案具有强不可伪造性,从而可以有效地防止原始签名人对代理签名人进行恶意攻击,并将其推广到代理多签名方案中。     

不使用Hash和Redundancy函数的有序多重数字签名方案

现有的有序多重数字签名方案都使用了Hash函数和消息冗余函数,这必将承受由Hash函数和消息冗余函数带来的安全威胁。首先指出了施方案（文献[1]）中存在的安全性问题,随后利用椭圆曲线密码算法设计了一个新的有序多重数字签名方案,该方案不使用Hash函数和消息冗余函数,减少了这方面所带来的安全威胁;取消了施方案里的签名中心,避免了该签名中心的参与导致计算瓶颈的产生;所有消息均公开,签名者可以共同通过验证来发现伪签名和成员内部的欺诈行为。该文方案能够克服施方案的安全问题,并且计算量小,结构简单,具有一定的实用价值。     

有效的有序多重数字签名方案

指出了文献[1]方案中存在的安全性问题,随后利用椭圆曲线密码算法设计了一个新的有序多重数字签名方案,且不使用哈希函数和消息冗余函数,减少了这方面所带来的安全威胁;取消了施方案里的签名中心,避免了该签名中心的参与导致计算瓶颈的产生;所有消息均公开,签名者可以共同通过验证来发现伪签名和成员内部的欺诈行为.此方案能够克服施方案的安全问题,并且计算量小,结构简单,具有一定的实用价值.     

具有消息认证功能的多重数字签名方案

根据具有消息认证功能的数字签名方案设计了两种新的基于离散对数问题的有序多重数字签名方案和广播多重数字签名方案。新的方案具有简单的初始化过程，在签名时具有随机性，在签字和验证方程中无须求逆，且具有消息认证功能。具有更高的实用性和安全性。     

抗差分故障攻击的两方协同EdDSA签名方案

以区块链为底层技术的比特币、Libra等密码货币掀起了数字经济的浪潮.密码货币采用数字签名保证交易的可验证性和完整性,其中签名私钥确保了货币资产的所有权.若签名私钥丢失或被盗,货币资产的安全将受到严重威胁.相比于椭圆曲线数字签名算法ECDSA,基于爱德华曲线的数字签名算法EdDSA具备运算速度更快、密钥与签名空间更小等优势,被用于Libra交易单的签名.但因其是确定性签名,容易遭受差分故障攻击,造成密钥丢失或泄漏.如何抵抗这一种攻击,并设计可证明安全的EdDSA签名是一个挑战.首先定义了抗差分故障攻击的数字签名方案需满足的安全性质,利用差分故障攻击技术对EdDSA签名算法进行了分析,提出了抗差分故障攻击的EdDSA签名方案,并证明了方案满足存在不可伪造性和抗差分故障攻击性;为了降低签名私钥泄漏风险,借助Paillier同态加密技术,设计了抗差分故障攻击的两方协同EdDSA签名方案,并基于通用可组合安全模型(universally composable, UC)证明了方案的安全性;最后,对两方协同ECDSA签名算法与抗差分故障攻击的两方协同EdDSA签名算法计算复杂度分析与算法执行效率测...     

Attack on Digital Multi-Signature Scheme Based on Elliptic Curve Cryptosystem

The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a ＂false＂ public key to a ＂true＂ one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.     

新的多代理签名和多代理多签名方案

涉及多个签名人的代理签名体制有三类：第一类称为代理多签名体制;第二类称为多代理签名体制;第三类称为多代理多签名体制。针对Lee等人的强代理签名方案和代理多签名方案中的安全缺陷,给出了新的改进方案,新方案能有效地防止原始签名人的伪造攻击,在改进方案的基础上给出了安全的多代理签名方案和多代理多签名方案。     

Provably secure server-aided verification signatures

A server-aided verification signature scheme consists of a digital signature scheme and a server-aided verification protocol. With the server-aided verification protocol, some computational tasks for a signature verification are carried out by a server, which is generally untrusted; therefore, it is very useful for low-power computational devices. In this paper, we first define three security notions for server-aided verification signatures, i.e., existential unforgeability, security against collusion attacks and security against strong collusion attacks. The definition of existential unforgeability includes the existing security requirements in server-aided verification signatures. We then present, on the basis of existing signature schemes, two novel existentially unforgeable server-aided verification signature schemes. The existential unforgeability of our schemes can be formally proved both without the random oracle model and using the random oracle model. We also consider the security of server-aided verification signatures under collusion attacks and strong collusion attacks. For the first time, we formally define security models for capturing (strong) collusion attacks, and propose concrete server-aided verification signature schemes that are secure against such attacks.