基于批量处理的特性,提出一个适用于供应链的可扩展的读写器-标签双向认证协议。在该协议中,后端数据库识别一个标签只需运行3次哈希函数和O(logn)次比较大小的运算,标签的计算量和已有的不可扩展的协议相当。提出的协议显著提高了射频识别RFID(Radio Frequency Identification)供应链管理系统的效率,并且满足其安全需求。
Ad Hoc网络是一种由移动节点组成的临时性自治系统,不依赖于任何固定的网络设施,因此存在着安全隐患,而基于身份的认证密钥交换虽然可以在Ad Hoc网络中实现认证并解决秘密通信问题,但由于在无线Ad Hoc中没有可信第三方结点,密钥成为比较难解决的问题。该文利用多项式秘密共享的思想,提出了一种应用于无线Ad Hoc网络中的基于身份的认证密钥交换协议,此协议是在公钥基础体制下基于身份的密钥交换协议的基础上实现的。
Current techniques for transforming unforgeable signature schemes （the forged message has never been signed） to strongly unforgeable ones （the forged message could have been signed） require supplementary components to be added onto the original key pairs of the schemes. In addition, some of them can only be applied to a certain type of signature schemes. In this paper, we propose a new generic transformation technique which converts any unforgeable signature scheme into a strongly unforgeable one without modifying any component in the original key pair. This makes our technique especially compatible for practical use. Our technique is based on strong one-time signature schemes. We show that they can be constructed efficiently from any one-time signature scheme that is based on one-way functions. The performance of our technique also compares favorably with that of current ones. Besides, it is shown in this paper that our transformation can further be applied to schemes satisfying only a weak variant of unforgeability without any further modification. Furthermore, our technique can also be used for constructing strongly unforgeable signature schemes in other cryptographic settings which include certificateless signature, identity-based signature, and several others. To the best of our knowledge, similar extent of versatility is not known to be supported by any of those comparable techniques. Finally and of independent interest, we show that our generic transformation technique can be modified to an on-line/off-line signature scheme, which possesses a very efficient signing process.
