Current blockchain optimistic verification schemes typically face critical challenges such as inadequate verifier workload verification, verifier identity exposure risks, and low transaction acceptance rates due to batch rollbacks, significantly impacting off-chain verification efficiency and security. To address these issues, we propose AnoST, an efficient transaction verification mechanism with enhanced verifier anonymity protection. First, we introduce an anonymous staking-based verifier election mechanism to preserve verifier privacy and mitigate identity exposure risks. Second, we propose a State Transition Commitment (STC) mechanism, enabling direct blockchain verification of verifier workloads, effectively resolving the Verifier’s Dilemma (Luu et al., CCS 2015). Furthermore, we develop a partial rollback mechanism leveraging State Transition Trees (STT), significantly improving transaction acceptance rates and system efficiency. Experimental results demonstrate that AnoST achieves notable advantages in security, anonymity protection, and transaction approval rates, highlighting its promising practicality and scalability.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

AnoST: An Anonymous Optimistic Verification System Based on Off-Chain State Transition

  • Qiyuan Gao,
  • Qianhong Wu,
  • Junxiang Nong,
  • Qi Liu

摘要

Current blockchain optimistic verification schemes typically face critical challenges such as inadequate verifier workload verification, verifier identity exposure risks, and low transaction acceptance rates due to batch rollbacks, significantly impacting off-chain verification efficiency and security. To address these issues, we propose AnoST, an efficient transaction verification mechanism with enhanced verifier anonymity protection. First, we introduce an anonymous staking-based verifier election mechanism to preserve verifier privacy and mitigate identity exposure risks. Second, we propose a State Transition Commitment (STC) mechanism, enabling direct blockchain verification of verifier workloads, effectively resolving the Verifier’s Dilemma (Luu et al., CCS 2015). Furthermore, we develop a partial rollback mechanism leveraging State Transition Trees (STT), significantly improving transaction acceptance rates and system efficiency. Experimental results demonstrate that AnoST achieves notable advantages in security, anonymity protection, and transaction approval rates, highlighting its promising practicality and scalability.