强不可伪造的基于id的签名，没有随机的预言

Q2 Mathematics

International Journal of Applied Cryptography Pub Date : 2009-04-02 DOI:10.1504/IJACT.2010.033797

Chifumi Sato, T. Okamoto, E. Okamoto

{"title":"强不可伪造的基于id的签名，没有随机的预言","authors":"Chifumi Sato, T. Okamoto, E. Okamoto","doi":"10.1504/IJACT.2010.033797","DOIUrl":null,"url":null,"abstract":"In this paper, we construct a strongly unforgeable ID-based signature scheme in the standard model (or without random oracles), with five signature parameters. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie Hellman (DH) problem or the discrete logarithm problem. The security of the scheme relies on the difficulty solving three problems related to the DH problem and a one-way isomorphism.","PeriodicalId":53552,"journal":{"name":"International Journal of Applied Cryptography","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Strongly unforgeable ID-based signatures without random oracles\",\"authors\":\"Chifumi Sato, T. Okamoto, E. Okamoto\",\"doi\":\"10.1504/IJACT.2010.033797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we construct a strongly unforgeable ID-based signature scheme in the standard model (or without random oracles), with five signature parameters. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie Hellman (DH) problem or the discrete logarithm problem. The security of the scheme relies on the difficulty solving three problems related to the DH problem and a one-way isomorphism.\",\"PeriodicalId\":53552,\"journal\":{\"name\":\"International Journal of Applied Cryptography\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Applied Cryptography\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJACT.2010.033797\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Applied Cryptography","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJACT.2010.033797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 19

摘要

本文在标准模型(或无随机预言器)下构造了一个具有5个签名参数的强不可伪造的基于id的签名方案。该方案的签名大小比基于Diffie Hellman (DH)问题或离散对数问题的其他方案的签名大小小。该方案的安全性依赖于与DH问题相关的三个问题的难解性和单向同构性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Strongly unforgeable ID-based signatures without random oracles

In this paper, we construct a strongly unforgeable ID-based signature scheme in the standard model (or without random oracles), with five signature parameters. The signature size of our scheme is smaller than that of other schemes based on varieties of the Diffie Hellman (DH) problem or the discrete logarithm problem. The security of the scheme relies on the difficulty solving three problems related to the DH problem and a one-way isomorphism.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Journal of Applied Cryptography Mathematics-Applied Mathematics

CiteScore

2.00

自引率

0.00%

发文量