Electronic Device Verification Using Dual Identifier Database Lookup
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for verifying whether an electronic device is part of a known group are costly and insecure, particularly for inexpensive devices, as they require additional hardware and manufacturing time for cryptographic key provision during manufacturing.
Innovation Solution
The method involves using a first device identifier accessible from storage circuitry and a second device identifier inaccessible from the storage circuitry, with a database lookup to verify the device's legitimacy, providing enhanced security without the need for cryptographic key injection during manufacturing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic key provision during manufacturing is implemented, then device verification security is improved, but manufacturing cost and complexity increase
Solution Approach 1:
The patent extracts the cryptographic key provision step from the manufacturing process entirely. Instead of injecting keys during manufacturing, the system uses two identifiers that are naturally present in the device (one accessible, one inaccessible) and verifies their pairing against a database. This removes the need for key provision infrastructure while maintaining verification security.
Solution Approach 2:
The patent creates a verification mechanism that copies the essential security function from traditional key-based systems. Instead of verifying cryptographic keys, it verifies the pairing relationship between two device identifiers against a database of valid pairings, achieving the same security goal through a different data structure.
2Reliability
If cryptographic key injection is performed during manufacturing, then device authenticity verification is improved, but manufacturing time increases
Solution Approach 1:
The patent performs preliminary action by establishing the pairing relationship between the two device identifiers during manufacturing and storing it in a database. This allows the actual verification to be performed quickly later by simply looking up the pairing in the database, rather than performing cryptographic key injection and verification during manufacturing.
3Reliability
If secure key provision infrastructure is deployed, then device verification reliability is improved, but manufacturing cost increases
Solution Approach 1:
The patent replaces expensive, long-lived cryptographic key infrastructure with a simpler, database-based verification system. The "cheap" approach uses standard device identifiers and a database lookup mechanism that can be implemented with minimal additional hardware or infrastructure, making it suitable for cost-sensitive applications.
4Reliability
If two device identifiers are used (one accessible, one inaccessible), then verification security is improved, but device complexity increases
Solution Approach 1:
The patent introduces a database as an intermediary that manages the pairing relationships between the two device identifiers. This mediator handles the complexity of matching accessible and inaccessible identifiers, allowing the device itself to remain simple while the verification security is enhanced through the external pairing verification mechanism.
Data Source
Figure 1~2
Figure 3~4
Figure 5
AI summary
A method for verifying whether an electronic device 10 is one of a group of known devices comprises receiving verification information 32, 34 indicative of a first device identifier 12 accessible from storage circuitry 46 by a predetermined process 50 executed by the electronic device and a second device identifier 16 inaccessible from the storage circuitry 46 by the predetermined process. A device database 24 retains valid pairings of the first and second device identifiers 12, 16 for the group of known devices. The device database is looked up based on the verification information to determine whether the first and second device identifiers correspond to one of the valid parings.