ID-based cryptographic schemes using a non-interactive public-key distribution system

Yuh-Min Tseng, J. Jan
{"title":"ID-based cryptographic schemes using a non-interactive public-key distribution system","authors":"Yuh-Min Tseng, J. Jan","doi":"10.1109/CSAC.1998.738643","DOIUrl":null,"url":null,"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.","PeriodicalId":426526,"journal":{"name":"Proceedings 14th Annual Computer Security Applications Conference (Cat. No.98EX217)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 14th Annual Computer Security Applications Conference (Cat. No.98EX217)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAC.1998.738643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

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.
使用非交互式公钥分发系统的基于id的加密方案
Shamir(1984)提出了基于身份信息的密码系统思想,并提出了基于身份的签名方案。他还提出了一个开放的问题,即找到一个基于id的公钥密码系统或公钥分发系统。在过去,已经提出了许多基于id的公钥分发系统。然而,在Shamir的意义上,这些都不是基于id的系统,因为每个用户的公钥不仅是实体的身份,而且是一些额外的随机数。Maurer和Yacobi(1991)开发了一个非交互式的基于id的公钥分发系统。在他们的方案中,除了实体的身份之外,没有公钥、公钥证书或其他需要交换的信息。但是,他们没有构建基于id的签名方案、用户识别方案或会议密钥分发系统。在本文中,我们对Maurer和Yacobi的方案进行了稍微的改进,即可信权威只在原始方案上增加了一个公共值。在此基础上,我们不仅提供了一个非交互式公钥分发系统,而且还提供了一个定向签名方案、一个用户识别方案和一个会议密钥分发系统。因此,对于各种类型的应用程序,非交互式公钥系统将更加实用和完整。所提方案的安全性基于单向哈希函数假设和复合模的离散对数计算难度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信