Encrypted Quotient Polynomial Ring Verification With One-Point Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for verifying operations on encrypted data, particularly quotient polynomial rings, suffer from inefficiencies and overhead due to the need for extensive computations in finite fields.
Innovation Solution
The method involves transmitting encrypted quotient polynomial rings to an external device, receiving a result value, and verifying it using a reverse order operation process through a random value and claim data, potentially with coefficient information, to efficiently confirm the accuracy of the operation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data encryption and operation verification method are applied to protect confidentiality and accuracy, then data security and operation accuracy are improved, but computational overhead and processing efficiency deteriorate
Solution Approach 1:
The verification process is divided into two independent phases: (1) encryption phase where quotient polynomial rings are encrypted using RLWE encryption scheme, and (2) verification phase where the encrypted results are verified using claim data and random values. This segmentation allows encryption and verification to be performed separately, reducing the computational overhead of continuous verification during processing.
Solution Approach 2:
Claim data is generated in advance by performing the operation process in reverse order on the encrypted quotient polynomial rings before the actual operation verification is needed. This preliminary generation of verification data eliminates the need for complex real-time verification computations, significantly improving processing efficiency while maintaining security.
2Measurement precision
If extensive computations in finite fields are performed for verification, then verification accuracy is improved, but verification time and computational overhead increase
Solution Approach 1:
Instead of performing extensive computations on the original encrypted data for verification, the system uses claim data which is a copy generated through reverse order operations. This claim data serves as a pre-computed verification reference that can be efficiently compared against actual operation results, maintaining verification accuracy while dramatically reducing computation time.
Solution Approach 2:
The verification approach changes the parameter being verified from the full encrypted operation result to a derived claim data set generated through reverse order operations. By transforming the verification target into this alternative parameter form, the system achieves the same verification accuracy with significantly reduced computational overhead.
Data Source
AI summary
Provided are an electronic apparatus and a method for verifying encrypted data. The verification method of the electronic apparatus includes transmitting encrypted quotient polynomial rings to an external device, receiving, from the external device, a result value calculated through an operation process for at least one layer on the basis of the transmitted encrypted polynomial rings, transmitting a random value to the external device, and receiving claim data obtained by performing the operation process in a reverse order on the basis of the random value from the external device, and verifying the received result value on the basis of a value of the quotient polynomial rings corresponding to the random value and the received claim data.