基于Web服务的使能服务平台安全机制

介绍了一个在网络经济模式下,基于Web服务的、支持中小企业动态联盟的使能服务平台,并分析了其中面临的安全威胁,提出了一套适用该平台的安全机制·该安全机制可以为用户提供信息通信保密,访问权限控制,数字签名,身份认证,密钥管理以及入侵检测等安全性保障·其中使用了AES和混沌密码算法进行数据加密,RSA算法用于数字签名和密钥交换,Guillou Quisquater协议用于身份认证,一个基于RSA的秘密共享体制保存密钥·在入侵检测系统中,综合使用了神经网络,数据挖掘和计算机免疫方法·最后,分析了其安全性·     

可证明安全的多信任域认证密钥协商协议

为解决采用基于证书认证方式的网络用户与采用基于身份认证方式的网络用户之间相互认证的问题,利用对称加密、数字签名和消息认证码等技术,首先构造一个认证链路模型下会话密钥安全的认证协议,然后设计消息认证器把该协议转换成非认证链路模型下的会话密钥安全的认证协议,并对该协议的安全性进行了分析.分析表明,该协议实现了不同认证方式的信任域中用户间的认证、密钥协商以及密钥更新,并在Canetti-Krawczyk(CK)模型下满足安全属性需求.此外,该协议仅需4次通信即可完成,且扩展性好,为不同认证机制的网络用户间认证提供了一种较为实用的解决方案.     

具有双向认证功能的多方量子密钥分发

基于Greenberger-Horne-Zeilinger态的纠缠特性,设计一个具有双向认证功能的多方量子密钥分发协议.在协议中,量子网络中的任意两个用户均可在一个半可信第三方的帮助下,共享一个安全的会话密钥.其中,利用带密钥的单向hash函数技术对每个用户的身份进行认证.最后,对协议的安全性进行分析,表明该协议在理论上是安全的.     

RSA算法在ATMC平台中的应用

研究了ATMC中的数据加密、RSA加密算法、数字签名方案和安全散列算法（SHA）的原理,并在其理论的基础上,针对ATMC平台中3DES密钥管理的薄弱环节,设计了在ATMC平台中的应用程序．希望能有效地管理密钥,减少银行内部在ATM安装中的安全隐患问题,保证网络数据的安全性．即便在以后的ATM维护中,也能够方便地导入密钥,有效地解决了密钥的安全问题．     

基于Hash函数与状态锁定的RFID认证协议研究

针对射频识别(RFID)系统中存在的标签数据机密、安全等问题,研究Hash函数相关协议与对称密钥机制的优缺点,提出一种基于Hash函数与状态锁定的安全认证协议.该协议采用单向Hash函数与对称加密方法,结合后台数据库与标签状态的锁定设置,并在认证结束后及时更新ID和密钥值,有效处理RFID认证阶段的安全风险问题.通过安全性分析表明,该协议既保证了标签的匿名性、完整性、机密性,又抵御了攻击者假冒、重传、去同步攻击,能较好地完成RFID系统中阅读器与标签的相互认证.     

一种适用于Ad hoc网络的轻量级密钥交换协议

通过对Ad hoc网络安全性特殊需求的分析,提出适合其特点的轻量级节点间密钥交换协议. 协议使用一种新的基于ID的身份认证机制相互验证身份;使用改进的Blom机制生成加密密钥和认证密钥,分别用于数据私密性保护和报文完整性检查. 为了防止敌方捕获密钥,提出基于节点间数据流的密钥更新机制. 针对节点撤销,给予相应的解决方案. 从不同的角度对协议进行安全性分析,通过和其他实现方法比较,在性能方面证明其高效性.     

一种利用多元线性函数绑定指纹细节点与密钥的新方法

提出了一种新的使用多元线性函数实现待保护的密钥和指纹细节点数据绑定的方法,将指纹数据和传统加密系统密钥融合成一体,只有通过指纹认证才可获得密钥的使用权.其中多元线性函数的变量数不是由待保护的密钥长度决定,而是由需要匹配的细节点数目决定.实验结果表明,与已有的算法相比,提高了系统的安全性和真实用户恢复密钥的速度.     

改进的前向安全的认证加密方案

多数基于离散对数问题的认证加密方案不满足前向安全性，证明了Huang—Chang方案不满足前向安全和语义安全，且易受已知明文攻击，基于循环群乙上离散对数困难问题以及单向hash函数的不可逆性，利用可证安全的短签名方案（SDSS），设计了一个新的能弥补Huang-Chang方案安全隐患的认证加密方案，理论分析证明了新方案的安全性：即不可伪造性、可公开验证性、语义安全性和前向安全性，复杂性分析表明新方案是高效的。     

基于圆特性的身份认证与密钥协商

有的几何认证方案采用"欧氏空间直线"等简单几何结构,使方案的安全性较低;有的虽然采用了复杂的"n维空间圆"结构,但由于登录消息太简单,也降低了安全性.本文设计了一个几何认证与密钥协商方案,它基于"n维空间圆上(n＋1)个点可以唯一重构该圆"的n维空间圆构造原理,还采用了多变量的单向散列函数来计算登录消息,加强了用户登录消息的安全性,使方案能抵抗口令猜测、重放、窃听与离线消息分析攻击;并且采用基于计算观点的正确认证协议形式化证明方法—Bellare-Rogaway模型,证明了本文身份认证与密钥协商协议是安全的.     

基于现场可编程门阵列的Linux统一加密设置认证算法的流水线架构

Linux统一加密设置(LUKS)是Linux操作系统的标准磁盘加密认证规范并得到广泛应用.由于其算法构成复杂且所需资源较多,如何利用单个现场可编程门阵列(FPGA)的有限资源来实现整个算法并获得高吞吐率是研究工作的重点和难点.为此,研究了一种高能效的LUKS认证算法流水线架构,包括采用4级流水线的安全散列算法(SHA-1)和8级流水线的基于密码的密钥派生函数(PBKDF2)-基于哈希消息验证代码(HMAC)-SHA-1),并使用块随机存取存储器(BRAM)实现了基于S盒和T盒(ST-box)映射表的高级加密标准(AES)-128-电子密码本模式(ECB)算法,以节省FPGA的查找表资源用于上述的流水线架构实现.运行结果显示本设计的密码遍历速度达到了342s-1,功耗仅为5.27W,每个密钥的平均计算能量为0.015J.口令恢复速度超过了工作频率为700 MHz、480核的GTX 480图像处理器(GPU),同时其能耗仅为GPU的1/13.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.