Efficient Protocol-Proving Algorithm Based on Improved Authentication Tests

A new efficient protocol-proving algorithm was proposed for verifying security protocols. This algorithm is based on the improved authentication tests model, which enhances the original model by formalizing the message reply attack. With exact causal dependency relations between messages in this model, the protocol-proving algorithm can avoid the state explosion caused by asynchronous. In order to get the straight proof of security protocols, three authentication theorems are exploited for evaluating the agreement and distinction properties. When the algorithm terminates, it outputs either the proof results or the potential flaws of the security protocol. The experiment shows that the protocol-proving algorithm can detect the type flaw attack on Neuman-Stubblebine protocol, and prove the correctness of NSL protocol by exploring only 10 states.

Cryptanalysis and Improvement of the Multi-User QPCE Protocol with Semi-Honest Third Party

In a recent work [Quantum Inf. Process 12 （2013） 1077], a multi-user protocol of quantum private comparison of equality （QPCE） is presented. Here we point out that if we relax the constraint of a semi-honest third party, the private information of the users will be totally leaked out to the third party. A special attack is demonstrated in detail. Furthermore, a possible improvement is proposed, which makes the protocol secure against this kind of attack.

A Novel Improved Artificial Bee Colony and Blockchain-Based Secure Clustering Routing Scheme for FANET

Flying Ad hoc Network(FANET)has drawn significant consideration due to its rapid advancements and extensive use in civil applications.However,the characteristics of FANET including high mobility,limited resources,and distributed nature,have posed a new challenge to develop a secure and ef-ficient routing scheme for FANET.To overcome these challenges,this paper proposes a novel cluster based secure routing scheme,which aims to solve the routing and data security problem of FANET.In this scheme,the optimal cluster head selection is based on residual energy,online time,reputation,blockchain transactions,mobility,and connectivity by using Improved Artificial Bee Colony Optimization(IABC).The proposed IABC utilizes two different search equations for employee bee and onlooker bee to enhance convergence rate and exploitation abilities.Further,a lightweight blockchain consensus algorithm,AI-Proof of Witness Consensus Algorithm(AI-PoWCA)is proposed,which utilizes the optimal cluster head for mining.In AI-PoWCA,the concept of the witness for block verification is also involved to make the proposed scheme resource efficient and highly resilient against 51%attack.Simulation results demonstrate that the proposed scheme outperforms its counterparts and achieves up to 90%packet delivery ratio,lowest end-to-end delay,highest throughput,resilience against security attacks,and superior in block processing time.

Universally Composable Three Party Password-based Key Exchange Protocol

Within the framework of universal composability,an appropriate ideal functionality that captures the basic security requirements of three party password-based key exchange was defined. An efficient real-word three party password-based key exchange protocol was also proposed.This protocol securely realizes the ideal functionality with respect to static party corruption.Thus it provides security guarantees under arbitrary composition with other protocols.

A Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Ad Hoc Networks Using Elliptic Curve Cryptography

This paper addresses an interesting security problem in wireless ad hoc networks: the dynamic group key agreement key establishment. For secure group communication in an ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, we propose a novel, secure, scalable and efficient region-based group key agreement protocol for ad hoc networks. This is implemented by a two-level structure and a new scheme of group key update. The idea is to divide the group into subgroups, each maintaining its subgroup keys using group elliptic curve diffie-hellman (GECDH) Protocol and links with other subgroups in a tree structure using tree-based group elliptic curve diffie-hellman (TGECDH) protocol. By introducing region-based approach, messages and key updates will be limited within subgroup and outer group;hence computation load is distributed to many hosts. Both theoretical analysis and experimental results show that this Region-based key agreement protocol performs well for the key establishment problem in ad hoc network in terms of memory cost, computation cost and communication cost.

A Quantitative Security Metric Model for Security Controls:Secure Virtual Machine Migration Protocol as Target of Assessment

