Pairing Analysis for NDA Data Confidentiality
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Determining whether data protected by a Non-Disclosure Agreement (NDA) is publicly known is challenging due to the difficulty in distinguishing between confidential and publicly available information.
Innovation Solution
A method and system that parse documents into pairings, search public data stores to determine if these pairings are publicly known, and mark the pairings based on the outcome, allowing for operations such as data retention or deletion based on their public availability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If NDA protected material is assumed to be confidential, then data confidentiality is maintained, but it becomes difficult to determine which material is actually publically known
Solution Approach 1:
The system performs preliminary searching in public data stores before finalizing data classification. By proactively checking public sources ahead of time, the system determines the public knowledge status of pairings in advance, resolving the contradiction between maintaining confidentiality and determining public knowledge status.
2Productivity
If all NDA protected material is retained, then data holders maintain maximum data availability, but proprietary information may be inadvertently disclosed
Solution Approach 1:
The system segments NDA protected material into distinct pairings (e.g., name-company, product-launch date) and evaluates each pairing's public knowledge status independently. This segmentation allows selective retention of only those pairings that are confirmed as publically known, while identifying and protecting proprietary information that should not be disclosed.
Solution Approach 2:
The system implements a feedback mechanism where search results from public data stores directly influence data retention decisions. The search outcomes provide feedback that determines whether each pairing should be retained or protected, creating a closed-loop system that balances data availability with proprietary information protection.
3Measurement precision
If extensive searching of public data stores is performed, then accurate determination of public knowledge status is achieved, but time and computational resources are consumed
Solution Approach 1:
The system performs targeted searching focused specifically on identifying pairings that are publically known, rather than conducting exhaustive searches on all possible data attributes. By applying partial action to the most critical identification tasks, the system achieves sufficient measurement precision while minimizing time and resource consumption.
Data Source
AI summary
Provided are techniques for testing pairings to determine whether they are publically known. It is determined whether a pairing from a record is publicly known by searching public data stores. The pairing is marked with an outcome of the determining. An operation is performed on the pairing based on the outcome.