National Changhua University of Education Institutional Repository : Item 987654321/12185

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30363986 Online Users : 462

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Science > math > Proceedings > Item 987654321/12185

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/12185

Title:	ID-Based Cryptographic Schemes Using a Non-Interactive Public-key Distribution System
Authors:	Tseng, Yuh-Min;Jan, Jinn-Ke
Contributors:	數學系
Date:	1998-12
Issue Date:	2012-07-03T03:46:18Z
Publisher:	IEEE
Abstract:	Shamir (1984) proposed the idea of a cryptographic system based on identification information and presented an identity-based signature scheme. He also presented as an open problem to find an ID-based public-key cryptosystem or public-key distribution system. In the past, many ID-based public-key distribution systems have been proposed. However, none of these is an ID-based system in Shamir's sense because each user's public key is not only the identity of the entity but also some additional random numbers. Maurer and Yacobi (1991) developed a non-interactive ID-based public-key distribution system. In their scheme, except for the identity of the entity, there were no public keys, certificates for public keys or other information required to be exchanged. However, they did not construct an ID-based signature scheme, user identification scheme or conference key distribution system. In this paper, we provide a slight improvement of the Maurer and Yacobi's scheme in that the trusted authority only adds one public value over the original scheme. Based on this, we provide not only a non-interactive public-key distribution system, but also a directed signature scheme, a user identification scheme and a conference key distribution system. Thus, a non-interactive public-key system will be more practical and complete for various kinds of applications. The security for the proposed schemes is based on the one-way hash function assumption and the difficulty of computing the discrete logarithm for a composite modulus
Relation:	The 14th Annual Computer Security Applications Conference (ACSAC 1998), Scottsdale, AZ, USA, IEEE Computer Society, : 237-243
Appears in Collections:	[math] Proceedings

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	724	View/Open

Loading...