Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation

Maharage Nisansala Sevwandi Perera; Takeshi Koshiba

doi:10.1007/978-3-319-99807-7_14

Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation

Maharage Nisansala Sevwandi Perera, Takeshi Koshiba

School of Education

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

9 Citations (Scopus)

Abstract

This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suitable revocation approach for any group since when a member is revoked VLR requires to update only verifiers. However, presenting a fully dynamic and fully secured lattice-based group signature scheme with verifier-local revocation is a significant challenge. Thus, we suggest a new security notion to prove the security of VLR schemes with member registration. As a result, we present a dynamical-almost-fully secured fully dynamic group signature scheme from lattices with VLR.

Original language	English
Title of host publication	Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings
Editors	Hiroaki Kikuchi, Chunhua Su
Publisher	Springer Verlag
Pages	229-247
Number of pages	19
ISBN (Print)	9783319998060
DOIs	https://doi.org/10.1007/978-3-319-99807-7_14
Publication status	Published - 2018
Event	14th International Conference on Information Security Practice and Experience, ISPEC 2018 - Tokyo, Japan Duration: 2018 Sep 25 → 2018 Sep 27

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11125 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	14th International Conference on Information Security Practice and Experience, ISPEC 2018
Country	Japan
City	Tokyo
Period	18/9/25 → 18/9/27

Keywords

Almost-full anonymity
Dynamical-almost-full anonymity
Lattice-based group signatures
Member registration
Verifier-local revocation

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-99807-7_14

Fingerprint Dive into the research topics of 'Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation'. Together they form a unique fingerprint.

Cite this

Perera, M. N. S., & Koshiba, T. (2018). Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. In H. Kikuchi, & C. Su (Eds.), Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings (pp. 229-247). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11125 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-99807-7_14

Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. / Perera, Maharage Nisansala Sevwandi; Koshiba, Takeshi.

Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. ed. / Hiroaki Kikuchi; Chunhua Su. Springer Verlag, 2018. p. 229-247 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11125 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Perera, MNS & Koshiba, T 2018, Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. in H Kikuchi & C Su (eds), Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11125 LNCS, Springer Verlag, pp. 229-247, 14th International Conference on Information Security Practice and Experience, ISPEC 2018, Tokyo, Japan, 18/9/25. https://doi.org/10.1007/978-3-319-99807-7_14

Perera MNS, Koshiba T. Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. In Kikuchi H, Su C, editors, Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. Springer Verlag. 2018. p. 229-247. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-99807-7_14

Perera, Maharage Nisansala Sevwandi ; Koshiba, Takeshi. / Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation. Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings. editor / Hiroaki Kikuchi ; Chunhua Su. Springer Verlag, 2018. pp. 229-247 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{1f687570d926428085dd2b30076088b9,

title = "Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation",

abstract = "This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suitable revocation approach for any group since when a member is revoked VLR requires to update only verifiers. However, presenting a fully dynamic and fully secured lattice-based group signature scheme with verifier-local revocation is a significant challenge. Thus, we suggest a new security notion to prove the security of VLR schemes with member registration. As a result, we present a dynamical-almost-fully secured fully dynamic group signature scheme from lattices with VLR.",

keywords = "Almost-full anonymity, Dynamical-almost-full anonymity, Lattice-based group signatures, Member registration, Verifier-local revocation",

author = "Perera, {Maharage Nisansala Sevwandi} and Takeshi Koshiba",

note = "Funding Information: Acknowledgments. This work is supported in part by JSPS Grant-in-Aids for Scientific Research (A) JP16H01705 and for Scientific Research (B) JP17H01695. Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 14th International Conference on Information Security Practice and Experience, ISPEC 2018 ; Conference date: 25-09-2018 Through 27-09-2018",

year = "2018",

doi = "10.1007/978-3-319-99807-7_14",

language = "English",

isbn = "9783319998060",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "229--247",

editor = "Hiroaki Kikuchi and Chunhua Su",

booktitle = "Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings",

}

TY - GEN

T1 - Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation

AU - Perera, Maharage Nisansala Sevwandi

AU - Koshiba, Takeshi

N1 - Funding Information: Acknowledgments. This work is supported in part by JSPS Grant-in-Aids for Scientific Research (A) JP16H01705 and for Scientific Research (B) JP17H01695. Publisher Copyright: © Springer Nature Switzerland AG 2018.

PY - 2018

Y1 - 2018

N2 - This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suitable revocation approach for any group since when a member is revoked VLR requires to update only verifiers. However, presenting a fully dynamic and fully secured lattice-based group signature scheme with verifier-local revocation is a significant challenge. Thus, we suggest a new security notion to prove the security of VLR schemes with member registration. As a result, we present a dynamical-almost-fully secured fully dynamic group signature scheme from lattices with VLR.

AB - This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suitable revocation approach for any group since when a member is revoked VLR requires to update only verifiers. However, presenting a fully dynamic and fully secured lattice-based group signature scheme with verifier-local revocation is a significant challenge. Thus, we suggest a new security notion to prove the security of VLR schemes with member registration. As a result, we present a dynamical-almost-fully secured fully dynamic group signature scheme from lattices with VLR.

KW - Almost-full anonymity

KW - Dynamical-almost-full anonymity

KW - Lattice-based group signatures

KW - Member registration

KW - Verifier-local revocation

UR - http://www.scopus.com/inward/record.url?scp=85054383031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054383031&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-99807-7_14

DO - 10.1007/978-3-319-99807-7_14

M3 - Conference contribution

AN - SCOPUS:85054383031

SN - 9783319998060

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 229

EP - 247

BT - Information Security Practice and Experience - 14th International Conference, ISPEC 2018, Proceedings

A2 - Kikuchi, Hiroaki

A2 - Su, Chunhua

PB - Springer Verlag

T2 - 14th International Conference on Information Security Practice and Experience, ISPEC 2018

Y2 - 25 September 2018 through 27 September 2018

ER -

Achieving almost-full security for lattice-based fully dynamic group signatures with verifier-local revocation

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this