Secure Computation System Reducing Communication Rounds via Bit Extraction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current secure computation systems face inefficiencies in reducing communication rounds during most significant bit extraction protocols, particularly in environments with large communication delays like WANs, where minimizing communication rounds is crucial for maintaining secrecy and improving process efficiency.

Innovation Solution

A secure computation system comprising at least three secure computation server apparatuses connected via a network, utilizing random number generation, m-1 bit comparison, carry correction, and most significant bit extraction to extract the most significant bit of an input value while maintaining secrecy, with each server having a random number generation part, an m-1 bit comparison part, a carry correction part, and a most significant bit extraction part to correct and extract the most significant bit.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If the most significant bit extraction protocol uses conventional methods with constant rounds (10), then secrecy is maintained, but the number of communication rounds is large which reduces efficiency in WAN environments

Engineering Contradiction:
Improveefficiency of most significant bit extractionVSAvoidnumber of communication rounds
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent segments the most significant bit extraction protocol into distinct functional modules: a random number generation module that generates masking random numbers, an m-1 bit comparison module that compares masked values, a carry correction module that corrects comparison results, and an extraction module that produces the final most significant bit. This segmentation allows each module to be optimized independently, reducing the total communication rounds from 10 to a more efficient sequence while maintaining secrecy through distributed computation among multiple secure computation server apparatuses

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by generating random numbers for masking the input values before the comparison operation. The random number generation part creates masking values that are combined with the secret-shared input values prior to comparison, ensuring that the actual comparison is performed on masked data. This preliminary masking action maintains secrecy while enabling the comparison to proceed with fewer communication rounds, as the masking is already in place before the main extraction logic begins

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20240007274A1Secure computation system, secure computation serverapparatus, secure computation method, and securecomputation program
Publication Date: 2024.01.04 NEC CORP
  • US20240007274A1 patent drawing
  • US20240007274A1 patent drawing
  • US20240007274A1 patent drawing

AI summary

A secure computation system comprises at least three secure computation server apparatuses connected to each other via a network, and each of secure computation server apparatuses comprises: a random number generation part that generates a random number for masking an input value; an m-1 bit comparison part that compares a value obtained by removing the most significant bit from input value masked with random number with a value obtained by removing the most significant bit from random number; a carry correction part that corrects calculation of a value obtained by removing the most significant bit from input value on basis of result of comparison; and a most significant bit extraction part that extracts the most significant bit of input value by subtracting corrected value of value obtained by removing the most significant bit from input value from input value.