Non-traceable Authentication Using Pre-computed RHA Tokens
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing authentication protocols, such as RSA, are inefficient and compromise privacy due to the need for shared secrets and extensive data exchanges, particularly in contactless contexts like NFC, where reducing exchange time is crucial.
Innovation Solution
A method using Random Handback Authentication (RHA) tokens with a certificate calculation mechanism that enables local verification of nested groups, reducing the number of exchanges required for authentication while maintaining security, by providing each device with authentication tokens containing random numbers and cryptograms, and using these to establish secure channels without sharing large constants.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If Random Handback Authentication (RHA) is used for authentication, then authentication speed is improved (3000 times faster than RSA), but the number of data exchanges increases
Solution Approach 1:
The patent pre-calculates and stores authentication tokens (comprising random numbers and their cryptograms) in each device before actual authentication occurs. This preliminary preparation eliminates the need for real-time computation during authentication, allowing devices to quickly exchange and verify pre-computed tokens, thus resolving the contradiction between fast authentication and minimized data exchange time
Solution Approach 2:
The patent extracts the computationally intensive authentication process from the real-time interaction phase and moves it to the preliminary token generation phase. By separating token generation (done in advance) from token verification (done during authentication), the system achieves high-speed authentication with minimal data exchange, as only compact tokens need to be transmitted rather than large cryptographic constants
2Reliability
If RSA authentication is used, then security is maintained through shared secrets, but authentication time is excessive and privacy is compromised due to large data exchanges
Solution Approach 1:
The patent changes the fundamental parameters of authentication by replacing RSA's large public key exchanges with RHA's compact token-based approach. Instead of exchanging large cryptographic constants and performing modular exponentiation, the system uses pre-computed tokens with random numbers and their cryptograms, dramatically reducing both authentication time and data exchange volume while maintaining security through the cryptographic strength of the token verification process
Solution Approach 2:
The patent substitutes the mechanical RSA authentication mechanism (involving large number arithmetic and public key exchange) with a lighter RHA mechanism based on pre-computed tokens and cryptogram verification. This substitution eliminates the need for time-consuming modular exponentiation and large data transmissions, achieving both faster authentication and reduced privacy risks from data exposure
3Reliability
If shared secrets and large constants are exchanged for authentication, then security is ensured, but privacy is compromised and data exchange volume increases
Solution Approach 1:
The patent segments the authentication information into separate components: authentication tokens (containing random numbers) and verification keys (used for cryptogram verification). This segmentation allows the system to exchange only the necessary token data for authentication while keeping the verification keys secure and local, thereby maintaining security without requiring exchange of large amounts of sensitive information that would compromise privacy
Data Source
Figure 1~2
Figure 3~4
Figure 5A~6
AI summary
The present invention relates to a method, for a provider entity belonging to a provider group, to authenticate its belonging to an attribute provider group to a verification entity in a non-traceable manner without necessitating to share secret or large constants compromising privacy. Both entities comprise at least one attribute group arborescence, this attribute group arborescence being shared by the provider entity and the verification entity when the provider entity has the attribute. According to the invention, when a verification is triggered, the verification entity calculates a certificate from the attribute group arborescence, said certificate being calculated from the authentication tokens of the groups along the arborescence from the attribute verification group's token to the consumer group's token.