A Mixed Mechanism Mutual Authentication Protocol for TETRA

1 Introduction TETRAsystemis a unified standard-based open sys-tem designed by European Telecommunications Stan-dards Institute(ETSI) in association with user organiza-tions, manufacturers ,testing and government authori-ties to satisfythe mobile communicationrequirements ofthe specialized institutions in all the European coun-tries .[1 ~4]A TETRAsystem supports many functionsonthe security field, which include authentication,airinterface encryption and end-to-end encryption.The au-then…     

一个安全的基于身份的强指定验证者签名方案

在一般的数字签名中,拥有签名者公钥的任何人都可以验证该签名的有效性;而强指定验证者签名是由签名者指定一个验证者,在签名验证阶段,只有这个指定验证者可以验证该签名的有效性,其他人都不能验证该签名。这是因为在签名的验证阶段必须用到指定验证者的私钥。基于这个性质,强指定验证者签名被广泛应用于电子商务、网上投标、电子选举中。基于双线性对提出了一个新的基于身份的强指定验证者签名方案,并基于GBDH困难问题假设,采用密码学上安全性分析的方法,证明了该方案在适应性选择消息和选择身份攻击下是不可伪造的。最后,分析了方案的计算成本,结果表明该方案具有较高的效率。     

基于身份加密的装备密钥分布式生成算法

为解决身份加密体制中单一密钥生成中心易遭受攻击的问题,借鉴网络中心战“去中心化”的思想,针对Lewko-Waters身份加密协议,提出了一种分布式密钥生成算法。在算法中,主密钥由密钥生成中心和密钥隐私中心共同掌握,用户密钥在密钥生成中心监管下由分布于网络中的各密钥隐私中心共同生成,有利于增强Lewko-Waters协议密钥管理体系的抗毁性、鲁棒性。最后,在标准模型中证明了该方案在选择明文攻击下的密文不可区分性,并进行了算法性能比较分析。     

基于身份的跨信任域签密方案

实际网络环境尤其是未来异构网络融合环境中,各个信任域大多都是独立的自治域,使用不同的系统参数.为此提出了一种新的基于身份的跨信任域签密方案,该方案对PKG系统参数不作限制,各PKG可以使用完全不同的系统公开参数、不同的主密钥和公钥.并且在该签密协议的基础上给出了会话密钥的生成方法.在随机预言模型中给出了安全性证明,在BDH问题是困难的的假设下该协议是安全的,其满足机密性、不可伪造性、不可否认性和公开验证性.在与其他跨信任域签密方案计算开销相当的情况下,该方案不仅实现了跨信任域签密,而且对各PKG参数不作限制.     

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.     

ID-based threshold decryption secure against adaptive chosen-ciphertext attack

This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems.     

Identity-based trapdoor mercurial commitments and applications

In this paper, we first introduce the notion of identity-based trapdoor mercurial commitment which enjoys the advantages of both the identity-based trapdoor commitment and trapdoor mercurial commitment, while using the idea of “Customized Identity”. Inherently, an identity-based trapdoor mercurial commitment is an underlying building block for constructing identity-based (non-interactive) zero-knowledge sets. That is, a prover can commit to a set S in a way that reveals nothing about S and prove to a verifier, in zero-knowledge, statements of the form x∈S and x∉S. Besides, although the (non-interactive) proof is publicly verifiable, it is also bound to the identity of the prover in a way which is recognizable to any verifier.     

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold

Key-insulated encryption schemes use a combination of key splitting and key evolution to protect against key exposure. Existing schemes, however scale poorly, having cost proportional to the number t of time periods that may be compromised by the adversary, and thus are practical only for small values of t. Yet in practice t might be large. This paper presents a strongly key-insulated encryption scheme with optimal threshold. In our scheme, t need not be known in advance and can be as large as one less than the total number of periods, yet the cost of the scheme is not impacted. This brings key-insulated encryption closer to practice. Our scheme is based on the Boneh-Franklin identity-based encryption (IBE) scheme [9], and exploits algebraic properties of the latter. Another contribution of this paper is to show that (not strongly) key-insulated encryption with optimal threshold and allowing random-access key updates (which our scheme and all others known allow) is equivalent to a restricted form of IBE. This means that the connection between key-insulated encryption and IBE is not accidental. Supported in part by NSF grants CCR-0098123, ANR-0129617 and CCR-0208842, and by an IBM Faculty Partnership Development Award. Supported in part by an NSF graduate fellowship.     

A more efficient and secure ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem

Recently, Yang and Chang proposed an identity-based remote login scheme using elliptic curve cryptography for the users of mobile devices. We have analyzed the security aspects of the Yang and Chang's scheme and identified some security flaws. Also two improvements of the Yang and Chang's scheme have been proposed recently, however, it has been found that the schemes have similar security flaws as in the Yang and Chang's scheme. In order to remove the security pitfalls of the Yang and Chang and the subsequent schemes, we proposed an enhanced remote user mutual authentication scheme that uses elliptic curve cryptography and identity-based cryptosystem with three-way challenge-response handshake technique. It supports flawless mutual authentication of participants, agreement of session key and the leaked key revocation capability. In addition, the proposed scheme possesses low power consumption, low computation cost and better security attributes. As a result, the proposed scheme seems to be more practical and suitable for mobile users for secure Internet banking, online shopping, online voting, etc.