DECENTRALIZED ELECTRONIC TRANSFER SYSTEM

• US 20150033301A1
• Filed: 02/25/2013
• Published: 01/29/2015
• Est. Priority Date: 03/02/2012
• Status: Active Grant

• Current Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Original Assignee: Alcatel-Lucent SA (Nokia Corporation)
• Inventors: Pianese, Fabio, Evans, Noah
• Granted Patent: US 9,258,307 B2
• Time in Patent Office: Days
• US Class Current: 726/5
• CPC Class Codes: G06Q 20/0655 e-cash managed centrally
• CPC Class Codes: G06Q 20/3672 initialising or reloading thereof
• CPC Class Codes: H04L 63/083 using passwords cryptographic mechanisms or cryptographic arrangements for entity authentication using a predetermined code H04L9/3226
• CPC Class Codes: H04L 63/10 for controlling access to devices or network resources
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

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

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

generating a first digital code that represents a first transaction from a first user'"'"'s secure repository to the first user'"'"'s unsecure repository;

sending the first digital code to a secure storage memory related to the unsecure repository to be stored in an area of the memory;

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

connecting the processor to the internet;

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

publishing by the processor via the internet connection of the retrieved digital code to validate the first transaction; and

publishing by the processor via the internet connection of the second digital code to validate the second transaction.

2. The method according to claim 1, wherein the first digital code comprises a plurality of digital codes each representing a transaction of a predetermined value, and wherein the processor retrieves a selection of the plurality of digital 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, wherein a third digital code is generated by the processor related to the unsecure repository 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 the sum of the second transaction'"'"'s value and the third transaction'"'"'s value, the third digital code being published, after the publication of the retrieved digital code, by the processor via the internet connection to validate the third transaction.

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

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

6. The method claim 1, 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.

7. The method according to claim 1, wherein the steps of publishing the first digital code and 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 steps of publishing the first digital code and the second digital code are executed via an atomic operation.

10. A repository for use in a decentralized electronic system, the repository being connected to a communication means for receiving a first digital code from a secure repository, to a secure storage memory adapted to store the first digital code, to a processor adapted to access the secure storage memory, and configured to generate a second digital code that represents a second transaction, and to input means for instructing the processor to generate the second digital code, the processor being configured to subsequently publish, via the communication means, the first digital code and the second digital code.