Loading patent…
AssigneeNTT, Inc.
InventorDai Ikarashi
Estimating the term…
Provided is a secure computation technique for efficiently uniforming exponent parts of floating points. A secret exponent part uniforming system which, from a share ([[→a]]P, [[→ρ]]Q) of a floating point vector (→a=(a0, . . . , am-1), →ρ=(ρ0, . . . , ρm-1)), calculates a share ([[→b]]P, [[→ρmax]]Q) of a floating point vector with uniformed exponent parts (→b=(b0, . . . , bm-1), →ρmax=(ρmax, . . . , ρmax) (ρmax=max{ρ0, . . . , ρm-1}), 2ρ_iai≈2ρ_maxbi is satisfied), comprises a mantissa part calculation means for calculating a share [[→b]]P by calculating a share [[bi]]P (bi=2−ρ_dif,iai) of the number bi from the i-th element of the share [[→a]]P and the i-th element of a share <<→ρdif>>Q converted by replicated secret sharing from a share [[→ρdif]]Q=[[→ρ]]−[[→ρmax]]Q.
A secret exponent part uniforming system where P is a prime number and Q is an order of a residue ring, the secret exponent part uniforming system which is comprised of three or more secret exponent part uniforming apparatuses connected via a communication network in a multi-party protocol, and each calculates, from a share (((→a))P, ((→ρ))Q) of a floating point vector (→a, →ρ) (provided that →a=(a0, a1, . . . , am-1), →ρ=(ρ0, ρ1, . . . , ρm-1)), a share (((→b))P, ((→ρmax))Q) of a floating point vector (→b, →ρmax) obtained by uniforming exponent parts of the floating point vector (→a, →ρ) (provided that →b=(b0, b1, . . . , bm-1), →ρmax=(ρmax, ρmax, . . . , ρmax) (provided that ρmax=max{ρ0, ρ1, . . . , ρm-1}, |→ρmax|=m), 2ρ_iai≈2ρ_maxbi(0≤i<m) is satisfied), the secret exponent part uniforming system comprising:
A secret exponent part uniforming apparatus in a secret exponent part uniforming system where P is a prime number and Q is an order of a residue ring, the secret exponent part uniforming system which is comprised of three or more secret exponent uniforming apparatuses connected via a communication network in a multi-party protocol, and each calculates, from a share (((→a))P, ((→ρ))Q) of a floating point vector (→a, →ρ) (provided that →a=(a0, a1, . . . , am-1), →ρ=(ρ0, ρ1, . . . , ρm-1)), a share (((→b))P, ((→ρmax))Q) of a floating point vector (→b, →ρmax) which is obtained by uniforming exponent parts of the floating point vector (→a, →ρ) (provided that →b=(b0, b1, . . . , bm-1), →ρmax=(ρmax, ρmax, . . . , ρmax) (provided that ρmax=max{ρ0, ρ1, . . . , ρm-1}, |→ρmax|=m), 2ρ_iai≈2ρ_maxbi (0≤i<m) is satisfied), the secret exponent part uniforming apparatus comprising:
A secret exponent part uniforming method where P is a prime number and Q is an order of a residue ring, the secret exponent part uniforming method by which, from a share (((→a))P, ((→ρ))Q) of a floating point vector (→a, →ρ) (provided that →a=(a0, a1, . . . , am-1), →ρ=(ρ0, ρ1, . . . , ρm-1)), a share (((→b))P, ((→ρmax))Q) of a floating point vector (→b, →ρmax) which is obtained by uniforming exponent parts of the floating point vector (→a, →ρ) (provided that →b=(b0, b1, . . . , bm-1), →ρmax=(ρmax, ρmax, . . . , ρmax) (provided that ρmax=max{ρ0, ρ1, . . . , ρm-1}, |→ρmax|=m), 2ρ_iai≈2ρ_maxbi (0≤i<m) is satisfied) is calculated by using a secret exponent part uniforming system comprised of three or more secret exponent uniforming apparatuses connected via a communication network in a multi-party protocol, the secret exponent part uniforming method comprising:
Dependencies are inferred from the claim text.