Credential Store Graph Normalization for Synchronization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional credential store systems face desynchronization and inconsistent user experiences due to the storage of disparate authentication mechanisms and services, leading to unexpected security behaviors and inefficiencies in managing user credentials across multiple computing systems.

Innovation Solution

A method involving the normalization and merging of credential stores by generating graphs from user credentials, analyzing nodes and subnodes across multiple data structures, and creating an output data structure that identifies logical correlations, enabling efficient synchronization and management of credentials.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of manufacture

If credential stores are stored in chronological order as features are added or improved, then the storage process is simple and straightforward, but multiple copies of credential stores on various computing systems become desynchronized and result in inconsistent user experience and unexpected security behavior

Engineering Contradiction:
Improvestorage process simplicityVSAvoidsynchronization consistency
Core Design Contradiction:
Ease of manufactureVSReliability

Solution Approach 1:

The credential store is segmented into multiple versions (e.g., v1, v2, v3) that are stored separately rather than overwriting each other. Each version maintains its own chronological structure, allowing simple sequential storage while enabling reliable synchronization through version tracking and selective merging of changes across versions.

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If credential stores are stored in chronological order, then the storage process is simple, but it leads to desynchronization and inconsistent user experience across multiple computing systems

Engineering Contradiction:
Improvestorage operation simplicityVSAvoidcross-system synchronization
Core Design Contradiction:
Ease of operationVSAdaptability or versatility

Solution Approach 1:

The system dynamically tracks changes in credential stores across different versions and computing systems. When updates occur, the system identifies affected versions and propagates changes appropriately, enabling adaptive synchronization that maintains consistency across diverse computing environments while preserving simple chronological storage operations.

Inventive Principle:
Principle #15Dynamics

3Device complexity

If conventional credential store systems store user credentials in a centralized manner, then the system structure is simple, but it leads to unexpected security behaviors and inefficiencies in managing user credentials across multiple computing systems

Engineering Contradiction:
Improvesystem structure simplicityVSAvoidsecurity behavior consistency
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The centralized credential store is segmented into multiple versioned copies distributed across computing systems. Each version maintains security integrity independently, and version tracking enables the system to identify and propagate security-related changes consistently across all systems, eliminating unexpected security behaviors while maintaining manageable system structure.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS8166072B2System and method for normalizing and merging credential stores
Publication Date: 2012.04.24 TAIWAN SEMICONDUCTOR MANUFACTURING CO LTD
  • US8166072B2 patent drawing
  • US8166072B2 patent drawing
  • US8166072B2 patent drawing

AI summary

One or more data structures are received by a computing device, wherein the one or more data structures include at least one or more user credentials. The one or more user credentials are normalized by the computing device to generate a first graph. One or more nodes of the first graph and one or more nodes of at least a second graph are analyzed by the computing device, wherein analyzing includes at least identifying a logical correlation between the one or more nodes of the first graph and the one or more nodes of at least the second graph. A third graph is generated by the computing device based, at least in part, upon the analysis of the one or more nodes of the first graph and the one or more nodes of at least the second graph. An output data structure is generated by the computing device based, at least in part, upon the third graph.