Compact Key Encryption for Cloud Storage Security

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Shannon's cipher system requires keys as large as the message for perfect secrecy, making it impractical for cloud storage systems where secure key storage is needed for data retrieval, hindering the benefits of offsite storage.

Innovation Solution

A method using a compact key system where a random binary matrix generates packet vector keys for encryption, allowing for perfect secrecy with significantly smaller key sizes and efficient encryption without increasing plaintext size, enabling secure cloud storage.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If Shannon's one-time pad system is used to achieve perfect secrecy, then security level is improved, but key size increases to match message size

Engineering Contradiction:
Improvesecurity levelVSAvoidkey size
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The message is divided into multiple packets, and a single compact key is used to encrypt all packets through systematic key generation. The encryption process segments the message into T packets, each encrypted using derived keys from one master key, reducing key storage from message-size to constant-size.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a mathematical transformation dimension by using systematic key derivation functions and linear algebra operations. Instead of storing multiple independent keys, a single key is transformed into multiple encryption keys through mathematical operations, changing the key management from spatial storage to computational generation.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Reliability

If keys as large as messages are stored for secure retrieval, then perfect secrecy is achieved, but ease of operation deteriorates due to key storage requirements

Engineering Contradiction:
Improveperfect secrecyVSAvoidkey storage
Core Design Contradiction:
ReliabilityVSEase of operation

Solution Approach 1:

The system enables self-service key generation where a single compact master key automatically generates all necessary encryption keys through systematic derivation. The master key serves itself to produce multiple packet-specific keys, eliminating the need for external key distribution and large-scale key storage infrastructure.

Inventive Principle:
Principle #25Self-service

3Ease of operation

If a compact key system is used to reduce key size, then ease of operation is improved, but reliability may worsen due to potential security compromises

Engineering Contradiction:
Improvekey sizeVSAvoidsecurity
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The system performs preliminary mathematical setup by establishing a systematic key derivation framework before actual encryption. The master key is pre-configured with mathematical properties that enable secure derivation of multiple encryption keys, ensuring security is built into the structure before use rather than added later.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes the parameter of key representation from full-message-size independent keys to compact master keys with mathematical transformation capabilities. By altering how keys are parameterized and generated, the system achieves both compactness and security through mathematical properties rather than brute-force key size.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11593528B2Compact key with reusable common key for encryption
Publication Date: 2023.02.28 RGT UNIV OF CALIFORNIA
  • US11593528B2 patent drawing
  • US11593528B2 patent drawing
  • US11593528B2 patent drawing

AI summary

Techniques for secure public exposure of digital data include extracting first digital data comprising one or more batches, each batch comprising a plurality of no more than a number T of packets, each packet containing a plurality of a number n of bits. A random binary matrix A consisting of T rows and n columns is generated. For a first batch, a first random n-bit temporary key is generated. For a packet in the first batch, a first packet vector key is generated based on random non-overlapping pairs of bit positions for both the temporary key and for a first packet-corresponding row of matrix A. An encrypted packet is generated for the packet based on the packet and the first packet vector key. The encrypted packet is exposed publicly.