Secret random number generation system and method, secret computing device, and program product

By using pseudo-random functions and polynomials in secret calculations to generate random numbers that follow the binomial distribution, the problem of large noise generation traffic in the prior art is solved, and efficient output privacy protection is achieved.

CN114830210BActive Publication Date: 2024-12-03NIPPON TELEGRAPH & TELEPHONE CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980103026.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-12-19
Publication Date
2024-12-03
Estimated Expiration
2039-12-19

AI Technical Summary

Technical Problem

The prior art requires a large amount of communication volume when generating secret random noises that follow binomial distribution, resulting in inefficient communication and affecting the rapidity of secret computing.

Method used

Multiple secret computing devices are used to calculate through pseudo-random functions, keys and polynomials to generate random numbers that follow the binomial distribution, reducing the traffic volume and realizing the generation of random numbers without successive communication.

Benefits of technology

It effectively reduces traffic, improves the efficiency of secret calculations, and can effectively protect the output privacy of the calculation results.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114830210B_ABST
    Figure CN114830210B_ABST
Patent Text Reader

Abstract

A secret random number based on binomial distribution is generated without successive communications. i ) generates a share of random numbers r following a binomial distribution [r] i The parameter storage unit (10) stores a pseudo-random function PRF and at least one set of keys k A And the polynomial f A The pseudo-random number generation unit (11) uses each key k A Calculate the pseudo-random function PRF(k A ,a), or with each key k A The corresponding pseudo-random number p A The bit counting unit (12) counts each pseudo-random number p A The number of 1s contained in r A The random number share generation unit (13) obtains the number r of 1 A and the number of 1s r A The corresponding polynomial f A The sum of the products of the outputs of (i) is the share of the random number r [r] i .
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to secret computing technology and privacy protection technology. Background Art

[0002] Recently, as the application demand for private data represented by personal information increases, secret computing technology that can perform various calculations while keeping the information secret is attracting attention. Secret computing is a useful technology with various application examples (for example, refer to non-patent document 1). However, secret computing guarantees the correctness (legitimacy) of the calculation results, so it cannot cover the privacy of the calculation results, which is called "output privacy". In order to protect output privacy, for example, it is necessary to stir the calculation results based on random noise. In secret computing, such stirring and the generation of random noise also become a technical issue.

[0003] In response to such a problem, a method for generating secret random noise that follows a binomial distribution using secret computing is disclosed in Non-Patent Document 2. Since the noise that follows the binomial distribution is used to meet the output privacy protection benchmark known as differential privacy, Non-Patent Document 2 can be said to be a useful technology for achieving output privacy protection in secret computing.

[0004] Prior art literature

[0005] Non-patent literature

[0006] Non-Patent Document 1: Naoto Kiribuchi, Dai Igarashi, Hiroki Hamada, Ryo Kikuchi, "Programmable Secret Computing Library MEVAL3", Symposium on Cryptography and Information Security (SCIS), 2018

[0007] Non-patent document 2: C. Dwork, K, Kenthapadi, F. McSherry, I. Mironov, M. Naor, "Our data, ourselves: privacy via distributed noise generation", Advances in Cryptology, EUROCRYPT, LNCS 4004, pp. 486-503, 2006. Summary of the invention

[0008] Problems to be solved by the invention

[0009] However, in non-patent document 2, there is a problem that when noise is generated, a communication volume corresponding to the value range of the noise is required. The value range of the noise becomes extremely large depending on the value range of the calculation result as the protection object and the protection strength. Therefore, in order to achieve sufficient protection strength for any calculation, a correspondingly large communication volume is required. From the perspective of speeding up secret calculations, reducing this communication volume has become a major issue.

[0010] In view of the above-mentioned technical problem, an object of the present invention is to generate a secret random number in accordance with a binomial distribution without sequential communications.

[0011] Means for solving problems

[0012] In order to solve the above-mentioned problems, a secret random number generation system of one embodiment of the present invention is a secret random number generation system including multiple secret computing devices, which generates hidden values ​​of random numbers following binomial distribution, wherein the secret computing devices include: a storage unit, which is used to store pseudo-random functions, and at least one set of keys and polynomials; a pseudo-random number generation unit, which uses each key to calculate the pseudo-random function to obtain a pseudo-random number corresponding to each key; a bit counting unit, which counts the number of 1s contained in each pseudo-random number; and a random number share generation unit, which obtains the sum of the products of the number of 1s and the output of the polynomial corresponding to the number of 1s as the share of the random number.

[0013] Effects of the Invention

