Nec Corporation

Nec C Orporation

Nec Europe Ltd.

Nec Laboratories Europe Gmbh

Frederik Armknecht

Ghassan Karame

Jens-Matthias Bohli

Joao Girao

Dirk Westhoff

Christian Gorke

Jun Furukawa

Wenting Li

Alfredo Matos

Rui Luis Aguiar

A method for storing data on a storage entity (SE) includes: computing a file identifier for a file to be stored on the SE; checking if the file has already been stored using the file identifier; generating a user-specific private and public identifier, wherein generating the user-specific private identifier is based on using an oblivious key generation protocol between the client and a trusted entity, and wherein the user-specific private identifier is a deterministic private identifier; updating or computing tags of the file by the client such that the updating or computing is homomorphic in the user-specific private identifier and in parts of the file; and providing the user-specific public identifier, the updated tags and a proof of possession of the secret identifier to the SE to enable the SE to store information associated with the file.

Method for storing data on a storage entity

A method for storing information includes receiving information to be stored and an information tag from a user computing entity, and storing the information and the information tag. The information to be stored includes a chunk that is divided into a plurality of blocks each comprising one or more elements. The information tag comprises a plurality of tags each having been computed for one of the blocks, wherein the tag for the j-th block of the i-th chunk is based on: an output of a random function using as input: 1) an output of an index function mapping each index j to a certain value, and/or 2) a seed sampled for the i-th chunk; the j-th block; and a representation of a second secret comprising one or more random elements each associated with a respective one of the one or more elements of one of the blocks.

Method for providing information to be stored and method for providing a proof of retrievability

A method for providing information to be stored includes computing a storable first secret for generating a random value based on a random function. The information to be stored is provided as a chunk which is divided into blocks each having an element. A storable second secret comprising a random element is computed. A tag is computed for each block such that the tag for the j-th block of the i-th chunk is computed using: an output of the random function, the j-th block, and a representation of the second secret. The information to be stored is provided together with an information tag comprising the computed tags of each block of each chunk.

A method for storing data on a storage entity (SE) includes: computing a file identifier for a file to be stored on the SE; checking if the file has already been stored using the file identifier; generating a user-specific private and public identifier; updating or computing tags of the file by the client such that the updating or computing is homomorphic in the user-specific private identifier and in parts of the file; providing the user-specific public identifier, the updated tags and a proof of possession of the secret identifier to the SE; verifying the proof-of-possession; verifying validity of the tags; upon successful checking, storing a public identifier for the file incorporating the user-specific public identifier and the updated tags by the SE; and upon a case where it is determined that the file has not already been stored, storing the file.

A method, performed by a user device, for proving retrievability (POR) of information includes: a1) exchanging credentials with a storing device and an auditing device to be used for communication between them; b1) encoding the information to be stored on the storing device; c1) initiating storing the encoded information on the storing device; d1) receiving correctness information, wherein the correctness information is secure and is generated based on the result of verification using unpredictable random information; and e1) validating the correctness information and unpredictable random information for proving retrievability of the stored information.

Method for proving retrievability of information

A method for storing data in a cloud includes receiving at least one data file to be stored together with a predefined number t of replicas of the at least one data file within the cloud, at least one authentication tag corresponding to the at least one data file and t functions that are configurable to take at least a predefined time to compute; storing the at least one data file within the cloud; computing t solutions of the t functions within the cloud; generating the t replicas of the at least one data file based on the t solutions of the t functions and the at least one data file within the cloud, wherein each of the t functions is used for at least one of the t replicas of the at least one data file; and storing the t replicas within the cloud.

Method for storing data in a cloud and network for carrying out the method

A method for providing a proof-of-work includes computing, by a verification computing device (VCD), a first linear feedback shift register sequence (LFSR-S) using a first polynomial having a first degree and computing, by the VCD, a second LFSR-S based on a second polynomial. A challenge, generated by the VCD and using elements of the second LFSR-S, is transmitted to the PCD. The PCD recursively computes all elements of the first LFSR-S by using the elements and coefficients of the second LFSR-S. A solution for the received challenge is computed based on the computed elements of the first LFSR-S. A proof-of-work is provided by verifying, by the VCD, the transmitted solution by: recomputing a solution to the challenge using initial state parameters and coefficients of the first LFSR-S, and comparing the computed solution of the PCD with the recomputed solution of the VCD.

Method and system for providing a proof-of-work

