# US 2025/0097020 A1 · System and method for securely sharing cryptographic material

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

- Number: US 2025/0097020 A1
- Document ID: US20250097020A1
- Status: Published application
- Kind: A1
- Application number: 18/770,199
- Filed: 2024-07-11
- Published: 2025-03-20
- Earliest claimed: 2017-12-13
- Assignees: nChain Licensing AG
- Applicants: nChain Licensing AG
- Inventors: Alexandra COVACI; Simone MADEO; Patrick MOTYLINSKI; Stephane VINCENT
- Web page: https://patentgrep.com/patent/US20250097020A1

## CPC

- H04L 9/085: {Secret sharing or secret splitting, e.g. threshold schemes}
- G06F 7/725: {over elliptic curves}
- G06F 17/17: Function evaluation by approximation methods, e.g. inter- or extrapolation, smoothing, least mean square method ({G06F17/18 takes precedence } ; interpolation for numerical control G05B19/18)
- H04L 9/14: using a plurality of keys or algorithms
- H04L 9/3066: {involving algebraic varieties, e.g. elliptic or hyper-elliptic curves}
- H04L 9/3093: {involving Lattices or polynomial equations, e.g. NTRU scheme}
- H04L 9/3218: {using proof of knowledge, e.g. Fiat-Shamir, GQ, Schnorr, ornon-interactive zero-knowledge proofs}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04W 12/04: Key management, e.g. using generic bootstrapping architecture [GBA]
- H04L 9/0841: {involving Diffie-Hellman or related key agreement protocols}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Systems and methods described herein relate to techniques in which multiple parties each generate and exchange quantities that are based on a shared secret (e.g., powers of the shared secret) without exposing the shared secret. According to a protocol, two or more parties may exchange sets of elliptic curve points generated over polynomials that can be used, by each of the two or more parties, to determine a power of a shared secret. The protocol may be utilised as part of determining parameters for a smart contract that is broadcast to a blockchain network (e.g., Bitcoin). Based on the protocol, an additional party (e.g., a third party different from the two or more parties) may perform a computational task such as execution of the smart contract.

## Claims

### Claim at position 1

1-15. (canceled)

### Claim 16

A computer-implemented method comprising:
at each of a plurality of participants, determining a respective polynomial;
collectively agreeing, among the plurality of participants, a set of points;
at each of the plurality of participants, evaluating its respective polynomial in the set of points to obtain a respective plurality of values;
at each of the plurality of participants, distributing powers of its respective plurality of values to the other participants, and receiving corresponding powers of values from the other participants;
at each of a first participant and a second participant of said plurality of participants:
using the powers of the values to determine a power of a sum of the respective polynomials of the participants, wherein the power of the sum corresponds to a power of a secret, and
based at least in part on the power of the secret, determining a common reference string; and
generating, using the common reference string, a smart contract comprising a first transaction input provided by said first participant and a second transaction input provided said second participant.

### Claim 17 (depends on 16)

The computer-implemented method of claim 16, wherein correct execution of the smart contract by a computing entity results in the computing entity being able to generate a blockchain transaction using an output of the smart contract.

### Claim 18 (depends on 16)

The computer-implemented method of claim 16, wherein said first participant and said second participant exchange additional parameters that are used to determine the common reference string.

### Claim 19 (depends on 16)

The computer-implemented method according to claim 16, wherein the set of points are a set of elliptic curve points.

### Claim 20 (depends on 16)

The computer-implemented method according to claim 16, wherein determining the power of the sum of the polynomials is based on a Lagrange interpolation.

### Claim 21 (depends on 16)

The computer-implemented method according to claim 16, wherein said common reference string comprises a verification key and an evaluation key.

### Claim 22 (depends on 16)

The computer-implemented method according to claim 16, wherein off-chain communications are utilised in distribution of the powers of the values of the polynomials to the participants.

### Claim 23 (depends on 16)

The computer-implemented method according to claim 16, wherein the plurality of participants is exactly two participants.

### Claim 24 (depends on 16)

The computer-implemented method according to claim 16, wherein the secret is determined based on the power of the sum of the polynomials evaluated at a particular point.

### Claim 25 (depends on 24)

The computer-implemented method according to claim 24, wherein the particular point is an intersection point.

### Claim 26 (depends on 25)

The computer-implemented method according to claim 25, wherein the set of points excludes the intersection point.

### Claim 27 (depends on 16)

The computer-implemented method according to claim 16, wherein the polynomials evaluated in the set of points are of at least order 2.

### Claim 28 (depends on 16)

The computer-implemented method according to claim 16, wherein each point of the set of points is a different point.

### Claim 29 (depends on 16)

A system, comprising:
a processor; and
memory including executable instructions that, as a result of execution by the processor, causes the system to perform the computer-implemented method according to claim 16.

### Claim 30 (depends on 16)

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform the computer-implemented method according to claim 16.
