Input data amount reduction device, input data amount reduction method, and program

The cryptographic protocol execution system addresses performance issues by compressing input data using a bijection, reducing the amount of input data and improving protocol efficiency in handling large databases with qualitative data.

WO2024236819A1PCT designated stage expired Publication Date: 2024-11-21NT T INC
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2023/018665
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-18
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Existing cryptographic protocols that use databases as input face performance issues such as increased communication amount and memory usage, especially when dealing with large databases containing qualitative data.

Method used

A system that reduces the input data amount for cryptographic protocols by using a bijection to map qualitative and quantitative data attributes to smaller representations, allowing for data compression and efficient processing, thereby reducing communication, memory usage, and calculation time.

Benefits of technology

The system effectively decreases the input data size, enhancing the performance of cryptographic protocols by minimizing communication and memory requirements while maintaining protocol functionality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2023018665_21112024_PF_FP_ABST
    Figure JP2023018665_21112024_PF_FP_ABST
Patent Text Reader

Abstract

An input data amount reduction device according to one aspect of the present disclosure reduces the amount of input data to an encryption protocol using a database as an input, wherein the input data amount reduction device includes: a preprocessing unit that compresses, by means of φj(rj), attribute values rj∈Rj (1≤j≤k) of each record r=(r0, r1, •••, rk)∈R0 x R1 x ••• x Rk (where R0 is a set of quantitative data), which compose a database Di used as an input to the encryption protocol, by using bijection φj:Rj→Hj⊂N (where N is a set of all natural numbers) from a qualitative data set Rj (1≤j≤k) to numerical values; and a protocol execution unit that uses a database composed of each (r0, φ1(r1), •••, φk(rk)) as an input to the encryption protocol and executes the encryption protocol with another device connected through a communication network.
Need to check novelty before this filing date? Find Prior Art

Description

Input data amount reduction device, input data amount reduction method, and program

[0001] The present disclosure relates to an input data amount reduction device, an input data amount reduction method, and a program.

[0002] Cryptographic protocols that use a database as input are known (for example, see Non-Patent Document 1). In experiments for performance evaluation of such cryptographic protocols, integers or binary values ​​of a few bits or less are often used as artificial databases. On the other hand, in practical applications, databases containing attributes whose values ​​are expressed as large data, such as long character strings, are also input.

[0003] Benny Pinkas et al. "SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension". In: Advances in Cryptology - CRYPTO 2019. Ed. by Alexandra Boldyreva and Daniele Micciancio. Vol. 11694. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019, pp. 401-431. isbn: 978-3-030-26953-1 978-3-030-26954-8. doi: 10.1007 / 978-3-030-26954-8_13.

[0004] However, in the past, the problem of poor performance in terms of communication volume and memory usage when a large database is used as input was not considered.

[0005] The present disclosure has been made in consideration of the above points, and provides a technique that can reduce the amount of input data in a cryptographic protocol that uses a database as input.

