Decentralized multi-authority anonymous credential system with bundled languages on identifiers in bilinear groups

We propose a multi-show decentralized multi-authority attribute-based anonymous credential system (dACS). Referring to previous work, we give a new syntax and three security notions: unforgeability, anonymity and unlinkability. Especially, corruption of authorities is considered to reflect a real scenario. Then we give a generic construction of dACS. In our $$ \textsf{dACS} $$ , an attribute authority who issues a private secret key to an entity only has to sign the entity's identifier. Then, according to the principle of "commit-to-identifier", the entity generates a proof of knowing credentials. There are two building blocks: the structure-preserving signature scheme and the Groth-Sahai non-interactive proof system, both of which are in asymmetric bilinear groups. The principle is realized with a bundled language that is simultaneous pairing-product equations on the identifier. There, the bundled language works for preventing collusion attacks . Finally, we instantiate our generic $$ \textsf{dACS} $$ under the Symmetric External Diffie-Hellman (SXDH) assumption, compare the instantiated scheme with previous work, and evaluate the performance.

Authors

Institutions

Publication Details

Journal
Journal of Surveillance Security and Safety
Published
2024-09-20
DOI
https://doi.org/10.20517/jsss.2024.08
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

Decentralized multi-authority anonymous credential system with bundled languages on identifiers in bilinear groups

Hiroaki Anada
Journal of Surveillance Security and Safety
Cryptography and Data Security
article

Decentralized multi-authority anonymous credential system with bundled languages on identifiers in bilinear groups

Hiroaki Anada
article en

Abstract

We propose a multi-show decentralized multi-authority attribute-based anonymous credential system (dACS). Referring to previous work, we give a new syntax and three security notions: unforgeability, anonymity and unlinkability. Especially, corruption of authorities is considered to reflect a real scenario. Then we give a generic construction of dACS. In our $$ \textsf{dACS} $$ , an attribute authority who issues a private secret key to an entity only has to sign the entity's identifier. Then, according to the principle of "commit-to-identifier", the entity generates a proof of knowing credentials. There are two building blocks: the structure-preserving signature scheme and the Groth-Sahai non-interactive proof system, both of which are in asymmetric bilinear groups. The principle is realized with a bundled language that is simultaneous pairing-product equations on the identifier. There, the bundled language works for preventing collusion attacks . Finally, we instantiate our generic $$ \textsf{dACS} $$ under the Symmetric External Diffie-Hellman (SXDH) assumption, compare the instantiated scheme with previous work, and evaluate the performance.

Journal of Surveillance Security and SafetyVol. 5(3)
Meiji Gakuin University (JP)
Japan Society for the Promotion of Science
Openalex Percentile: Top 86%
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.

Decentralized multi-authority anonymous credential system with bundled languages on identifiers in bilinear groups — Hiroaki Anada · Journal of Surveillance Security and Safety (2024) | TGRS Research Map | TGRS