Quantitative security metrics are desirable for measuring the performance of information security controls. Security metrics help to make functional and business decisions for improving the performance and cost of the security controls. However, defining enterprise-level security metrics has already been listed as one of the hard problems in the Info Sec Research Council's hard problems list. Almost all the efforts in defining absolute security metrics for the enterprise security have not been proved fruitful. At the same time, with the maturity of the security industry, there has been a continuous emphasis from the regulatory bodies on establishing measurable security metrics. This paper addresses this need and proposes a relative security metric model that derives three quantitative security metrics named Attack Resiliency Measure(ARM), Performance Improvement Factor(PIF), and Cost/Benefit Measure(CBM) for measuring the performance of the security controls. For the effectiveness evaluation of the proposed security metrics, we took the secure virtual machine(VM) migration protocol as the target of assessment. The virtual-ization technologies are rapidly changing the landscape of the computing world. Devising security metrics for virtualized environment is even more challenging. As secure virtual machine migration is an evolving area and no standard protocol is available specifically for secure VM migration. This paper took the secure virtual machine migration protocol as the target of assessment and applied the proposed relative security metric model for measuring the Attack Resiliency Measure, Performance Improvement Factor, and Cost/Benefit Measure of the secure VM migration protocol.

IAGNES algorithm for protocol recognition

In the process of protected protocol recognition,an improved AGglomerative NESting algorithm( IAGNES) with high adaptability is proposed,which is based on the AGglomerative NESting algorithm( AGNES),for the challenging issue of how to obtain single protocol data frames from multiprotocol data frames. It can improve accuracy and efficiency by similarity between bit-stream data frames and clusters,extract clusters in the process of clustering. Every cluster obtained contains similarity evaluation index which is helpful to evaluation. More importantly,IAGNES algorithm can automatically recognize the number of cluster. Experiments on the data set published by Lincoln Laboratory shows that the algorithm can cluster the protocol data frames with high accuracy.

草地培育的内涵和方法

草地培育在草业科学理论指导下,通过一系列草地管理措施,解决草-畜供需季节性不平衡这一根本性矛盾,提高和完善草业系统的结构与功能。根据草地培育的作用目标或其尺度与属性、实施主体有5种划分方法。主要包括封育、休牧、划破、补播、施肥、灌溉、火烧、放牧、人工增雨、研学旅游、智慧管理、政策法规等,这些方法通过改变草业系统或其组分而融入草畜反馈机制。草地培育遵循产业化、慎重改造、综合性和尺度对应等原则,集成技术之间协同或叠加,效果达到超饱和或盈饱和,关键是确定生态系统对培育措施的适应期、响应期和饱和期3组阈值。草地培育建立以放牧为基础的边牧边育的模式,重视“有害”生物作为生态系统不可替代的组分及其资源属性,建设以草地健康水平为基础的标准化的草地培育流程,推动智能化、机械化、规模化作业,提高培育效率和效益。

基于身份认证的BACnet/IP分析与改进

为了解决BACnet/IP身份认证存在多种可攻击漏洞和密钥泄露带来的安全问题,提出了一种安全增强的BACnet/IP-SA协议认证方案。研究协议身份认证消息流模型,基于着色Petri网理论和CPNTools对身份认证消息流建模,采用Dolev-Yao攻击者模型和形式化分析方法对BACnet/IP进行安全性分析,发现协议漏洞并提出改进方案。BACnet/IP-SA协议使用设备的伪身份来保护真实身份信息,使用PUF响应进行认证,通过多信息集合的验证值来验证端身份的真实性并生成会话密钥。结合BAN逻辑和非形式化方法,对协议的安全性进行了证明。实验结果表明,所提方案能有效抵抗多类攻击和密钥泄露带来的安全威胁,在减少计算开销的同时增强了协议身份认证的安全性。

改良特异性皮炎小鼠模型的建立与评估

目的对现有的建模方法和评价指标进行优化以提高模型的成功率和实验结果的可靠性,同时,对BALB/c和C57BL/6J两种不同品系的小鼠特异性皮炎模型进行了对比评价。方法8~10周龄BALB/c和C57BL/6J小鼠各16只,分为对照组和模型组(每组8只),使用2,4-二硝基氯苯(DNCB)诱导小鼠产生特异性皮炎(AD)样改变,动态观察并统计小鼠皮炎发病程度,抓挠次数和体质量等,在实验观察的终点收集对照组和模型组小鼠脾指数,对外周血免疫细胞变化和血清相关炎症因子水平等相关数据进行统计分析。结果实验第3天,两种品系模型组小鼠均开始出现皮肤肿胀、红斑等皮炎表型,随时间进展皮炎症状进一步加重。与同品系对照组小鼠相比,各模型组小鼠有明显的皮炎表现,脾指数、抓挠次数、外周血免疫细胞、相关炎症因子水平均高于其对照组水平。BALB/c小鼠的皮炎表型更易观察,但各指标与C57BL/6J小鼠有较大差异。结论两种品系小鼠都可用于AD小鼠模型构建。与C57BL/6J小鼠相比,BALB/c小鼠的皮炎症状更为明显,皮炎恢复能力弱。

