一种实现数据库同态计算的ELGamal重加密算法

数据库加密技术旨在解决数据库隐私数据泄露问题.现有的关于加密数据库的研究应用未实现或仅部分实现密文数据的同态计算功能,使得SQL查询语句在加密数据库中无法高效执行甚至失效.提出一种实现数据库同态计算的ELGamal重加密算法,该算法基于ELGamal乘法同态密码体制和数据库外层加密方式,通过将SQL查询语句中算术表达式重写为具有同态计算的重加密表达式,实现数据库基于密文进行同态计算的目标.本文提出的ELGamal重加密算法在DDH问题是困难的假设下可以抵抗选择明文攻击.     

物联网密文数据访问中可撤销的混合加密控制算法设计

针对物联网密文数据访问中用户隐私数据的安全性与数据应用操作效率要求之间的矛盾问题,提出一种新的可撤销的混合加密控制算法。介绍了对称加密算法,根据物联网密文数据访问中用户录入的指纹,通过数据特征提取过程、模板生成过程以及密钥生成过程生成可撤销密匙。介绍了公钥加密算法,给出物联网密文数据访问中公钥加密算法加密过程。对对称加密算法和公钥加密算法的性能进行对比,将二者结合在一起形成可撤销的混合加密控制算法。将椭圆加密算法和AES加密算法作为对比进行测试,结果表明所提算法效率高,对明文和密钥有较高的敏感性。     

云计算环境中基于策略的多用户全同态加密方法

全同态加密技术是解决云环境隐私安全问题的有效方法。考虑云环境下用户多样性特征,提出基于策略的多用户全同态加密方案(PB-MUFHE),该方案在全同态加密算法的基础上,通过在密文中设定适当的访问策略以及在密钥中设定属性,从而满足多用户密文的全同态运算以及多用户共享,并支持细粒度的访问控制。安全分析证明PB-MUFHE可以抵制共谋攻击,且在LWE困难度假设随机域模型下是IND-CPA安全的。性能评估表明:PB-MUFHE高效地实现密文数据的全同态运算,并能有效地支持访问控制和多用户共享。     

基于同态加密的电网隐私数据多维聚合优化算法

针对智能电网实时采集用户用电数据聚合上传通信过程中存在的计算效率低、传输不安全、泄露用户隐私等问题,提出了一种基于同态加密的电网隐私数据多维聚合优化算法。利用基于盲因子技术的Paillier加密算法对多维数据进行整体加密和签名，并向聚合器报告加密后的密文和签名;采用双线性配对方案，对签名后的数据进行签名验证分析;利用Paillier加密算法的同态特性实现数据聚合。安全性分析证明，该算法解密安全且能抵抗外部攻击和内部攻击，批量验证也具有安全性。实验结果表明，提出的算法与其他4种对比算法相比不仅计算效率较优，而且通信效率也较优;与基于身份的同态方案相比，该方案的数据签名和签名验证所花费的时间分别可平均降低约510 ms和187 ms,在数据通信过程中所花费的时间平均降低了约449 ms。     

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

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

面向多用户的多层嵌套数据库加密方案

围绕外包数据的安全性问题与用户隐私性问题,展开对加密数据库方案的研究,提出了一个面向多用户的多层嵌套数据库加密方案.该方案根据洋葱模型多层理论,采用多种不同类型的加密算法对用户的外包数据进行多层嵌套加密,实现了既保证数据机密性又满足多种不同SQL查询类型的数据库加密方案.针对用户递交包含敏感信息的查询语句在一定程度上泄露用户自身的隐私这一问题,设计了基于单服务器私有信息检索(private information retrieval,PIR)技术的用户隐私保护机制,实现了用户匿名查询.安全性分析表明,该方案满足数据机密性与用户隐私性.Sysbench基准测试实验分析表明,该方案具有良好的查询处理效率、读写吞吐量以及健壮性.     

机器学习算法在同态加密数据集上的应用

大数据时代要求数据在云端进行存储和计算,这导致敏感数据隐私泄露的问题。该文提出了一种在同态加密数据集上应用机器学习分类算法的方案:首先对明文进行预处理,保证其满足对数据进行同态加密的要求;然后在加密数据集上通过协议实现比较、排序等操作;最后获取分类结果。客户端将加密数据上传,可以保证服务器端不会获取任何敏感信息;选取同态加密算法,能够保证服务器端仍可对密文执行相关操作。实验结果表明:该方案适用于Bayes、超平面和决策树分类器,其经过修正具有良好的适用性能,准确率高。     

一种基于异或运算的混合加密算法

针对DES对称加密算法中密钥安全性保密困难且不易管理、RSA非对加密算法加密速度慢不易实现的缺点,研究信息明文与随机产生的加密密钥之间的异或运算进行信息明文加密、同时将信息明文的加密密钥按RSA算法进行加密管理以安全的传输到接收方,基于此,提出了一种基于异或运算的混合加密算法,实例验证演算表明,该算法是一种有效可行的信息安全保密方案.     

基于Hadoop的移动云存储系统研究与实现

通过对移动存储进行需求分析,提出了一种基于Hadoop的移动云存储系统.移动云存储系统通过手机客户端与服务器端和云端进行数据交换,达到访问云端数据和加密存储数据的目的.本系统实现了基于Android移动手持终端上的文件移动云存储,达到了实时查看和分享数据的目的;对用户信息采用对称加密算法,保证了文件存储过程中用户信息的安全;利用Hadoop云管理平台和AES文件加密算法,保证了在存储在云端文件的安全.     

云计算网络数据库中的加密优化模型仿真分析

针对云计算网络数据库中大数据加密耗时长的弊端,提出一种新的并行同态加密(DGHV)方案。在云计算网络环境下,采用DGHV同态加密算法进行初步数据加密,并对加密过程产生的噪声进行去噪处理。引入MapReduce计算框架的并行特性,使用分块算法对云环境中的大数据进行分割,并采用同态算法进行加密,最后将加密后的密文块汇总,得到整个数据库中的密文。实验结果表明,通过相同的实验平台对云环境网络数据进行加密优化。相比较其他方法针对大数据的处理的加速比较高,能够有效地减少加密时间。     

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.     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.