[0014] According to the present invention, a secret random number conforming to binomial distribution can be generated without sequential communication, and the output privacy in secret calculation can be effectively protected by using the secret random number to stir the calculation result. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 This is a diagram illustrating the functional structure of a secret random number generation system.

[0016] Figure 2 This is a diagram illustrating the functional structure of a secure computing device.

[0017] Figure 3 This is a diagram illustrating the processing procedure of the secret random number generation method.

[0018] Figure 4 This is a diagram illustrating a functional configuration of a computer. DETAILED DESCRIPTION

[0019] In this specification, "_" (underscore) in a subscript means that the character on the right is added to the character on the left in a subscript manner. b_c " means b c Append to a in subscript format.

[0020] First, the prior art that is a premise of the present invention will be described.

[0021] <Shamir's Secret Dispersion Method>

[0022] The Shamir secret distribution method is a method of distributing a secret value s into n pieces using a random polynomial f, and restoring the secret value s from any t pieces (for example, see reference 1). Hereinafter, a piece obtained by distributing a certain value is called a "share", and the set of all shares is called a "hidden value". The hidden value of a certain value · is represented by [·], and the i-th share of the hidden value [·] is represented by [·] i . Wherein, n is an integer greater than or equal to 3, and t is an integer satisfying n≥2t-1.

[0023] [Reference 1] A. Shamir, "How to share a secret," Communications of the ACM, Vol. 22, No. 11, pp. 612-613, 1979.

[0024] In Shamir's secret distribution method, first, for a finite field Z with a number of bits p p The secret s on which we choose a finite field Z p The t-1 degree polynomial f(x)=r t-1 x t-1 +…+r1x 1 +s. Among them, each r i is a finite field Z p At this point, we can obtain the shares of secret s [s]1,…,[s] n Each of them, as for example as [s] i =f(i). When restoring the secret s, polynomial interpolation is performed using any t or more non-repeating shares to find the constant term s of the polynomial f(x).

[0025] <Pseudo-random secret dispersion>

[0026] Pseudo-random secret distribution is a method of generating shares of uniform random numbers without communication using a pseudo-random function (for example, see Reference 2).

[0027] [Reference 2] R.Cramer, I.Damgard, and Y.Ishai, "Share conversion, pseudorandom secret-sharing and applications to secure computation," Theory of Cryptography, LNCS 3378, pp.342-362, 2005.

[0028] Pseudo-random function PRF: K×{0,1} α →Z p It takes as input a secret key and a bit string of length α and outputs a (roughly) uniform finite field Z p Here, K represents the key space. In addition, consider the distribution of shares in Shamir's secret distribution method among n parties P1, ..., P n In this case, the shares of random number r are shared by n parties as follows: [r]1,…,[r] n .

[0029] 1. First, a pseudo-random function key is shared among some parties in advance. Specifically, let A be a set of n-t+1 parties selected from n parties, and all n-t+1 parties included in set A share the key k A ∈K. On the contrary, the t-1 party not included in the set A does not obtain the key k A Similarly, for all conceivable sets A, they share different keys k A In addition, for all sets A, they share the corresponding t-degree polynomial f A . Among them, it is assumed that f A (0)=1 and f A (i)=0(P i is not included in set A).

[0030] 2. When random number generation is required, each party generates a pseudo-random number using a publicly used value a such as a timestamp. Specifically, when each party P i Included in set A j In the example, there is a key set {k A_j}, calculate the P of each party i [r] i ←Σ j PRF(k A_j ,a)·f A_j (i). Here, J is set to be the i The number of the set A to which it belongs, j is an integer greater than or equal to 1 and less than or equal to J.

[0031] Through the above process, all parties P i Available share [r] i Become a pseudo-random number r = Σ A PRF(k A ,a)’s share.

[0032] <Binomial Distribution>

[0033] It is known that a uniform random number r∈{0,1} in L bits L The number of 1s contained in becomes a random number following the binomial distribution Bin(L,1 / 2). If the pseudo-random function PRF: K×{0,1} α →{0,1} L With sufficient uniformity, it can be said that the number of 1s contained in the pseudo-random number PRF(k,a) also follows the binomial distribution Bin(L,1 / 2).

[0034] [Implementation Method]

[0035] Hereinafter, the embodiments of the present invention will be described in detail. In addition, the same reference numerals are given to components having the same functions in the drawings, and repeated descriptions are omitted.

[0036] The secret random number generation system of the embodiment is coordinated by N (≥3) secret computing devices to calculate a hidden value of a random value following a binomial distribution. In this embodiment, multi-party computing based on Shamir's secret sharing method is assumed.

