RFID Key Distribution via Error Correction Tiny Shares

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing perfect secret sharing schemes for RFID tags are inadequate due to weak security when a reader probes the tag over an extended period, and they require share sizes equal to or larger than the secret, which is impractical for RFID tags with limited memory.

Innovation Solution

The use of error correction code encoding, such as Reed-Solomon encoding, to generate small 'tiny shares' for an encryption key, allowing for secure storage on RFID tags while enabling reconstruction of the key from a predetermined number of shares, even if they reveal partial information about the secret.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If perfect secret sharing schemes are used for RFID tags, then information security is improved, but share size becomes equal to or larger than the secret size, which is impractical for RFID tags with limited memory

Engineering Contradiction:
Improveinformation securityVSAvoidshare size
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The secret key is segmented into multiple smaller shares using error correction code encoding. Instead of storing one large share equal to the secret size, the system divides the key into N shares where each share is significantly smaller, yet any K shares can reconstruct the original key through the error correction decoding process

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system changes the parameter of share size by using error correction codes with specific redundancy rates. By selecting appropriate code parameters (N, K, d), the share size can be optimized to be smaller than the secret while maintaining security through the mathematical properties of the error correction code

Inventive Principle:
Principle #35Parameter changes

2Reliability

If the share emission period is extended to improve security against probing attacks, then security is improved, but delays occur for the authorized reader's ability to obtain the RFID tag information

Engineering Contradiction:
Improvesecurity against probing attacksVSAvoiddelay for authorized reader
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system dynamically adjusts the threshold parameter K based on the security requirements and communication context. By making K adjustable, the system can balance between security (higher K) and accessibility speed (lower K), allowing optimization for different operational scenarios without fixed emission periods

Inventive Principle:
Principle #15Dynamics

3Quantity of substance

If smaller shares are used to reduce storage demands on RFID tags, then storage efficiency is improved, but the shares may reveal partial information about the secret

Engineering Contradiction:
Improveshare sizeVSAvoidinformation security
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

Error correction code encoding acts as an intermediary mechanism between the secret key and the shares. This mathematical encoding provides a protective layer that allows small shares to be created while the code's redundancy and structure ensure that partial shares reveal no meaningful information about the original key without the proper decoding process

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS8031875B1Key distribution in unidirectional channels with applications to RFID
Publication Date: 2011.10.04 EMC IP HLDG CO LLC
  • US8031875B1 patent drawing
  • US8031875B1 patent drawing
  • US8031875B1 patent drawing

AI summary

A technique for securing information involves encrypting raw data into encrypted data based on an initial key. The technique further involves generating a set of key shares from the initial key via application of error correction code encoding. Each key share has a size which is independent of a size of the initial key. The technique further involves electronically storing each key share on a respective memory device of a set of memory devices (e.g., RFID tags). The initial key is reconstructable from a predetermined number of the key shares read from their respective memory devices to enable decryption of the encrypted data.