公路工程中利用群签名的电子投标方案

公路工程电子投标是电子商务中的重要活动之一。利用群签名方案可设计出一种新的公路工程密封投标方案。该方案由公路工程招标者来确定公路工程中标者,公路工程中标者的身份则由群管理者根据公路工程中标者对投标消息的签名来确定,且经一次注册后,公路工程投标者即可参加多个投标活动,而不会泄露自己的身份,这使得该方案具有一定的可扩展性。     

具有可追查性的抗合谋攻击(t,n)门限签名方案

在分析王斌和李建华的无可信中心门限签名方案(王-李方案)以及X ie-Yu改进方案安全缺陷的基础上,提出了一种新的具有可追查性的抗合谋攻击(t,n)门限签名方案;对新方案的安全性进行了分析,并与现有方案的效率进行了比较.结果表明:该方案不仅能够从根本上抵抗合谋攻击和伪造签名攻击,而且在保证匿名性的前提下,能够真正实现签名成员身份的可追查性,同时通过构造安全的分布式密钥生成协议保证群私钥的不可知性,因此比现有方案具有更高的安全性.此外,新方案的计算量和通信量与王-李方案接近,但优于X ie-Yu方案.     

车载网络中基于群签名的可保护隐私的车辆认证

安全和隐私是配置车载网络时所需要的2个重要条件,具有保护隐私功能的认证是实现这2个条件的关键技术.不同于已有的认证方案,文中用群签名来实现车载网络中能保护隐私的车辆认证.为了满足认证的快速性要求,基于目前安全性最强、效率较高和签名较短的ZL 06局部验证者撤销短群签名方案,提出了2个具有隐私保护功能的车载网络中的车辆认证方案.群签名所具有的良好性质保证了所提出的认证方案具有实用性和隐私保护功能.     

一个安全高效的车载网认证方案

为了解决车载通信网中的信息安全问题,根据数字签名原理,综合考虑车载通信网实际状况,基于适合大规模群体的双线性对技术,提出快速高效并具有隐私保护功能的信息认证方案,把车辆分成私家车辆和公用车辆,分别采用群签名和基于身份签名的方法对相应信息进行认证,并引入积聚信息批量验证和矛盾信息量化对比确认技术,使车载通信网中信息认证效率比现有方案提高33%以上.仿真结果表明,信息认证的效率与预期分析符合,具有较强的鲁棒性和可扩充性,能够满足车载通信网的运行需求.     

考试管理系统中群签名的实现

主要讨论为了在考试管理系统中实现数据的安全性和一致性,结合数字签名技术,介绍了群签名在管理系统中的实现.     

基于椭圆曲线的不可否认门限代理签名方案

针对已有的门限代理签名方案不能有效地抵抗签名人协作攻击和伪造攻击,以及在某些场合实用性不强的缺点提出了改进方案.在代理签名生成阶段要求每个实际签名人提供自己的私钥信息,在形成的代理签名中不仅包含每个代理签名人的秘密信息,还包含了每个实际签名人的秘密信息,从而能有效抵抗协作攻击和伪造攻击.另外,用椭圆曲线密码机制替换了已有的方案中用的ElGamal离散对数密钥机制,使系统效率更高.     

一种高效的基于身份的代理盲签名方案

在代理签名中,原始签名人能将数字签名的权力委托给代理签名人;而在盲签名方案中,签名者不能看到被签消息的内容。签名被接受者得到后,签名者不能追踪签名,结合代理签名与盲签名的优点,利用基于椭圆曲线上的Weil配对（WeilPair—ing）的双线性映射,构造了一个高效的基于身份的代理盲签名方案．分析表明,该方案不仅满足代理盲签名所要求的所有性质,而且其效率也优于已有同类方案．     

一种基于椭圆曲线的门限部分盲签名方案

通过对余昭平等人提出的一种基于椭圆曲线上的门限盲签名方案的分析,了解到该方案结合了椭圆曲线、门限盲签名的双重优势。在原方案的基础上提出了一种基于椭圆曲线的门限部分盲签名的方案,不仅保留了原方案的强可验证性性、不可伪造性等安全特性,还进一步增加了签名的稳定性、部分盲性及密钥共享等特性。最后,对新提出的方案进行了可证的安全性分析及效率分析,事实证明该方案安全性高、稳定性好。     