基于改进机器学习的无人机中继通信数据调度控制研究

为解决无人机通信网络中数据调度行为中断概率过大的问题,实现对通信资源的合理分配,提出基于改进机器学习的无人机中继通信数据调度控制方法;设计基本网络架构,联合BMRC协议,设置URLLC数据链路单元,联合相关通信数据样本,求解通信中断概率的具体数值,实现对无人机中继通信网络资源的联合优化处理;分别计算时隙分配参量与带宽分配参量,并以此为基础,确定无人机中继位置,实现对中继通信资源的调度;按照机器学习算法标准,定义PCA改进特征,从而完善改进机器学习算法,再联合最优控制器闭环,实现对通信数据调度行为的控制;实验结果表明,改进机器学习算法作用下,随着中继数据累积量的增大,无人机通信网络中数据调度行为中断概率的最大值只能达到7.3%,有效降低了中断概率,符合合理分配通信资源的实际应用需求。

基于改进CGAN算法的私有工控协议可信性溯源检测方法

以往的私有工控协议可信性溯源检测方法直接利用提取的数据流特征构建可信性溯源模型,导致检测精度不高。因此,设计基于改进CGAN算法的私有工控协议可信性溯源检测方法。聚类私有工控协议,提取私有工控协议数据流特征;结合改进CGAN算法,计算数据流的权重矩阵,构建工控协议的可信性溯源模型,实现私有工控协议可信性的溯源检测。实验结果表明,设计的基于改进CGAN算法的私有工控协议可信性溯源检测方法检测精度为98.1%,检测效率最高为97%,监测准确性最高为98%,检测效果更好,并且具有良好的鲁棒性。

Improved algorithm of cluster-based routing protocols for agricultural wireless multimedia sensor networks

Low Energy Adaptive Clustering Hierarchy(LEACH)is a routing algorithm in agricultural wireless multimedia sensor networks(WMSNs)that includes two kinds of improved protocol,LEACH_D and LEACH_E.In this study,obstacles were overcome in widely used protocols.An improved algorithm was proposed to solve existing problems,such as energy source restriction,communication distance,and energy of the nodes.The optimal number of clusters was calculated by the first-order radio model of the improved algorithm to determine the percentage of the cluster heads in the network.High energy and the near sink nodes were chosen as cluster heads based on the residual energy of the nodes and the distance between the nodes to the sink node.At the same time,the K-means clustering analysis method was used for equally assigning the nodes to several clusters in the network.Both simulation and the verification results showed that the survival number of the proposed algorithm LEACH-ED increased by 66%.Moreover,the network load was high and network lifetime was longer.The mathematical model between the average voltage of nodes(y)and the running time(x)was concluded in the equation y=−0.0643x+4.3694,and the correlation coefficient was R2=0.9977.The research results can provide a foundation and method for the design and simulation of the routing algorithm in agricultural WMSNs.

An improved evaporation rate water cycle algorithm for energy-efficient routing protocol in WSNs

Purpose-The paper aims to introduce an efficient routing algorithm for wireless sensor networks(WSNs).It proposes an improved evaporation rate water cycle(improved ER-WC)algorithm and outlining the systems performance in improving the energy efficiency of WSNs.The proposed technique mainly analyzes the clustering problem of WSNs when huge tasks are performed.Design/methodology/approach-This proposed improved ER-WC algorithm is used for analyzing various factors such as network cluster-head(CH)energy,CH location and CH density in improved ER-WCA.The proposed study will solve the energy efficiency and improve network throughput in WSNs.Findings-This proposed work provides optimal clustering method for Fuzzy C-means(FCM)where efficiency is improved in WSNs.Empirical evaluations are conducted to find network lifespan,network throughput,total network residual energy and network stabilization.Research limitations/implications-The proposed improved ER-WC algorithm has some implications when different energy levels of node are used in WSNs.Practical implications-This research work analyzes the nodes’energy and throughput by selecting correct CHs in intra-cluster communication.It can possibly analyze the factors such as CH location,network CH energy and CH density.Originality/value-This proposed research work proves to be performing better for improving the network throughput and increases energy efficiency for WSNs.

