基于盲签名的电子选举方案的改进

在分析Sensus电子投票系统的基础上,针对该系统的不足之处提出了相关的改进意见,并改进设计一个可用于互联网大规模投票的电子选举方案,该方案采用了阈值、盲签名、验证序列号等思想,使得本协议方案在保持了原有方案的各种优点的同时,增强了电子投票系统的安全性和公正性,并具有较高的效率,是一个实用的电子投票方案。     

秘密计票的多候选人电子投票方案

基于Mixnet的电子投票方案、基于同态加密的电子投票方案、基于盲签名的电子投票方案被看作是电子投票的3个主流投票方案,而同态加密方案以其高效和灵活的优点更加受到人们的青睐;多候选人电子选举方案在许多实际环境下具有重要的应用价值,但现有绝大多数方案由于技术限制只能进行"两选一"投票.该文设计了基于同态加密的一种新的多候选人电子投票方案,该方案在满足已有的电子投票方案安全要求的基础上,还能满足多个新的安全特性,尤其是秘密计票性.     

利用四粒子Cluster态实现量子电子投票

一种新的基于量子代理签名的电子投票方案被提出.方案中,量子纠缠Cluster态作为量子信道.投票人Alice、投票管理中心Bob、计票员Charlie和监票人Diana只需进行单粒子测量就可以成功实现电子投票过程.因此,该方案降低了技术难度,提高了运行效率,易于实现.使用量子密钥分配和一次一密加密算法来保证方案的无条件安全性.     

新的盲签名方案在电子投票协议中的运用

电子投票的安全性至关重要.文章创新性地将比特承诺技术运用于基于椭圆曲线的盲数字签名方案中,该方案的安全性基于椭圆曲线离散对数困难问题,有很强的安全性,且在密钥长度和执行效率上具有显著优势.并将该方案用于电子投票协议中,对协议的安全性进行了分析,有很.强的实用价值.     

新的基于身份的代理盲签名方案及其应用*

代理盲签名技术是指由原始签名者授权的代理签名者在不知晓待签名的消息的具体内容的情况下完成签名的技术。代理盲签名技术可以保证消息的匿名性,将签名权外放,减轻签名者的负担,同时能保证签名的安全性,常被用于电子商务,电子现金交易和电子投票方面。提出了一个新的基于身份的代理盲签名方案,论证了方案的正确性和安全性,证实了该方案具有较高的效率,并阐述了其在电子现金领域的应用,尤其是在使用移动终端进行购物方面的应用。     

安全电子选举研究

提出安全电子选举的三级目标和一般模型,为系统地研究电子选举提供了基础.通过对现有方案的关键技术分析,提出保护隐私的电子评审、含权选举、"m选k"等特殊投票问题,并给出采用安全多方计算技术解决这些问题的新方法.     

一个实用的电子投票协议的设计

Ｆｕｊｉｏｋａ等人在文献［１］中提出了一个可用于大规模投票的电子投票方案，但是它不允许投票者弃权，因此使该方案缺乏实用性。本文在Ｆｕｊｉｏｋａ方案的基础上改进设计了一个新的电子投票协议，它采用了阈值方案的思想，使得在合法投票者弃权时，冒名投票者只有很小的成功可能性。本协议保持了原方案的各种优点，同时又增强了系统的安全性和灵活性，是一个实用的电子投票方案。     

一个高效的基于IBE的电子投票方案

传统的电子投票方案大多是以公钥密码学为基础的,在使用过程中,需要大量的认证和交互工作,存在耗时长、效率低的缺点.本文以IBE为基础提出了一种新的电子投票方案,它去除了公钥证书的认证过程,直接以用户的身份信息作为公钥,在保证安全性的前提下,有效地提高了电子投票的效率,同时也解决了目前已有的电子投票方案中对选民身份认证困难的问题.     

基于多线性映射的无证书代理盲签名方案

代理盲签名方案不能防止密钥生成中心不诚信行为,存在伪造签名的隐患。文章在无证书公钥密码学体系下,通过多密钥中心共同生成用户密钥,运用多线性映射的技术,提出一种基于多线性映射的代理盲签名方案。该方案满足代理盲签名协议的性质,同时可以防止单个密钥生成中心伪造签名。对该方案的正确性、安全性及攻击性进行了分析,结果表明,该方案具备较高的安全性,可以广泛应用于电子现金、电子银行和电子投票系统。     

基于零知识证明的匿名投票方案

针对现有电子投票与问卷调查系统中公正性与匿名性这两项最根本需求，提出了运行于以太坊上的智能合约投票方案。方案满足可信、透明的要求，剥离了对可信第三方的依赖。随后进一步结合零知识证明与数字签名技术，实现了方案的匿名性。通过合理设计算术电路及智能合约，该方案可满足一人一票或一人多票的应用场景。通过安全性分析，本方案完全满足业界对电子投票方案公认的各种要求，加之相关代码已完整开源，为后续移植及具体应用提供了借鉴与参考。     

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).     

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.     

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.