WO2021070317A1 - 近似関数計算装置、方法及びプログラム - Google Patents
近似関数計算装置、方法及びプログラム Download PDFInfo
- Publication number
- WO2021070317A1 WO2021070317A1 PCT/JP2019/039989 JP2019039989W WO2021070317A1 WO 2021070317 A1 WO2021070317 A1 WO 2021070317A1 JP 2019039989 W JP2019039989 W JP 2019039989W WO 2021070317 A1 WO2021070317 A1 WO 2021070317A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- function
- error
- upper bound
- interval
- calculation unit
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/17—Function evaluation by approximation methods, e.g. inter- or extrapolation, smoothing, least mean square method
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/085—Secret sharing or secret splitting, e.g. threshold schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
Definitions
- the present invention relates to a method of creating an approximate function for each interval for approximating a function.
- secret calculation There is a method called secret calculation as a method of obtaining a specific calculation result without restoring the encrypted numerical value.
- encryption is performed by distributing numerical fragments among three secret computing devices, and the three secret computing devices perform cooperative calculation, so that addition / subtraction and constant addition are performed without restoring the numerical values.
- Multiplication, constant multiple, logical operation (negative, logical product, logical sum, exclusive OR), data format conversion (integer, binary number) results are distributed to three secret arithmetic units, that is, encrypted. It can be held as it is.
- An object of the present invention is to provide an approximation function calculation device, a method, and a program that realizes an approximation for each section of the entire domain with a smaller number of sections than before.
- x 0 , x 1 is a predetermined number satisfying the relation x 0 ⁇ x 1
- D [x 0 , x 1 ] is the function f (x).
- ⁇ is the error allowed in the approximation and is a predetermined number
- k is a predetermined integer greater than or equal to
- b is a number that satisfies the relationship x 0 ⁇ b ⁇ x 1.
- the function g b (x) is the Taylor expansion up to order k at b of the function f (x), a Taylor expansion unit for obtaining the function g b (x), the interval [x 0, b] in the function g b (Using the first error upper bound calculation unit that finds the upper bound of the error of the approximation of the function f (x) by x) and the upper bound of the error obtained by the processing of the first error upper bound calculation unit, the interval [x 0 , b] The expansion position calculation unit that finds the expansion position b', which is the maximum b where the upper bound of the approximation error of the function f (x) by the function g b (x) is ⁇ or less, and x 2 is b'.
- the output error can be reduced even when the parameter contains an error, and the approximation for each section of the entire domain can be realized with a small number of sections.
- FIG. 1 is a diagram showing an example of a functional configuration of an approximate function calculation device.
- FIG. 2 is a diagram showing an example of a processing procedure of the approximate function calculation method.
- FIG. 3 is a diagram showing an example of a functional configuration of a computer.
- the approximate function calculation device includes a Taylor expansion unit 1, a first error upper bound calculation unit 2, an expansion position calculation unit 3, a second error upper bound calculation unit 4, a right end position calculation unit 5, and an output unit. 6 and a control unit 7 are provided, for example.
- the approximate function calculation method is realized, for example, by each component of the approximate function calculation device performing the processes of steps S1 to S7 described below and shown in FIG.
- the Taylor expansion unit 1 obtains the function g b (x) (step S1).
- the obtained function g b (x) is output to the first error upper bound calculation unit 2 and the second error upper bound calculation unit 4. Further, the function g b' (x) corresponding to the expansion position b'obtained by the expansion position calculation unit 3 described later is output to the output unit 6.
- k is a given integer greater than or equal to 0
- b is a number that satisfies the relationship x 0 ⁇ b ⁇ x 1
- the function g b (x) is the Taylor expansion of the function f (x) up to the kth order in b. is there.
- the function g b (x) is expressed by, for example, the following equation.
- f (i) is a function obtained by differentiating the function f i times.
- the first error upper bound calculation unit 2 obtains the upper bound of the approximation error of the function f (x) by the function g b (x) in the interval [x 0 , b] (step S2).
- the "upper bound of the error” is more specifically the "upper bound of the absolute value of the error”.
- the upper bound of the obtained error is output to the expansion position calculation unit 3.
- the expansion position calculation unit 3 uses the upper bound of the error obtained by the processing of the first error upper bound calculation unit 2 to approximate the function f (x) by the function g b (x) in the interval [x 0 , b].
- the expansion position b' which is the maximum b whose upper bound of the error is ⁇ or less, is obtained (step S3).
- the obtained expansion position b' is output to the second error upper bound calculation unit 4, the right end position calculation unit 5, and the output unit 6.
- the Taylor expansion unit 1 finds the functions g b0 (x), g b1 (x), ..., g bN (x) corresponding to b0, b1, ..., bN at predetermined intervals in the interval D. And. Suppose b0 ⁇ b1 ⁇ ... ⁇ bN.
- the first error upper bound calculation section 2, i 1, 2, ..., as N, the interval [x 0, b i] in the function g bi error of approximation (x) by the function f (x) Upper bound ei is required.
- the expansion position calculation unit 3 finds the maximum i such that ei ⁇ ⁇ . In this case, the bi corresponding to this maximum i is the expansion position b'.
- the expansion position calculation unit 3 may obtain the expansion position b'by the binary search method.
- the second error upper bound calculation unit 4 obtains the upper bound of the approximation error of the function f (x) by the function g b' (x) in the interval [b', x 2] (step S4).
- x 2 is a number that satisfies b' ⁇ x 2 ⁇ x 1.
- the upper bound of the obtained error is output to the rightmost position calculation unit 5.
- the right end position calculator 5 with an upper bound of Motoma' error by processing the second error upper bound calculation unit 4, the interval [b ', x 2] function in g b' by the function f of the approximation (x) Find the rightmost position x 2 ', which is the maximum x 2 where the upper bound of the error is ⁇ or less (step S5).
- Motoma' right end position x 2 ' is output to the output section 6.
- r0, r1, ..., rN be the positions of predetermined intervals in the interval [b', x 2].
- Upper bound ei is required.
- the rightmost position calculation unit 5 finds the maximum i such that ei ⁇ ⁇ . In this case, the ri corresponding to this maximum i is the rightmost position x 2 '.
- the binary search may be obtained right end position x 2 '.
- Output unit 6 The output unit 6, is deployed position calculating section 3 deployed position b obtained is input 'is and right position calculator 5 rightmost position x 2 obtained'. Further, the function g b' (x) corresponding to the expansion position b'is input to the output unit 6 from the Taylor expansion unit 1.
- the output unit 6 outputs the interval [x 0 , x 2 '] and the information about the function g b' (x) (step S6).
- Control unit 7 The control unit 7 has the interval [x 2 ', x 1 ] as the interval D, the Taylor expansion unit 1, the first error upper bound calculation unit 2, the expansion position calculation unit 3, the second error upper bound calculation unit 4, and the right end.
- the processing of the position calculation unit 5 and the output unit 6 is repeated (step S7). This process is performed while x 2 ' ⁇ x 1 .
- control unit 7 updates the interval D to [x 2 ', x 1 ], and performs the processing after step S1 again.
- the error of the coefficient of x k was expanded by about
- the expansion of the coefficient error can be suppressed to about (x 1 -x 0 ) k times. For this reason, it is possible to set a wide section even for a section far from the origin, which was conventionally forced to set a narrow section in order to achieve a desired error, and the number of sections can be reduced. it can.
- ⁇ 2 ((
- the first error upper bound calculation unit 2 sets ⁇ 1 + ⁇ 2 when the predetermined interval R is the interval [x 0 , b] as the function f by the function g b (x) in the interval [x 0 , b]. It may be an upper bound of the approximation error of (x).
- ⁇ j is the upper bound of the truncation error of a j
- ⁇ * is the upper bound of the truncation error of b.
- the second error upper bound calculation unit 4 sets ⁇ 1 + ⁇ 2 as the interval [b', x 2 ] when the predetermined interval R is the interval [b', x 2 ] as the function g b' ( It may be an upper bound of the approximation error of the function f (x) by x).
- the expansion position calculation unit 3 may output the information of the position b corresponding to the upper bound of the error, which is necessary for obtaining the expansion position b', to the first error upper bound calculation unit 2.
- the first error upper bound calculation unit 2 may obtain the upper bound of the error corresponding to the position after receiving the information of the position b corresponding to the upper bound of the error.
- the first error upper bound calculation unit 2 may output the information of the position b for obtaining the upper bound of the error to the Taylor expansion unit 1.
- the Taylor expansion unit 1 may obtain the function g b (x) corresponding to the position b after receiving the information of the position b for obtaining the upper bound of the error from the first error upper bound calculation unit 2. ..
- data may be exchanged directly between the constituent parts of the approximate function calculation device, or may be performed via a storage unit (not shown).
- the program that describes this processing content can be recorded on a computer-readable recording medium.
- the computer-readable recording medium may be, for example, a magnetic recording device, an optical disk, a photomagnetic recording medium, a semiconductor memory, or the like.
- the distribution of this program is carried out, for example, by selling, transferring, renting, etc., portable recording media such as DVDs and CD-ROMs on which the program is recorded. Further, the program may be stored in the storage device of the server computer, and the program may be distributed by transferring the program from the server computer to another computer via a network.
- a computer that executes such a program first stores, for example, a program recorded on a portable recording medium or a program transferred from a server computer in its own storage device. Then, when the process is executed, the computer reads the program stored in its own storage device and executes the process according to the read program. Further, as another execution form of this program, a computer may read the program directly from a portable recording medium and execute processing according to the program, and further, the program is transferred from the server computer to this computer. Each time, the processing according to the received program may be executed sequentially. In addition, the above processing is executed by a so-called ASP (Application Service Provider) type service that realizes the processing function only by the execution instruction and result acquisition without transferring the program from the server computer to this computer. May be.
- the program in this embodiment includes information to be used for processing by a computer and equivalent to the program (data that is not a direct command to the computer but has a property of defining the processing of the computer, etc.).
- the present device is configured by executing a predetermined program on the computer, but at least a part of these processing contents may be realized by hardware.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Analysis (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Complex Calculations (AREA)
- Machine Translation (AREA)
Abstract
Description
近似関数計算装置は、図1に示すように、テイラー展開部1、第一誤差上界計算部2、展開位置計算部3、第二誤差上界計算部4、右端位置計算部5、出力部6及び制御部7を例えば備えている。
テイラー展開部1には、区間D=[x0,x1]についての情報が入力される。区間Dは、関数f(x)を近似したい区間である。x0,x1はx0<x1の関係を満たす所定の数である。後述するように、区間Dは、制御部7により更新される。
ai=f(i)(a)/i!
第一誤差上界計算部2には、テイラー展開部1が求めた関数gb(x)が入力される。
展開位置計算部3には、第一誤差上界計算部2が求めた誤差の上界が入力される。
第二誤差上界計算部4には、展開位置計算部3が求めた展開位置b'が入力される。
右端位置計算部5には、第二誤差上界計算部4が求めた誤差の上界が入力される。
出力部6には、展開位置計算部3が求めた展開位置b'及び右端位置計算部5が求めた右端位置x2'が入力される。また、出力部6には、展開位置b'に対応する関数gb'(x)がテイラー展開部1から入力される。
制御部7は、区間[x2',x1]を区間Dとする、テイラー展開部1、第一誤差上界計算部2、展開位置計算部3、第二誤差上界計算部4、右端位置計算部5及び出力部6の処理を繰り返す(ステップS7)。この処理は、x2'≠x1である間行われる。制御部7は、x2'=x1である場合には、処理を終了する。
テイラー展開に対応する剰余項の絶対値の上界はε1であり、Δjはajの誤差の上界であり、Δ*はbの誤差の上界であり、Rは所定の区間でありwはw=maxx∈R|x-b|であり、ε2は以下の式により定義されるとして、
ε2=((|a0|+Δ0)+(|a1|+Δ1)(w+Δ*)+…+(|ak|+Δk)(w+Δ*)k)-(|a0|+|a1|w+…+|ak|wk)
第一誤差上界計算部2は、所定の区間Rを区間[x0,b]としたときのε1+ε2を、区間[x0,b]における関数gb(x)による関数f(x)の近似の誤差の上界としてもよい。
上記説明した各装置における各種の処理機能をコンピュータによって実現する場合、各装置が有すべき機能の処理内容はプログラムによって記述される。そして、このプログラムをコンピュータで実行することにより、上記各装置における各種の処理機能がコンピュータ上で実現される。例えば、上述の各種の処理は、図3に示すコンピュータの記録部2020に、実行させるプログラムを読み込ませ、制御部2010、入力部2030、出力部2040などに動作させることで実施できる。
Claims (4)
- x0,x1はx0<x1の関係を満たす所定の数であり、D=[x0,x1]は関数f(x)を近似したい区間であり、εは近似で許容される誤差であり所定の数であり、kは所定の0以上の整数であり、bはx0<b<x1の関係を満たす数であり、関数gb(x)は関数f(x)のbにおけるk次までのテイラー展開であり、
関数gb(x)を求めるテイラー展開部と、
区間[x0,b]における関数gb(x)による関数f(x)の近似の誤差の上界を求める第一誤差上界計算部と、
前記第一誤差上界計算部の処理により求まった誤差の上界を用いて、区間[x0,b]における関数gb(x)による関数f(x)の近似の誤差の上界がε以下となる最大のbである展開位置b'を求める展開位置計算部と、
x2はb'<x2≦x1を満たす数であり、区間[b',x2]における関数gb'(x)による関数f(x)の近似の誤差の上界を求める第二誤差上界計算部と、
前記第二誤差上界計算部の処理により求まった誤差の上界を用いて、区間[b',x2]における関数gb'による関数f(x)の近似の誤差の上界がε以下となる最大のx2である右端位置x2'を求める右端位置計算部と、
区間[x0,x2']と、関数gb'(x)についての情報とを出力する出力部と、
区間[x2',x1]を前記区間Dとする、前記テイラー展開部、前記誤差上界計算部、前記展開位置計算部、前記右端位置計算部及び前記出力部の処理を繰り返す制御部と、
を含む近似関数計算装置。 - 請求項1の近似関数計算装置であって、
前記関数gb(x)は、以下の式により表され、
gb(x)=a0+a1(x-b)+…+ak(x-b)k
ai=f(i)(a)/i!
前記テイラー展開に対応する剰余項の絶対値の上界はε1であり、Δjはajの誤差の上界であり、Δ*はbの誤差の上界であり、Rは所定の区間でありwはw=maxx∈R|x-b|であり、ε2は以下の式により定義されるとして、
ε2=((|a0|+Δ0)+(|a1|+Δ1)(w+Δ*)+…+(|ak|+Δk)(w+Δ*)k)-(|a0|+|a1|w+…+|ak|wk)
前記第一誤差上界計算部は、前記所定の区間Rを区間[x0,b]としたときのε1+ε2を前記誤差の上界とし、
前記第二誤差上界計算部は、前記所定の区間Rを区間[b',x2]としたときのε1+ε2を前記誤差の上界とする、
近似関数計算装置。 - x0,x1はx0<x1の関係を満たす所定の数であり、D=[x0,x1]は関数f(x)を近似したい区間であり、εは近似で許容される誤差であり所定の数であり、kは所定の0以上の整数であり、bはx0<b<x1の関係を満たす数であり、関数gb(x)は関数f(x)のbにおけるk次までのテイラー展開であり、
テイラー展開部が、関数gb(x)を求めるテイラー展開ステップと、
第一誤差上界計算部が、区間[x0,b]における関数gb(x)による関数f(x)の近似の誤差の上界を求める第一誤差上界計算ステップと、
展開位置計算部が、前記第一誤差上界計算部の処理により求まった誤差の上界を用いて、区間[x0,b]における関数gb(x)による関数f(x)の近似の誤差の上界がε以下となる最大のbである展開位置b'を求める展開位置計算ステップと、
第二誤差上界計算部が、x2はb'<x2≦x1を満たす数であり、区間[b',x2]における関数gb'(x)による関数f(x)の近似の誤差の上界を求める第二誤差上界計算ステップと、
右端位置計算部が、前記第二誤差上界計算部の処理により求まった誤差の上界を用いて、区間[b',x2]における関数gb'による関数f(x)の近似の誤差の上界がε以下となる最大のx2である右端位置x2'を求める右端位置計算ステップと、
出力部が、区間[x0,x2']と、関数gb'(x)についての情報とを出力する出力ステップと、
制御部が、区間[x2',x1]を前記区間Dとする、前記テイラー展開部、前記誤差上界計算部、前記展開位置計算部、前記右端位置計算部及び前記出力部の処理を繰り返す制御ステップと、
を含む近似関数計算方法。 - 請求項1又は2の近似関数計算装置の各部としてコンピュータを機能させるためのプログラム。
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201980101098.0A CN114503102A (zh) | 2019-10-10 | 2019-10-10 | 近似函数计算装置、方法以及程序 |
JP2021551033A JP7318721B2 (ja) | 2019-10-10 | 2019-10-10 | 近似関数計算装置、方法及びプログラム |
AU2019469886A AU2019469886B2 (en) | 2019-10-10 | 2019-10-10 | Approximate function calculation apparatus, method and program |
US17/762,740 US20220335104A1 (en) | 2019-10-10 | 2019-10-10 | Approximate function calculation apparatus, method and program |
EP19948481.7A EP4044050A4 (en) | 2019-10-10 | 2019-10-10 | DEVICE, METHOD AND PROGRAM FOR APPROXIMATE FUNCTIONAL CALCULATION |
PCT/JP2019/039989 WO2021070317A1 (ja) | 2019-10-10 | 2019-10-10 | 近似関数計算装置、方法及びプログラム |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2019/039989 WO2021070317A1 (ja) | 2019-10-10 | 2019-10-10 | 近似関数計算装置、方法及びプログラム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2021070317A1 true WO2021070317A1 (ja) | 2021-04-15 |
Family
ID=75438115
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2019/039989 WO2021070317A1 (ja) | 2019-10-10 | 2019-10-10 | 近似関数計算装置、方法及びプログラム |
Country Status (6)
Country | Link |
---|---|
US (1) | US20220335104A1 (ja) |
EP (1) | EP4044050A4 (ja) |
JP (1) | JP7318721B2 (ja) |
CN (1) | CN114503102A (ja) |
AU (1) | AU2019469886B2 (ja) |
WO (1) | WO2021070317A1 (ja) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013025467A (ja) * | 2011-07-19 | 2013-02-04 | Hitachi Advanced Digital Inc | 対数関数の近似演算回路 |
WO2017119211A1 (ja) * | 2016-01-07 | 2017-07-13 | ソニー株式会社 | 情報処理装置、情報処理システム、および情報処理方法、並びにプログラム |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8397187B2 (en) * | 2010-04-23 | 2013-03-12 | International Business Machines Corporation | Verifying the error bound of numerical computation implemented in computer systems |
US9015217B2 (en) * | 2012-03-30 | 2015-04-21 | Apple Inc. | Transcendental and non-linear components using series expansion |
-
2019
- 2019-10-10 WO PCT/JP2019/039989 patent/WO2021070317A1/ja unknown
- 2019-10-10 CN CN201980101098.0A patent/CN114503102A/zh active Pending
- 2019-10-10 US US17/762,740 patent/US20220335104A1/en active Pending
- 2019-10-10 JP JP2021551033A patent/JP7318721B2/ja active Active
- 2019-10-10 AU AU2019469886A patent/AU2019469886B2/en active Active
- 2019-10-10 EP EP19948481.7A patent/EP4044050A4/en active Pending
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2013025467A (ja) * | 2011-07-19 | 2013-02-04 | Hitachi Advanced Digital Inc | 対数関数の近似演算回路 |
WO2017119211A1 (ja) * | 2016-01-07 | 2017-07-13 | ソニー株式会社 | 情報処理装置、情報処理システム、および情報処理方法、並びにプログラム |
Non-Patent Citations (3)
Title |
---|
MISHINA, IBUKI ET AL.: ""Designs and Implementations of Efficient and Accurate Secret Logistic Regression"", PROCEEDINGS OF COMPUTER SECURITY SYMPOSIUM 2018 (CSS2018), 25 October 2018 (2018-10-25), XP009522747 * |
MISHINA, IBUKI ET AL.: "Can the Logistic Regression in Secure Computation Really be Used?", PREPRINTS OF THE 2019 SYMPOSIUM ON CRYPTOGRAPHY AND INFORMATION SECURITY; JANUARY 22-25, 2019, IEICE, JP, 31 December 2018 (2018-12-31) - 25 January 2019 (2019-01-25), JP, pages 1 - 8, XP009530138 * |
See also references of EP4044050A4 * |
Also Published As
Publication number | Publication date |
---|---|
CN114503102A (zh) | 2022-05-13 |
US20220335104A1 (en) | 2022-10-20 |
JP7318721B2 (ja) | 2023-08-01 |
AU2019469886B2 (en) | 2023-04-27 |
AU2019469886A1 (en) | 2022-04-07 |
EP4044050A1 (en) | 2022-08-17 |
EP4044050A4 (en) | 2023-06-21 |
JPWO2021070317A1 (ja) | 2021-04-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP7067632B2 (ja) | 秘密シグモイド関数計算システム、秘密ロジスティック回帰計算システム、秘密シグモイド関数計算装置、秘密ロジスティック回帰計算装置、秘密シグモイド関数計算方法、秘密ロジスティック回帰計算方法、プログラム | |
JP7092206B2 (ja) | 秘密シグモイド関数計算システム、秘密ロジスティック回帰計算システム、秘密シグモイド関数計算装置、秘密ロジスティック回帰計算装置、秘密シグモイド関数計算方法、秘密ロジスティック回帰計算方法、プログラム | |
AU2019461059B2 (en) | Secure softmax function calculation system, secure softmax function calculation apparatus, secure softmax function calculation method, secure neural network calculation system, secure neural network learning system, and program | |
JP6977882B2 (ja) | 秘密一括近似システム、秘密計算装置、秘密一括近似方法、およびプログラム | |
US11200346B2 (en) | Secure computation for reading multiple elements from a secure text array | |
WO2021070317A1 (ja) | 近似関数計算装置、方法及びプログラム | |
EP3096308B1 (en) | Element replication device, element replication method, and program | |
JP7205623B2 (ja) | 秘密共役勾配法計算システム、秘密計算装置、共役勾配法計算装置、秘密共役勾配法計算方法、共役勾配法計算方法、およびプログラム | |
CN111194448A (zh) | 伪数据生成装置及其方法和程序 | |
Henriques-Rodrigues et al. | A note on the PORT methodology in the estimation of a shape second-order parameter | |
JP6981473B2 (ja) | 秘密読み書き装置、秘密読み書き方法、およびプログラム | |
JP7472998B2 (ja) | パラメータ推定装置、秘密パラメータ推定システム、秘密計算装置、それらの方法、およびプログラム | |
CN113221116B (zh) | 镜像的摘要计算方法、装置、设备及可读存储介质 | |
JP7359225B2 (ja) | 秘密最大値計算装置、方法及びプログラム | |
WO2021070322A1 (ja) | 秘密多重反復計算装置、方法及びプログラム | |
JP7322976B2 (ja) | 秘密最大値計算装置、方法及びプログラム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 19948481 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2021551033 Country of ref document: JP Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 2019469886 Country of ref document: AU Date of ref document: 20191010 Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2019948481 Country of ref document: EP Effective date: 20220510 |