植物石蜡制片中透明和脱蜡技术的改良

石蜡切片是植物科学研究领域中一项重要的实验技术,为组织学的发展做出了卓越贡献。制片过程中采用不同试剂和处理程序对切片质量有较大的影响。该文针对常规石蜡切片方法在操作步骤上存在的繁琐及试剂安全性等问题,摸索出改进方法。实验结果表明,采用histolene(C1OH16)、环保透明剂van-clear、正丁醇(n-butanol)和松节油(oil of turpentine)代替二甲苯(xylene),可避免二甲苯的毒性危害;同时精简了传统石蜡切片的操作程序,缩短了实验周期并提高了制片质量。

一种提取植物基因组DNA的方法--改良尿素法

介绍了一种从玉米和水稻叶片中提取高质量基因组DNA的改良尿素法.与其他常用方法如CTAB法、SDS法等相比,这种改良方法具有产率高、快速省时、可常温操作、成本耗用低等优点.结果证明,采用这种改良方法获得的基因组DNA纯度高、浓度大,适合用于限制性内切酶的酶切反应、基于PCR基础上的遗传多样性分析、基于传统的Southern杂交的遗传图谱分析以及其他下游分子生物学研究,是一种适于植物基因组DNA制备方法,值得推广的.并针对基因组制备过程中经常出现的难题,分析了产生的原因,提出了具体解决办法.

一种改进的AODV路由协议的实现与仿真

采用网络仿真软件进行网络协议开发与研究是一种经济、高效的方法。文章剖析了网络仿真器NS2的组成、结构和AODV协议工作机制。针对AODV协议只支持单径路由的缺点,提出一种改进策略,分析了改进的AODV协议的实现方法。NS2仿真实验结果表明,改进协议在端到端平均时延、分组投递率、路由发现频率和路由开销等方面有一定优势。

基于改进协议机制的防ARP欺骗方法

地址解析协议(ARP)是建立在友好通信、充分信任基础上的协议,因此,很容易受到攻击。该文介绍ARP协议工作机制、协议安全漏洞和当前已经提出的针对ARP欺骗的对策,并指出这些方法的不足之处。提出一种采用改进协议机制的方法用于防止ARP欺骗,该方法可以有效地减少利用ARP协议的网络欺骗攻击。

同种农机机群动态作业任务分配方法

为解决农机作业过程中因突发状况引起的作业时间增加、某些作业任务无法完成等问题,该研究提出一种基于改进合同网算法的同种农机机群动态作业任务分配方法。基于农机性能参数和任务参数综合考虑用时最长农机的作业时间、农机机群油耗和路上的路程建立机群代价函数,建立单个田块和地头相邻田块的路径规划方法,参考合同网算法中的招-投标过程,建立农机对任务进行投标的代价函数,基于降低服务器计算量、减少通信次数、任务均衡分配和减小非作业路程等原则,通过选择招标者、设定招标阈值、中标者任务再分配和农机间任务交换等方式改进合同网算法。在不同时间进行基于传统合同网算法和改进合同网算法的农机机群动态作业任务分配仿真试验和农场实际播种作业试验。仿真结果表明,基于改进合同网算法的动态任务分配仿真结果比基于传统合同网算法的动态任务分配仿真结果机群时间代价降低0.83%~12.89%,与服务器通信次数降低77.4%~85%。农场实际试验结果表明:在不同的任务分配时间,基于改进合同网算法的动态任务分配的机群时间代价比实际理论机群时间代价降低30.20%~34.09%。本文提出的动态作业任务分配法能够满足农业生产中同种农机机群动态作业任务分配需求。

WSN中基于LEACH-DCHS协议的簇维护算法

节能是无线传感器网络设计中的一个重要的目标,而路由算法对无线传感器网络的能量消耗有着重要的影响,所以提高路由算法的有效性,以减少网络中的能量消耗是非常必要的。在原LEACH-DCHS算法的基础上,提出了LEACH-DCHSCM(LEACH-DCHS Cluster Maintenance)算法。LEACH-DCHSCM通过延长网络稳定通信时间,同时兼顾网络中节点能量的均匀消耗,来达到节省能量的目的。仿真分析表明,新的算法在节能和信息传输的实时性方面较已有算法有很大的提高。