Chameleon Hashing Security Enhancement to Hierarchical Identity-Based Identification

This paper examines a security enhancement technique from a passively secure hierarchical identity-based identification (HIBI) protocol to a concurrently secure one. Two types of security enhancement techniques for the identification protocols have been proposed: one based on the OR-proof technique and the other using a chameleon hash function. The former has been examined in detail, while the latter has not been formulated in the HIBI protocol, and its close evaluation of applicability, especially in identity-selecting settings, and reduction efficiency has not been made public. We describe a transformation using a chameleon hash function and compare it with the others based on the OR-proof technique in applicability and reduction efficiency.

Authors

Institutions

Publication Details

Published
2024-11-10
DOI
https://doi.org/10.23919/isita60732.2024.10858272
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Chameleon Hashing Security Enhancement to Hierarchical Identity-Based Identification

Keita Xagawa, Keisuke Saito, Atsushi Fujioka, Taiichi Saito
Algorithms and Data Compression
article

Chameleon Hashing Security Enhancement to Hierarchical Identity-Based Identification

Keita Xagawa, Keisuke Saito, Atsushi Fujioka, Taiichi Saito
article en

Abstract

This paper examines a security enhancement technique from a passively secure hierarchical identity-based identification (HIBI) protocol to a concurrently secure one. Two types of security enhancement techniques for the identification protocols have been proposed: one based on the OR-proof technique and the other using a chameleon hash function. The former has been examined in detail, while the latter has not been formulated in the HIBI protocol, and its close evaluation of applicability, especially in identity-selecting settings, and reduction efficiency has not been made public. We describe a transformation using a chameleon hash function and compare it with the others based on the OR-proof technique in applicability and reduction efficiency.

Tokyo Denki University (JP), Kanagawa University (JP), Technology Innovation Institute (AE)
Openalex Percentile: Top 76%
Algorithms and Data Compression
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.