# US 2025/0148095 A1 · Secure computation apparatus, secure computation method, and program

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0148095 A1
- Document ID: US20250148095A1
- Status: Published application
- Kind: A1
- Application number: 18/836,747
- Filed: 2022-02-16
- Published: 2025-05-08
- Earliest claimed: 2022-02-16
- Assignees: Nippon Telegraph and Telephone Corporation
- Applicants: Nippon Telegraph and Telephone Corporation
- Inventors: Hiroki SUDO
- Web page: https://patentgrep.com/patent/US20250148095A1

## CPC

- G06F 21/602: {Providing cryptographic facilities or services}
- G09C 1/00: Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system (cryptographic typewriters G09C3/00)
- H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes}
- H04L 9/40: Network security protocols
- H04L 2209/46: Secure multiparty computation, e.g. millionaire problem
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G09C: CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A secure computation apparatus includes a former half window frame column generation unit configured to generate, with respect to subVector ({g→}, s+1, i}, a bit column obtained by an OR operation performed on all bits from the end to each position as {wf→}, a latter half window frame column generation unit configured to generate, with respect to subVector ({g→}, i+1, t}, a bit column obtained by an OR operation performed on all bits from the head to each position as {wl→}, a window frame flag column generation unit configured to generate {w→} by combining {wf→} and {wl→}, an inverted window frame flag column generation unit configured to generate {w′→} by performing a NOT operation on {w→}, a share conversion unit configured to convert {w′→} into [[w′→]], and a product-sum operation unit configured to execute a product-sum operation on subVector ([[v′→]], s, t) and [[w′→]].

## Claims

### Claim 1

A secure computation apparatus for performing arithmetic operations while keeping a database including a key column k→ which is an attribute column and a data column v→ which is a value column concealed, wherein
a group flag column g→ represents a vector in which a value becomes 1 at a position where a value of the key column changes, and a value becomes 0 at other positions,
a share of a value x according to replicated secret sharing is represented as {x},
a share of the value x according to Shamir secret sharing is represented as ((x)),
a current row number is represented by i, a window frame start position is represented by s, and a window frame end position is represented by t,
the number of rows of the key column and the data column is set to 1, and the current row number i is incremented by one each time all flag column generation processing ends in a range of 0 or more and less than 1, the secure computation apparatus comprising:
processing circuitry configured to
generate, with respect to a vector subVector ({g→}, s+1, i} obtained by extracting elements from an (s+1)-th element to an i-th element of {g→}, a bit column obtained by an OR operation performed on all bits from the end to each position as a former half window frame flag column {wf→};
generate, with respect to a vector subVector ({g→}, i+1, t) obtained by extracting elements from an (i+1)-th element to a t-th element of {g→, a bit column obtained by an OR operation performed on all bits from the head to each position as a latter half window frame flag column {wl→};
generate a window frame flag column {w→} by combining the former half window frame flag column {wf→} from the front side and the latter half window frame flag column {wl→} from the rear side having (0) interposed between the former half window frame flag column {wf→} and the latter half window frame flag column {wl→};
generate an inverted window frame flag column {w′→} by performing a NOT operation on the window frame flag column {w→};
convert the inverted window frame flag column {w′→} into an inverted window frame flag column ((w′→)); and
execute a product-sum operation on subVector ((v′→)), s, t) obtained by extracting elements from s to t of a data column ((v′→)) obtained by sorting a data column ((v→)) in ascending order and the inverted window frame flag column w′→)).

### Claim 2

A secure computation method for performing arithmetic operations while keeping a database including a key column k→ which is an attribute column and a data column v→ which is a value column concealed, wherein
a group flag column g→ represents a vector in which a value becomes 1 at a position where a value of the key column changes, and a value becomes 0 at other positions,
a share of a value x according to replicated secret sharing is represented as {x},
a share of the value x according to Shamir secret sharing is represented as ((x)),
a current row number is represented by i, a window frame start position is represented by s, and a window frame end position is represented by t,
the number of rows of the key column and the data column is set to 1, and the current row number i is incremented by one each time all flag column generation processing ends in a range of 0 or more and less than 1, the secure computation method comprising:
a step of generating, with respect to a vector subVector ({g→}, s+1, i} obtained by extracting elements from an (s+1)-th element to an i-th element of {g→}, a bit column obtained by an OR operation performed on all bits from the end to each position as a former half window frame flag column {wf→};
a step of generating, with respect to a vector subVector ({g→}, i+1, t} obtained by extracting elements from an (i+1)-th element to a t-th element of {g→}, a bit column obtained by an OR operation performed on all bits from the head to each position as a latter half window frame flag column {wl→};
a step of generating a window frame flag column {w→} by combining the former half window frame flag column {wf→} from the front side and the latter half window frame flag column {wl→} from the rear side having {0} interposed between the former half window frame flag column {wf→} and the latter half window frame flag column (wl→};
a step of generating an inverted window frame flag column {w′→} by performing a NOT operation on the window frame flag column {w→};
a step of converting the inverted window frame flag column {w′→} into an inverted window frame flag column ((w′→; and
a step of executing a product-sum operation on subVector ((v′→, s, t) obtained by extracting elements from s to t of a data column ((v′→)) obtained by sorting a data column ((v→)) in ascending order and the inverted window frame flag column][w′→)).

### Claim 3 (depends on 1)

A non-transitory computer readable medium storing a computer program for causing a computer to function as the secure computation apparatus according to claim 1.
