Packaged Product Authentication Using Batch Bilinear Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems lack an efficient and reliable method to authenticate packaged products, particularly in large quantities, to ensure their authenticity and integrity throughout the supply chain, especially when some products are physically inaccessible.
Innovation Solution
A system utilizing elliptic curve cryptography and bilinear pairings to generate authentication data, which is stored on RFID tags or other forms of encoding, allowing for simultaneous and efficient verification of product-packaging pairs using bilinear computations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional authentication methods are used for packaged products, then individual product verification is possible, but authentication of large quantities of products is inefficient and time-consuming
Solution Approach 1:
The patent combines multiple product authentication operations into a single batch verification process. By aggregating authentication data from multiple products and performing unified bilinear pairing computations, the system authenticates large quantities of products simultaneously rather than individually, dramatically improving throughput and reducing total verification time.
Solution Approach 2:
The system performs preliminary actions by pre-computing and storing authentication data (including bilinear pairing results) on RFID tags during the packaging process. This allows the authentication system to retrieve and verify pre-prepared data rather than performing complex cryptographic computations in real-time for each product, significantly accelerating the authentication process.
2Speed
If authentication data is stored on RFID tags, then rapid reading of multiple products is enabled, but computational overhead for verification remains high
Solution Approach 1:
The patent extracts and pre-computes the most computationally intensive parts of the authentication process (bilinear pairing computations) and stores the results directly on RFID tags during packaging. This shifts the computational burden from the verification phase to the packaging phase, allowing the verification system to perform only lightweight validation operations when reading RFID tags, thereby reducing real-time computational overhead and energy consumption.
3Measurement precision
If bilinear pairing computations are performed for each product, then authentication accuracy is maintained, but processing time increases significantly
Solution Approach 1:
The patent merges multiple individual bilinear pairing computations into a single batch verification process. By combining authentication data from multiple products and performing unified cryptographic verification, the system maintains the same authentication accuracy as individual verification while reducing total processing time through parallel processing and computational optimization.
4Productivity
If products are packaged in large quantities, then distribution efficiency is improved, but verification of all products becomes increasingly difficult
Solution Approach 1:
The patent implements self-service authentication by embedding RFID tags with pre-computed authentication data during the packaging process. Each product-packaging pair autonomously carries its own verification credentials, allowing the authentication system to independently verify products without requiring manual inspection or complex external validation processes, thereby making large-scale verification as easy as reading RFID tags.
Data Source
AI summary
Example implementations provide a computer program product for authenticating a number of grouped product-packaging pairs, in which each product-packaging pair comprises a respective message, associated with a respective product, and a respective signature associated with the message; the computer program product comprising machine executable instructions arranged, when processed, to: read the product messages and the signatures from the grouped product-packaging pairs; determine and store bilinear computation results associated with each of the messages, and each of the signatures; and determine, from the stored bilinear computation results, whether or not at least one product-packaging pair of the number of grouped product-packaging pairs is authentic.