Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

基于局部结构交互的RNA假结预测

基于RNA局部结构间的交互作用,提出一种含假结的RNA二级结构预测新方法LIFold。对给定的RNA序列,首先通过能量计算得到不含假结的能量最优结构,然后应用局部结构交互配对生成假结茎区,在已得到的最优结构基础上构建含假结的能量计算模型,最后通过优化算法得到含假结的RNA二级结构。应用该方法基于HotKnots测试数据的敏感性和阳性预测值(PPV)分别达到84%和80%,基于PseudoBase数据库测试数据的敏感性和阳性预测值分别达到78%和73%,与HotKnots、ILM、PknotsRG、IPknot及FlexStem等知名软件相比较,准确率均有所提高。     

基于子载波选择配对及功率优化分配的多跳中继系统研究

为了提升OFDM协作通信系统的网络覆盖率及网络容量,提出了一种基于子载波选择配对及功率优化分配的多跳中继OFDM系统优化算法。首先,通过在OFDM的系统模型上进行中继配对和非中继配对的性能分析,将子载波选择配对转换为一个整数规划问题,并采用基于匈牙利算法的规划方法进行配对矩阵的计算。接着,根据OFDM系统的功率分配问题,通过KKT条件对中继功率及电源功率进行优化,从而实现中继系统的功率优化分配 。最终的仿真结果表明,与统计质量QoS保证的资源分配方案以及OFDM中继系统异构服务的资源分配算法相比,所提出的方法在提高网络覆盖率和容量上均表现出更好的效果。     

几个签密方案的密码学分析与改进

对六个签密方案进行了安全性分析,指出它们都存在保密性的安全问题,其中两个方案还存在不可伪造性的安全问题。对每一个安全问题都给出了具体的攻击方法,并使用加密部分绑定发送者、签名部分绑定接收者、验证等式不含明文信息和部分私钥生成时绑定公钥的方法对每一个方案给出了改进措施。对改进后的方案给出了随机预言机模型下的安全性证明。安全分析表明,改进方案是安全的。最后提出了设计签密方案时必须注意的几个问题。     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

时间分层的基于身份密码技术的算法和系统

基于椭圆曲线和Weil配对数学理论发明了具体可实施的基于身份密码的技术方案,但其一大缺陷就是密钥更新问题.介绍了一种时间分层的基于身份密码技术的算法和系统,其采用多个主密钥分量,逐级更新用户私钥,与PKG对接的顶级中间设备的帮助密钥更新时间相对较长,而用户终端保存的用户私钥更新时间相对较短,这样既满足了用户私钥更新频度的需要,又不引起系统频繁更新用户私钥所造成的沉重负荷.     

Conference key agreement protocol with non-interactive fault-tolerance over broadcast network

Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373–379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.

Spin dynamics and implications for superconductivity: some problems with thed-wave scenario

We review the spin dynamics of the normal state of the cuprates with special emphasis on neutron data in both the YBa₂Cu₃O_7– and La_2–x Sr _x CuO₄ systems. When realistic models of the Fermi surface shapes are incorporated, along with a moderate degree of spin fluctuations, we find good semiquantitative agreement with experiment for both cuprates. Building on the success of this Fermi-liquid-based scheme, we explore the implications ford-wave pairing from a number of vantage points. We conclude that our present experimental and theoretical understanding is inadequate to confirm or refute thed-wave scenario.     

A realistic theory for the “normal state” and pairing mechanism in the high-tc cuprates

The electronic structure of the high-T _c cuprates is studied on the basis of large-U and smallU orbitals. Two types of charge carriers are predicted: (i) spinless polarons with a very small bandwidth; (ii) anomalous carriers of both charge and spin. The results are consistent with many anomalous properties of the cuprates. The spinless polarons undergo a CDW transition, and transitions between pair states of the two types of carriers provide the pairing mechanism.The author acknowledges stimulating discussions with participants of the workshop. Some numerical work was performed at the Florida State University Computing Center.     

A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Based on the computational Diffie-Hellman problem, this paper proposes an identity-based authenticated key agreement protocol which removes bilinear pairings. Compared with previous protocols, the new protocol minimizes message exchange time with no extra cost. The protocol provides strong security guarantees including key compromise impersonation resilience, perfect forward secrecy, and master key forward secrecy. A security proof with the modular approach in the modified Bellare-Rogaway model is also provided.