Non-uniform hydrogen attack cavitation and the role of interaction with creep

Hydrogen attack (HA) is the development of grain-boundary porosity by cavities filled with high-pressure methane that originates from the reaction of carbides with hydrogen at high temperatures. The cavities grow by grain-boundary diffusion and by creep of the adjacent grain material till they coalesce with neighbouring cavities to form a microcrack. Earlier work on HA has focussed on unit cells containing a single cavity, using average cavitation properties. Here, non-uniform cavitation properties on the grain-size scale are assumed in a polycrystalline aggregate, and unit cell analyses are performed to investigate the influence of the adjacent grains on the development of the grain-boundary HA. The numerical results are explained in terms of two simplified models which highlight the key parameters governing the grain deformation-grain boundary cavitation interaction process.     

ID-based threshold decryption secure against adaptive chosen-ciphertext attack

This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems.     

标准模型下的无证书代理环签名方案

由于无证书公钥密码体制是一种新型公钥密码体制,它既克服了密钥托管问题,又不需要使用公钥证书,而在标准模型下所构造的方案与在随机语言模型下所构造的方案相比,具有更高的可证安全性,因此,该文在标准模型下,提出了一个无证书代理环签名方案。与现有的代理环签名方案相比,它具有更高的执行效率和可证安全性,能够归约于CDH（computational diffie-Hellman）问题假定。分析结果表明：它既能有效抵制来自密钥生成中心和授权人的伪造攻击,又能满足代理环签名的其他安全性需求;并且,该方案具有更高的执行效率,只需要两次对运算。     

电子邮件目录收割攻击的防御

为了更好地解决垃圾邮件的问题,提高对垃圾邮件的防御效果,本文从造成垃圾邮件的其中一个原因———子邮件目录收割攻击(DHA)入手,通过对DHA攻击原理的分析,提出基于黑名单同时以邮件地址阈值和IP地址阈值为锁定条件的防御策略,并在攻击资源有限的条件下对防御策略进行模拟测试。分析结果表明该防御策略能对DHA进行有效的防御,同时得出防御策略中的过滤阈值和锁定时间的设置是防御DHA的关键点。     

某大型企业网络安全防御系统的设计

为提高某企业网络的安全防护等级,有效抵御网络黑客和攻击,基于企业当前的网络现状,分析企业的安全需求,设计部署企业的安全防御系统。新的设计方案能有效过滤简单网络攻击,识别复杂网络攻击,全面防护企业网。     

网络攻击过程剖析

了解网络攻击的过程,有利于用户采取适当的防护措施,减少受到攻击的可能性。本文描述并分析网络攻击过程的三个阶段,以及各个阶段所采取的不同方法。     

基于DWT的水印嵌入规则性能研究

在数字水印研究中,一个重要的问题是水印的不可见性与鲁棒性之间的折中。根据实际应用,数字水印的嵌入规则主要有乘性规则、加性规则和一种区域融合嵌入规则。本文主要从数字水印的抗攻击性方面,结合不同的嵌入规则,对各种常见图像攻击进行测试,在检测不同嵌入规则性能优劣的同时,为水印方法的选择与应用,提供指导和参考,以达到最佳的使用目的。     

基于水印技术的数字作品版权保护系统

本文基于数字水印技术提出了一种网络多媒体作品的注册和侵权收集机制,可以实现包括图像、视频和音频等网络作品的注册和非授权复制和传播行为的信息收集等功能。该机制对网络多媒体作品的版权保护具有一定的实用价值。     

采用工作量证明共识机制的区块链中挖矿攻击者间的“鲶鱼效应”

近年来,采用工作量证明共识机制(Proof of Work,PoW)的区块链被广泛地应用于以比特币为代表的数字加密货币中.自私挖矿攻击(Selfish mining)等挖矿攻击(Mining attack)策略威胁了采用工作量证明共识机制的区块链的安全性.在自私挖矿攻击策略被提出之后,研究者们进一步优化了单个攻击者的挖矿攻击策略.在前人工作的基础上,本文提出了新颖的两阶段挖矿攻击模型,该模型包含拥有单攻击者的传统自私挖矿系统与拥有两个攻击者的多攻击者系统.本文的模型同时提供了理论分析与仿真量化分析,并将两个攻击者区分为内部攻击者与外部攻击者.通过引入内部攻击者与外部攻击者的概念,本文指出传统自私挖矿系统转化为多攻击者系统的条件.本文进一步揭示了在多攻击者系统中两个攻击者将产生竞争并面临着“矿工困境”问题.攻击者间的竞争可被总结为“鲶鱼效应”:外部攻击者的出现导致内部攻击者的相对收益下降至多67.4%,因此内部攻击者需要优化攻击策略.本文提出了名为部分主动发布策略的全新挖矿攻击策略,相较于自私挖矿策略,该策略是半诚实的攻击策略.在特定场景下,部分主动发布策略可以提高攻击者的相对收益并破解攻击者面临的“矿工困境”问题.     

A Network Security Risk Assessment Method Based on a B_NAG Model

Computer networks face a variety of cyberattacks. Most network attacks are contagious and destructive, and these types of attacks can be harmful to society and computer network security. Security evaluation is an effective method to solve network security problems. For accurate assessment of the vulnerabilities of computer networks, this paper proposes a network security risk assessment method based on a Bayesian network attack graph (B_NAG) model. First, a new resource attack graph (RAG) and the algorithm E-Loop, which is applied to eliminate loops in the B_NAG, are proposed. Second, to distinguish the confusing relationships between nodes of the attack graph in the conversion process, a related algorithm is proposed to generate the B_NAG model. Finally, to analyze the reachability of paths in B_NAG, the measuring indexs such as node attack complexity and node state transition are defined, and an iterative algorithm for obtaining the probability of reaching the target node is presented. On this basis, the posterior probability of related nodes can be calculated. A simulation environment is set up to evaluate the effectiveness of the B_NAG model. The experimental results indicate that the B_NAG model is realistic and effective in evaluating vulnerabilities of computer networks and can accurately highlight the degree of vulnerability in a chaotic relationship.