Format-Preserving Encryption Tokens for Database-Free Data Exchange
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for exchanging sensitive data using tokens are inefficient, require extensive database synchronization, are prone to inconsistent lookup results due to data replication lags, rely on costly caching, are unavailable when databases are offline, and necessitate cumbersome maintenance for expunging expired tokens.
Innovation Solution
Utilizing format-preserving encryption (FPE) to generate secure tokens with encrypted data and metadata, ensuring user-specific and time-constrained validity, allowing direct data exchange without reliance on relational databases.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional tokenization with relational databases is used to exchange sensitive data, then data can be shared without direct transmission, but database synchronization and caching costs increase significantly
Solution Approach 1:
The patent extracts the token-to-data mapping relationship from centralized relational databases and embeds it directly into the token structure itself. Each token now contains its own mapping information, eliminating the need for external database lookups and synchronization mechanisms. This resolves the contradiction by maintaining data exchange security through tokenization while removing the complex database synchronization infrastructure.
Solution Approach 2:
The patent introduces format-preserving encryption as an intermediary mechanism that enables direct token-to-data conversion without requiring database mediation. The FPE algorithm acts as a mathematical mediator that transforms tokens into corresponding data values through deterministic encryption, eliminating the need for complex database synchronization and caching infrastructure while maintaining security.
2Productivity
If relational databases are used for token lookup, then data can be retrieved, but data replication lags cause inconsistent lookup results
Solution Approach 1:
The patent segments the centralized token-to-data mapping functionality into individual, self-contained tokens. Each token carries its own encryption key and mapping information, eliminating the need for centralized database lookups. This segmentation resolves the contradiction by enabling immediate data retrieval through local token processing while ensuring consistent results across all systems, as each token is self-sufficient and does not depend on database synchronization.
3Speed
If caching is used to boost token lookup performance, then lookup speed increases, but caching costs and maintenance requirements increase
Solution Approach 1:
The patent makes each token self-sufficient by embedding all necessary mapping and decryption information directly within the token structure. Tokens perform their own lookup and decryption operations without requiring external caching infrastructure. This self-service approach resolves the contradiction by achieving maximum lookup speed through direct token processing while eliminating all caching maintenance requirements.
4Reliability
If conventional tokenization is used, then sensitive data can be protected, but expired tokens require cumbersome database maintenance
Solution Approach 1:
The patent extracts the token expiration and validity management functionality from centralized database operations and embeds expiration metadata directly into each token. This allows tokens to be independently validated and expired without requiring database access or maintenance operations. The solution maintains data protection through secure tokenization while dramatically simplifying maintenance by enabling pure software-based token lifecycle management.
5Adaptability or versatility
If relational databases are used for token storage, then tokens can be managed, but the system becomes unavailable when databases are offline
Solution Approach 1:
The patent replaces the relational database intermediary with format-preserving encryption as a mathematical mediator that operates entirely in memory. Token validation and data retrieval become deterministic computational operations that do not depend on external database availability. This resolves the contradiction by maintaining full token management capability through embedded token structures while achieving 100% system availability through offline-capable operations.
Data Source
AI summary
Methods and systems disclosed herein describe tokenizing data to generate a secure token that is limited in scope (e.g., directed to a specific recipient) and limited in time (e.g., valid for only a specified period of time). A detokenization process may be employed to recover encrypted data of the secure token without the need for any relational database lookup processes, thereby reducing cost while maintaining robust protection against unintended recipients that attempt to recover the encrypted data.