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
- Keita Xagawa (ORCID: https://orcid.org/0000-0002-6832-9940)
- Keisuke Saito (ORCID: https://orcid.org/0000-0002-2293-9743)
- Atsushi Fujioka (ORCID: https://orcid.org/0000-0001-8442-8116)
- Taiichi Saito (ORCID: https://orcid.org/0000-0002-5016-9619)
Institutions
- Tokyo Denki University (JP)
- Kanagawa University (JP)
- Technology Innovation Institute (AE)
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