An Efficient and Provably Secure SM2 Key-Insulated Signature Scheme for Industrial Internet of Things

With the continuous expansion of the Industrial Internet of Things(IIoT),more andmore organisations are placing large amounts of data in the cloud to reduce overheads.However,the channel between cloud servers and smart equipment is not trustworthy,so the issue of data authenticity needs to be addressed.The SM2 digital signature algorithm can provide an authentication mechanism for data to solve such problems.Unfortunately,it still suffers from the problem of key exposure.In order to address this concern,this study first introduces a key-insulated scheme,SM2-KI-SIGN,based on the SM2 algorithm.This scheme boasts strong key insulation and secure keyupdates.Our scheme uses the elliptic curve algorithm,which is not only more efficient but also more suitable for IIoT-cloud environments.Finally,the security proof of SM2-KI-SIGN is given under the Elliptic Curve Discrete Logarithm(ECDL)assumption in the random oracle.

An Identity-Based Strong Designated Verifier Proxy Signature Scheme

In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements.

An Improved Identity-Based Society Oriented Signature Scheme with Anonymous Signers

In this paper, we present an improved identity-based society oriented signature scheme with anonymous signers, which satisfies： （1） when members leave or join an organization, the public verification key and the signature verification procedure are unchanged; （2） a user participates in several organizations at the same time, her secret key is only related with her identity. However, no previous schemes have these two properties.

An Identity-Based Scheme of Fair Exchange of Digital Signatures

Fair exchange of digital signatures is an important tool for signing digital contracts, e-payment and other electronic commerce actions. An ID-based scheme of fair exchange of digital signature is proposed in this paper. The protocol relies on a trusted third party, but is ＂optimistic＂, in that the third party is only needed in cases where one player attempts to cheat or simply crashes. The proposed scheme has properties of short signature, low computation and verification cost. It can realize exchange of digital signatures fairly and effic, iently. A key feature of our scheme is that it is identity-based, which needs no certificates and has a simple key management. To our best knowledge, this is the first identity based scheme of fair exchange of digital signatures.

Improvement of Identity-Based Threshold Proxy Signature Scheme with Known Signers

In 2006, Bao et al proposed an identlty-based threshold proxy signature scheme with known signers. In this paper, we show that Bao et al＇s scheme is vulnerable to the forgery attack. An adversary can forge a valid threshold proxy signature for any message with knowing a previously valid threshold proxy signature. In addition, their scheme also suffers from the weakness that the proxy signers might change the threshold value. That is, the proxy signers can arbitrarily modify the threshold strategy without being detected by the original signer or verifiers, which might violate the original signer＇s intent. Furthermore, we propose an improved scheme that remedies the weaknesses of Bao et al＇s scheme. The improved scheme satisfies all secure requirements for threshold proxy signature.

Efficient ID-Based Proxy Blind Signature Scheme

In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting and e-payment. In this paper, we propose an identity-based proxy blind signature scheme which combines the advantages of proxy signature and of blind signature. Our scheme fulfills peffecdy the security requirements of a proxy blind signature. Comparing the previous scheme, our scheme needs less computational overhead and is more efficient.

Pairing-Free ID-Based Key-Insulated Signature Scheme

Without the assumption that the private keys are kept secure perfectly, cryptographic primitives cannot be deployed in the insecure environments where the key leakage is inevitable. In order to reduce the damage caused by the key exposure in the identity-based（ID-based） signature scenarios efficiently, we propose an ID-based key-insulated signature scheme in this paper, which eliminates the expensive bilinear pairing operations. Compared with the previous work, our scheme minimizes the computation cost without any extra cost. Under the discrete logarithm（DL） assumption, a security proof of our scheme in the random oracle model has also been given.

Identification of Small and Discriminative Gene Signatures for Chemosensitivity Prediction in Breast Cancer

Various gene signatures of chemosensitivity in breast cancer have been discovered. One previous study employed t-test to find a signature of 31 probe sets (27 genes) from a group of patients who received weekly preoperative chemotherapy. Based on this signature, a 30-probe set diagonal linear discriminant analysis (DLDA-30) classifier of pathologic complete response (pCR) was constructed. In this study, we sought to uncover a signature that is much smaller than the 31 probe sets and yet has enhanced predictive performance. A signature of this nature could inform us what genes are essential in response prediction. Genetic algorithms (GAs) and sparse logistic regression (SLR) were employed to identify two such small signatures. The first had 13 probe sets (10 genes) selected from the 31 probe sets and was used to build a SLR predictor of pCR (SLR-13), and the second had 14 probe sets (14 genes) selected from the genes involved in Notch signaling pathway and was used to develop another SLR predictor of pCR (SLR-Notch-14). The SLR-13 and SLR-Notch-14 had a higher accuracy and a higher positive predictive value than the DLDA-30 with much lower P values, suggesting that our two signatures had their own discriminative power with high statistical significance. The SLR prediction model also suggested the dual role of gene RNUX1 in promoting residual disease (RD) or pCR in breast cancer. Our results demonstrated that the multivariable techniques such as GAs and SLR are effective in finding significant genes in chemosensitivity prediction. They have the advantage of revealing the interacting genes, which might be missed by single variable techniques such as t-test.

