State-based file system integrity remote attestation method
A file system and remote attestation technology, applied in the direction of digital data protection, etc., can solve problems such as insufficient judgment of the integrity of the witness system, insufficient integrity of the witness system, etc., and achieve a computationally feasible effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0025] Assume that the initial state of the file system is to open two files: / bin / f1, / etc / f2. The file system has two data objects: (1) The variable x representing the total number of currently open files, the initial value is x=2; (2) The tree structure representing all open file directories and file nodes is sorted in the order of node depth first , the initial state is ( / )(bin)(f1)(etc)(f2). The user's system call sequence is open(" / home / hh / f3"), open(" / home / hh / f4").
[0026] The verification algorithm execution steps are as follows:
[0027] 1) Determine the initial state of the system
[0028] 2) Enter the system call sequence: open(" / home / hh / f3"), open(" / home / hh / f4"), i=1, n=2;
[0029] 3) At this time, i=1, n=2, if i>n is not satisfied, go to the next step 4);
[0030] 4)a 1 =open(" / home / hh / f3") is a system call structure that changes the tree data object. After the system call is executed, the condition that the tree object must meet is to include { / bin / f1, / et...
Embodiment 2
[0040]Assume the same as example 1. The user's system call sequence is open(" / home / hh / f3"), open(" / home / hh / f4"), close( / home / hh / f4). The verification algorithm execution process is as follows:
[0041] 1) Determine the initial state of the system ;
[0042] 2) Enter the system call sequence: open(" / home / hh / f3"), open(" / home / hh / f4"), close( / home / hh / f4); i=1, n=3;
[0043] 3) At this time, i=1, n=3, if i> n is not satisfied, go to the next step 4);
[0044] 4)a 1 =open(" / home / hh / f3") is a system call structure that changes the tree data object. After the system call is executed, the condition that the tree object must meet is to include { / bin / f1, / etc / f2} ∪{ / home / hh / } minimum tree: ( / ) (bin) (f1) (etc) (f2) (home) (hh) (f3); x=3; go to the next step 5);
[0045] 5) At this time, i=1, execute 1+1→i, and go to the next step 3).
[0046] The following enters the second round of the algorithm:
[0047] 3) At this time, i=2, n=2, if i>n is not satisfied, go to the next step 4)...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com