毫米波车联网多基站多用户下的安全传输方案

针对移动场景下毫米波安全波束形成的时效性和毫米波动态窃听场景下安全连接的鲁棒性等问题,提出了一种基于决斗双重深度Q网络(D3QN)-深度确定性策略梯度(DDPG)算法的多智能体安全协作通信方案。该方案利用路侧单元(RSU)辅助的协作干扰技术降低窃听者对合法信号的接收质量,并通过联合优化车辆用户(VU)的基站与波束连接控制、阻塞RSU的选择,以及RSU的协作干扰方向和发射功率控制,使得所有合法车辆的总保密传输速率最大化。在此基础上,针对车联网的高动态性,通过构建基于D3QN的VU智能体和基于D3QN-DDPG的RSU智能体,实现了实时的离散-连续混合决策。最后,通过多维度的性能分析和方案对比实验,验证了所提方案的有效性。

An Active Deception Defense Model Based on Address Mutation and Fingerprint Camouflage

The static and predictable characteristics of cyber systems give attackers an asymmetric advantage in gathering useful information and launching attacks.To reverse this asymmetric advantage,a new defense idea,called Moving Target Defense(MTD),has been proposed to provide additional selectable measures to complement traditional defense.However,MTD is unable to defeat the sophisticated attacker with fingerprint tracking ability.To overcome this limitation,we go one step beyond and show that the combination of MTD and Deception-based Cyber Defense(DCD)can achieve higher performance than either of them.In particular,we first introduce and formalize a novel attacker model named Scan and Foothold Attack(SFA)based on cyber kill chain.Afterwards,we develop probabilistic models for SFA defenses to provide a deeper analysis of the theoretical effect under different defense strategies.These models quantify attack success probability and the probability that the attacker will be deceived under various conditions,such as the size of address space,and the number of hosts,attack analysis time.Finally,the experimental results show that the actual defense effect of each strategy almost perfectly follows its probabilistic model.Also,the defense strategy of combining address mutation and fingerprint camouflage can achieve a better defense effect than the single address mutation.

Utilizing Certificateless Cryptography for IoT Device Identity Authentication Protocols in Web3

Traditional methods of identity authentication often rely on centralized architectures,which poses risks of computational overload and single points of failure.We propose a protocol that offers a decentralized approach by distributing authentication services to edge authentication gateways and servers,facilitated by blockchain technology,thus aligning with the decentralized ethos of Web3 infrastructure.Additionally,we enhance device security against physical and cloning attacks by integrating physical unclonable functions with certificateless cryptography,bolstering the integrity of Internet of Thins(IoT)devices within the evolving landscape of the metaverse.To achieve dynamic anonymity and ensure privacy within Web3 environments,we employ fuzzy extractor technology,allowing for updates to pseudonymous identity identifiers while maintaining key consistency.The proposed protocol ensures continuous and secure identity authentication for IoT devices in practical applications,effectively addressing the pressing security concerns inherent in IoT network environments and contributing to the development of robust security infrastructure essential for the proliferation of IoT devices across diverse settings.

基于动态伪装网络的主动欺骗防御方法

针对现有蜜罐易被攻击者识破而导致其抵御渗透攻击时经常失效的问题,提出一种基于动态伪装网络的主动欺骗防御方法。首先,给出动态伪装网络定义并描述基于动态伴随网络的主动欺骗攻防场景;然后,在分析攻防交互过程的基础上,构建信号博弈模型来指导最优欺骗策略选取;进一步,设计基于双层威胁渗透图的攻防策略收益量化方法;最后,提出一种统一纯策略与混策略的博弈均衡求解方法。实验结果表明,基于动态伪装网络,精炼贝叶斯均衡能够为防御者实施最优防御策略提供有效指导,实现防御者收益最大化。此外,还总结了利用动态伪装网络进行主动欺骗防御的特点与规律。

高效的决策树隐私分类服务协议

为了有效解决物联网大数据场景中的决策树隐私分类服务问题,将决策树分类模型与安全多方计算技术相结合,提出了一种高效的决策树隐私分类服务协议。该协议包括:决策树分类模型混淆、基于布尔共享的隐私比较和基于不经意传输的隐私分类结果获取3个阶段。该协议能够同时保护服务提供商决策树分类模型参数及结构特征和用户需要进行分类的特征数据不被泄露。安全性分析表明,所提决策树隐私分类服务协议能够抵抗“诚实好奇”的攻击者。将所提协议用于通过公开数据集得到的决策树分类模型,以分类准确率和完成隐私分类服务的时间效率为指标与现有方法进行对比,实验结果验证了所提出隐私分类服务协议的准确性和高效性。

万物互联背景下的边缘计算安全需求与挑战

作为万物互联时代新型的计算模型,边缘计算具有的分布式、"数据第一入口"、计算和存储资源相对有限等特性,使其除了面临信息系统普遍存在网络攻击之外,还不可避免地引入了一些新的安全威胁。为此,从4个方面对边缘计算的安全需求进行阐述,同时对其主要安全技术的设计以及实现所面临的挑战进行分析,较为全面地指出了边缘计算在身份认证、访问控制、入侵检测、隐私保护、密钥管理中存在的具体安全问题。

车载边缘计算中任务卸载和服务缓存的联合智能优化

