Arithmetic for secure multi-party computation with modular integers
US11050558B2 · kind B2 · utility
Inventors
Key dates
| Filing date | Nov 9, 2020 |
| Grant date | Jun 29, 2021 |
| Priority date | — |
| Expiry date | Nov 9, 2040 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/46
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A secure multi-party computation implements real number arithmetic using modular integer representation on the backend. As part of the implementation, a secret shared value jointly stored by multiple parties in a first modular representation is cast into a second modular representation having a larger most significant bit. The parties use a secret shared masking value in the first representation, the range of which is divided into two halves, to mask and reveal a sum of the secret shared value and the secret shared masking value. The parties use a secret shared bit that identifies the half of the range that contains the masking value, along with the sum to collaboratively construct a set of secret shares representing the secret shared value in the second modular format. In contrast with previous work, the disclosed solution eliminates a non-zero probability of error without sacrificing efficiency or security.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.