Public-Key Cryptosystems with Secret Encryptor and Digital Signature

This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (primitive element). Modifications that simplify the cryptosystem are proposed, and, as a result, accelerate its performance. It is shown that hiding information via exponentiation is more efficient than other seemingly simpler protocols. Some of these protocols also provide digital signature/sender identification. Numeric illustrations are provided.

A Practical Comparison between Signature Approach and Other Existing Approaches in Error Detection over TCP

Error coding is suited when the transmission channel is noisy. This is the case of wireless communication. So to provide a reliable digital data transmission, we should use error detection and correction algorithms. In this paper, we constructed a simulation study for four detection algorithms. The first three methods—hamming, LRC, and parity are common techniques in networking while the fourth is a proposed one called Signature. The results show that, the hamming code is the best one in term of detection but the worst one in term of execution time. Parity, LRC and signature have the same ability in detecting error, while the signature has a preference than all others methods in term of execution time.

基于Signature和Ⅱ型双删失系统寿命数据的统计推断

基于Signature理论和方法,建立Ⅱ型双删失情形下元件寿命的统计推断模型,用极大似然估计及其渐近理论,推导出系统元件寿命分布参数的点估计及渐近置信区间估计的解析表达式,并通过3种优化算法获得相关估计的数值解.仿真结果表明,基于Signature的似然函数统计推断模型对Ⅱ型双删失情形下元件寿命的推断有效.

An efficient identity-based signature protocol over lattices for the smart grid

As the promising next-generation power grid,the smart grid has developed rapidly in recent years.The smart grid enables energy to be stored and delivered more efficiently and safely,but user data’s integrity protection has been an important security issue in the smart grid.Although lots of digital signature protocols for the smart grid have been proposed to resolve this problem,they are vulnerable to quantum attacks.To deal with this problem,an efficient identity-based signature protocol on lattices is proposed in this paper.To improve our protocol’s efficiency,the tree of commitments is utilized.Moreover,a detailed performance evaluation of the proposed protocol is made.The performance analysis demonstrates that the potential utility of our protocol in the smart grid is huge.

支持批量证明的SM2适配器签名及其分布式扩展

适配器签名,又称无脚本脚本,是解决区块链应用(如密码货币)中扩展性差、吞吐量低等问题的重要密码技术.适配器签名可看作数字签名关于困难关系的扩展,同时具有签名授权和证据提取两种功能,在区块链应用中具有以下优点:(1)降低链上成本;(2)提高交易的可替代性;(3)突破区块链脚本语言限制.SM2签名是我国自主设计的国家标准签名算法,在各种重要信息系统中有着广泛应用.基于SM2签名构造出高效的适配器签名方案,并在随机谕言机模型下给出安全性证明.所提方案结合SM2签名结构,可避免在预签名阶段生成额外的零知识证明,与现有ECDSA/SM2适配器签名相比更加高效,其中,预签名生成效率提升4倍,预签名验证效率提升3倍.随后,基于SM2协同签名,构造分布式SM2适配器签名,可避免单点故障问题,提升签名私钥安全.最后,在实际应用方面,基于SM2适配器签名构造适用于一对多场景下安全高效的批量原子交换协议.

基于国密SM2算法的局部可验证聚合签名算法研究

国密SM2算法基于椭圆曲线密码体制,由国家密码管理局于2010年发布,目前广泛应用于电子政务、医疗、金融等领域,其中数字签名作为SM2算法的主要应用,各种安全应用场景下产生的签名、验签操作次数呈指数级增长.针对海量SM2数字签名占用较大的存储空间,且对签名逐个验证效率较低的问题,提出一种基于国密SM2算法的局部可验证聚合签名方案,使用聚合签名,降低存储开销,提高验证效率.另一方面,针对验证方仅验证指定消息及聚合签名时,也必须获取聚合时的全部消息明文的问题,利用局部可验证签名,使得验证方仅需指定消息、聚合签名及短提示即可完成验证.对方案的正确性及安全性进行分析.通过实验数据和理论分析,与同类方案相比,该方案具备较高性能.

一种面向工业物联网的远程安全指令控制方案

随着工业领域对智能化要求的不断提高,工业物联网(IIoT)得到了快速发展,其可以有效提高工业生产中的流程效率和决策质量,具有广阔的应用前景。然而,近年来IIoT的安全问题逐渐凸显。针对远程指令控制这一应用场景,设计一种基于SM9标识密码算法的两方协同群签名算法,并结合区块链实现面向IIoT的远程安全指令控制方案,以保障IIoT中远程指令操作的安全性。该方案基于国密SM9标准,群管理员审核指令,并与发起指令签署请求的用户协同完成群签名,群签名在保护签名者身份隐私的同时可以由群管理员在必要时公开签名者身份。通过引入区块链技术,实现IIoT平台的去中心化管理,并通过智能合约获取指令执行历史数据,方便后续审计与追责。此外,方案在签名验证阶段通过批量验证来有效减少计算消耗。安全性及性能分析结果表明:在签名数量超过20条时,该方案通过批量验证的方式可以使得计算量减少50%以上;相较对比方案,所提方案在IIoT环境下安全性和实用性更高。

