Authenticated Hierarchical Set Operations for Cloud Data Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current techniques lack effective methods for securely verifying the correctness of hierarchical set operations on outsourced data sets, particularly in cloud computing scenarios where data is processed by untrusted servers, and there is a need for cryptographic protocols to ensure the integrity and accuracy of query results.
Innovation Solution
The development of methods and apparatus for authenticated hierarchical set operations, which involve generating and verifying encodings and proof-of-correctness for data sets using a third-party server, allowing clients to verify the correctness of query results through a tree-based parsing and verification process, incorporating extractable accumulation schemes to ensure security and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If authenticated set operations are performed on outsourced data sets using traditional verification methods, then the correctness of query results can be verified, but the verification time and proof size become excessively large for hierarchical operations
Solution Approach 1:
The patent segments the hierarchical set operation verification into multiple levels corresponding to the tree structure of the query. Each level is verified independently using localized proofs, rather than verifying the entire hierarchical operation as a single unit. This segmentation reduces the verification time and proof size by focusing only on the relevant portions at each level.
Solution Approach 2:
The patent introduces a hierarchical dimension to the verification process, organizing the verification proofs in a tree structure that mirrors the query structure. This allows the verification to proceed in a structured manner from root to leaves, reducing the complexity compared to flat verification approaches.
2Reliability
If traditional authenticated set operation protocols are used for hierarchical queries, then query correctness can be ensured, but the proof size becomes unmanageably large
Solution Approach 1:
The patent extracts only the essential verification information needed at each level of the hierarchy, rather than including all possible proof elements. By taking out only the necessary components for verification at each level, the overall proof size is significantly reduced while maintaining verification integrity.
Solution Approach 2:
The patent applies partial verification at each level, focusing only on the specific set operations needed for that level rather than re-verifying all operations. This partial action approach reduces proof size by avoiding redundant verification information.
3Measurement precision
If comprehensive verification of all set operations is performed, then complete accuracy can be achieved, but the system complexity and computational overhead increase significantly
Solution Approach 1:
The patent segments the complex verification task into manageable levels corresponding to the tree structure, where each level handles specific set operations. This segmentation reduces system complexity by breaking down the monolithic verification process into modular, level-specific verification routines.
Solution Approach 2:
The patent implements a dynamic verification approach where the verification process adapts to the specific structure of the query tree. Rather than using a fixed verification protocol, the system dynamically determines which verifications are needed at each level based on the actual query operations, reducing unnecessary complexity.
Data Source
AI summary
Methods and apparatus are provided for authenticated hierarchical set operations. A third party server processes a query (possibly from a client) on data sets outsourced by a source of the data. The query comprises a hierarchical set operation between at least two of the data sets. Authenticated Set Operation techniques for flat set operations can be iteratively applied for hierarchical set operations. In addition, bilinear accumulators are extended to provide an extractable accumulation scheme comprising a primary bilinear accumulator and a secondary bilinear accumulator. The client receives (i) an encoding of an answer to the query, (ii) a verification comprising, for example, one or more of subset witnesses, completeness witnesses, and/or accumulation values, and (iii) at least one argument for at least one intersection operation, union operation and/or set difference operation.