Seeded Random Memory Scanning for Escrow-Resistant Detection

The patent applies dynamics by transforming the static sequential scanning approach into a dynamic random scanning approach. The verifier generates random challenge values that dynamically determine which memory locations to scan, making the verification process adaptive and unpredictable. This dynamic approach increases security against escrow attacks while maintaining computational efficiency through selective random sampling rather than exhaustive scanning.

The patent changes the fundamental parameter of the scanning approach from sequential (fixed pattern) to random (variable pattern). By introducing randomness as a parameter change, the system achieves better security properties against escrow attacks where an attacker might predict or cache sequential access patterns. The random scanning with challenge-response mechanism changes the verification paradigm while keeping computational complexity manageable.

The patent applies partial action by performing random scanning on a selected subset of memory locations rather than requiring complete verification of all m memory cells. The challenge-response mechanism allows the verifier to randomly sample specific locations based on challenge values, achieving sufficient security through partial verification. This reduces computational complexity from O(mlog(m)) to a more manageable level while maintaining robustness against escrow attacks.

The patent uses copying in the sense that the verifier maintains a reference copy of the original digest computed from the trusted initial state. This reference digest is compared against the current digest computed through random scanning. The copying approach allows verification without requiring the verifier to store or process all original data, reducing computational overhead while maintaining security through cryptographic comparison of digest values.