CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...     

二层交换机的攻击分析与防范技术的研究

本文通过OSI模型的第二层的特点,分析了二层交换机存在的安全隐患,提出了相应的解决办法。     

Threshold password authentication against guessing attacks in Ad hoc networks

Password authentication has been accepted as one of the commonly used solutions in network environment to protect resources from unauthorized access. The emerging mobile Ad hoc network, however, has called for new requirements for designing authentication schemes due to its dynamic nature and vulnerable-to-attack structure, which the traditional schemes overlooked, such as availability and strong security against off line guessing attacks in face of node compromise. In this paper, we propose a threshold password authentication scheme, which meets both availability and strong security requirements in the mobile Ad hoc networks. In our scheme, t out of n server nodes can jointly achieve mutual authentication with a registered user within only two rounds of message exchanges. Our scheme allows users to choose and change their memorable password without subjecting to guessing attacks. Moreover, there is no password table in the server nodes end, which is preferable since mobile nodes are usually memory-restricted devices. We also show that our scheme is efficient to be implemented in mobile devices.     

ε线性结构及其谱特征

本文提出了ε线性结构的概念,研究了其基本性质,给出了多输出函数的ε线性结构与其坐标函数的线性组合的ε线性结构之间的关系,给出了具有ε线性结构的Ｂｏｏｌｅ函数的Ｗａｌｓｈ谱特征。最后证明了利用密码算法的ε线性结构,在选择明文攻击下,可保证成功率不小于１－ε／２有前提下大幅度降低密钥穷举量。     

The Full Cost of Cryptanalytic Attacks

An open question about the asymptotic cost of connecting many processors to a large memory using three dimensions for wiring is answered, and this result is used to find the full cost of several cryptanalytic attacks. In many cases this full cost is higher than the accepted complexity of a given algorithm based on the number of processor steps. The full costs of several cryptanalytic attacks are determined, including Shanks method for computing discrete logarithms in cyclic groups of prime order n, which requires n^1/2+o(1) processor steps, but, when all factors are taken into account, has full cost n^2/3+o(1). Other attacks analyzed are factoring with the number field sieve, generic attacks on block ciphers, attacks on double and triple encryption, and finding hash collisions. In many cases parallel collision search gives a significant asymptotic advantage over well-known generic attacks.     

基于层次分析法的城市反空袭防护目标选择

通过对防护目标的选定因素分析,城市反空袭防护目标指标体系包括目标层、准则层及措施层.利用层次分析法(AHP)法选定城市反空袭中的防护目标,形成数据表、建立并求解判断矩阵及一致性检验,以获得选择最优保护目标的排序权重.经实际运用,所建立的指标体系和方法更有利于合理、科学地选择防护目标.     

海战场电子战的发展和对策

简述海战场电子战在现代海战中的作用,分析海战场电子战的发展水平和面临的挑战,提出海战场电子战的发展趋势和对策。     

机器学习系统毒化攻击综述

自机器学习被应用到许多关键性领域以来,机器学习系统的脆弱性也引起了人们的高度重视。其中,针对机器学习系统的毒化攻击得到了研究者的广泛关注,呈现了一些研究成果。因此,将系统地介绍当前机器学习系统毒化攻击的研究进展,对机器学习系统毒化攻击算法进行分类和总结,包括针对机器学习中的线性分类器、支持向量机、贝叶斯分类器和深度神经网络等几类常见模型的毒化攻击等攻击算法,目标是使现有的关于机器学习系统毒化攻击的研究成果更加清晰,为相关研究者的研究工作提供启发。     

基于改进决策树的有状态防火墙模型

适应复杂防御策略的有状态模型是研究有状态防火墙的核心内容。防火墙的运行不仅应当具有时间和空间上的效率,还应当允许管理员定义复杂的逻辑过程和状态信息。在一种经典的有状态防火墙模型的基础上,结合改进决策树,提出了一种新的允许用户自定义状态变量以及防御算法的模型。该模型能够更好地适应针对不同类型网络攻击,复杂多变的防御策略需求,在时间和空间上也具有较好的效率。     

Some results on the algebraic immunity of Boolean functions

From the motivation of algebraic attacks on stream and block ciphers,the concept of algebraic immunity(AI) of a Boolean function was introduced and studied extensively.High algebraic immunity is a necessary condition for resisting algebraic attacks.In this paper,we give some lower bounds on the algebraic immunity of Boolean functions.The results are applied to give lower bounds on the AI of symmetric Boolean functions and rotation symmetric Boolean functions.Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value「n/2」are constructed.