公开(公告)号：EP2792101A4

公开(公告)日：2015-07-01

申请号：EP12858144

申请日：2012-11-16

Applicant: IBM

Inventor： CACHIN CHRISTIAN ,  HAAS ROBERT ,  HAFNER ALEXIS ,  KURMUS ANIL ,  SORNIOTTI ALESSANDRO

IPC: H04L9/08 ,  G06F17/30 ,  G06F21/60

CPC classification number: G06F21/602 ,  G06F17/3007 ,  H04L9/0822 ,  H04L9/0836

公开(公告)号：GB2503655A

公开(公告)日：2014-01-08

申请号：GB201211472

申请日：2012-06-28

Applicant: IBM

Inventor： CACHIN CHRISTIAN ,  HAAS ROBERT ,  KURMUS ANIL ,  SORNIOTTI ALESSANDRO

IPC: G06F21/62 ,  H04L9/08

Abstract: The invention relates to a computer-implemented method for storing an object that comprises providing (S10) an object, an ordering vector of the object, the ordering vector being associated to a lexicographic order having at least one dimension, and base keys associated to each dimension of the lexicographic order. The method also comprises deriving (S20) a key by firstly retrieving (S210) the base key associated to the first dimension of the lexicographic order for which the ordering vector has a value different from the smallest value, and, lastly applying (S240) a one way function a number of times corresponding to the value of the vector for the first dimension for which the ordering vector has a different value from the smallest value, or a number of times corresponding to the value of the vector for the last dimension of the order. The method then comprises encrypting (S30) the object with the key, and storing (S40) the object as encrypted. Such a system improves the secure deletion of objects stored on a storage system of a computerized system and, in particular, provides for a reduction in the number of keys that need to be stored.

公开(公告)号：GB2529859A

公开(公告)日：2016-03-09

申请号：GB201415664

申请日：2014-09-04

Applicant: IBM

Inventor： IOANNOU NIKOLAS ,  KOLTSIDAS IOANNIS ,  KURMUS ANIL ,  PLETKA ROMAN A ,  SORNIOTTI ALESSANDRO ,  WEIGOLD THOMAS D

IPC: G06F17/30 ,  G06F3/06

Abstract: A device 10 receives data to be stored in a distributed file system 20 from an operating system 30. It determines a characteristic of the data, such as a digest, fingerprint or hash. Based in the characteristic, it selects one of the storage devices 21 in the distributed file system to store the data. The storage device then identifies duplicate blocks and only stores one copy of the duplicates. The device may compare a signature of the data with that of data already stored on the storage devices and select a storage device with data having the same signature. If the write to the storage device fails, the device may select another storage device. The device may also use load balancing to select the storage device.