# US 2022/0092150 A1 · Calculation verification for approximate calculation

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0092150 A1
- Document ID: US20220092150A1
- Status: Published application
- Kind: A1
- Application number: 17/422,278
- Filed: 2020-01-10
- Published: 2022-03-24
- Earliest claimed: 2019-01-11
- Assignees: Crypto Lab Inc.
- Applicants: Crypto Lab Inc.
- Inventors: Jung Hee Cheon; Dongwoo Kim; Daejun Park
- Web page: https://patentgrep.com/patent/US20220092150A1

## CPC

- G06F 17/11: for solving equations {, e.g. nonlinear equations, general mathematical optimization problems (optimization specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06F 17/156: {using a domain transform, e.g. Fourier transform, polynomial transform, number theoretic transform}
- G06F 7/544: for evaluating functions by calculation {(G06F7/4824 takes precedence)}
- H04L 9/00: {Cryptographic mechanisms or cryptographic} arrangements for secret or secure communications; Network security protocols
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed is a method of arithmetic operation. The arithmetic operation includes receiving an input value, generating an output value by reflecting the input value to a preset arithmetic circuit on a finite commutative ring and a first polynomial function to verify the output value, and transferring the generated output value and the first polynomial function to an external device.

## Claims

### Claim 1

A method of computation operation, the method comprising:
receiving an input value;
generating an output value by reflecting the input value to a preset arithmetic circuit on a finite commutative ring and a first polynomial function to verify the output value; and
transferring the generated output value and the first polynomial function to an external device.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the input value and the output value is a homomorphic ciphertext.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
receiving a random value randomly extracted from the finite commutative ring;
generating computation value for the random value and a second polynomial function to verify the computation value; and
transferring the generated computation value and the second polynomial to the external device.

### Claim 4 (depends on 3)

The method of claim 3, wherein the finite commutative ring is a Galois ring.

### Claim 5 (depends on 3)

The method of claim 3, wherein each of the generating the first polynomial function and the second polynomial function comprises generating a polynomial function by using an n-variable polynomial.

### Claim 6 (depends on 1)

The method of claim 1, wherein the arithmetic circuit is composed of a plurality of layers, and each layer comprises at least one of an addition gate or a multiplication gate.

### Claim 7 (depends on 1)

The method of claim 1, wherein the arithmetic circuit comprises a modular computation operation, a polynomial operation to make a lower bit to zero, and a round-off operation using a division operation.

### Claim 8

A method of calculation verification, the method comprising:
transferring an input value to an external device;
receiving an operation result generated by reflecting the input value to a preset arithmetic circuit on a finite commutative ring and a polynomial function;
performing a verification operation using the received polynomial function; and
verifying the arithmetic operation by the external device using the verified operation result and the received arithmetic operation result.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
extracting a random value from a finite commutative ring; and
transferring the extracted random value to the external device.

### Claim 10 (depends on 9)

The method of claim 9, wherein the extracting comprises extracting a random value from a set which is a subset of the finite commutative ring and in which a difference between two different numbers is not a zero divisor.

### Claim 11 (depends on 10)

The method of claim 10, wherein the finite commutative ring is a Galois ring.

### Claim 12 (depends on 9)

The method of claim 9, further comprising:
receiving a polynomial function corresponding to the transferred random value,
wherein the verifying comprises the arithmetic operation by the external device by also using a polynomial function corresponding to the random value.

### Claim 13

A computation apparatus, comprising:
a communication device to receive an input value;
a memory storing at least one instruction; and
a processor to execute the at least one instruction,
wherein the processor, by performing the at least one instruction, is to:
generate an output value by reflecting the input value to a preset arithmetic circuit on a finite commutative ring and a first polynomial function to verify the output value, and
control the communication device to transfer the generated output value and the first polynomial function to an external device.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the processor:
based on receiving, from the external device, a random value extracted from the finite commutative ring, generates an computation value for the random value and a second polynomial function to verify the computation value, and
controls the communication device to transfer the generated computation value and the second polynomial to the external device.

### Claim 15 (depends on 14)

The apparatus of claim 14, wherein the processor generates the first polynomial function and the second polynomial function by using n-variable polynomial, and performs a verifiable computing operation as many as times corresponding to a number of variables of the n-variable polynomial.

### Claim 16 (depends on 13)

The apparatus of claim 13, wherein the arithmetic circuit is composed of a plurality of layers, and each layer comprises at least one of an addition gate or a multiplication gate.

### Claim 17 (depends on 13)

The apparatus of claim 13, wherein the arithmetic circuit comprises a modular arithmetic operation, a polynomial operation to make a lower bit to zero, and a round-off operation using a division operation.

### Claim 18 (depends on 13)

The apparatus of claim 13, wherein each of the input value and the output value is a homomorphic ciphertext.

### Claim 19

A computation apparatus, comprising:
a communication device to communicate with an external device;
a memory storing at least one instruction; and
a processor to execute the at least one instruction,
wherein the processor, by performing the at least one instruction, is to:
control the communication device to transfer an input value to an external device,
based on receiving an computation result generated by reflecting the input value to a preset arithmetic circuit on a finite commutative ring and a polynomial, perform verified operation using the received polynomial, and
verify arithmetic operation by the external device using the verified operation result and the received arithmetic operation result.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the processor extracts a random value from the finite commutative ring and controls the communication device to transfer the extracted random value to the external device.