一个基于身份的代理签名方案

基于椭圆曲线上的双线性对的双线性性质和已证明安全的签名体制,提出了一种基于身份的代理签名方案,该方案克服了已有几种方案中在授权和代理签名密钥生成上的一些安全缺陷,且方案在基于双线性Diffie-Hellman 问题的随机预言模型下是可证明安全的.     

一种基于离散对数问题的存根代理盲签名方案

数字签名用来保证原始数据完整性和有效性,一个数字签名方案包括数字签名生成算法和数字签名验证算法.简短地介绍了盲签名、代理签名的基本思想和基本性质,并给出如何通过非对称密码算法的思想来实现这些签名方案,提出并详细介绍了一种基于离散对数问题的有存根的(免责声明)代理盲签名方案,讨论了基于离散对数问题的密码学算法的可能攻击方法,在此基础上给出了协议实现时的一些有益的建议.     

Efficient Dynamic Threshold Group Signature Scheme Based on Elliptic Curve Cryptosystem

The short secret key characteristic of elliptic curve cryptosystem （ECC） are integrated with the （ t, n ） threshold method to create a practical threshold group signature scheme characterized by simultaneous signing. The scheme not only meets the requirements of anonymity and traceability of group signature but also can withstand Tseng and Wang＇s conspiracy attack. It allows the group manager to add new members and delete old members according to actual application, while the system parameters have a little change. Cryptanalysis result shows that the scheme is efficient and secure.     

A Distributed Authentication Algorithm Based on GQ Signature for Mobile Ad Hoc Networks

Introduction Mobile ad hoc networks (MANETs) are newinfrastructureless networks without the usual rout-ing infrastructure like fixed routers and routingbackbones. A mobile ad hoc network is a multi-hop temporary self-organizing system compromisedof a group of mobile nodes with radios. MANETshave some special characteristics: self organizing,dynamic topology, limited bandwidth, resourceconstraint nodes, multi-hop routing, vulnerable tosecurity attacks etc. Recently, MANET has beenone of t…     

Democratic group signatures with threshold traceability

This paper presents a concrete democratic group signature scheme which holds (t, n)-threshold trace-ability. In the scheme, the capability of tracing the actual signer is distributed among n group members. It gives a valid democratic group signature such that any subset with more than t members can jointly reconstruct a secret and reveal the identity of the signer. Any active adversary cannot do this even if he can corrupt up to t - 1 group members.     

Democratic group signatures with linkability from gap Diffie-Hellman group

Democratic group signatures(DGSs) attract many researchers due to their appealing properties, i.e., anonymity, traceability and no group manager.Security results of existing work are based on decisional Diffie-Hellman(DDH) assumption.In this paper, we present a democratic group signature scheme based on any gap Diffie-Hellman(GDH) group where DDH problem is easily but computational Diffie-Hellman(CDH) problem is hard to be solved.Besides the properties of ordinary DGSs, our scheme also provides the property of linkability, i.e., any public verifier can tell whether two group signatures are generated using the same private key.Security properties of our scheme employ a new and independently interesting decisional product Diffie-Hellman(DPDH) assumption which is weaker than DDH one.     

Cryptanalysis of One Fair E-cash System

Introduction The concept of group signature was intro-duced by Chaum and Heyst[1], which allows indi-vidual members to make signatures on behalf of thegroup. More formally, a secure group signaturescheme must satisfy such properties as unforgeabil-ity, anonymity, traceability, coalition-resistance,unlinkability, exculpability[2,3]. An important application of group signature isto construct fair e-cash systems. A fair electroniccash system is a system that allows customers tomake payments anon…     

A universal composability framework for analysis of proxy threshold signature

The universal composability framework is a new approach for designing and analyzing the security of cryptographic protocols. In this framework, the security of protocols is maintained under a general protocol composition operation. In the paper, we propose the universal composability framework for the analysis of proxy threshold signature and present a universally composable secure proxy threshold signature scheme which is the first one in this area. The proposed scheme is suitable for the mobile agents, which should migrate across different environment through network. Furthermore, we give the concrete analysis of the reduction to prove the security of the proposed scheme.