Round-efficient fully secure solitary multi-party computation with honest majority
US12052349B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 22, 2023 |
| Grant date | Jul 30, 2024 |
| Priority date | — |
| Expiry date | Aug 22, 2043 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2209/46
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Several round-efficient solitary multi-party computation protocols with guaranteed output delivery are disclosed. A plurality of input devices and an output device can collectively perform a computation using methods such as fully homomorphic encryption. The output of the computation is only known to the output device. Some number of these devices may be corrupt. However, even in the presence of corrupt devices, the output device can still either generate a correct output or identify that the computation was compromised. These protocols operate under different assumptions regarding the communication infrastructure (e.g., broadcast vs point-to-point), the number of participating devices, and the number of corrupt devices. These protocols are round-efficient in that they require a minimal number of communication rounds to calculate the result of the multi-party computation.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.