Secure Array Access Using Permuted Tags
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques require a significant number of communication stages to access an array, leading to increased time in large communication delay environments, and fail to keep the accessed position secret during data reading and writing.
Innovation Solution
A secure array access apparatus that includes a storage unit for concealed values and addresses, a refresh unit that generates permuted concealed values and public tags using a random permutation, and an access unit that performs operations based on calculated tags to enable efficient and secure access with a constant number of communication stages.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional secure array access techniques are used, then the accessed position is kept secret, but the number of communication stages increases to Ω(log n), leading to increased access time
Solution Approach 1:
The system performs preliminary actions by pre-computing and storing permuted arrays and their corresponding tags in advance. When access is needed, the system simply retrieves the pre-computed data structure and uses the tag to directly identify the permuted position, eliminating the need for multiple communication stages during actual access operations.
Solution Approach 2:
The patent introduces tags as an intermediary element that mediates between the access position and the permuted array. The tag serves as a key that directly maps to the permuted position without requiring iterative search or multiple communication rounds, thus reducing access time while maintaining position secrecy.
2Reliability
If the array is permuted with random permutation to hide access position, then position secrecy is improved, but the device complexity increases due to storage requirements
Solution Approach 1:
The system creates copies of the array in permuted form and stores them in advance. Instead of performing complex permutations during access operations, the system pre-generates multiple permuted versions and stores them, allowing direct retrieval based on tag matching. This trading of storage space for computational simplicity reduces device complexity during access operations.
Data Source
AI summary
Access to an array is efficiently performed without reveling an accessed position. A storage 10 stores an array of concealed values [x′→] of an array x′→ and an array of addresses a′→ corresponding to respective elements of the array of concealed values [x′→]. A refresh unit 11 determines a concealed value [F] of a random parameter F, an array of concealed values [x→] of an array x→ generated by permutating the array x′→ with random permutation ρ, and an array of public tags b→ calculated from respective elements of the array of addresses a→ with the function TagF. An access unit 12 performs a desired access to an element of the array of concealed values [x→] corresponding to a tag that is calculated from a concealed value [j] of an access position j with the function Tag and the concealed value [F] of the parameter.