Confidentiality Graph for Dynamic Recipient-Based Information Classification

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current methods for identifying confidential information in textual communications fail to account for information that may not be traditionally classified as confidential but becomes sensitive when shared with new recipients, and do not adapt to changes in confidentiality over time.

Innovation Solution

A system that uses a confidentiality graph with nodes representing participants and edges representing acceptable discussion topics, parsing textual communications to identify confidential topics, and alerting existing participants before sending the communication to new recipients, ensuring that only non-confidential information is shared.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional confidential information identification methods are used, then traditionally classified confidential information is protected, but information that becomes sensitive when shared with new recipients is not identified

Engineering Contradiction:

Improveconfidential information identification accuracyVSAvoidadaptability to changes in confidentiality

Core Design Contradiction:

Measurement precisionVSAdaptability or versatility

Solution Approach 1:

The system dynamically updates the confidentiality graph as new participants are added to communications. The graph structure evolves to reflect changing relationships and confidentiality contexts, allowing the system to adapt to new recipients and identify previously unrecognized confidential information based on relationship changes.

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The system changes the parameter of information classification from static traditional categories to dynamic relationship-based classification. By monitoring changes in participant relationships within the confidentiality graph, the system identifies when information transitions from non-confidential to confidential status based on the addition of new recipients.

Inventive Principle:

Principle #35Parameter changes

2Reliability

If a confidentiality graph is implemented to track participant relationships, then confidential information can be identified based on recipient relationships, but system complexity increases

Engineering Contradiction:

Improveconfidentiality protection reliabilityVSAvoidsystem structure complexity

Core Design Contradiction:

ReliabilityVSDevice complexity

Solution Approach 1:

The confidentiality graph serves multiple functions: it tracks participant relationships, identifies confidential information, determines notification requirements, and adapts to changing communication contexts. This multi-functionality reduces the need for separate systems for each task, thereby managing complexity while improving reliability.

Inventive Principle:

Principle #6Universality (Multi-functionality)

Solution Approach 2:

The confidentiality graph acts as an intermediary data structure that mediates between communication content and confidentiality rules. Rather than directly analyzing communication content against complex rules, the system uses the graph as an intermediate representation to simplify the identification and notification process.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Measurement precision

If the system parses and analyzes all textual communications to identify confidential topics, then accurate confidential information detection is achieved, but processing time increases

Engineering Contradiction:

Improveconfidential topic identification accuracyVSAvoidcommunication processing time

Core Design Contradiction:

Measurement precisionVSLoss of time

Solution Approach 1:

The system performs preliminary action by maintaining the confidentiality graph structure in advance, which encodes relationship-based confidentiality rules. When a new participant is added, the system only needs to query the pre-built graph and analyze communication content against the specific relationship context, rather than performing comprehensive analysis from scratch, thereby reducing processing time while maintaining accuracy.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS11709962B2Confidential information identification based upon communication recipient

Publication Date: 2023.07.25 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

One embodiment provides a method, including: receiving an indication of an addition of a new participant in a textual communication between at least two existing participants; identifying at least one confidential topic contained within the textual communication by (i) parsing the textual communication and (ii) identifying at least one topic contained within the textual communication; the identifying comprising (i) accessing a confidentiality graph comprising (a) nodes representing participants and (b) edges representing confidential concepts that are acceptable discussion topics between participants connected by a corresponding edge and (ii) determining that an edge corresponding to the at least one confidential topic does not connect the new participant with both of the existing participants; and alerting one of the existing participants that the at least one confidential topic is included in the textual communication to be sent to the new participant.