New Complex Sinusoidal Waveform-Based Zero-Knowledge Proof Systems for Efficient Anonymous Authentication

Zero-knowledge proof systems based on Feige-Fiat–Shamir (FFS) protocol are an interactive protocol between two anonymous authentication parties. However, they require heavy computations because of many iterations for reducing the probability that an attacker can trick a remote server. The algorithm’s time complexity rapidly increases with the total number of the challenge values, which should be unpredictable. Hence, the FFS protocol is not suitable for practical zero-knowledge proof systems. In this study, we propose new zero-knowledge proof systems based on phase mask generation that are complex sinusoidal waveform versions of the FFS algorithm for efficient anonymous authentication in the diverse interactive systems. The proposed anonymous authentication schemes need a single iteration only, allowing for efficient uses of a random challenge mask with large bit-depth. The proposed schemes allow the verifier to verify that the prover knows the secret mask, such as binary pattern, visual image, or hologram, which are the prover’s secrets, without revealing any information about it to anyone else, including the verifier. Various numerical simulations demonstrate the proposed schemes’ feasibility and robustness.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2024-09-30
DOI
https://doi.org/10.1109/tsmc.2024.3460801
Primary Topic
Internet Traffic Analysis and Secure E-voting
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

New Complex Sinusoidal Waveform-Based Zero-Knowledge Proof Systems for Efficient Anonymous Authentication

Ongee Jeong, Inkyu Moon, Bahram Javidi, You-Hyun Kim et al.
1 links
IEEE Transactions on Systems Man and Cybernetics Systems
Internet Traffic Analysis and Secure E-voting
article

New Complex Sinusoidal Waveform-Based Zero-Knowledge Proof Systems for Efficient Anonymous Authentication

Ongee Jeong, Inkyu Moon, Bahram Javidi, You-Hyun Kim, Kevin Choi
article en

Abstract

Zero-knowledge proof systems based on Feige-Fiat–Shamir (FFS) protocol are an interactive protocol between two anonymous authentication parties. However, they require heavy computations because of many iterations for reducing the probability that an attacker can trick a remote server. The algorithm’s time complexity rapidly increases with the total number of the challenge values, which should be unpredictable. Hence, the FFS protocol is not suitable for practical zero-knowledge proof systems. In this study, we propose new zero-knowledge proof systems based on phase mask generation that are complex sinusoidal waveform versions of the FFS algorithm for efficient anonymous authentication in the diverse interactive systems. The proposed anonymous authentication schemes need a single iteration only, allowing for efficient uses of a random challenge mask with large bit-depth. The proposed schemes allow the verifier to verify that the prover knows the secret mask, such as binary pattern, visual image, or hologram, which are the prover’s secrets, without revealing any information about it to anyone else, including the verifier. Various numerical simulations demonstrate the proposed schemes’ feasibility and robustness.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 54(12)
University of Connecticut (US), Daegu Gyeongbuk Institute of Science and Technology (KR)
Openalex Percentile: Top 85%
Internet Traffic Analysis and Secure E-voting
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.