[0037] For example Figure 1 As shown, the secret random number generation system 100 of the embodiment includes n (≥3) secret computing devices 11, ..., 1 n In this embodiment, the secure computing devices 11, ..., 1 n Each of the devices is connected to a communication network 9. The communication network 9 is a circuit switching or packet switching communication network configured so that each connected device can communicate with each other, such as the Internet, LAN (Local Area Network), WAN (Wide Area Network), etc. In addition, each device does not necessarily need to be able to communicate online via the communication network 9. For example, it can also be configured so that the input to the secret computing device 11, ..., 1 n The information is stored in a portable recording medium such as a magnetic tape or a USB memory, and is input from the portable recording medium to the secure computing device 11, ..., 1 in an offline manner. n .

[0038] For example Figure 2As shown, the secret computing device 1 included in the secret random number generation system 100 of the embodiment i (i=1, ..., n) comprises a parameter storage unit 10, a pseudo-random number generator 11, a bit counter 12, a random number share generator 13, and an output unit 14. i (i=1,…,n) and other secret computing devices 1 j (j=1,…,n, where i≠j) While performing coordination, the processing of each step described later is performed, thereby realizing the secret random number generation method of this embodiment.

[0039] Secret computing device 1 i For example, it is a special device that is configured by reading a special program into a well-known or special computer having a central processing unit (CPU), a main storage device (RAM), etc. i For example, each process is executed under the control of a central processing unit. i The data or data obtained through each process is stored in a main storage device, for example. The data stored in the main storage device is read out to the central processing unit as needed for other processing. i At least a part of each processing unit may also be constituted by hardware such as an integrated circuit. i Each storage unit may be composed of a main storage device such as RAM (Random Access Memory), an auxiliary storage device composed of a semiconductor storage element such as a hard disk, an optical disk or a flash memory, or middleware such as a relational database or a key value store.

[0040] Below, reference Figure 3 , describing the processing procedure of the secret random number generation method executed by the secret random number generation system 100 of the implementation mode.

[0041] The parameter storage unit 10 stores a pseudo-random function PRF:K×{0,1} α →{0,1} L , J keys {k A_1 ,…,k A_J} and J polynomials {f A_1 (x),…,f A_J (x)}.

[0042] In step S11, the pseudo-random number generator 11 generates a random number for each integer j that is greater than or equal to 1 and less than or equal to J using each key k stored in the parameter storage unit 10. A_j and parameter a, calculate the pseudo-random function PRF(k A_j ,a). Parameter a is, for example, a timestamp, etc. in all the secret computing devices 11,…,1 n The pseudo-random number generator 11 generates a parameter based on each key k. A_j The calculated pseudo-random number p A_j Output to the bit counting unit 12.

[0043] In step S12, the bit counting unit 12 obtains each pseudo-random number p for each integer j greater than or equal to 1 and less than or equal to J. A_j The number of 1s contained in r A_j The bit counting unit 12 counts the number of pseudo-random numbers p A_j Find the number of 1s r A_j Output to the random number share generation unit 13.

[0044] In step S13, the random number share generation unit 13 calculates the number r of 1 A_j With the polynomial f A_j (i) The sum of products of the outputs [r] i ←Σ j r A_j ·f A_j (i). Where i is the number of the secret computing device. i Become a random number r = Σ A r A The random number share generation unit 13 generates a share of random number r [r] i Output to the output unit 14.

[0045] In step S14, the output unit 14 outputs the share [r] of the random number r. i .

[0046] About the pseudo-random function PRF(k A , the output of a) is the L-bit pseudo-random number p A , the number of 1s contained in it is r A follows the binomial distribution Bin(L,1 / 2). Similarly, through all the keys k shared among the parties A The number r of 1s included in the calculated random number of N = (nCn-t+1) × L bits follows the binomial distribution Bin(N, 1 / 2). Here, nCn-t+1 represents the number of different n-t+1 combinations selected from different n. The number r of 1s satisfies r = Σ A r AIn addition, since all these calculations can be performed locally, there is no need for communication between the parties. The present invention is to utilize this property to obtain the share [r] of random numbers that follow the binomial distribution Bin(N,1 / 2) without communicating with each other. i , and as the entire system, generates a hidden value [r] of the random number r.

