Secure Data Access via Block Segmentation and Buffer Management

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for reading and writing data from a sequence require a communication amount of Ω(n) through constant-depth communication, making them inefficient without revealing the access position.

Innovation Solution

A secure reading and writing apparatus and method that utilize a buffer storage, command judging, secure reading, buffer addition, and secure writing components to efficiently read and write data with a smaller communication amount by concealing the access position, using techniques such as Shamir secret sharing and buffer management to limit communication to O(√n) for reading and O(n) for writing.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If secure reading/writing is performed without revealing access position using related art methods, then data security is maintained, but communication amount becomes Ω(n) which is inefficient

Engineering Contradiction:
Improvedata securityVSAvoidcommunication amount
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent segments the sequence data into multiple blocks and processes them in parallel. By dividing the data access task into smaller independent segments that can be handled simultaneously, the communication complexity is reduced from Ω(n) to O(√n) while maintaining the security property of not revealing access positions.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimensional approach by using block-based indexing and parallel processing dimensions. Instead of sequentially accessing elements one by one, the system operates on multiple blocks in parallel, effectively adding a parallelism dimension to the access pattern that reduces communication overhead.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Reliability

If all elements are accessed to conceal access position, then access position is hidden, but reading efficiency decreases

Engineering Contradiction:
Improveaccess position concealmentVSAvoidreading efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies local quality by making different parts of the data structure have different properties. Specifically, accessed blocks are marked with a special flag (set to 1) while unaccessed blocks remain marked as 0. This allows the system to conceal access positions at the block level rather than requiring all elements to be accessed, thereby improving reading efficiency while maintaining security.

Inventive Principle:
Principle #3Local quality

3Speed

If constant-depth communication is used for secure computation, then computation speed is maintained, but communication amount increases to Ω(n)

Engineering Contradiction:
Improvecomputation speedVSAvoidcommunication amount
Core Design Contradiction:
SpeedVSQuantity of substance

Solution Approach 1:

The patent performs preliminary actions by pre-processing data into blocks and pre-establishing the block indexing structure before the actual secure access operations. This preliminary organization allows subsequent access operations to proceed in constant depth with reduced communication requirements, as the heavy lifting of data organization is already completed.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentEP3686869B1Secret reading/writing device, secret reading/writing method, and program
Publication Date: 2024.02.07 NIPPON TELEGRAPH & TELEPHONE CORP
  • EP3686869B1 patent drawingFigure 1
  • EP3686869B1 patent drawingFigure 2
  • EP3686869B1 patent drawingFigure 3

AI summary

Data is efficiently read from and written in a sequence without an access position being revealed. A secure reading and writing apparatus (1) receives a read command or a write command as input, and, when the read command is input, outputs a secret text [a[x]] which is an x-th element of a secret text sequence [a], and, when the write command is input, adds the secret text [a[x]] which is the x-th element of the secret text sequence [a], to a secret text [d]. A secure reading part (12) reads the secret text [a[x]] which is the x-th element from the secret text sequence [a]. A buffer addition part (13) adds a secret text [c] of an unreflected value c to the secret text [a[x]]. A buffer appending part (14) appends a secret text [x] and the secret text [d] to a write buffer [b]. When the number of elements of the write buffer [b] exceeds a predetermined value, a secure writing part (15) adds a value indicated with a secret text vector [b1] to an access position of the secret text sequence [a] which is indicated with a secret text vector [b0].