# US 2019/0356481 A1 · System and method for securing digital assets

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

- Number: US 2019/0356481 A1
- Document ID: US20190356481A1
- Status: Published application
- Kind: A1
- Application number: 16/410,656
- Filed: 2019-05-13
- Published: 2019-11-21
- Earliest claimed: 2018-05-18
- Assignees: Qredo Ltd.
- Applicants: Qredo Ltd.
- Inventors: Brian Spector; Chrstopher Steven Morris; Howard Kitto; Kealan McCusker
- Web page: https://patentgrep.com/patent/US20190356481A1

## CPC

- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- G06Q 20/065: {using e-cash}
- G06Q 20/10: specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
- G06Q 20/36: using electronic wallets or electronic money safes
- G06Q 20/3674: {involving authentication}
- G06Q 20/38215: {Use of certificates or encrypted proofs of transaction rights}
- G06Q 20/3825: {Use of electronic signatures}
- G06Q 20/3829: {involving key management}
- H04L 9/0833: {involving conference or group key (network architectures or network communication protocols for key management in group communication in a packet data network H04L63/065)}
- H04L 9/0844: {with user authentication or key authentication, e.g. ElGamal, MTI, MQV-Menezes-Qu-Vanstone protocol or Diffie-Hellman protocols using implicitly-certified keys}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/3247: {involving digital signatures}
- H04L 9/3255: {using group based signatures, e.g. ring or threshold signatures}
- H04L 63/045: {wherein the sending and receiving network entities apply hybrid encryption, i.e. combination of symmetric and asymmetric encryption (cryptographic mechanisms or cryptographic arrangements using a plurality of keys or algorithms H04L9/14)}
- G06Q 2220/00: Business processing using cryptography
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/56: Financial cryptography, e.g. electronic payment or e-cash
- 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
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The present invention generally relates to the field of data encryption processes for crypto-currency or other digital asset transactions between a principal and beneficiary utilizing a custodian. Cryptographic protocols protect the asset from the custodian. It can also protect the asset from the principal. It can also protect the asset against the beneficiary until such time as the beneficiary can prove certain logical conditions that give it exclusive control over the digital asset.

## Claims

### Claim 1

A method executed by a computer system comprised of a first computer, a second computer executing a beneficiary process and at least one server operatively communicating over a data network, for securely transferring a digital asset comprising:
receiving from the first computer a deposit order message comprised of data designating the digital asset,
receiving data corresponding to a beneficiary;
generating using the received beneficiary data a data representing a shared secret;
generating a deposit address using at least part of the shared secret data;
generating a first transaction data package comprised of data that designates the received deposit address as a destination of the transaction; and
receiving by the beneficiary process at least part of the first transaction data package;
obtaining by the beneficiary process at least part of the shared secret data.

### Claim 2 (depends on 1)

The method of claim 1 where the step of obtaining is comprised of receiving by the beneficiary process the at least part of the shared secret data.

### Claim 3 (depends on 1)

The method of claim 1 where the step of obtaining is comprised of generating by the beneficiary process, the at least part of the shared secret data.

### Claim 4 (depends on 1)

The method of claim 1 further comprising:
storing by the system at least part of the first transaction data package in a ledger system.

### Claim 5 (depends on 1)

The method of claim 1 further comprising:
generating a redemption script comprised of data representing a first and a second logical tests, the first logical test being proof of possession of the at least part of the shared secret data and the second logical test being proof of possession of a secret data corresponding to the beneficiary process.

### Claim 6 (depends on 5)

The method of claim 5 further comprising,
generating the deposit address using the redemption script.

### Claim 7 (depends on 1)

The method of claim 1 where the at least part of the shared secret data is a public key of a public key- private key pair.

### Claim 8 (depends on 1)

The method of claim 1 where the step of generating by the beneficiary the at least part of the shared secret data is by using an authenticated key exchange protocol.

### Claim 9 (depends on 1)

The method of claim 1 further comprising using a cryptographic protocol to validate a logical condition that the beneficiary process is in possession of at least part of the shared secret data.

