一种可外包解密的密文策略属性基加密方案

属性基加密能够更好地对敏感数据进行分享和管理,可以满足生活中众多场合的需求,但其缺陷在于属性基加密有大量的双线性映射对的计算,这样就会给用户带来极大的计算负担。云计算、云存储的迅速发展为属性基加密方案的外包解密技术带来了机遇。用户把解密时需要极大计算量的工作交给云服务器执行,得到中间密文,然后在用户端使用用户私钥和中间密文对目标密文解密,获得明文消息。使用外包解密技术可大大降低用户的负担,减少用户的计算量。文章提出一种密文策略属性基加密(ciphertext-policy ABE,CP-ABE)的外包解密方法,并用双系统加密证明技术证明其在标准模型下是完全安全的。     

基于CP-ABE的自定义读写策略的云数据共享方案

为解决现有研究中用户权限分类的云存储数据共享的研究少,且已存研究算法复杂、通信开销大、安全漏洞多等问题,提出一种去中心化的用户自定义读写权限的数据安全共享方案.本文采用密文政策的基于属性的加密算法与短群签名相结合,使数据拥有者自定义只读用户和修改用户的属性条件,并将条件绑定密文托管至云服务器中,使得符合条件的用户能够自行解密数据.实验结果表明,所提云数据共享方案保证数据读写机密性,算法简单、计算量通信量小、参数少、签名长度短并且能弥补同类方案的安全漏洞.      

属性盲化的模糊可搜索加密云存储方案

为保护基于属性的密文策略（ciphertext-policy attribute-based encryption,CP-ABE）可搜索加密云存储机制中数据使用者的属性隐私,实现云存储模糊可搜索加密,该文提出一种属性盲化的模糊可搜索加密云存储（attribute blinding fuzzy searchable encryption cloud storage,ABFSECS）方案.数据使用者的每个访问属性被随机盲化,再聚合为一个完整的盲化属性.通过关键字索引集和数据使用者生成的关键字陷门的匹配计算,实现了模糊可搜索加密云存储机制.利用云服务器的强大计算资源,引入预解密操作,减少了数据使用者的计算时间开销.安全性分析表明,ABFSECS方案具有不可伪造性,可抵抗数据使用者与云存储服务器间的共谋攻击,不会泄露数据使用者的属性隐私信息.      

一种可外包解密的高效密文策略的属性基加密方案

基于属性基的加密方案提供了一种对加密数据进行复杂访问控制的机制。但在大多数属性基加密系统中,密文长短和解密开销会随访问策略的复杂性而增加,限制了在资源有限的设备上运行程序。针对该问题,通过引入外包解密方法,构造了一个高效的、抗共谋攻击的可外包解密的密文策略的属性基加密方案,该方案在加密算法构造过程中引入线性密钥共享矩阵作为输入,并根据该矩阵选择随机指数,使得私钥随机分布,从而实现了抗共谋攻击,且方案在解密过程中引入了外包解密,只需要用户进行少量的计算便可得到密文相应的明文,从而很好解决了资源制约性问题。本文提出的安全证明是在非交互模型下、判定性平行双线性Diffie-Hellman幂元假设下进行的,且通过效率与安全性分析得出本方案拥有良好的性能。     

无线体域网中云外包可撤销的属性加密方案

无线体域网(wireless body area networks,WBANs)在远程医疗、健康监测等服务领域有着广泛的应用前景,为了减少数据访问者和数据拥有者的计算量,提供低延迟的辅助医疗服务,结合数字信封技术提出云外包可撤销的属性加密方案,该方案将解密密钥分为两部分,采用云服务器对密文部分解密的方法,使得属性撤销操作不会对数据访问者和数据拥有者产生影响,分析证明该方案充分发挥云计算的优势,高效地对数据进行加密处理,并且方案也保证了数据的机密性,并具有抗共谋攻击。     

基于CP-ABE的云存储数据访问控制方案

结合云存储的应用环境,构造了一种基于密文策略属性的加密(ciphertext policy attribute based encryption,CP-ABE)技术和收敛加密技术的混合加密数据访问控制方案.该方案包括密钥发布中心、用户和云服务器三方实体,能高效、灵活、细粒度地进行数据的访问控制,可提高云存储服务器的空间利用率,并使用签名技术支持数据源认证和数据完整性认证.理论分析与实验验证了该方案具有较高的实际应用价值.     

混合云模式下数据安全存储方案

针对混合云模式下数据安全存储与共享使用的问题,提出一种适用于混合云模式下的高效数据安全共享方案,该方案采用密文策略的属性基加密机制加密数据,通过私有云将密文数据存储在公有云上;移动用户访问云数据时,采用匿名密钥协商技术和委托加解密方法,保证用户对数据的快速访问.实验结果表明,本方案能够保证公有云上数据的安全存储,支持细粒度的访问控制,同时将大部分解密计算委托给私有云,减少移动云用户访问云数据的处理时间,使得其加解密时间为恒定值,不会随着属性的增多而线性增长.      

基于区块链的电子病历共享与可验证方案

为解决传统电子病历存储方案共享难、数据易篡改和隐私泄露问题,为此构建一种基于区块链的电子病历可搜索加密存储、高效共享与可验证方案。通过使用简洁非交互零知识证明(zero-knowledge succinct non-interactive arguments of knowledge, zk-SNARKs)构建用户身份认证系统,提高用户身份的隐私性,匿名性。通过提出基于改进Merkle树的格可搜索加密方案,实现电子病历的可搜索加密与验证方案;并在此基础上通过智能合约构造搜索方案的双重验证。通过将相应的加密数据外包到星际文件系统(interplanetary file system, IPFS)以降低存储成本。通过实验对加密算法性能、智能合约时间和花费开销、链下存储性能进行仿真测试。验证了该系统能够满足电子病历系统应用需求,并提高了数据完整性、搜索效率性和身份保密性。     

基于谓词的Paillier型密文解密外包方案

近年来,随着云技术的快速发展,越来越多的用户开始将复杂的计算资源外包给"云端",然而,云环境下如何对数据进行访问控制却成为制约其发展的瓶颈.基于谓词的加密(predicate encryption,PE)方法计算更加复杂和灵活,从而能实现对密文解密权限的访问控制,因而备受关注.在Paillier方案基础上,借鉴Green等人提出的密文解密外包思想,构造了基于谓词的Paillier型密文解密外包方案.同时,解密过程被部分外包到"云端"进行,减小了用户开销.该方案支持同态操作,并且在子群判定问题困难假设下达到IND-AH-CPA(INDistinguishability-attribute hiding-chosen plain attack)安全.     

一种高效的具有属性撤销的访问控制协议

采用外包计算技术构造一种基于密文策略的属性加密数据访问控制方法,具有高效的属性撤销功能,可以减少用户的计算量和通信量.其最大特点是将解密秘钥分为两部分,一部分发送给云服务器,另一部分发送给用户,使得云服务器可以帮助用户解密密文,减少了用户计算量,也减少了用户和云服务器的通信量.     

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.