# US 2026/0100822 A1 · Improved security and efficiency for multi-party computation wallets

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

- Number: US 2026/0100822 A1
- Document ID: US20260100822A1
- Status: Published application
- Kind: A1
- Application number: 18/909,358
- Filed: 2024-10-08
- Published: 2026-04-09
- Earliest claimed: 2024-10-08
- Assignees: Circle Internet Group, Inc.
- Applicants: Circle Internet Group, Inc.
- Inventors: Vipin Singh Sehrawat
- Web page: https://patentgrep.com/patent/US20260100822A1

## CPC

- H04L 9/0838: {Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these (network architectures or network communication protocols for key exchange in a packet data network H04L63/061)}
- G06Q 20/3674: {involving authentication}
- G06Q 20/3678: {e-cash details, e.g. blinded, divisible or detecting double spending}
- H04L 9/008: {involving homomorphic encryption}
- H04L 9/0816: {Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use}
- H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes}
- H04L 2209/46: Secure multiparty computation, e.g. millionaire problem
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

Methods, systems, and apparatus for multiplicative to additive share conversions in MPC wallet protocols. In one aspect, a first party generates a graded encoding for a first secret value using a first LWE instance that comprises the first secret value. The first party receives a graded encoding for the second secret value from a second party in possession of a second secret value. The first party computes a product of: the graded encoding for the second secret value, the graded encoding for the first secret value, and a first public matrix generated by or assigned to the first party, where the product comprises a second additive secret value and forms a second LWE instance. The first party inverts the second LWE instance to compute a first additive secret value. The first party performs a cryptographic operation in an MPC wallet protocol using the first additive secret value.

## Claims

### Claim at position 1

-14. (canceled)

### Claim 15

A classical computing system comprising one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
generating, by a first party in possession of a first secret value, a graded encoding for the first secret value using a first learning with errors (LWE) instance that comprises the first secret value;
receiving, by the first party and from a second party in possession of a second secret value, a graded encoding for the second secret value, wherein the secret is equal to a product of the first secret value and the second secret value;
computing, by the first party, a product of: the graded encoding for the second secret value, the graded encoding for the first secret value, and a first public matrix generated by or assigned to the first party, wherein the product comprises a second additive secret value and forms a second LWE instance;
computing, by inverting the second LWE instance, a first additive secret value, wherein the secret is equal to a sum of the first additive secret value and the second additive secret value; and
performing, by the first party, a cryptographic operation in an MPC wallet protocol using the first additive secret value.

### Claim 16 (depends on 15)

The classical computing system of claim 15, wherein the first LWE instance is given by a sum of i) a product of a second public matrix and the first secret value, and ii) a first LWE error matrix, wherein the second public matrix comprises a matrix generated by or assigned to the second party.

### Claim 17 (depends on 15)

The classical computing system of claim 15, wherein the first LWE instance is equal to a product of the graded encoding for the first secret value and a first public matrix, wherein the first public matrix comprises a matrix generated by or assigned to the first party.

### Claim 18

A computer-readable storage medium comprising instructions stored thereon that are executable by a classical processing device and upon such execution cause the processing device to perform operations comprising:
generating, by a first party in possession of a first secret value, a graded encoding for the first secret value using a first learning with errors (LWE) instance that comprises the first secret value;
receiving, by the first party and from a second party in possession of a second secret value, a graded encoding for the second secret value, wherein the secret is equal to a product of the first secret value and the second secret value;
computing, by the first party, a product of: the graded encoding for the second secret value, the graded encoding for the first secret value, and a first public matrix generated by or assigned to the first party, wherein the product comprises a second additive secret value and forms a second LWE instance;
computing, by inverting the second LWE instance, a first additive secret value, wherein the secret is equal to a sum of the first additive secret value and the second additive secret value; and
performing, by the first party, a cryptographic operation in an MPC wallet protocol using the first additive secret value.

### Claim 19 (depends on 18)