基于SM2门限盲签名电子选举方案

针对提高国产化电子选举系统算法协议层的安全和效率问题,提出一种基于SM2门限盲签名电子选举方案。首先,基于SM2签名算法构造SM2门限盲签名算法,在不改变原有签名流程的前提下,采用Shamir秘密分享、随机秘密分享(RSS)、秘密和差、乘积分享、逆的秘密分享(ISS)等方法分享SM2签名算法中的秘密私钥和随机数,同时引入盲化因子对签名的消息进行盲化,实现签名过程中消息发送方的隐私保护及敏感信息的有效分享;其次,算法安全分析结果表明,在随机预言机模型下,所提的盲签名算法具有盲性、健壮性和不可伪造性,相较于现有的RSA(Rivest-Shamir-Adleman)、椭圆曲线数字签名算法(ECDSA)门限盲签名算法,所提的SM2门限盲签名算法具有计算复杂度低、通信开销较小的优势,适用于大规模选举;最后,基于SM2门限盲签名算法设计安全电子选举协议,分析结果表明,所提协议具有不可伪造性、保密性、合法性和鲁棒性,并且完成一次投票过程仅需15.7061 ms。

基于区块链的智能电网隐私保护数据聚合方案

为解决电力用户用电数据隐私泄露的问题,提出一种基于区块链的智能电网隐私保护数据聚合方案。每个智能电表分别使用Okamoto-Uchiyama加密算法和双线性聚合签名算法对用电数据进行处理,将其上传至区块链主节点。区块链主节点负责验证签名并聚合数据后将其存入区块链。电力公司从链上获取聚合数据。由于区块链主节点可能为了节省计算资源而不验证用户签名,发起懒惰攻击,引入可选性检验阶段,避免这种攻击。安全分析和性能评估表明,所提方案具有较好的安全性,能够以较低计算代价取得更优整体性能。

基于区块链的个人健康护照存储、共享与验证方案

随着人们对出境需求的增加,个人健康护照成为确认旅行者健康状态、满足入境要求的重要工具。针对个人健康护照全球共享所面临“信息孤岛”、隐私保护和易伪造等难题,提出了一种基于区块链的个人健康护照存储、共享与验证方案。方案在采用链上链下协同存储的同时,通过结合可搜索加密和区块链技术,优化了区块链上的存储方式,减少区块链的存储压力,同时实现用户个人数据的可靠存储及安全共享。方案对弱共识机制进行了优化,优化后的算法达成共识只需要2个阶段,从而减小了节点间达成共识的通信复杂度,提高了整个区块链系统的吞吐量。为适应多用户场景,方案引入并改进了聚合签名技术,减轻了签名验证的计算负担,使方案能够快速追溯恶意伪造者。方案给出了全面的安全性分析,证明方案是安全可靠的。最后,仿真实验结果表明,相较于现有方案,在多用户场景下方案的计算开销最高优化了49.89%,通信开销最高优化了25.81%,所提出的共识机制在不同节点数量下效率也有较大的优势。

基于区块链技术的物流供应链信息加密算法优化研究

传统供应链平台往往由于中心化的特性导致信息不对称,用户数据容易面临泄露的风险。针对这一问题,提出结合区块链技术对物流供应链信息进行加密解密。区块链技术具有匿名性、去中心化等特点,能够更好的保证物流供应链中用户信息的安全,通过非对称加密以及对称加密混合的方式,并设计相应的环签名算法以及PoA共识机制。经算例验证,以区块链技术为依据的物流供应链信息加密算法相比ECC算法在加密解密的速度上大幅提升,同时CPU占有率更低,加密解密的安全性更高。

一种双主节点的PBFT共识算法

针对区块链中拜占庭类共识算法主节点权限过高导致中心化集权与共识效率低下的问题,提出了一种双主节点的实用拜占庭容错(dual-master node practical Byzantine fault tolerance,DMNPBFT)共识算法。首先确定了区块链节点之间双主节点的权力,通过双主节点的交互模式减少中心化带来的权力集中影响。在信息交易传播过程中将双主节点与秘密分享技术相结合,确保联盟链中所有节点对交易信息达成一致,解决了节点之间为确认共识而造成的由复杂信息传播引起的共识效率较低的问题。双主节点利用秘密分享中的聚合算法生成主密钥并将主密钥与原密钥进行一致性比较,从而完成共识交易。DMNPBFT算法在计算上具备安全性与健壮性,共识轮数量仅有3轮。实验表明,相较于传统PBFT算法,DMNPBFT算法的共识一致性与容错处理能力均显著增强,共识时延减少了97.7%。该算法提高了联盟链节点处理数据的能力,能够在大数据流量下完成联盟链中数据的安全性共识传输操作。