arXiv:2610.16124
QIAP: A Quantum-Inspired Authentication Protocol with BB84-Based Channel Monitoring
Owais Ishtiaq Siddiqui, Nouhaila Innan, Hira Zaheer, Muhammad Shafique
Muhammad ShafiqueAbstract
Authentication in quantum-aware communication settings requires mechanisms that verify user legitimacy while also assessing whether the communication channel exhibits excessive disturbance. This paper presents QIAP, a stateful hybrid framework that combines classical commitment-based challenge-response authentication with BB84-based quantum-channel monitoring. QIAP uses a dual-branch verification structure inspired by rectilinear and diagonal basis selection. In the rectilinear branch, the prover opens a hash-based commitment and the verifier checks consistency with the registered round token. In the diagonal branch, the prover returns an HMAC tag bound to the verifier nonce, round identifier, and submitted commitment without disclosing the round-specific sub-secret. Under the stated hash, HMAC, freshness, secure-registration, protected-storage, and high-entropy-secret assumptions, QIAP provides computational resistance to the modeled wrong-secret and replay attempts and protects the long-term master secret from direct recovery. After successful authentication, the BB84 module estimates the quantum bit error rate (QBER) and aborts the session when the measured value reaches or exceeds the configured threshold. In the reported simulation, no successful authentication was observed among 1,000 tested wrong-secret attempts per branch. The baseline and full intercept-resend conditions produced mean QBER values of approximately 0.02 and 0.25, respectively. The classical authentication stage required approximately 0.6 ms, and the implemented authentication messages required approximately 113 bytes per round. These results indicate that QIAP can provide a lightweight hybrid framework for combining secret-based identity verification with QBER-based channel-disturbance assessment under the stated threat model.
AI Summary
QIAP addresses combining secret-based identity authentication with quantum-channel disturbance assessment. It places a stateful classical challenge–response protocol before a separate BB84 monitoring stage, requiring both to pass for session acceptance. Its “quantum-inspired” feature is a random choice between two classical verification branches, not quantum authentication. Each round uses a master-secret-derived sub-secret, a fresh verifier nonce, and a randomized hash commitment. One branch reveals the sub-secret and commitment opening; the other returns an HMAC bound to the nonce, round identifier, and commitment. Registered verification records are consumed after every attempt. The security analysis argues completeness, per-branch computational impersonation resistance, replay resistance, and protection against master-secret recovery under explicit cryptographic and operational assumptions. It does not claim zero knowledge or a $2^{-R}$ soundness bound. Python simulations using SHA-256/HMAC-SHA-256 observed zero successes in 1,000 wrong-secret attempts per branch; the reported 95% upper bound is approximately $0.003$ for that tested attack generator, not a cryptographic forgery bound. Across 500 trials per condition with 1,024 transmitted qubits, mean QBER was approximately $0.02$ without interception and $0.25$ under full intercept–resend, compared with an abort threshold of $0.11$. Classical authentication took approximately $0.6$ ms for 20 rounds and approximately 113 bytes per round. The stated limitations include protected verifier storage, secure registration, authenticated and session-bound BB84 classical messaging, and single-use-record management. Evaluation excludes hardware QKD timing, finite-key security, partial interception, and device attacks; elevated QBER indicates disturbance, not its cause.
Central claim may not hold: QIAP's master-secret protection theorem requires stronger assumptions than ordinary hash preimage and second-preimage resistance, because those properties do not exclude recovery of the shared master secret from multiple related round-secret outputs.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 8 pages, 7 figures (Accepted by QAI26)