[0006] An input data amount reduction device according to one aspect of the present disclosure is an input data amount reduction device that reduces the amount of input data to a cryptographic protocol that uses a database as input, and includes a set R of qualitative data. jBijection φ from (1≦j≦k) to numbers j :R j →H j ⊂N (where N is the set of all natural numbers), and the database D i Each record r = (r 0 , r 1 , ..., r k )∈R 0 ×R 1 ×...×R k (However, R 0 is a set of quantitative data) j ∈R j (1≦j≦k) as φ j (r j ) and a preprocessing unit that compresses each (r 0 , φ 1 (r 1 ), ..., φ k (r k and a protocol execution unit that executes the cryptographic protocol between the device and another device connected via a communication network, using a database configured as an input to the cryptographic protocol.

[0007] A technique is provided that can reduce the amount of input data for a cryptographic protocol that uses a database as input.

[0008] 1 is a diagram illustrating an example of the overall configuration of a cryptographic protocol execution system according to the present embodiment; FIG. 2 is a diagram illustrating an example of the hardware configuration of a participant device according to the present embodiment; FIG. 3 is a diagram illustrating an example of the functional configuration of a participant device according to the present embodiment; and FIG. 4 is a flowchart illustrating an example of a cryptographic protocol execution process according to the present embodiment.

[0009] An embodiment of the present invention will be described below. In the following embodiment, a cryptographic protocol execution system 1 will be described that can execute a cryptographic protocol that uses a database as input after reducing the amount of input data for the protocol. However, it is assumed that the database contains qualitative data (especially data having a nominal scale). A typical example of a database that serves as input to the cryptographic protocol is a collection of personal data to which some identifier such as an ID is assigned as a nominal scale (e.g., a phone number as an ID, and data having name, gender, age, etc. as attributes). Another example of a cryptographic protocol that uses a database as input is one that counts the number of times a specific value appears in an input database.

[0010] Hereinafter, the format of the input data to the cryptographic protocol that uses a database as input is a Cartesian product set R = R 0 ×R 1 ×...×R k Here, R 0 is a set of quantitative data, R j (1≦j≦k) is a set of qualitative data. Note that if all attributes of the input data of the cryptographic protocol are qualitative data, R 0 can be ignored as an appropriate one-dimensional set.

[0011] In addition, the input data that a participant i of a cryptographic protocol that uses a database as input is input to the cryptographic protocol as D i Furthermore, D i The records constituting the record r are represented by r, and the j-th attribute value constituting each record r is represented by r j (0≦j≦k). Note that r∈R=R 0 ×R 1 ×...×R k and r j ∈R j (0≦j≦k). In the following, a record r consisting of k+1 attribute values ​​is defined as r=(r 0 , r 1 , ..., r k ) will also be expressed as r j ∈Rj (0≦j≦k), so in the following, R j attribute value r j We will also call it the set of values ​​that r can take. j may be a value, a set of values, etc.

[0012] Input data D i A typical example of this is a collection of personal data with a telephone number as an ID (nominal scale) and attributes such as name, gender, and age. In this typical example, name and gender are qualitative data, and age is quantitative data.

[0013] In addition, r j Set R of possible values ​​(1≦j≦k) j may be expressed as a Cartesian product of sets of qualitative data. For example, if there is a set of genders {male, female, other} and a set of regions {Hokkaido, ..., Okinawa}, then R j = {Male, Female, Others}, R j' = {Hokkaido, ..., Okinawa}, or R j = {male, female, other} x {Hokkaido, ..., Okinawa}. j When expressed as a direct product of qualitative data, the bijection φ j On the other hand, for example, j If it is expressed as a Cartesian product, such as r = {male, female, other} × {Hokkaido, ..., Okinawa}, there is a disadvantage that it becomes impossible to handle gender and region independently within the encryption protocol. 0 The set of possible values ​​for 0 may also be expressed as a Cartesian product of quantitative data (note that the attribute value r 0 is not subject to compression and is therefore unrelated to compression efficiency, etc.).

[0014] In the cryptographic protocol execution system 1 according to this embodiment, input data D i After compressing, the compressed input data D iis input to the cryptographic protocol. Then, in the cryptographic protocol execution system 1 according to this embodiment, the output data of the cryptographic protocol is expanded (restored) and restored as post-processing of the cryptographic protocol. This reduces the amount of input data for the cryptographic protocol that uses a database as input, making it possible to reduce the communication volume and memory usage of the cryptographic protocol, and in some cases, even the calculation time, and as a result, it becomes possible to improve the performance of the cryptographic protocol.

[0015] <Example of Overall Configuration of Cryptographic Protocol Execution System 1> An example of the overall configuration of a cryptographic protocol execution system 1 according to this embodiment is shown in Fig. 1. As shown in Fig. 1, the cryptographic protocol execution system 1 according to this embodiment includes a plurality of participant devices 10, which are communicatively connected to one another via a communication network 20 including the Internet or the like.

[0016] The participant devices 10 are devices that are used or managed by participants in a cryptographic protocol that uses a database as input, or are considered to be participants themselves. The participant devices 10 may be various devices such as PCs (personal computers), general-purpose servers, smartphones, tablet terminals, wearable devices, etc.

[0017] Hereinafter, the number of participants in a cryptographic protocol that uses a database as input is n (where n≧2), and a participant device 10 that is used or managed by participant i or that is considered to be participant i itself is referred to as a “participant device 10 i On the other hand, the participant device 10 i When referring to all participants (1≦i≦n), they will simply be referred to as "participant devices 10."

[0018] 1 is merely an example, and is not intended to be limiting. For example, the cryptographic protocol execution system 1 may include any other device, equipment, terminal, etc. other than the participant device 10.

[0019] <Example of Hardware Configuration of Participant Device 10> An example of the hardware configuration of a participant device 10 according to this embodiment is shown in Fig. 2. As shown in Fig. 2, the participant device 10 according to this embodiment includes an input device 101, a display device 102, an external I / F 103, a communication I / F 104, a RAM (Random Access Memory) 105, a ROM (Read Only Memory) 106, an auxiliary storage device 107, and a processor 108. Furthermore, each of these pieces of hardware is connected to each other via a bus 109 so as to be able to communicate with each other.

[0020] The input device 101 is, for example, a keyboard, a mouse, a touch panel, a physical button, etc. The display device 102 is, for example, a display, a display panel, etc. Note that the participant device 10 does not necessarily have to have at least one of the input device 101 and the display device 102, for example.

[0021] The external I / F 103 is an interface with an external device such as a recording medium 103a. The participant device 10 can read from and write to the recording medium 103a via the external I / F 103. Examples of the recording medium 103a include a flexible disk, a CD (Compact Disc), a DVD (Digital Versatile Disk), an SD memory card (Secure Digital memory card), and a USB (Universal Serial Bus) memory card.

[0022] The communication I / F 104 is an interface for connecting the participant device 10 to a communication network. The RAM 105 is a volatile semiconductor memory (storage device) that temporarily stores programs and data. The ROM 106 is a non-volatile semiconductor memory (storage device) that can store programs and data even when the power is turned off. The auxiliary storage device 107 is a storage device (storage device) such as an HDD (Hard Disk Drive), SSD (Solid State Drive), or flash memory. The processor 108 is an arithmetic device such as a CPU (Central Processing Unit).

[0023] The participant device 10 according to this embodiment has the hardware configuration shown in Figure 2, and is therefore capable of implementing the cryptographic protocol execution process described below. However, the hardware configuration shown in Figure 2 is merely an example, and the hardware configuration of the participant device 10 is not limited to this. For example, the participant device 10 may have multiple auxiliary storage devices 107 or multiple processors 108, may not have some of the hardware shown in the figure, or may have various hardware components other than the hardware shown in the figure.

[0024] <Participant device 10 i (1≦i≦n) Functional Configuration Example> Participant device 10 according to this embodiment i An example of the functional configuration of the participant device 10 (1≦i≦n) is shown in FIG. 3. As shown in FIG. 3, i is a preprocessing unit 201 i and protocol execution unit 202 i and the post-processing unit 203 i These units include, for example, the participant device 10 i The participant device 10 according to this embodiment is realized by a process in which one or more programs installed in the participant device 10 are executed by a computing device such as a CPU. i is stored in the storage unit 204. i The storage unit 204 i is realized by a storage area of ​​a storage device such as an HDD, an SSD, or a flash memory. i For example, the participant device 10 i It may be realized by a storage area of ​​a storage device communicably connected to the

[0025] In addition, the pre-processing unit 201 i (1≦i≦n) are collectively referred to simply as "preprocessing unit 201", and protocol execution unit 202 i (1≦i≦n) are collectively referred to simply as the “protocol execution unit 202” and the post-processing unit 203. i (1≦i≦n) are collectively referred to simply as "post-processing unit 203", and memory unit 204 i When referring to all of the memory units (1≦i≦n), they are simply referred to as "memory unit 204."

[0026] Preprocessing unit 201 i is the attribute value r j The set of possible values ​​for j k bijections φ from j :R j →H j ⊂N (where N is the set of all natural numbers, 1≦j≦k), the input data D i Each record r is composed of j (0≦j≦k), r j (1≦j≦k) is compressed. i is the input data D i Each attribute value r constituting each record r j (0≦j≦k) where attribute value r j (1≦j≦k) as φ j (r j ) where bijection φ j is a predefined bijective map and can be considered as a lossless compressor. j Set R of possible values ​​(1≦j≦k) j than the image φ j (R j ) is expressed with a smaller amount of data. i The attribute values ​​r that make up each record r j Set R of possible values ​​(1≦j≦k) j and its image φ j (R j ) does not change the number of elements, but the data size of each record is reduced. 1 , ..., φ k ) is commonly defined for each participant i (1≦i≦n). Hereinafter, the compressed input data D i is called the compressed input data, and D i '. In addition, the compressed input data D i Each record that makes up ' is expressed as r' = (r 0 , φ 1 (r 1 ), ..., φ k (r k )) will be expressed as

[0027] In addition, bijection φ jis, for example, a sequence number or a hash function to find the attribute value r j Set R of possible values ​​(1≦j≦k) j For all elements of H without omission and without duplication, j After assigning the element number of j The set of possible values ​​for j and a first dictionary-type data set in which the elements of j Set R of possible values ​​(1≦j≦k) j This can be realized by a second dictionary-type data having the elements of the above as values.

[0028] Protocol execution unit 202 i is the compressed input data D i ' as input data, and the other participant devices 10 j (j≠i, 1≦j≦n) executes a predetermined cryptographic protocol using a database as an input.

[0029] Post-processing unit 203 i is the element of the output data of the cryptographic protocol. j (R j ), then the element is j -1 By R j Return to the element.

[0030] Storage unit 204 i is various information (for example, input data D i , bijection φ j (1≦j≦k, etc.)

[0031] <Execution process of cryptographic protocol using database as input> Hereinafter, n participant devices 10 i Assume that a predetermined cryptographic protocol is executed between (1≦i≦n) participants using a database as input. i The process executed by (iε{1, . . . , n}) will be described with reference to FIG.

[0032] Preprocessing unit 201 i is a bijective φ j :R j →H j (1≦j≦k) to obtain the input data Di The elements of the preprocessing unit 201 are compressed (step S101). i is the input data D i Each record r = (r 0 , r 1 , ..., r k ) attribute value r j (1≦j≦k) as φ j (r j ) to compress the input data D i is compressed, and the record r′=(r 0 , φ 1 (r 1 ), ..., φ k (r k )) i ' is obtained.

[0033] Next, the protocol execution unit 202 i is the compressed input data D i ' as input data for the cryptographic protocol, and j (j≠i, 1≦j≦n) and execute the cryptographic protocol (step S102).

[0034] Then, the post-processing unit 203 i is the element of the output data of the cryptographic protocol executed in step S102 above, φ j (R j ), then the element is j -1 By R j (Step S103). This restores the output data of the cryptographic protocol. However, depending on the type of cryptographic protocol, post-processing (i.e., φ j -1 By R j This is because, for example, when counting the number of occurrences of a particular value, it is not necessary to restore the original elements.

[0035] The above-described embodiment can be applied to the execution of various cryptographic protocols that use a database containing qualitative data (especially data with a nominal scale) as input. Examples of cryptographic protocols that use a database containing qualitative data (especially data with a nominal scale) as input include the cryptographic protocols described in Non-Patent Document 1, Reference Document 1, Reference Document 2, etc.

[0036] As an example, an outline of the application to the cryptographic protocol described in Reference 2 will be described below. The cryptographic protocol described in Reference 2 is a two-party protocol called a secure binding.

[0037] Preparation: Hereinafter, it is assumed that n=2, and the participant device 10 1 The private key held by s 1 , participant device 10 2 The private key held by s 2 Let private key s 1 The hash function determined by 1 , private key s 2 The hash function determined by 2 Let's say h 1 , h 2 is assumed to be commutative.

[0038] HE to the participant device 10 1 and participant device 10 2 is a re-encryptable encryption method.

[0039] Also, if x is a vector and its m-th element is x[m], then for s=1, 2, h s (x) is h s (x[m]) is the m-th element of the vector. s The m-th element of (x) is "h s Similarly, the m-th element of HE(x) is also written as "HE(x)[m]".

[0040] At this time, the participant device 10 1 Input data D 1is expressed as a vector with its elements arranged, and the vector with the IDs assigned to those elements arranged is called ID 1 Similarly, the participant device 10 2 Input data D 2 is expressed as a vector with its elements arranged, and the vector with the IDs assigned to those elements arranged is called ID 2 However, ID 1 and D 1 participant device 10 2 The IDs are arranged in an unknown order. 2 and D 2 participant device 10 1 The data are arranged in an order unknown to the user.

[0041] Secure Binding Protocol At this time, the secure binding protocol is executed according to the following steps 1 to 7.

[0042] Step 1: Participant device 10 1 Pre-processing unit 201 1 is a bijective φ j :R j →H j Using the input data D 1 This compresses the elements of the input data D 1 (each element of) is compressed. In the following, the compressed input data D 1 Val 1 and the mth element is Val 1 It is written as [m].

[0043] Step 2: Participant device 10 1 Protocol execution unit 202 1 Is, h 1 (ID 1 ) and HE(Val 1 ) is calculated.

[0044] Step 3: Participant device 10 1 Protocol execution unit 202 1 Is, h 1 (ID 1 ) and HE(Val 1 ) to the participant device 10 2 Send to.

[0045] Step 4: Participant device 10 2 Protocol execution unit 202 2 Is, h 1 (ID 1 ) and HE(Val 1 ) is received, the following steps 4-1 to 4-4 are executed.

[0046] Step 4-1: Protocol execution unit 202 2 Is, h 2 (ID 2 ) is calculated.

[0047] Step 4-2: Protocol execution unit 202 2 creates a random permutation σ.

[0048] Step 4-3: Protocol execution unit 202 2 is HE(Val 1 ) is re-encrypted and then rearranged by random permutation σ. Hereinafter, the rearranged data is referred to as HE(Val' 1 )

[0049] Step 4-4: Protocol execution unit 202 2 is σ(h 2 (h 1 (ID 1 ))) is calculated. Hereafter, the result after this calculation is called h 2 (h 1 (ID' 1 ))

[0050] Step 5: Participant device 10 2 Protocol execution unit 202 2 Is, h 2 (h 1 (ID' 1 )) and HE (Val' 1 ) and h 2 (ID 2 ) to the participant device 10 1 Send to.

[0051] Step 6: Participant device 10 1 Protocol execution unit 202 1 Is, h 2 (h 1 (ID' 1 )) and HE (Val' 1 ) and h2 (ID 2 ) is received, the following steps 6-1 to 6-2 are executed.

[0052] Step 6-1: Protocol execution unit 202 1 Is, h 1 (h 2 (ID 2 )) to calculate.

[0053] Step 6-2: Protocol execution unit 202 1 Is, h 1 (h 2 (ID 2 )) and h 2 (h 1 (ID' 1 )) and for each m, h 1 (h 2 (ID 2 )) [m] = h 2 (h 1 (ID' 1 )) [j]. If such a j is found, the protocol execution unit 202 1 is HE(Val' 1 ) [j] is re-encrypted to generate a value HE(Val'' 1 ) [m]. On the other hand, h 1 (h 2 (ID 2 )) [m] = h 2 (h 1 (ID' 1 )) If j that is [j] is not found, the protocol execution unit 202 1 creates a value by encrypting a dummy value, and 1 ) [m].

[0054] Step 7: Participant device 10 1 Protocol execution unit 202 1 is HE(Val'' 1 ) [m] HE(Val'' 1 ) to the participant device 10 2 Send to.

[0055] This realizes a secure binding with reduced communication volume and memory usage compared to the secure binding described in Reference 2. Note that although no post-processing is performed in the above example, φ j -1 By Val'' 1 Post-processing may be performed to restore the value of [m].

[0056] <Summary> As described above, focusing on the fact that a cryptographic protocol that uses a database as input can be used normally even if the qualitative data is temporarily replaced with appropriate data, the cryptographic protocol execution system 1 according to this embodiment reduces the input data size to the cryptographic protocol. This makes it possible to reduce the communication volume and memory usage of a cryptographic protocol that uses a database as input, and in some cases, the calculation time, and as a result, it becomes possible to improve the performance of the cryptographic protocol.

[0057] The present invention is not limited to the above-described specifically disclosed embodiments, and various modifications, changes, and combinations with known technologies are possible without departing from the scope of the claims.

[0058] [References] Reference 1: Koji Chida et al. Communication-Efficient Inner Product Private Join and Compute with Cardinality. 2022. url: https: / / eprint.iacr.org / 2022 / 338 (visited on 02 / 21 / 2023). preprint. Reference 2: International Publication No. 2022 / 244226

[0059] REFERENCE SIGNS LIST 1 Cryptographic protocol execution system 10 Participant device 20 Communication network 101 Input device 102 Display device 103 External I / F 103a Recording medium 104 Communication I / F 105 RAM 106 ROM 107 Auxiliary storage device 108 Processor 109 Bus 201 Pre-processing unit 202 Protocol execution unit 203 Post-processing unit 204 Storage unit

Claims

1. An input data amount reduction device for reducing the amount of input data to a cryptographic protocol that uses a database as input, comprising: j A bijection φ from (1≦j≦k) to numbers j :R j →H j ⊂ N (where N is the set of all natural numbers), the database D i Each record r = (r 0 , r 1 , ..., r k )∈R 0 ×R 1 ×...×R k (However, R 0 is a set of quantitative data) j ∈R j (1≦j≦k) as φ j (r j ) and a preprocessing unit for compressing each (r 0 , φ 1 (r 1 ), ..., φ k (r k and a protocol execution unit that executes the cryptographic protocol between another device connected via a communication network, using a database configured as an input to the cryptographic protocol, the database being configured as an input to the cryptographic protocol and the other device connected via a communication network.

2. The element of the output data of the cryptographic protocol is φ j (R j ), the element of the output data is set to φ j -1 By R j 2. The input data amount reducing device according to claim 1, further comprising a post-processing unit for restoring the input data amount to elements of said first input data.

3. The aforementioned database D i 3. The input data amount reducing device according to claim 1, wherein:

4. The bijection φ j is calculated by using a serial number or a hash function. j For all elements of H without omission or duplication, j After assigning numbers to the elements of R j a first dictionary type data set having the elements of R as keys and the numbers as values; j and second dictionary-type data having values ​​of elements of the above formula (1).

5. An input data amount reduction method executed by an input data amount reduction device for reducing the amount of input data to a cryptographic protocol that uses a database as input, comprising: j A bijection φ from (1≦j≦k) to numbers j :R j →H j ⊂ N (where N is the set of all natural numbers), the database D i Each record r = (r 0 , r 1 , ..., r k )∈R 0 ×R 1 ×...×R k (However, R 0 is a set of quantitative data) j ∈R j (1≦j≦k) as φ j (r j ), and a pre-processing step of compressing each (r 0 , φ 1 (r 1 ), ..., φ k (r k and a protocol execution step of executing the cryptographic protocol between another device connected via a communication network and the cryptographic protocol using a database configured as an input to the cryptographic protocol, the database being configured as an input to the cryptographic protocol and a database configured as an input to the cryptographic protocol.

6. An input data reduction device for reducing the amount of input data to a cryptographic protocol that uses a database as input, comprising: j A bijection φ from (1≦j≦k) to numbers j :R j →H j ⊂ N (where N is the set of all natural numbers), the database D i Each record r = (r 0 , r 1 , ..., r k )∈R 0 ×R 1 ×...×R k (However, R 0 is a set of quantitative data) j ∈R j (1≦j≦k) as φ j (r j ), and a pre-processing step of compressing each (r 0 , φ 1 (r 1 ), ..., φ k (r k a protocol execution procedure for executing the cryptographic protocol between another device connected via a communication network, using a database consisting of a plurality of cryptographic protocols as input to the cryptographic protocol, the plurality of cryptographic protocols being stored in a database, and a program for executing the cryptographic protocol between the other device and the cryptographic protocol, the plurality of cryptographic protocols being stored in a database, and

Citation Information

Patent Citations

  • File volume reduction method

    JP1995064833A

  • Information processing system and information processing method

    JP2022053676A