Homomorphic Encryption Automaton String Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
It is challenging to determine whether a string has been accepted by an automaton without revealing the string held by the client to the server or the automaton held by the server to the client.
Innovation Solution
A system where a server and client use encryption schemes with homomorphism to encode and decode data, allowing the client to input a string and the server to determine if the automaton has transitioned to a final state without disclosing the string or automaton details, by using coding sequences and state keys to encrypt and decrypt exchange data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the client sends the string to the server for checking, then the server can determine whether the automaton accepts the string, but the string is disclosed to the server
Solution Approach 1:
The patent introduces an intermediary encryption mechanism where the client encrypts the string before sending it to the server. The server operates on encrypted data without being able to decrypt or view the original string, thus maintaining string privacy while still enabling acceptance checking through cryptographic operations.
Solution Approach 2:
The patent replaces the traditional mechanical approach of sending plaintext strings with a cryptographic system. Instead of direct string comparison, the system uses encrypted representations and cryptographic protocols to perform acceptance checking, substituting physical information transfer with mathematical transformations that preserve privacy.
2Reliability
If the server keeps the automaton private, then the client cannot verify the automaton's correctness, but disclosing the automaton compromises security
Solution Approach 1:
The patent creates cryptographic copies or representations of the automaton's state and transition information that can be verified by the client without revealing the actual automaton structure. These cryptographic proofs allow verification of correctness while maintaining the security and privacy of the original automaton implementation.
Solution Approach 2:
The patent uses cryptographic intermediaries such as zero-knowledge proofs and encrypted state representations that enable the client to verify automaton correctness without directly accessing or learning about the automaton's internal structure, thus maintaining both reliability and security.
3Measurement precision
If both parties disclose their data, then mutual verification is achieved, but privacy and security are compromised
Solution Approach 1:
The patent introduces cryptographic intermediaries that enable mutual verification without direct data disclosure. Both parties can verify the correctness of their respective data and operations through cryptographic proofs and encrypted exchanges, achieving verification accuracy while maintaining data privacy through mathematical rather than direct informational verification.
Data Source
AI summary
A server having an automaton whose state transitions in accordance with received characters, determines whether the automaton has transitioned to a final state on the basis of the characters. The server receives a coding sequence from the client in the characters included in the string. The coding sequence elements corresponding to the characters are values encrypting a non-unity using a first encryption scheme having homomorphism, and whose elements not corresponding to the characters are values encrypting a unity using the first encrypting scheme. The server generates, in response to receiving the coding sequence, exchange data encrypting a subsequent state key corresponding to each of a plurality of previous states of the automaton on the basis of the coding sequence using the first encryption scheme; encrypts exchange data with the corresponding previous state key and sends the encrypted exchange data to the client.