RFID Identification Tag Anonymization Under Memory Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing RFID tag technologies face security risks due to unsecured data communication and inadequate data obfuscation, leading to potential data exposure and high computational costs, especially in shipping contexts where tags have limited memory and full encryption is impractical.
Innovation Solution
Anonymization and de-anonymization of RFID tag data using internal data, such as asset information, without requiring full encryption, thereby reducing memory usage and computational overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full encryption is applied to RFID tag data, then data security is improved, but memory usage and computational costs increase beyond what is practical for tags with limited memory
Solution Approach 1:
The patent extracts only the essential security function from full encryption, implementing a simplified anonymization scheme that removes personally identifiable information while preserving asset identification capability. This extraction approach provides security against casual observation without requiring the full computational and memory resources of traditional encryption algorithms.
Solution Approach 2:
The patent changes the parameter of data representation by transforming readable identification codes into anonymized forms using simple mathematical operations. This parameter transformation provides a degree of security while maintaining compatibility with the limited memory constraints of RFID tags, avoiding the need for complex encryption data structures.
2Reliability
If full encryption is applied to RFID tag data, then data security is improved, but computational overhead increases beyond practical limits for tag operations
Solution Approach 1:
The patent employs lightweight, computationally inexpensive anonymization operations that can be performed quickly with minimal energy consumption. These simple transformations serve as a disposable security layer for casual protection scenarios, consuming far less energy than full encryption while providing adequate security for the intended use case.
Solution Approach 2:
The patent changes the computational approach from complex encryption algorithms to simple parameter transformations. This reduces the computational overhead and energy consumption significantly while still providing a layer of security that obscures sensitive information from casual observation by unauthorized readers.
3Quantity of substance
If no data obfuscation is applied, then memory usage is minimized, but data security is compromised and sensitive information is exposed
Solution Approach 1:
The patent extracts and removes only the sensitive personally identifiable information components from the data, replacing them with anonymized identifiers. This selective extraction provides security against data exposure while maintaining minimal memory usage, as only the essential anonymized code is stored rather than full encryption data structures.
4Ease of operation
If traditional RFID tags are used without anonymization, then ease of operation is maintained, but security risks increase due to unsecured data communication
Solution Approach 1:
The patent implements self-service anonymization where the RFID tag automatically performs the anonymization transformation of its own identification data. This maintains ease of operation from the user perspective while internally providing security protection, as the tag autonomously applies the security transformation without requiring external intervention or complex operational procedures.
Data Source
AI summary
Various embodiments are related to anonymizing an identification code using internal data. Once anonymized, the identification code may be written to a tag, such as an RFID tag. Anonymizing the identification code using internal data may protect potentially sensitive tag data from outsiders while operating while operating within tag memory constraints.