An Efficient Identity Authentication Mechanism Based on Algebraic Curves and Zero-Knowledge Proofs
Bibliographic record
Abstract
With the rapid development of the digital economy and the Internet of Things, identity authentication in resource-constrained environments faces challenges such as low efficiency and inadequate privacy protection. Addressing the high computational and communication overhead of traditional RSA and ECC authentication mechanisms, this study proposes an efficient identity authentication mechanism (AC-ZKP) based on algebraic curves and non-interactive zero-knowledge proofs (NIZK). This mechanism leverages algebraic curve group operations to achieve lightweight key management and employs zero-knowledge proofs to ensure information concealment and anti-forgery during identity verification. The paper conducts a systematic study across four dimensions: system modeling, algorithm design, security analysis, and performance evaluation. Experimental results demonstrate that while maintaining 128-bit security strength, the AC-ZKP mechanism reduces authentication latency by approximately 44% and communication overhead by about 40%. It also exhibits strong scalability and resistance to attacks, significantly outperforming traditional ECC schemes. These findings provide a viable solution for lightweight, high-security identity authentication in IoT, edge computing, and cross-border data exchange environments.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.015 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; both teacher heads agree on what is shown here.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".