[0047] In the present invention, based on the pseudo-random secret dispersion method, the successive communication in the secret random number generation is not required. At this time, by changing the pseudo-random secret dispersion method for generating uniform random numbers, it is possible to generate random numbers that follow the binomial distribution, thereby significantly reducing the amount of communication compared to the existing method. In this way, according to the present invention, a secret random number that follows the binomial distribution and can be used for output privacy protection of secret calculation results can be generated without successive communications. In the existing method, each time a secret random number is generated, an amount of communication proportional to the value range N of the noise is required.

[0048] The embodiments of the present invention are described above, but the specific structure is not limited to these embodiments. Even if there are appropriate design changes, they are of course included in the present invention without departing from the scope of the present invention. The various processes described in the embodiments can be executed not only in a time series according to the order of the description, but also in parallel or individually according to the processing capacity or needs of the device executing the processing.

[0049] [Program, recording medium]

[0050] When the various processing functions in the devices described in the above embodiments are implemented by a computer, the processing contents of the functions that each device should have are described by a program. Then, by reading the program into Figure 4 In the storage unit 1020 of the computer shown, the control unit 1010, the input unit 1030, the output unit 1040, etc. are operated, and various processing functions in the above-mentioned devices are realized on the computer.

[0051] The program describing the processing contents can be recorded in a computer-readable recording medium. The computer-readable recording medium may be any medium such as a magnetic recording device, an optical disk, a magneto-optical recording medium, or a semiconductor memory.

[0052] In addition, the program can be circulated by selling, transferring, or lending a portable recording medium such as a DVD or CD-ROM on which the program is recorded. Furthermore, the program can also be stored in a storage device of a server computer and forwarded from the server computer to other computers via a network, thereby circulating the program.

[0053] The computer executing such a program, for example, first temporarily stores the program stored in a portable recording medium or the program forwarded from a server computer in its own storage device. Then, when executing the process, the computer reads the program stored in its own storage device and executes the process according to the read program. In addition, as another execution mode of the program, the computer can also directly read the program from the portable storage medium and execute the process according to the program, and can also execute the process according to the received program in sequence whenever the program is forwarded from the server computer to the computer. In addition, it can also be configured so that the program is not forwarded from the server computer to the computer, but the processing function is realized only by the execution instruction and the result acquisition, that is, the above-mentioned process is executed by the so-called ASP (Application Service Provider, Application Service Provider) type service. In addition, in the program of this method, it is set to include information used for the processing of the electronic computer and information in accordance with the program (not a direct instruction to the computer, but data with the nature of the processing of the computer, etc.).

[0054] In this embodiment, the present device is configured by executing a predetermined program on a computer, but at least a part of the processing contents may be realized only on hardware.

Claims

1. A secret random number generation system, comprising a plurality of secret computing devices, generating a secret random number generation system of a hidden value of a random number following a binomial distribution, wherein: The secret computing device comprises: A storage unit, used for storing a pseudo-random function, and at least one set of keys and polynomials; A pseudo-random number generating unit, which uses each of the keys to calculate the pseudo-random function to obtain a pseudo-random number corresponding to each of the keys; A bit counting unit, which counts the number of 1s contained in each of the pseudo-random numbers; a random number share generating unit, which obtains the product sum of the number of 1s and the output of the polynomial corresponding to the number of 1s as a share, wherein the share is a fragment obtained by dispersing the random number; and An output unit outputs the share of the random number.

2. A secret computing device, used in a secret random number generation system for generating a hidden value of a random number following a binomial distribution, comprising: A storage unit, used for storing a pseudo-random function, and at least one set of keys and polynomials; A pseudo-random number generating unit, which uses each of the keys to calculate the pseudo-random function to obtain a pseudo-random number corresponding to each of the keys; A bit counting unit, which counts the number of 1s contained in each of the pseudo-random numbers; A random number share generating unit, which obtains the product sum of the number of 1s and the output of the polynomial corresponding to the number of 1s as a share, wherein the share is a fragment obtained by dispersing the random number; as well as An output unit outputs the share of the random number.

3. A secret random number generation method, which is a secret random number generation method performed by a secret random number generation system that generates a hidden value of a random number following a binomial distribution, wherein: The storage unit stores a pseudo-random function, at least one set of keys and a polynomial, The pseudo-random number generating unit calculates the pseudo-random function using each of the keys to obtain a pseudo-random number corresponding to each of the keys. The bit counting unit counts the number of 1s contained in each of the pseudo-random numbers. The random number share generating unit obtains the product sum of the number of 1s and the output of the polynomial corresponding to the number of 1s as a share, wherein the share is a fragment obtained by dispersing the random number. The output unit outputs the share of the random number.

4. A computer program product, comprising a computer program, wherein the computer program is used to enable a computer to function as the secret computing device as described in claim 2.