适于云计算的并行RAM程序的函数加密方案

针对云计算环境下的现有函数加密方案难以有效利用并行计算能力进行大数据运算的问题,提出了一种并行随机存取计算模型程序的函数加密方案,允许数据拥有者一次性传输加密数据,获得授权的云服务提供者利用其并行计算集群有效计算大量加密数据。该方案将混淆并行随机存取计算模型中的密码原件作为黑盒使用,将并行随机存取计算模型程序硬编码于电路中。并采用现有的基于电路模型的函数加密方案对该电路生成密钥,从而转化为并行随机存取计算模型程序的函数加密方案。通过理论分析该方案的时间效率相对原有并行算法仅有多项式时间的额外负载,并给出了该函数加密方案的不可区分性安全性证明。     

对称分析在物理学中的应用

本文用对称分析方法,分析计算了力学、电学、固体物理学、原子和分子光谱学中的转动惯量、极化率、选择定则等.结果表明,用此方法研究有关参量,其运算过程可大大简化.     

Careful with those scissors,Eugene! Against the observational indistinguishability of spacetimes

We discuss Manchak (2009a)'s result that there are locally (but not globally) isometric universes observationally indistinguishable from our own. This theorem makes the epistemic predicament of modern cosmology particularly problematic and the prospects of ever gaining knowledge of the global structure of the universe rather unlikely in the context of general relativity. We argue however that this conclusion is too quick; indeed, Manchak's theorem deploys spacetimes which are not physically reasonable, since they have features which are not the product of any physical process. This ultimately rests on the fact that local isometry between two spacetimes is not sufficient to guarantee that they are both physically reasonable. We propose an additional condition to properly define when a spacetime is physically reasonable, and we show that Manchak's spacetimes do not satisfy this further demand.     

浅海温度,盐度观测资料的误差分析

温度、盐度观测资料的误差分析结果表明：浅海区温、盐的观测误差冬季较小，分别约为０．４℃和０．２；夏季较大，在跃层附近层次由定深偏差所引起的温、盐观测误差分量分别可达１．３２℃和０．１１．温、盐的资料误差更大，夏季跃层处温、盐的日替代资料误差分别可达２．６２℃和０．１７．作者还就造成观测误差、资料误差的原因作了分析，对合理使用历史调查资料提出意见．     

常规隐信道下可证明安全隐写术的有效构造方法

隐写术是在看起来无害媒体中隐藏信息的科学.文中为了解决在常规隐信道下可证明安全隐写术的有效构造问题,在不依赖于任何采样假设的前提下,提供了一种基于计算不可区分的安全隐写术构造.文中结果表明,隐信道采样器中影射函数的不可区分性是安全隐写系统抵抗自适应选择隐文攻击的必要条件.在此基础上,完整地证明了l(-1+5-2)—安全隐写系统能在-1伪随机函数和-2无偏采样函数下有效地被构造,其中,-1和-2是任意两个可忽略错误,l是多项式的隐文长度.更为重要的,文中的研究不依赖于密码系统的密文伪随机性假设和完美采样假设,因此,我们的结果对于安全隐写系统的构造和隐写分析都具有现实意义.     

Reduction zero-knowledge

The nature of zero-knowledge is re-examined and the evidence for the following belief is shown:the classic simulation based definitions of zero-knowledge(simulation zero-knowledge)may be somewhat too strong to include some "nice" protocols in which the malicious verifier seems to learn nothing but we do not know how to construct a zero-knowledge simulator for it.To overcome this problem a new relaxation of zero-knowledge,reduction zero-knowledge,is introduced.It is shown that reduction zero-knowledge just lies between simulation zero-knowledge and witness indistinguishability.Under the assumption of existence of one-way permutations a 4-round public-coin reduction zero-knowledge proof system for NP is presented and in practice this protocol works in 3 rounds since the first verifier's message can be fixed once and for all.