One-Way Hash Credential Verification Against Malware Exposure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional tap-to-phone solutions using commercial-off-the-shelf devices are vulnerable to malware due to the storage of sensitive payment data, leading to potential fraud in public transportation systems, and require expensive proprietary systems for verification.
Innovation Solution
A method using a secure hash function with a random value to generate and match hash values, ensuring only one credential is stored in plaintext at a time, preventing malware attacks and allowing the use of commercial-off-the-shelf devices for verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional TTP solutions store hundreds or thousands of sensitive payment data records for inspection, then verification capability is improved, but security against malware attacks deteriorates
Solution Approach 1:
The patent extracts only the essential verification element (hash value) from the complete payment data record, storing only this condensed representation rather than the full sensitive payment data. This extraction allows the system to maintain verification capability while eliminating the security risk associated with storing complete payment records.
Solution Approach 2:
The patent employs ephemeral credentials that are generated, used for verification, and then discarded. Each credential exists only temporarily in memory during the verification process and is never persisted to storage, making the system secure against malware that might compromise stored data.
2Reliability
If proprietary RID devices are used for fare verification, then security is improved, but device cost deteriorates
Solution Approach 1:
The patent enables the use of inexpensive commercial-off-the-shelf smartphones instead of costly proprietary devices by implementing temporary, in-memory credentials that eliminate the need for expensive secure hardware. The ephemerality of the credentials compensates for the lower security hardware of consumer devices.
Solution Approach 2:
The patent changes the fundamental parameter of data persistence from permanent storage to temporary in-memory existence. This parameter change allows consumer-grade devices to achieve security levels previously requiring proprietary hardware, as the security model shifts from relying on hardware security to relying on the ephemerality of data.
3Speed
If sensitive payment data is stored in plaintext for verification, then verification speed is improved, but vulnerability to dictionary attacks deteriorates
Solution Approach 1:
The patent performs preliminary hashing of payment data to create verification-ready credentials before the verification process begins. These pre-computed hash values are stored temporarily in memory, allowing for rapid verification while the one-way nature of hashing prevents reverse-engineering attacks.
Solution Approach 2:
The patent replaces the mechanical approach of storing and comparing plaintext data with a cryptographic hashing mechanism. This substitution maintains verification speed through efficient hash comparison while providing cryptographic resistance against dictionary and brute-force attacks.
Data Source
AI summary
A disclosed method includes receiving, by a first device from a server computer, a first hash value along with a plurality of other hash values, and a random value. The first hash value is generated by inputting at least a first credential and the random number into a hash function. The method includes reading a second credential from a second device operated by a second user, and generating a second hash value by inputting at least the second credential and the random value into the hash function. The method includes comparing the first hash value and the second hash value, and determining that the first hash value and the second hash value match. The method also includes validating an action of the second user when the first hash value and the second hash value match.