Cited 0 time in
Strong unforgeability in group signature schemes
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, Haeryong | - |
| dc.contributor.author | Lim, Seongan | - |
| dc.contributor.author | Yie, Ikkwon | - |
| dc.contributor.author | Kim, Kitae | - |
| dc.contributor.author | Song, Junghwan | - |
| dc.date.accessioned | 2022-12-20T21:59:50Z | - |
| dc.date.available | 2022-12-20T21:59:50Z | - |
| dc.date.issued | 2009-06 | - |
| dc.identifier.issn | 0920-5489 | - |
| dc.identifier.issn | 1872-7018 | - |
| dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/176726 | - |
| dc.description.abstract | A signature scheme is strongly unforgeable if no adversary can produce a new valid signature sigma on a message M even after seeing some signatures on M. We define strong unforgeability of group signature schemes and explain why the strong unforgeability of a group signature scheme is necessary. This relatively new security concept was not considered when Bellare-Micciancio-Warinschi established their security model, what we call the BMW security model, of group signature schemes. We show that a scheme proposed at Eurocrypt'06 that was proven secure in the BMW security model is not strongly unforgeable. We also present a method to convert this scheme into a strongly unforgeable group signature scheme preserving the security in the BMW security model. | - |
| dc.format.extent | 7 | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | Elsevier BV | - |
| dc.title | Strong unforgeability in group signature schemes | - |
| dc.type | Article | - |
| dc.publisher.location | 네델란드 | - |
| dc.identifier.doi | 10.1016/j.csi.2008.09.019 | - |
| dc.identifier.scopusid | 2-s2.0-64249121138 | - |
| dc.identifier.wosid | 000266057300029 | - |
| dc.identifier.bibliographicCitation | Computer Standards and Interfaces, v.31, no.4, pp 856 - 862 | - |
| dc.citation.title | Computer Standards and Interfaces | - |
| dc.citation.volume | 31 | - |
| dc.citation.number | 4 | - |
| dc.citation.startPage | 856 | - |
| dc.citation.endPage | 862 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | N | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Computer Science | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
| dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
| dc.subject.keywordPlus | RANDOM ORACLES | - |
| dc.subject.keywordPlus | GENERAL ASSUMPTIONS | - |
| dc.subject.keywordPlus | BILINEAR PAIRINGS | - |
| dc.subject.keywordPlus | EFFICIENT | - |
| dc.subject.keywordPlus | CRYPTANALYSIS | - |
| dc.subject.keywordPlus | ENCRYPTION | - |
| dc.subject.keywordAuthor | Group signature | - |
| dc.subject.keywordAuthor | Strong unforgeability | - |
| dc.subject.keywordAuthor | ID-based cryptosystem | - |
| dc.subject.keywordAuthor | Cryptography | - |
| dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0920548908001414?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1366
COPYRIGHT © 2024 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