The computer-readable storage medium of claim 18, wherein the first LWE instance is given by a sum of i) a product of a second public matrix and the first secret value, and ii) a first LWE error matrix, wherein the second public matrix comprises a matrix generated by or assigned to the second party.

### Claim 20 (depends on 18)

The computer-readable storage medium of claim 18, wherein the first LWE instance is equal to a product of the graded encoding for the first secret value and a first public matrix, wherein the first public matrix comprises a matrix generated by or assigned to the first party.

### Claim 21 (depends on 15)

The classical computing system of claim 15, wherein the second LWE instance comprises a product of: the first public matrix and a sum of i) the second secret value multiplied by the first secret value and ii) an element of a ring used to sample the first and second secret values multiplied by the graded encoding for the first secret value multiplied by the first public matrix, added to a second LWE error matrix.

### Claim 22 (depends on 15)

The classical computing system of claim 15, wherein the graded encoding for the second secret value is generated using i) a third LWE instance that comprises the second secret value and ii) an element of a ring used to sample the first secret value and the second secret value.

### Claim 23 (depends on 22)

The classical computing system of claim 22, wherein the third LWE instance is equal to a sum of i) a product of the first public matrix and the second secret value, and ii) a third LWE error matrix.

### Claim 24 (depends on 22)

The classical computing system of claim 22, wherein a product of the graded encoding for the second secret value and a second public matrix generated by or assigned to the second party is equal to a sum of: a) the third LWE instance and b) a product of the first public matrix, the element of the ring used to sample the first secret value and the second secret value, and the second public matrix.

### Claim 25 (depends on 15)

The classical computing system of claim 15, wherein the second additive secret value is equal to a negative product of: an element of a ring used to sample the first secret value and the second secret value, the graded encoding of the first secret value, and the first public matrix.

### Claim 26 (depends on 15)

The classical computing system of claim 15, wherein the first additive secret value is equal to a sum of i) the second secret value multiplied by the first secret value and ii) an element of a ring used to sample the first and second secret values multiplied by the graded encoding for the first secret value multiplied by the first public matrix.

### Claim 27 (depends on 15)

The classical computing system of claim 15, wherein operations further comprise sending, by the first party, the graded encoding for the first secret value to a second party that possesses a second secret value.

### Claim 28 (depends on 18)

The computer-readable storage medium of claim 18, wherein the second LWE instance comprises a product of: the first public matrix and a sum of i) the second secret value multiplied by the first secret value and ii) an element of a ring used to sample the first and second secret values multiplied by the graded encoding for the first secret value multiplied by the first public matrix, added to a second LWE error matrix.

### Claim 29 (depends on 18)

The computer-readable storage medium of claim 18, wherein the graded encoding for the second secret value is generated using i) a third LWE instance that comprises the second secret value and ii) an element of a ring used to sample the first secret value and the second secret value.

### Claim 30 (depends on 29)

The computer-readable storage medium of claim 29, wherein the third LWE instance is equal to a sum of i) a product of the first public matrix and the second secret value, and ii) a third LWE error matrix.

### Claim 31 (depends on 29)

The computer-readable storage medium of claim 29, wherein a product of the graded encoding for the second secret value and a second public matrix generated by or assigned to the second party is equal to a sum of: a) the third LWE instance and b) a product of the first public matrix, the element of the ring used to sample the first secret value and the second secret value, and the second public matrix.

### Claim 32 (depends on 18)

The computer-readable storage medium of claim 18, wherein the second additive secret value is equal to a negative product of: an element of a ring used to sample the first secret value and the second secret value, the graded encoding of the first secret value, and the first public matrix.

### Claim 33 (depends on 18)

The computer-readable storage medium of claim 18, wherein the first additive secret value is equal to a sum of i) the second secret value multiplied by the first secret value and ii) an element of a ring used to sample the first and second secret values multiplied by the graded encoding for the first secret value multiplied by the first public matrix.

### Claim 34 (depends on 18)

The computer-readable storage medium of claim 18, wherein operations further comprise sending, by the first party, the graded encoding for the first secret value to a second party that possesses a second secret value.
