结合公钥加密和关键字可搜索加密的加密方案

带关键字搜索的公钥加密(PEKS)是一种有用的加密原语，它允许用户将在加密数据上搜索的功能委托给不可信的第三方服务器，而不影响原始数据的安全性和隐私性。但是，由于缺乏对于数据的加密以及解密能力，PEKS方案不能单独进行使用，必须与标准的公钥加密方案(PKE)相结合。因此，Baek等人在2006年引入了一种新的加密原语，称为结合PKE和PEKS的加密方案(PKE+PEKS)，它同时提供了PKE和PEKS的功能。目前，已有文献提出了几种PKE+PEKS方案。然而，他们都没有考虑关键字猜测攻击的问题。本文提出一个新的高效且能够抵抗关键字猜测攻击的PKE+PEKS方案，与已有方案相比，该方案在性能上有很大的提升，并且在生成关键字和数据密文时，不需要使用双线性对，极大地降低了计算和存储成本。安全性分析表明，本文中所提出的方案能够满足密文隐私安全性、陷门不可区分性和抗关键字猜测攻击的安全性。效率分析表明，本分提出的方案更加高效。     

Key-dependent side-channel cube attack on CRAFT

CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time.     

A New NTRU-Type Public-Key Cryptosystem over the Binary Field

As the development of cloud computing and the convenience of wireless sensor netowrks, smart devices are widely used in daily life, but the security issues of the smart devices have not been well resolved. In this paper, we present a new NTRU-type public-key cryptosystem over the binary field. Specifically, the security of our scheme relies on the computational intractability of an unbalanced sparse polynomial ratio problem (DUSPR). Through theoretical analysis, we prove the correctness of our proposed cryptosystem. Furthermore, we implement our scheme using the NTL library, and conduct a group of experiments to evaluate the capabilities and consuming time of encryption and decryption. Our experiments result demonstrates that the NTRU-type public-key cryptosystem over the binary field is relatively practical and effective.     

Inducing sustained oscillations in feedback-linearizable single-input nonlinear systems

The present paper concerns the induction of stable sustained oscillation in feedback-linearizable single-input affine nonlinear dynamical systems via continuous-time state feedback control. The proposed application-oriented control approach is based on the conception of a state feedback controller that ensures the tracking of a limit cycle characterized in terms of the feedback-linearized system. Boundedness and convergence of the closed-loop trajectories are established following the Lyapunov theoretical framework and applying LaSalle׳s stability principle. The proposed approach is demonstrated with computer-simulated control experiments, showing that it ensures the convergence of the state trajectories of the controlled system to a designed limit cycle and that the methodology can, in principle, be applied to any single input feedback linearizable system.     

一种军棋机器博弈的多棋子协同博弈方法

针对在军棋博弈不完全信息对弈中，面对棋子不同价值、不同位置、不同搭配所产生的不同棋力，传统的单子意图搜索算法，不能满足棋子之间的协同性与沟通性，同时也缺乏对敌方的引诱与欺骗等高级对抗能力。本文提出一种结合UCT搜索策略的高价值棋子博弈方法，实现高价值棋子协同博弈的策略。实战经验表明:高价值多棋子军棋协同博弈策略优于单棋子军棋博弈策略。     

Thaumasite––direct, woodfordite and other possible formation routes

Two main formation routes for thaumasite exist below 15 °C. One is the direct route from C–S–H reacting with appropriate carbonate, sulfate, Ca²⁺ ions and excess water. The other route is the woodfordite route from ettringite reacting with C–S–H, carbonate, Ca²⁺ ions and excess water, in which thaumasite arises through the intermediate formation of the solid solution woodfordite. The woodfordite route for thaumasite formation appears to be relatively quicker (although still slow) than the direct route, presumably because with the former the ettringite already has the octahedral [M(OH)₆] units that can facilitate the critical change from [Al(OH)₆]³⁻ to [Si(OH)₆]²⁻ groupings. Both routes are mutually dependent on each other. The presence of magnesium salts can modify the path to thaumasite formation. High pressure might be able to stabilise [Si(OH)₆]²⁻ groupings and allow thaumasite to become formed above 15 °C. This possibility is discussed.     

连续波半主动雷达制导空空导弹截获跟踪距离计算

分析了连续波半主动雷达制导导弹导引头工作电磁环境和对武器系统攻击区的影响，建立了热噪声和杂波干扰环境下导引头截获距离方程，分析推导了直波泄漏干扰，地杂波干扰的计算公式，并在此基础上给出了导弹允许攻击区计算公式。     

数字签名技术在解决密钥泄露方面的发展

密钥泄露对数字签名的危害越来越成为人们关注的焦点，该问题很难找到完全彻底的解决办法，只能尽可能减少其危害。对此专家和学者提出了很多新的数字签名机制，这里详细介绍了其中的一些，并指出它们各自的优缺点。针对在SiBIR数字签名机制中由于网络拥塞或攻击者的恶意拦截使得更新信息丢失造成signer和home base不能保持同步的问题，我们提出了超时同步机制。     

3G系统的安全策略分析

介绍了当前3G系统面临的各种威胁和针对3G的攻击方法,如对非授权数据的非法获取、对数据完整性的攻击和对业务的非法访问攻击等.分析了3G系统的安全体系结构和安全特性的优缺点.     

Adaptive solutions to the mutual exclusion problem

Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time. Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms. Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094