All-or-Nothing Encryption Data Block Processing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional all-or-nothing encryption methods are inefficient, particularly when dealing with large files, as they require at least two rounds of encryption, which hampers performance in cloud security applications.

Innovation Solution

A method and system that divide data into an odd number of blocks of equal size, encrypt them using a symmetric key, and apply a single round of linear transformation via XOR and AND operations to achieve a final ciphertext, ensuring semantic security with only one round of encryption and one round of transformation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional all-or-nothing encryption methods are used, then semantic security is achieved, but encryption efficiency deteriorates due to requiring at least two rounds of encryption

Engineering Contradiction:
Improvesemantic securityVSAvoidencryption efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent combines the all-or-nothing transformation and encryption operations into a single integrated process. Instead of applying encryption first and then the all-or-nothing transformation in separate rounds, the method performs both operations simultaneously in one round, thereby maintaining semantic security while improving encryption efficiency.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent achieves continuous encryption processing by eliminating the gap between the encryption round and the all-or-nothing transformation round. The encryption operation directly feeds into the transformation operation within the same encryption round, ensuring continuous processing without intermediate storage or separate execution phases.

Inventive Principle:
Principle #20Continuity of useful action

2Reliability

If two rounds of encryption are applied, then security is strengthened, but processing time increases

Engineering Contradiction:
ImprovesecurityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent merges the encryption and all-or-nothing transformation operations into a single encryption round, eliminating the time required for a second encryption round while maintaining the security properties of both operations through their integrated execution.

Inventive Principle:
Principle #5Merging (Combining)

3Reliability

If multiple encryption rounds are used, then cryptographic security is enhanced, but computational complexity increases

Engineering Contradiction:
Improvecryptographic securityVSAvoidcomputational complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent combines multiple cryptographic operations (encryption and all-or-nothing transformation) into a single computational pass, reducing the number of separate encryption rounds from two or more to one, thereby lowering computational complexity while preserving cryptographic security.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS10291392B2Method and system for encrypting data
Publication Date: 2019.05.14 NEC CORP
  • US10291392B2 patent drawing
  • US10291392B2 patent drawing

AI summary

A method for encrypting data based on all-or-nothing encryption includes: providing, by an encryption system, data to be encrypted and an encryption key; dividing, by the encryption system, the data into an odd number of blocks, wherein each of the blocks has the same size; encrypting, by the encryption system, the blocks with the encryption key to obtain an intermediate ciphertext c′ comprising intermediate ciphertext blocks c0′, . . . , cN′, wherein c0′ corresponds to a random seed and c1′, . . . , cN′ corresponds to the encrypted blocks; and obtaining, by the encryption system, a final ciphertext c using the intermediate ciphertext c′. An intermediate overall ciphertext t is obtained based on XOR'ing the intermediate ciphertext blocks c0′, . . . , cN′; and obtaining a plurality of final ciphertext blocks c1, . . . cN by XOR'ing respective intermediate ciphertext blocks c1′, . . . , cN′ with the intermediate overall ciphertext t.