Young-Ran Lee

EIBAS: An efficient identity-based broadcast authentication scheme in wireless sensor networks

In this paper, we propose an efficient identity-based broadcast authentication scheme, EIBAS, to achieve security requirements in wireless sensor networks. To minimize communication and computational costs, we use a pairing-optimal identity-based signature scheme with message recovery, where the original message of the signature is not required to be transmitted together with the signature, as it can be recovered according to the verification/message recovery process. The EIBAS scheme achieves a minimization of communication overhead, allowing the total energy consumption to be reduced by up to 48.5% compared to previous identity-based broadcast authentication schemes.

Multi-party authenticated key agreement protocols from multi-linear forms

Joux [Lect. Notes Comput. Sci., Vol. 1838, 2000, pp. 385-394] presented a one round protocol for tripartitie key agreement and Al-Riyami and Paterson [Report 2002/035, http://eprint.iacr.org, 2002] developed a number of tripartitie, one round, authenticated protocols related to MTI and MQV protocols. Recently, Boneh and Silverleg [Applications of Multi-linear Forms to Cryptography, Contemporary Mathematics, Vol. 324, Am. Math. Soc., Providence, RI, 2003, pp. 71-90] studied multi-linear forms, which provides a one round multi-party key agreement protocol. In this paper, we propose (n+1) types of one round authenticated multi-party key agreement protocols from multi-linear forms based on the application of MTI and MQV protocols.

Security flaws in authentication and key establishment protocols for mobile communications

Mobile electronic commerce has started recently to appear in the scene by exploiting the advantages of mobile computing and telecommunications in order to provide a large number of advanced services to mobile users. A variety of protocols suitable for applications in upcoming third-generation mobile systems such as UMTS have been proposed. In this paper, we identify security flaws with several authentication and key establishment protocols for mobile communications introducing a new kind of attack: known key-share attack. Our results show that the protocols do not provide authentication as intended.

IDENTITY BASED AUTHENTICATED KEY AGREEMENT FROM PAIRINGS

We present a new identity based authenticated key agreement protocol from pairings satisfying the required security attributes. The security of our protocol is based on the bilinear Di-e-Hellman assumption.

MULTIPARTY KEY AGREEMENT PROTOCOL BASED ON SYMMETRIC TECHNIQUES

In this paper, we propose multiparty key agreement protocols by generalizing the Bloms scheme based on 2 variable polynomials. Especially we develop three party and four party key agreement schemes with security. The advantage of the new schemes is to have small demands on storage space.

Security Pitfalls of the Certificateless Signature and Multi-Receiver Signcryption Schemes

Recently, Xiong et al. and Selvi et al. proposed a certificateless signature scheme secure in the standard model and a certificateless multi-receiver signcryption scheme secure in the random oracle model, respectively. In this paper, we show that they are insecure against malicious-butpassive KGC attacks. More specifically, the former does not achieve unforgeability and the latter does not satisfy confidentiality against type II adversaries.

On the Existence of Short Certificateless Signatures

Certificateless cryptography eliminates the need of certificates in public key cryptosystems and solves the inherent key escrow problem in identity-based cryptosystems. In this paper we discuss the existence of short certificateless signature schemes provably secure in formal security models recently established, whose resulting signature consists of a single element of the underlying group by demonstrating key replacement attacks on Du-Wens and Tso et al.s short certificateless signature schemes.