IP Library Granted Patent US 12,476,817
Granted Patent B2
US 12,476,817 · App. 18/556,518 · Granted Nov 18, 2025

Secure consolidation system, information processing apparatus, secure consolidation method, and program

Inventors: Koki Hamada (Tokyo, JP); Koji Chida (Tokyo, JP); Masanobu Kii (Tokyo, JP); Atsunori Ichikawa (Tokyo, JP); Junichi Tomida (Tokyo, JP)
Assignee: NTT, Inc.
H04L9/3236
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,476,817
App. No.
18/556,518
Granted
Nov 18, 2025
Kind
B2
Abstract

A secure collation system performs secure-data-collation between first and second information processing apparatuses and includes the first and second information processing apparatuses. The second information-processing-apparatus creates, when receiving a first vector having a hash value of a key value of the first information-processing-apparatus as an element, a second vector by adding a dummy hash value to the first vector and rearranging the first vector by random permutation; creates a third vector having, as elements, a hash value of a key value of the second information-processing-apparatus and a hash value of a dummy key value; and transmits the second and third vectors to the first information-processing-apparatus. The first information-processing-apparatus calculates a hash value of an element of the third vector and creates a fourth vector having the hash value as an element; and collates matched values between each element of the third vector and each element of the fourth vector.

Claims (35)

1 . A secure collation system comprising a first information processing apparatus and a second information processing apparatus,

wherein the second information processing apparatus is configured to:

receive a first vector having a hash value of a key value of the first information processing apparatus as an element, and create a second vector by adding a dummy hash value to the first vector and rearranging the first vector by random permutation;

create a third vector having, as elements, a hash value of a key value of the second information processing apparatus and a hash value of a dummy key value; and

transmit the second vector and the third vector to the first information processing apparatus, and

wherein the first information processing apparatus is configured to:

receive the second vector and the third vector, calculate a hash value of an element of the third vector and create a fourth vector having the hash value as an element; and

collate matched values between each element of the third vector and each element of the fourth vector.

2 . The secure collation system according to claim 1 , wherein, when f and g are commutative hash functions,

the first information processing apparatus is further configured to:

calculate, by f, the hash value of the key value of the first information processing apparatus and creates the first vector having the hash value as the element; and

transmit the first vector to the second information processing apparatus, and

the second information processing apparatus is further configured to calculate, by g, the hash value of the key value of the second information processing apparatus and calculate, by g, the hash value of the dummy key value, and create the third vector having, as elements, the hash value of the key value of the second information processing apparatus and the hash value of the dummy key value that are calculated by g.

3 . The secure collation system according to claim 1 , wherein

the second information processing apparatus is further configured to create a second dummy vector such that the number of elements having a common value is a predetermined number, between a first dummy vector including a key value for calculating the dummy hash value to be added to the first vector and the second dummy vector including the key value for calculating the dummy hash value to be used as the element of the third vector.

4 . An information processing apparatus comprising:

a processor; and

a memory storing program instructions that cause the processor to:

receive a first vector having a hash value of a key value of another information processing apparatus as an element, and create a second vector by adding a dummy hash value to the first vector and rearranging the first vector by random permutation;

create a third vector having, as elements, a hash value of a key value of the information processing apparatus and a hash value of a dummy key value; and

transmit the second vector and the third vector to the another information processing apparatus.

5 . An information processing apparatus comprising:

a processor; and

a memory storing program instructions that cause the processor to:

receive a second vector obtained by adding a dummy hash value to a first vector having a hash value of a key value of the information processing apparatus as an element and rearranging the first vector by random permutation, and a third vector having, as elements, a hash value of a key value of the another information processing apparatus and a hash value of a dummy key value, and calculate a hash value of an element of the third vector and creates a fourth vector having the hash value as an element; and

collate matched values between each element of the third vector and each element of the fourth vector.

6 . A secure collation method comprising:

using a second information processing apparatus, executing:

receiving a first vector having a hash value of a key value of a first information processing apparatus as an element, and creating a second vector by adding a dummy hash value to the first vector and rearranging the first vector by random permutation;

creating a third vector having, as elements, a hash value of a key value of the second information processing apparatus and a hash value of a dummy key value; and

transmitting the second vector and the third vector to the first information processing apparatus, and

using the first information processing apparatus, executing:

receiving the second vector and the third vector, and calculating a hash value of an element of the third vector and creating a fourth vector having the hash value as an element; and

collating matched values between each element of the third vector and each element of the fourth vector.

7 . A non-transitory computer-readable recording medium having stored therein a program for causing the first information processing apparatus and the second information processing apparatus to execute the secure collation method according to claim 6 .

Assignments (2)
CHANGE OF NAME Recorded Aug 15, 2025
From: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
To: NTT, INC.
Reel/Frame 072473/0885 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 20, 2023
From: HAMADA, KOKI; CHIDA, KOJI; KII, MASANOBU; ICHIKAWA, ATSUNORI; TOMIDA, JUNICHI
To: NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Reel/Frame 065295/0316 →
Continuity (1)
Related Publication 20240214212A1 · Jun 27, 2024
References Cited (5)
US 9276922B2 · Mosko · 2016 [cited by examiner]
US 11477017B2 · Newton · 2022 [cited by examiner]
US 20110222683A1 · Struik · 2011 [cited by examiner]
US 20170272239A1 · Minematsu · 2017 [cited by examiner]
Koji Chida et al., Anonymous Equijoin Protocol and its Applications, In SCIS Jan. 25-28, 2011. [cited by applicant]