Presentation 2008-05-16
Strongly Unforgeable ID-based Signatures Without Random Oracles
Chifumi SATO, Takeshi OKAMOTO, Eiji OKAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) There is an open problem to construct ID-based signature schemes which satisfy strongly EUF-ID-CMA, without random oracles. It is known that strongly EUF-ID-CMA is a concept of the strongest security in ID-based signatures. In this paper, we propose a solution to the open problem, that is an ID-based signature scheme, which satisfies strongly EUF-ID-CMA, without random oracles for the first time. Security of the scheme is based on the difficulty to solve three problems related to the Diffie-Hellman problem and a one-way isomorphism.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Digital signatures / ID-based signatures / Strongly EUF-ID-CMA / Standard models
Paper # ISEC2008-15
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/5/9(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Strongly Unforgeable ID-based Signatures Without Random Oracles
Sub Title (in English)
Keyword(1) Digital signatures
Keyword(2) ID-based signatures
Keyword(3) Strongly EUF-ID-CMA
Keyword(4) Standard models
1st Author's Name Chifumi SATO
1st Author's Affiliation C4 Technology, Inc.()
2nd Author's Name Takeshi OKAMOTO
2nd Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba
3rd Author's Name Eiji OKAMOTO
3rd Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba
Date 2008-05-16
Paper # ISEC2008-15
Volume (vol) vol.108
Number (no) 38
Page pp.pp.-
#Pages 8
Date of Issue