Efficient Group Signatures with Designated Traceability over Openers’ Attributes from Lattices

The group signature with designated traceability (GSdT) is a kind of group signatures (GS) which aim to restrict the opening authority of the group manager; by setting an access structure over openers' attributes at the signing, a signer is able to control openers who can open the signature.A generic construction of GSdT was given when the notion was introduced, then a pairing-based construction and a symmetric-key-based one were presented.Nonetheless, it remains open whether a post-quantum GSdT with full anonymity can be truly constructed.In this paper, we give a lattice-based GSdT scheme that has full anonymity for the first time.In our construction, the lattice-based ciphertext-policy attribute-based encryption (CP-ABE) by Tsabary and the lattice-based group signatures (GS) by Libert et al. are employed.The CP-ABE is based on the Regev public-key encryption, while the GS uses a non-interactive zero-knowledge proof to prove the correctness of the encryption in the signing process.Based on the compatibility, we combine and modify them to build up a GSdT scheme.

Authors

Institutions

Publication Details

Journal
International Journal of Networking and Computing
Published
2025-01-01
DOI
https://doi.org/10.15803/ijnc.15.2_153
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Group Signatures with Designated Traceability over Openers’ Attributes from Lattices

Hiroaki Anada, Shingo Hasegawa, Masayuki Fukumitsu
International Journal of Networking and Computing
Cryptography and Data Security
article

Efficient Group Signatures with Designated Traceability over Openers’ Attributes from Lattices

Hiroaki Anada, Shingo Hasegawa, Masayuki Fukumitsu
article en

Abstract

The group signature with designated traceability (GSdT) is a kind of group signatures (GS) which aim to restrict the opening authority of the group manager; by setting an access structure over openers' attributes at the signing, a signer is able to control openers who can open the signature.A generic construction of GSdT was given when the notion was introduced, then a pairing-based construction and a symmetric-key-based one were presented.Nonetheless, it remains open whether a post-quantum GSdT with full anonymity can be truly constructed.In this paper, we give a lattice-based GSdT scheme that has full anonymity for the first time.In our construction, the lattice-based ciphertext-policy attribute-based encryption (CP-ABE) by Tsabary and the lattice-based group signatures (GS) by Libert et al. are employed.The CP-ABE is based on the Regev public-key encryption, while the GS uses a non-interactive zero-knowledge proof to prove the correctness of the encryption in the signing process.Based on the compatibility, we combine and modify them to build up a GSdT scheme.

International Journal of Networking and ComputingVol. 15(2)
Meiji Gakuin University (JP), University of Nagasaki (JP), Fukushima University (JP)
Japan Society for the Promotion of Science
Climate action
Openalex Percentile: Top 90%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Efficient Group Signatures with Designated Traceability over Openers’ Attributes from Lattices — Hiroaki Anada, Shingo Hasegawa, et al. · International Journal of Networking and Computing (2025) | TGRS Research Map | TGRS