一个基于差积的匿名会议密钥分配方案

本文基于椭圆曲线上向量差积的性质,提出了一个基于差积的会议密钥分配方案.在此方案中,会议主席利用三个多项式来隐藏真正的会议密钥,使得该方案具有较强安全性和匿名性.     

Quantum Secret Sharing Using GHZ-Like State

This paper presents a simple and novel quantum secret sharing scheme using GHZ-like state. The characteristics of the GHZ-like state are used to develop the quantum secret sharing scheme. In contrast with the other GHZ-based QSS protocols with the same assumptions, the proposed protocol provides the best quantum bit efficiency.     

突变理论在浅埋煤层组合关键层中的应用

应用突变理论的方法,对组合关键层的力学模型进行了分析,导出了系统的总势能函数表达式, 并建立了尖角型突变模型.定量地分析了顶板的台阶下沉量以及组合关键层失稳的充要条件,得出的结论有实际意义.     

Key Player Policies When Contextual Effects Matter

We consider a model where the criminal decision of each individual is affected by not only her own characteristics, but also by the characteristics of her friends (contextual effects). We determine who the key player is, i.e., the criminal who once removed generates the highest reduction in total crime in the network. We propose a new measure, the contextual intercentrality measure, that generalizes the one proposed by Ballester, Calvó-Armengol, and Zenou (2006 Ballester , C. , Calvó-Armengol , A. , &; Zenou , Y. ( 2006 ). Who's who in networks. Wanted: The key player . Econometrica , 74 , 1403 – 1417 .[Crossref], [Web of Science ®] , [Google Scholar]) by taking into account the change in contextual effects following the removal of the key player. We also provide an example showing that the key player can be different whether contextual effects are taken into account or not. This means that the planner may target the wrong person if it ignores the effect of the “context” when removing a criminal from a network.     

矿山环境恢复治理保证金制度中公众参与的博弈分析:基于合谋与防范的视角

矿产资源开采行为容易造成矿区生态环境的恶化,国内外目前主要采取矿山环境恢复治理保证金制度以强制矿山企业对矿区开采后生态环境进行一系列修复。在缺少公众监督的情况下,保证金制度容易出现道德风险,即矿山企业和地方政府监管者的合谋行为。目前,我国各地推行的矿山环境恢复治理保证金制度均没有让公众参与进来,这就需要对这一制度缺陷进行弥补与修正。本文基于公众参与理论和博弈论构建了公众、矿山企业和政府监管者三方博弈模型,并利用对其混合纳什均衡解的分析,得出结论为:通过提高公众监督概率和公众监督有效概率、降低公众监督成本来防范和控制合谋行为。最后,根据以上分析提出了相关的政策建议。     

力学处2014年度重点项目结题审查情况简要介绍

对2014 年度国家自然科学基金委员会数理科学部力学科学处结题的12 项重点项目结题审查情况进行了简要介绍. 给出了12 项2014 年度结题重点项目清单以及经评审专家组讨论形成的结题审查评价意见.      

Discrete Logarithms: The Past and the Future

The first practical public key cryptosystem to be published, the Diffie–Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the presumed security of a variety of other public key schemes. While there have been substantial advances in discrete log algorithms in the last two decades, in general the discrete log still appears to be hard, especially for some groups, such as those from elliptic curves. Unfortunately no proofs of hardness are available in this area, so it is necessary to rely on experience and intuition in judging what parameters to use for cryptosystems. This paper presents a brief survey of the current state of the art in discrete logs.     

Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98

In 1 Matsumoto and Imai developed a new public key scheme, called C*, for enciphering or signing. (This scheme is completely different from and should not be mistaken with another scheme of Matsumoto and Imai developed in 1983 in 7 and broken in 1984 in 8). No attacks have been published as yet for this scheme. However, in this paper, we will see that—for almost all keys—almost every cleartext can be found from its ciphertext after only approximately m ² n ⁴ log n computations, where m is the degree of the chosen field K and mn is the number of bits of text. Moreover, for absolutely all keys that give a practical size for the messages, it will be possible to find almost all cleartexts from the corresponding ciphertexts after a feasible computation. Thus the algorithm of 1 is insecure.     

A New Approach for Visual Cryptography

Visual cryptography is to encrypt a secret image into some shares (transparencies) such that any qualified subset of the shares can recover the secret visually. The conventional definition requires that the revealed secret images are always darker than the backgrounds. We observed that this is not necessary, in particular, for the textual images.In this paper, we proposed an improved definition for visual cryptography based on our observation, in which the revealed images may be darker or lighter than the backgrounds. We studied properties and obtained bounds for visual cryptography schemes based on the new definition. We proposed methods to construct visual cryptography schemes based on the new definition. The experiments showed that visual cryptography schemes based on our definition indeed have better pixel expansion in average.     

An algorithm for DLP on anomalous elliptic curves over Fp

This paper improves the method of discrete logarithm on anomalous elliptic curves, and establishes an isomorphism from E(Fp) to Fp which can be more easily implemented. Fruthermore, we give an optimized algorithm for discrete logarithm on anomalous elliptic curves E(Fp).