Stochastic Secure Computing for Bootstrapping-Free Homomorphic Encryption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The significant increase in calculation amount and operation time in secure computing processes, particularly due to bootstrapping in fully homomorphic encryption, poses a challenge in achieving efficient secure computing.

Innovation Solution

A secure computing device and method that utilizes random bit strings generated based on prescribed probability distributions to determine the values of bit strings representing sums and products of encrypted data, employing Bernoulli strings in various code formats to perform calculations without increasing noise and thus eliminating the need for bootstrapping.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If fully homomorphic encryption with bootstrapping is used to perform secure computing, then the ability to perform unlimited addition and multiplication operations on encrypted data is improved, but the calculation amount and operation time are significantly increased

Engineering Contradiction:
Improveability to perform unlimited operations on encrypted dataVSAvoidoperation time
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent changes the fundamental parameter of how homomorphic operations are performed by switching from traditional bootstrapping-based fully homomorphic encryption to a stochastic computing approach. This involves representing encrypted data in a stochastic format where arithmetic operations can be performed directly on the stochastic representations without triggering noise accumulation that requires bootstrapping, thereby maintaining unlimited operation capability while dramatically reducing computation time

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent replaces the mechanical bootstrapping process (which involves complex decryption and re-encryption operations) with a stochastic computing mechanism. Instead of periodically resetting noise through bootstrapping, the system uses probabilistic bit string operations that inherently avoid noise accumulation, substituting a fundamentally different computational mechanism that achieves the same goal of enabling unlimited operations without the time penalty

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Adaptability or versatility

If fully homomorphic encryption with bootstrapping is used to perform secure computing, then the ability to perform unlimited addition and multiplication operations on encrypted data is improved, but the calculation amount is significantly increased

Engineering Contradiction:
Improveability to perform unlimited operations on encrypted dataVSAvoidcalculation amount
Core Design Contradiction:
Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

The patent fundamentally changes the operational parameters by adopting stochastic computing representations where encrypted values are expressed as probabilistic bit strings. This parameter change allows addition and multiplication to be performed through simple bitwise operations rather than complex homomorphic transformations, reducing the calculation amount while preserving the ability to perform unlimited operations

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent substitutes the traditional homomorphic encryption mechanical system (which requires bootstrapping to manage noise) with a stochastic computing system. This substitution eliminates the need for bootstrapping operations entirely, as the stochastic representation naturally handles unlimited operations without noise accumulation, thereby significantly reducing the overall calculation amount

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Adaptability or versatility

If bootstrapping is performed to reduce noise in somewhat homomorphic encryption, then the number of operations that can be performed is improved, but the operation time is increased

Engineering Contradiction:
Improvenumber of operationsVSAvoidoperation time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent extracts and eliminates the bootstrapping step from the homomorphic encryption process by adopting stochastic computing. Instead of performing bootstrapping to reduce noise after a certain number of operations, the system uses stochastic representations that allow operations to continue indefinitely without noise accumulation, effectively taking out the time-consuming bootstrapping operation from the computational workflow

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the fundamental parameter of noise management by switching from deterministic noise reduction through bootstrapping to probabilistic noise avoidance through stochastic computing. This parameter change allows the system to perform an unlimited number of operations without the time penalty of periodic bootstrapping, as the stochastic representation inherently prevents noise from exceeding threshold values

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentEP4083972B1Secret calculation device, secret calculation method, and program
Publication Date: 2025.07.16 TOHOKU UNIV
  • EP4083972B1 patent drawingFigure 1~2
  • EP4083972B1 patent drawingFigure 3~4
  • EP4083972B1 patent drawingFigure 5~7

AI summary

A secure computing device includes a secure computing unit configured to execute secure computing on encrypted data obtained by encrypting plaintext represented in a prescribed expression format for stochastic computing in a homomorphic encryption scheme. The secure computing includes a process of acquiring a sum and a process of acquiring a product. The secure computing unit determines a value of each digit of a bit string representing the sum as one of a value of a corresponding digit of a bit string that represents first encrypted data and is represented in the expression format and a value of a corresponding digit of a bit string that represents second encrypted data and is represented in the expression format in the process of acquiring the sum that is a sum of the first encrypted data of the encrypted data and the second encrypted data of the encrypted data.