Hash-Based Customer Authentication Mechanism for Fraud Prevention

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current customer service systems are vulnerable to fraud by malicious actors impersonating customers and rogue agents, as they lack a mechanism to conclusively identify customers before revealing sensitive information.

Innovation Solution

An authentication code is communicated to the customer, whose hash is stored with session and customer details, and compared to the provided hash to verify the customer's identity, ensuring that only verified customers receive unmasked details, thereby protecting privacy and preventing fraud.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If customer details are provided to agents to confirm customer identity, then customer service efficiency is improved, but the system becomes vulnerable to fraud by rogue agents who may skim customer details

Engineering Contradiction:
Improvecustomer service efficiencyVSAvoidfraud vulnerability
Core Design Contradiction:
ProductivityVSObject-affected harmful factors

Solution Approach 1:

The patent extracts the authentication code from the customer details and stores it separately in secure storage. The authentication code is hashed and stored in an authentication code repository, while the original code is destroyed. This separation ensures that even if customer details are accessed, the authentication code cannot be obtained or reused for fraud.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent introduces an intermediary authentication mechanism where agents must verify customer identity through a hashed authentication code comparison rather than directly accessing customer details. The hash comparison acts as a mediator that confirms identity without exposing sensitive information, preventing rogue agents from skimming details.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If authentication codes are stored securely and destroyed after use, then fraud prevention is improved, but system complexity increases

Engineering Contradiction:
Improvefraud preventionVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent creates a hash copy of the authentication code for storage and comparison purposes, while the original code is destroyed after being stored in secure storage. This copying mechanism allows verification without retaining the actual authentication code, preventing replay attacks while maintaining a manageable system architecture.

Inventive Principle:
Principle #26Copying

3Loss of information

If hashed authentication codes are compared to verify identity, then customer privacy is protected, but verification time increases

Engineering Contradiction:
Improvecustomer privacy protectionVSAvoidverification time
Core Design Contradiction:
Loss of informationVSLoss of time

Solution Approach 1:

The patent performs preliminary hashing of the authentication code during the authentication process and stores the hash value. When verification is needed, the system retrieves the stored hash and compares it with a newly computed hash, avoiding the need to store or retrieve large amounts of sensitive customer data. This preliminary action reduces verification time while maintaining privacy.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10776794B2Mechanism for customer service with security and privacy
Publication Date: 2020.09.15 MICROSOFT TECHNOLOGY LICENSING LLC
  • US10776794B2 patent drawing
  • US10776794B2 patent drawing
  • US10776794B2 patent drawing

AI summary

A mechanism for customer service with security and privacy is provided. In a support service scenario for products or services, a determination is made based on an interaction with a customer that additional verification is needed. An authentication code is communicated to the customer via a mode chosen by the customer. At the same time, a hash of the authentication code is stored along with session and customer details. The customer is prompted to provide the authentication code and a hash of the provided authentication code is compared to the hash of the authentication code that was stored with the session and customer details. If the hashes match, it can be presumed that the agent is communicating with the correct customer and customer details are revealed. If the hashes do not match, the agent does not see any private customer details.