### Claim 10 (depends on 1)

The method of claim 1 where the step of generating using the beneficiary data a data representing a shared secret is comprised of using a completed ring signature as an input.

### Claim 11 (depends on 1)

The method of claim 1 where the step of generating using the beneficiary data a data representing a shared secret is comprised of using a deterministic process.

### Claim 12

A computer system comprised of a first computer executing a principal process, a second computer executing a beneficiary process and at least one server operatively communicating over a data network, for securely transferring control of a digital asset from the principal process to the beneficiary process comprising:
a module adapted by logic to receive a deposit order message comprised of data designating the digital asset and to receive data corresponding to a beneficiary;
a module adapted by logic to use the received beneficiary data to generate a data representing a shared secret and to generate a deposit address data using at least part of the generated shared secret data;
a module adapted by logic to generate a first transaction data package comprised of data that designates the received deposit address as a destination of the transaction;
a module adapted by logic operating as the beneficiary process to receive at least part of the first transaction package and to obtain the at least part of the shared secret data.

### Claim 13 (depends on 12)

The system of claim 12 where the module adapted by logic operating as the beneficiary process is further adapted to receive the at least part of the shared secret data.

### Claim 14 (depends on 12)

The system of claim 12 where the module adapted by logic operating as the beneficiary process is further adapted to generate the at least part of the shared secret data.

### Claim 15 (depends on 12)

The system of claim 12 where the system is further adapted by logic to store at least part the first transaction data package in a ledger system;

### Claim 16 (depends on 12)

The system of claim 12 where the system is further adapted by logic to:
generate a redemption script comprised of data representing a first and a second logical test, the first logical test being proof of possession of the at least part of the shared secret data and the second logical test being proof of possession of a secret data corresponding to the beneficiary process.

### Claim 17 (depends on 16)

The system of claim 16 where the system is further adapted by logic to generate the deposit address using the redemption script.

### Claim 18 (depends on 12)

The system of claim 12 where the beneficiary process is further adapted by logic to generate the data corresponding to the beneficiary process and the at least part of the shared secret data so that they are cryptographically related.

### Claim 19 (depends on 12)

The system of claim 12 where the at least part of the shared secret is a public key of a cryptographically related public key and private key pair.

### Claim 20 (depends on 15)

The system of claim 15 where the system is further adapted by logic to receive at the beneficiary process the location of the stored transaction data package.

### Claim 21 (depends on 12)

The system of claim 12 where the system is further adapted by logic to generate at the server a public-private key pair as the at least part of the shared secret and the beneficiary process is further adapted by logic to generate the private key of the generated public-private key pair.

### Claim 22 (depends on 12)

The system of claim 12 where the beneficiary process is further adapted by logic to generate a private key cryptographically related to the deposit address by using the generated private key of the generated public-private key pair.

### Claim 23 (depends on 12)

The system of claim 12 where the beneficiary process is further adapted by logic to generate the at least part of the shared secret data using an authenticated key exchange protocol.

### Claim 24 (depends on 12)

The system of claim 12 where the beneficiary process is further adapted by logic use a completed ring signature as input to generate the data representing a shared secret.

### Claim 25 (depends on 12)

The system of claim 12 where the beneficiary process is further adapted by logic use a deterministic process to generate the data representing a shared secret.

### Claim 26

A computer system comprised of a first computer executing a principal process, a second computer executing a beneficiary process and at least one server operatively communicating over a data network, adapted by logic to securely transfer control of a digital asset to the beneficiary process comprising:
a module adapted by logic to create a transaction data structure that is comprised of or refers to a redemption script designated by the system as a first payment destination, where the redemption script is comprised of code that expresses a logical test of a first and second logical conditions, the first condition verifying a secret corresponding to the beneficiary process and the second condition verifying possession of a secret shared between the at least one server and the beneficiary process; and
a module adapted by logic to verify that the beneficiary process meets both logical conditions.

### Claim 27 (depends on 27)

The system of claim 27 further adapted by logic to transfer the shared secret from at least one server to the beneficiary process.
