Secure Multiplication Triplet Verification for Malicious Security

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing secure computation systems face challenges in protecting against malicious behavior of participants while maintaining a small processing amount, as the verification accuracy required to ensure security leads to increased processing loads.

Innovation Solution

A secure computation apparatus and method that includes a first multiplication triplet column generator, a second multiplication triplet column generator, and a multiplication validity verifier, which generate and verify secure multiplication triplets using secure distribution random numbers and input numbers, allowing for the verification of secure multiplication validity with reduced processing overhead.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If verification accuracy of secure computation is improved to protect against malicious behavior, then security against malicious participants is improved, but processing amount becomes large

Engineering Contradiction:
Improvesecurity against malicious behaviorVSAvoidprocessing amount
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent extracts only the essential verification function by using multiplication triplets (a, b, c) where c = a × b. Instead of verifying all computation details, the system verifies only this compact triplet representation, which suffices to detect malicious behavior while minimizing processing overhead.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent creates a simplified copy of the verification process using multiplication triplets. Rather than verifying the entire computation process, the system uses these triplet copies to represent and verify multiplication operations, reducing the verification workload while maintaining security.

Inventive Principle:
Principle #26Copying

2Reliability

If verification accuracy is increased to ensure security, then protection against malicious participants is improved, but processing time and resource utilization increase

Engineering Contradiction:
Improveverification accuracyVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the verification process into discrete triplet-based checks. Each multiplication operation is broken down into verifying individual multiplication triplets, which can be done efficiently and in parallel, reducing overall verification time while maintaining high accuracy.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS11080393B2Secure computation system, secure computation apparatus, secure computation method, and secure computation program
Publication Date: 2021.08.03 NEC CORP
  • US11080393B2 patent drawing
  • US11080393B2 patent drawing
  • US11080393B2 patent drawing

AI summary

This invention is directed to a secure computation apparatus that protects a security against the malicious behavior while maintaining a processing amount small. The secure computation apparatus comprises a first multiplication triplet column generator that generates first multiplication triplet columns formed from a set of two secure distribution random numbers and a distribution value of a multiplication result obtained by performing secure multiplication of the two secure distribution random numbers, a second multiplication triplet column generator that generates second multiplication triplet columns formed from a set of two secure distribution input numbers and a distribution value of a multiplication result obtained by performing secure multiplication of the two secure distribution input numbers, in each multiplication process of semi-honest safe secure multiplication, and a multiplication validity verifier that generates a set of first multiplication triplets and second multiplication triplets by randomly selecting, from the first multiplication triplet columns, a number of rows of the first multiplication triplets as many as a number of rows of the second multiplication triplets in the second multiplication triplet columns, and verifies validity of secure multiplication based on the set of the first and second multiplication triplets.