US Patent Application 18029375. SECURE EXPONENT UNIFICATION SYSTEM, SECURE EXPONENT UNIFICATION APPARATUS, SECURE EXPONENT UNIFICATION METHOD, SECURE SUM COMPUTING SYSTEM, SECURE SUM-OF-PRODUCT COMPUTING SYSTEM, AND PROGRAM simplified abstract

From WikiPatents
Jump to navigation Jump to search

SECURE EXPONENT UNIFICATION SYSTEM, SECURE EXPONENT UNIFICATION APPARATUS, SECURE EXPONENT UNIFICATION METHOD, SECURE SUM COMPUTING SYSTEM, SECURE SUM-OF-PRODUCT COMPUTING SYSTEM, AND PROGRAM

Organization Name

Nippon Telegraph and Telephone Corporation


Inventor(s)

Dai Ikarashi of Musashino-shi, Tokyo (JP)

SECURE EXPONENT UNIFICATION SYSTEM, SECURE EXPONENT UNIFICATION APPARATUS, SECURE EXPONENT UNIFICATION METHOD, SECURE SUM COMPUTING SYSTEM, SECURE SUM-OF-PRODUCT COMPUTING SYSTEM, AND PROGRAM - A simplified explanation of the abstract

This abstract first appeared for US patent application 18029375 titled 'SECURE EXPONENT UNIFICATION SYSTEM, SECURE EXPONENT UNIFICATION APPARATUS, SECURE EXPONENT UNIFICATION METHOD, SECURE SUM COMPUTING SYSTEM, SECURE SUM-OF-PRODUCT COMPUTING SYSTEM, AND PROGRAM

Simplified Explanation

This patent application describes a technique for securely and efficiently standardizing the exponent parts of floating point numbers. The technique involves a secret exponent part uniforming system that takes a share of a floating point vector and calculates a share of another floating point vector with standardized exponent parts.

  • The system ensures that the exponent parts of the resulting vector are uniform and satisfies the condition 2a≒2b.
  • It utilizes a mantissa part calculation means to calculate the share of the resulting vector by performing calculations on the individual elements of the input share.
  • The mantissa part calculation means calculates the share of the resulting vector by using the i-th element of the input share and the i-th element of a converted share obtained through replicated secret sharing.
  • The resulting vector has the same exponent parts for all elements and is represented by a share b.
  • The system ensures that the maximum exponent part among all elements of the resulting vector is used for all elements.


Original Abstract Submitted

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, ρ) of a floating point vector (a= (a,..., a), ρ=(ρ, ..., ρ)), calculates a share (b, ρ) of a floating point vector with uniformed exponent parts (b= (b,..., b), ρ=(ρ, ..., ρ) (ρ=max{ρ, ..., ρ}), 2a≒2b is satisfied), comprises a mantissa part calculation means for calculating a share b by calculating a share b (b=2a) of the number b from the i-th element of the share a and the i-th element of a share <<ρ>> converted by replicated secret sharing from a share