IP Library Granted Patent US 9,258,307
Granted Patent B2
US 9,258,307 · App. 14/378,139 · Granted Feb 9, 2016

Decentralized electronic transfer system

Inventors: Fabio Pianese (Brussels, BE); Noah Evans (Antwerp, BE)
Assignee: Alcatel Lucent
H04L63/10G06Q20/0655G06Q20/3672H04L63/083H04L67/1097
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,258,307
App. No.
14/378,139
Granted
Feb 9, 2016
Kind
B2
Abstract

An exemplary technique is provided for use in a decentralized electronic transfer system. A first digital code that represents a first transaction is generated from a first user's secure repository to the first user's unsecure repository. The first digital code is sent to a secure storage memory related to the unsecure repository to be stored in an area of the memory. A processor related to the unsecure repository generates a second digital code that represents a second transaction from the unsecure repository to the second user's repository. The processor retrieves the first digital code stored in the secure storage memory and publishes the retrieved digital code to validate the first transaction. In addition, the processor publishes the second digital code to validate the second transaction.

Claims (16)

1. A method for use in a decentralized electronic transfer system, the method comprising the steps of:

receiving, at a processor related to an unsecure repository of a first user, a first digital code that represents a first transaction from a secure repository of the first user to the unsecure repository;

storing, by the processor, the first digital code in an area of a secure storage memory related to the unsecure repository;

generating, by the processor, a second digital code that represents a second transaction from the unsecure repository to a second user's repository;

retrieving, by the processor, the first digital code stored in the secure storage memory;

publishing, by the processor via an Internet connection, the retrieved first digital code to validate the first transaction; and

publishing, by the processor via the Internet connection, the second digital code to validate the second transaction;

wherein the processor generates digital codes based on a first public address that represents the unsecure repository, a second public address that represents the second user's repository, a value and a private signature related to the unsecure repository.

2. The method according to claim 1 , wherein the first digital code comprises a plurality of digital sub-codes each representing a transaction of a predetermined value, and wherein the processor retrieves a selection of the plurality of digital sub-codes in such a manner that the value of the selection is equal or higher than a second transaction's value.

3. The method according to claim 2 , further comprising the step of generating, by the processor, a third digital code that represents a third transaction from the unsecure repository to the secure repository, the third transaction representing a value in such a manner that the value of the selection is equal to a sum of the second transaction's value and the third transaction's value.

4. The method according to claim 3 , further comprising the step of publishing, by the processor via the Internet connection, the third digital code, after the publication of the retrieved first digital code, to validate the third transaction.

5. The method according to claim 1 , wherein the step of retrieving, by the processor, the first digital code is preceded by the step of entering a pin-code to gain access to the secure storage memory.

6. The method according to claim 1 , wherein the step of generating, by the processor, the second digital code is preceded by the step of entering a second pin-code to gain access to a codes generating function in the processor.

7. The method according to claim 1 , wherein the step of publishing, by the processor via the Internet connection, the retrieved first digital code and the step of publishing, by the processor via the Internet connection, the second digital code are executed in a predetermined timeframe.

8. The method according to claim 7 , wherein the predetermined timeframe is smaller than 5 minutes.

9. The method according to claim 7 , wherein the step of publishing, by the processor via the Internet connection, the retrieved first digital code and the step of publishing, by the processor via the Internet connection, the second digital code are executed via an atomic operation.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 10, 2014
From: PIANESE, FABIO; EVANS, NOAH
To: ALCATEL LUCENT
Reel/Frame 033713/0313 →
Priority Claims (1)
EP 12305254 · Mar 2, 2012 · regional
Continuity (1)
Related Publication 20150033301A1 · Jan 29, 2015