Granted Patent B2

US 12,231,568 · App. 17/224,374 · Granted Feb 18, 2025

Inventors: Muslum Ozgur Ozmen (Tampa, FL); Rouzbeh Behnia (Tampa, FL); Attila Altay Yavuz (Tampa, FL)

Assignee: University of South Florida

H04L9/3218G06F17/16H04L9/3093H04L9/50

Abstract

Claims (68)

1. A computer-implemented method for providing a proof-of-work for a blockchain comprising:

receiving a cryptocurrency transaction request by a first computing device of a plurality of computing devices of a peer-to-peer blockchain network associated with the cryptocurrency; and

in response to receiving the cryptocurrency transaction request:

generating a block for a blockchain by the first computing device in the peer-to-peer blockchain network, wherein the block represents the cryptocurrency transaction request;

hashing the received block into a positive integer S and a list of positive integers (a 1 , a 2 , . . . , a n ) to create a shortest vector problem proof-of-work (PoW) by the first computing device;

solving the shortest vector problem PoW using a lattice sieving algorithm by the first computing device to generate a solution (∈ 1 , ∈ 2 , . . . , ∈ n );

transmitting the block and the solution to each other computing device of the plurality of computing devices in the peer-to-peer blockchain network by the first computing device; and

in response to solving the shortest vector problem PoW, adding the block to the blockchain by the first computing device.

2. The method of claim 1 , wherein the lattice sieving algorithm comprises a knapsack-based algorithm.

3. The method of claim 1 , wherein a difficulty of the shortest vector problem PoW may be increased by increasing a number of positive integers n in the list of positive integers.

4. The method of claim 1 , further comprising:

receiving the block and the solution (∈ 1 , ∈ 2 , . . . , ∈ n ) by another computing device of the plurality of computing devices;

verifying the solution (∈ 1 , ∈ 2 , . . . , ∈ n ) by the another computing device of the plurality of computing devices by determining that

S

=

∑

i

=

1

n

⁢

ϵ

i

⁢

a

i

,

 wherein ∈ i is an i th integer in the solution and a i is an i th integer in the list of positive integers; and

in response to verifying the solution, adding the block to the blockchain by the another computing device.

5. A computer-implemented system for providing a proof-of-work for a blockchain comprising:

a peer-to-peer blockchain network comprising a plurality of computing devices, wherein each computing device is configured to:

receiving a cryptocurrency transaction request by a first computing device of a plurality of computing devices of a peer-to-peer blockchain network associated with the cryptocurrency; and

in response to receiving the cryptocurrency transaction request:

generate a block for a blockchain;

hash the received block into a positive integer S and a list of positive integers (a 1 , a 2 , . . . , a n ) to create a shortest vector problem proof-of-work (PoW);

solve the shortest vector problem PoW using a lattice sieving algorithm to generate a solution (∈ 1 , ∈ 2 , . . . , ∈ n );

transmit the block and the solution to each node of the plurality of nodes in the peer-to-peer blockchain network; and

in response to solving the shortest vector problem PoW, add the block to the blockchain.

6. The system of claim 5 , wherein the lattice sieving algorithm comprises a knapsack-based algorithm.

7. The system of claim 5 , wherein a difficulty of the shortest vector problem PoW may be increased by increasing a number of positive integers n in the list of positive integers.

8. The system of claim 5 , wherein each computing device is further configured to:

receive the block and the solution (∈ 1 , ∈ 2 , . . . , ∈ n ) from another computing device of the plurality of computing devices;

verify the solution (∈ 1 , ∈ 2 , . . . , ∈ n ) by determining that

S

=

∑

i

=

1

n

⁢

ϵ

i

⁢

a

i

,

 wherein ∈ i is an i th integer in the solution and a i is an i th integer in the list of positive integers; and

in response to verifying the solution, add the block to the blockchain.

9. A non-transitory computer readable medium storing instructions that when executed by at least one processor of a first computing device of a plurality of computing devices of a peer-to-peer blockchain associated with a cyrptocurrency cause the at least one processor to:

receive a cryptocurrency transaction request associated with the cryptocurrency; and

in response to receiving the cryptocurrency transaction request:

generate a block for a blockchain;

hash the received block into a positive integer S and a list of positive integers (a 1 , a 2 , . . . , a n ) to create a shortest vector problem proof-of-work (PoW);

solve the shortest vector problem PoW using a lattice sieving algorithm to generate a solution (∈ 1 , ∈ 2 , . . . , ∈ n );

transmit the block and the solution to each other computing device of the plurality of computing devices in the peer-to-peer blockchain network; and

in response to solving the shortest vector problem PoW, add the block to the blockchain.

10. The non-transitory computer readable medium of claim 9 , wherein the lattice sieving algorithm comprises a knapsack-based algorithm.

Assignments (1)

Continuity (2)

References Cited (51)

Cited By (1)

US 12,627,478