A method for verifying information of a first data item in a plurality of different data items stored on a server includes a) generating a hash tree, b) computing an authentication path for the first data item based on a recomputation of the hash tree, wherein an authentication path includes all siblings of tree nodes from the first data item to a root of the hash tree, c) recomputing the root-hash based on the first data item and a computed authentication path of the first data item and comparing the recomputed root-hash with the root-hash of the hash-tree of step a), d) determining a side element in leaves or a tree level above of the hash tree and its authentication path, and e) verifying the authentication path of the side element.

Method and system for verifying information of a data item in a plurality of different data items

A method for storing data in a cloud includes providing at least one data file to be stored together with a predefined number t of replicas of the at least one data file within the cloud, at least one authentication tag corresponding to the at least one data file and t functions that are configurable to take at least a predefined time to compute. The at least one data file, the at least one authentication tag and the t functions are transmitted to the cloud. The at least one data file is stored within the cloud and t solutions of the t functions are computed within the cloud. The t replicas of the at least one data file are generated based on the t solutions of the t functions and the at least one data file within the cloud. The t replicas are stored within the cloud.

A method for proving retrievability (POR) of information is performed in a memory available to one or more computation devices, wherein credentials between a user device, a storing device and an auditing device between each pair of said devices are exchanged and used for communication between them. The method includes encoding information to be stored on the storing device by the user device or the auditing device, storing the encoded information on the storing device, verifying the correctness of the stored information by the auditing device using unpredictable random information, transmitting correctness information to the user device, the correctness information being secure and being generated based on the result of the verification by the auditing device, and validating the correctness information by the user device for proving retrievability of the stored information and the unpredictable random information.

A method for integrating a Proof of Storage (PoS) into a blockchain increases security, robustness and verifiability of a blockchain network. A part of the blockchain to be stored is received at a first one of a plurality of mining nodes of the blockchain network. The part of the blockchain is stored. Mining of the new block is bound to the stored data and performed so as to enforce that the mining nodes store different parts of the blockchain. The PoS is integrated into the new block. The PoS is verified before accepting the new block into the blockchain.

Method and system for providing a robust blockchain with an integrated proof of storage

A method for storing a data file of a client on a storage entity includes generating, by a proxy entity, a master encryption key; encrypting, by the client, the data file using the master encryption key to produce an encrypted file; computing a hash-tree for the encrypted file and using a top-hash of the hash-tree as a file identification (FID); and determining, by the proxy entity, whether the FID is already known to the storage entity. If the FID is not already known to the storage entity the method further includes computing, by the proxy entity, a top-hash of the encrypted file (PFID), and when the ownership of the data file has been proven, storing the FID being equal with the PFID at the client together with the hash value.

Method for storing a data file of a client on a storage entity

A key exchanging apparatus transmits the contribution data to the plurality of counterpart apparatuses, generates a signer contribution confirmation signature with respect to a contribution data set including all the contribution data received from the plurality of counterpart apparatuses, generates auxiliary data and auxiliary data validity certification sentence from the contribution data set and the contribution random number, transmits the auxiliary data, the auxiliary data validity certification sentence and the contribution confirmation signature to the plurality of counterpart apparatuses, verifies validity of auxiliary data by using the counterpart identifier set, the counterpart public key set, the contribution confirmation signature set including the data received from the plurality of counterpart apparatuses, the auxiliary data set and the auxiliary data validity certification sentence set, and generates a public key from the contribution data set and the auxiliary data received from the plurality of counterpart apparatuses.

Key exchanging apparatus

A method for establishing a secret key between two nodes in a communication network, in particular in a wireless local area network (WLAN), includes concealment of the fact that a key exchange occurs, one of the nodes&#x2014;first node (B)&#x2014;broadcasts one or more packets (P) that can be received by the other node&#x2014;second node (A)&#x2014;, wherein the packets (P) contain each a first key (K) and wherein the packets (P) are each encrypted with a second key (k) before being sent, the second node (A) randomly chooses one packet (P) from the packets (P) received and breaks the encryption of the chosen packet (P) in order to obtain the first key (K), and the second node (A) initiates a key exchange protocol, wherein the second node (A) encrypts the message to be sent for initiating the key exchange protocol with the revealed key (K).

Method for establishing a secret key between two nodes in a communication network

A method for aggregating data in a network, particularly in a wireless sensor network, wherein the network () includes a plurality of sensor nodes (N) to measure data and at least one sink node (S) at which the data measured by the sensor nodes (N) are aggregated, and wherein each sensor node (N) encrypts its measured data with a key k and forwards the result towards the sink node (S), is characterized in that, in the context of a key distribution within the network (), a master key K is chosen, and that the master key K is autonomously split up by the network () into individual keys kto be used by the sensor nodes (N) for encrypting measured data, with the sum of all individual keys kbeing equal to the master key K.

Growing community of inventors

Worms, Germany

Frederik Armknecht