Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
SECRET COLLECTIVE APPROXIMATION SYSTEM, SECRET CALCULATION DEVICE, SECRET COLLECTIVE APPROXIMATION METHOD, AND PROGRAM
Document Type and Number:
WIPO Patent Application WO/2019/225531
Kind Code:
A1
Abstract:
In the present invention, a calculation time period is reduced without decreasing approximate accuracy when a complex function is calculated by secret calculation. A secret collective approximation system (100) calculates a secret sentence [z] of an approximate value z of a function value y satisfying yj=f(xj), by using a secret sentence [x] of a value x as input. "g" is defined as a polynomial for approximating sections obtained by dividing a function f into m sections. For each of integers j in the range of 1 to n, a parameter acquisition unit (11) acquires a secret sentence [a] of a parameter a corresponding to the value x by defining aj as a parameter pi corresponding to a section Ri in which a value xj is included. A polynomial calculation unit (12) calculates a polynomial g([x],[a]) by using, as input, the secret sentence [x] of the value x by use of the secret sentence [a] of the parameter a, thus acquiring the secret sentence [z] of the approximate value z for the function value y.

Inventors:
HAMADA KOKI (JP)
Application Number:
PCT/JP2019/019846
Publication Date:
November 28, 2019
Filing Date:
May 20, 2019
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
NIPPON TELEGRAPH & TELEPHONE (JP)
International Classes:
G09C1/00; G06F17/10
Domestic Patent References:
WO2012102203A12012-08-02
Foreign References:
JPH07200537A1995-08-04
Other References:
HAMADA KOKI ET AL.: "A batch mapping algorithm for secure function evaluation", IEICE TECHNICAL REPORT, vol. 112, no. 126, 12 July 2012 (2012-07-12), pages 195 - 199, XP055511610
BICKSON, D. ET AL.: "Peer-to-Peer Secure Multi-Party Numerical Computation", EIGHTH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, September 2008 (2008-09-01), pages 257 - 266, XP031322348
BEN-EFRAIM, A.: "On Multiparty Garbling of Arithmetic Circuits", CRYPTOLOGY EPRINT ARCHIVE, 26 March 2018 (2018-03-26), pages 1 - 31, XP061026743
KOJI CHIDAKOKI HAMADADAI IKARASHIKATSUMI TAKAHASHI: "A Three-party Secure Function Evaluation with Lightweight Verifiability Revisited", CSS, 2010
LIINA KAMMJAN WILLEMSON: "Secure floating point arithmetic and private satellite collision analysis", INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 14, no. 6, 2015, pages 531 - 548, XP035577326, DOI: 10.1007/s10207-014-0271-8
KOKI HAMADADAI IKARASHIKOJI CHIDA: "A Batch Mapping Algorithm for Secure Function Evaluation", THE TRANSACTIONS OF THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS. A, vol. J96-A, no. 4, 2013, pages 157 - 165, XP008184067
PEETER LAUD: "Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees", POPETS, vol. 2015, no. 2, 2015, pages 188 - 205
PAYMAN MOHASSELYUPENG ZHANG: "2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA", 22 May 2017, IEEE COMPUTER SOCIETY, article "SecureML: A system for scalable privacy-preserving machine learning", pages: 19 - 38
Attorney, Agent or Firm:
NAKAO, Naoki et al. (JP)
Download PDF: