Retrieval Integrity Verification Mechanism with Privacy Protection and Dynamic Updates for Blockchain Oracles

Abstract

Blockchain oracles bridge on-chain smart contracts and off-chain data sources, but encrypted off-chain data still raises two practical challenges: how to verify retrieval integrity without exposing sensitive values, and how to keep verification information fresh when the off-chain data set changes. Existing oracle and outsourced-database retrieval mechanisms often rely on plaintext verification, heavy cryptographic proofs, or static authentication structures, which limits their applicability to latency-sensitive IoT and decentralized finance scenarios. To address these issues, this paper proposes a retrieval integrity verification mechanism based on CKKS approximate homomorphic encryption and an authenticated index named CKKS-Auth Tree. The proposed mechanism verifies encrypted query results through homomorphically aggregated metadata, while smart contracts record versioned verification commitments to detect stale or replayed results after updates. The scope of the mechanism is the integrity, completeness, privacy, and freshness of data after commitment and upload; verifying the physical authenticity of the original data source is outside the core threat model. Experimental results show that the proposed scheme reduces authentication and verification overhead compared with existing retrieval verification methods while supporting encrypted metadata updates and on-chain synchronization.