针对车载环境下有限的网络资源和大量用户需求之间的矛盾,提出了智能驱动的车载边缘计算网络架构,以实现网络资源的全面协同和智能管理。基于该架构,设计了任务卸载和服务缓存的联合优化机制,对用户任务卸载以及计算和缓存资源的调度进行了建模。鉴于车载网络的动态、随机和时变的特性,利用异步分布式强化学习算法,给出了最优的卸载决策和资源管理方案。实验结果表明,与其他算法相比,所提算法取得了明显的性能提升。

一种智能高效的最优渗透路径生成方法

在考虑未知攻击和内部攻击条件下,为进一步提高最优渗透路径生成效率,提出一种智能高效的最优渗透路径生成方法.首先给出双层威胁渗透图(two-layer threat penetration graphs, TLTPG)模型,其下层为主机威胁渗透图(host threat penetration graph, HTPG),其上层为网络威胁渗透图(network threat penetration graph, NTPG);然后,基于知识图谱,构建主机资源知识图谱(host resource knowledge graph, HRKG),用于智能高效推理生成HTPG;进一步,利用HTPG,设计智能化的基于渗透信息交换的NTPG生成算法;最后依据TLTPG,设计任意2个主机间的最优渗透路径生成算法.实验结果表明:该方法能够描述未知攻击和内部攻击,且可提高最优渗透路径的生成效率.

理性安全的公平两方比较协议

现有的安全两方比较协议通常是让一方(如Alice)先获知比较结果,然后Alice将比较结果告知另一方(如Bob)。如果Alice拒绝或未将结果发送给Bob,则协议无法保障参与方都拿到比较结果,协议的公平性被破坏。为解决上述问题,结合门限Paillier密码系统与博弈论提出一种理性安全的公平两方比较协议TEAM。具体地,首先利用门限Paillier密码系统设计一种新型的安全两方比较协议。接着引入博弈论机制,探寻所提安全两方比较协议双方均获得比较结果的博弈均衡点。严格的理论分析表明,TEAM保障理性的参与方可在不泄露各自数据的情况下正确地获得比较结果,即TEAM是一个正确、安全且公平的两方比较协议。实验结果显示,同等实验环境下TEAM的计算效率相较于现有的安全两方比较方法运行速度能提升超50倍。

Dynamic Cluster Key Management Scheme on Wireless Sensor Networks

Wireless sensor networks are open architectures, so any potential threat can easily intercept, wiretap and counterfeit the information. Therefore, the safety of WSN is very important. Since any single key system cannot guarantee the security of the wireless sensor network for communications, this paper introduces a hierarchical key management scheme based on the different abilities of different sensor nodes in the clustered wireless sensor network. In this scheme, the nodes are distributed into several clusters, and a cluster head must be elected for each cluster. Private communication between cluster heads is realized through the encryption system based on the identity of each head while private communication between cluster nodes in a same cluster head is achieved through the random key preliminary distribution system. Considering the characteristics of WSN, we adopt dynamic means called dynamic cluster key management scheme to deal with master key, so master key will be updated according to the changed dynamic network topology. For cluster head node plays a pivotal role in this scheme, a trust manage-ment system should be introduced into the election of the cluster head which will exclude the malicious node from outside the cluster, thus improve the whole network security.

Dynamic Polling MAC Scheme Considering Emergency Access in WSNs Based on Priorities

In Wireless Sensor Networks(WSNs),polling can obviously improve the throughput and decrease average access delay by allocating bandwidth efficiently and reasonably.In this paper,a Dynamic Polling Media Access Control (DPMAC) scheme designed according to WSNs' features is proposed.DPMAC is a priority based access control protocol with the characteristics that its polling table is dynamically refreshed depending on whether the sensor node is active and that the bandwidth is dynamically allocated according to the traffic types.The access priorities are determined by the emergency levels of events and the scheduler proposed in our MAC is preemptive based on the deadline of the events.Simulation results show that DPMAC can efficiently utilize bandwidth and decrease average access delay and response time for emergency events with different access priorities in WSNs.

Analysis on the Resilience of Key Pre-distribution in Sensor Networks

Resilience against node capture is one of the main indicators of the key pre-distribution security in sensor networks.On providing the attack model and the definition of the resilience against node capture of sensor networks,the resilience of basic random key pre-distribution,Q-composite random key pre-distribution and their reinforced schemes are analyzed and compared in depth.Research results show that the size of key pool,the numbers of the keys stored in nodes and the value of Q determine the resilience of random key pre-distribution.The tradeoff between the resilience,security connectivity and costs in sensor networks is presented.These researches lay a foundation on the design of the secure protocol and the algorithm in the specific application environment of sensor networks.

Ant-Colony Based Routing Algorithm in Wireless Sensor Networks

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.

Elliptic Curve Scalar Multiplication with x-Coordinate

This paper gives a comprehensive method to do Elliptic Curve Scalar Multiplication with only x-coordinate. Explicit point operation formulae for all types of defining equations of the curves are derived. For each type of curve, the performance is analyzed. The formulae are applied in Montgomery Ladder to get scalar multiplication algorithm operated with only x-coordinate. The new scalar multiplication has the same security level and computation amount with protected binary scalar multiplication （PBSM） against side channel attack, and has the advantages of higher security and little memory needed.

A Digital Right Management Model for Distribution of Digital Audiovisual Content

This paper presents a digital rights management model, which considers the integrated factors including legality, communication security, integrity of the content, and trading fairness. The architecture of the model, the necessary protocol for the copyright control and content distribution, the authentication mechanism which offer consumption registration for content fair distribution, of the model are all provided. The scheme also provides distribution and evidence for using the copyright of digital content fairly and effectively. Finally, analysis shows the proposed model has both high security and good performance.