Hash-Based User Identification System for Secure Partner Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network services face security issues with personal information leakage and lack of control over who can search for users' information, leading to anonymous communication and potential malicious uses.
Innovation Solution
A system where users calculate and store hash values of their and others' information, sending these to a server for matching, allowing secure and controlled identification of communication partners without revealing personal data to the server.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If personal information is disclosed to enable search and communication between users, then communication functionality is improved, but security and privacy of personal information deteriorates
Solution Approach 1:
The patent extracts only the necessary identification capability from personal information by using hash values. Instead of storing or transmitting actual personal information (names, addresses, etc.), the system extracts transformed identification data that enables user matching without exposing sensitive details. This resolves the contradiction by maintaining communication functionality while removing the harmful exposure of personal information.
Solution Approach 2:
The patent introduces hash values as an intermediary between personal information and user identification. The hash function acts as a mediator that transforms sensitive personal data into non-reversible identification codes. These intermediaries enable search and communication functions while preventing direct access to actual personal information, thus securing privacy while maintaining usability.
2Productivity
If personal information is stored on server database, then search capability is improved, but risk of external leakage and unauthorized access increases
Solution Approach 1:
The system extracts the essential search capability from personal information by storing only hash values in the server database. The actual personal information remains on user terminals and is never transmitted to or stored on the server. This extraction approach maintains efficient search functionality while eliminating the server as a vulnerability point for external attacks and data breaches.
Solution Approach 2:
The patent creates a functional copy of personal information in the form of hash values that can be stored and processed on the server without containing the actual sensitive data. These hash copies enable all necessary search and matching operations while being inert and non-reversible, thus providing the productivity of centralized storage without the security risks of storing real personal information.
3Ease of operation
If all users can search for any registered personal information, then ease of finding communication partners is improved, but control over who can search deteriorates
Solution Approach 1:
The patent implements preliminary action by having users pre-register their personal information and corresponding hash values in the system before needing to communicate. This advance registration enables the system to perform controlled matching when communication is needed, rather than allowing arbitrary searches. The preliminary setup maintains ease of operation for legitimate users while establishing control mechanisms against unauthorized access.
Data Source
AI summary
A system having a server and an information terminal of A which records A's personal information Pa and B's personal information Pb′, an information terminal of B which records A's personal information Pa and B's personal information Pb′. B's information terminal generates a calculation result F(Pa′,Pb) via the calculation of Pa′ and Pb, sends F(Pa′,Pb) to a server. The server correlates B's identification tag with F(Pa′,Pb) and records it. A's information terminal forms F(Pa,Pb′) calculated via the calculation of Pb′ and Pa and sends F(Pa,Pb′) to the server. The server searches for a calculation result which matches F(Pa,Pb′) and by detecting a match between F(Pa′,Pb) and F(Pa,Pb′) detects B's identification tag which has been correlated with F(Pa′,Pb) and detected B's identification tag is sent to A's information terminal.