-
公开(公告)号：EP2792101A4
公开(公告)日：2015-07-01
申请号：EP12858144
申请日：2012-11-16
Applicant: IBM
Inventor： CACHIN CHRISTIAN , HAAS ROBERT , HAFNER ALEXIS , KURMUS ANIL , SORNIOTTI ALESSANDRO
CPC classification number: G06F21/602 , G06F17/3007 , H04L9/0822 , H04L9/0836
-
公开(公告)号：WO0237242A3
公开(公告)日：2003-10-16
申请号：PCT/IB0101988
申请日：2001-10-24
Applicant: IBM , ALGESHEIMER-MUELLER JOY , CACHIN CHRISTIAN , CAMENISCH JAN , KARJOTH GUENTER
Inventor： ALGESHEIMER-MUELLER JOY , CACHIN CHRISTIAN , CAMENISCH JAN , KARJOTH GUENTER
CPC classification number: G06F9/465
Abstract: The invention provides a method and system for processing securely an originator request of a customer. This originator request can be sent to at least one first entity. The method for processing the originator request comprises the steps of (a) sending from the customer the originator request to the or each first entity; (b) connecting the or each first entity to a computation entity; (c) adding by the or each first entity, information concerning the originator request; (d) sending at least part of the first modified request to at least the computation entity; (e) deriving a computation-entity result from the at least part of the first-modified request; (f) sending at least part of the computation-entity result to the or each first entity; (g) deriving therefrom a first-entity result and forwarding it at least in part; and (h) deriving therefrom a customer result.
Abstract translation: 本发明提供了一种用于安全地处理客户的发起者请求的方法和系统。 该发起者请求可以被发送到至少一个第一实体。 用于处理发起者请求的方法包括以下步骤：（a）从客户发送发起者请求到或每个第一实体; （b）将所述或每个第一实体连接到计算实体; （c）由该或每个第一实体增加关于发起者请求的信息; （d）至少将所述第一修改请求的至少一部分发送给所述计算实体; （e）从所述第一修改请求的所述至少一部分导出计算实体结果; （f）将所述计算实体结果的至少一部分发送给所述或每个第一实体; （g）从其中得到第一实体结果并至少部分转发; 和（h）从中导出客户结果。
-
公开(公告)号：DE60207691T2
公开(公告)日：2006-07-06
申请号：DE60207691
申请日：2002-02-15
Applicant: IBM
Inventor： CACHIN CHRISTIAN , KURSAWE KLAUS , LYSYANSKAYA ANNA , STROBL RETO
Abstract: In accordance with the present invention, there is provided a method for sharing a secret value x among n participating network devices via an asynchronous network. The n participating network devices comprises t faulty devices and k sub-devices capable of reconstructing the secret value x, wherein t i and subshare values s ij of the secret value x by applying a linear secret sharing scheme and deriving verification values g s ij usable for verification of validity of the share values s i and the subshare values s ij ; sending to each participating network device a share message comprising the corresponding subshare values s Ai ,s iA , s Bi ,s iB , s Ci ,s iC ; broadcasting a verification message comprising the verification values g s ij ; receiving by at least l participating network devices the verification message comprising the verification values g s ij , wherein n-t>=l>=2t+1, and performing the following steps 1) to 4) for each recipient network device, 1) if a share message comprising subshare values s ij is received, determining the validity of the subshare values s ij in dependence on the verification values g s ij and 2) broadcasting in the event of positive determination an agree message comprising an agree-value Y; 3) receiving l agree messages comprising the agree-values Y A , Y B , Y c ; 4) in the event of l received agree messages, obtaining the share value s i either from the share message sent by the distributor D or from subshare values s ij received from participating network devices and determining the validity of the subshare values s ij in dependence on the verification values g s ij . In a second aspect of the present invention a method without broadcast is disclosed.
-
公开(公告)号：GB2503655A
公开(公告)日：2014-01-08
申请号：GB201211472
申请日：2012-06-28
Applicant: IBM
Inventor： CACHIN CHRISTIAN , HAAS ROBERT , KURMUS ANIL , SORNIOTTI ALESSANDRO
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.
-
公开(公告)号：CA2426794A1
公开(公告)日：2002-05-10
申请号：CA2426794
申请日：2001-10-24
Applicant: IBM
Inventor： CAMENISCH JAN , ALGESHEIMER-MULLER JOY , CACHIN CHRISTIAN , KARJOTH GUNTER
Abstract: The invention provides a method and system for processing securely an originator request of a customer. This originator request can be sent to at least one first entity. The method for processing the originator request comprises the steps of a) sending from the customer the originator request t o the or each first entity; b) connecting the or each first entity to a computation entity; c) adding by the or each first entity, on receipt of the originator request, information concerning the originator request thereby forming a first-modified request; d) sending at least part of the first modified request to at least the computation entity; e) having received at least part of the first-modified request by the computation entity deriving a computation-entity result from the atleast part of the first-modified reques t; f) sending at least part of the computation-entity result to the or each fir st entity; g) having received at least part of the computation-entity result by the or each first entity deriving therefrom a first-entity ressult and forwarding it at least in part; and h) having received at least part of the first-entity result by the customer deriving therefrom a customer result.
-
Patent Agency Ranking
公开(公告)号：CA2426794C
公开(公告)日：2009-10-06
申请号：CA2426794
申请日：2001-10-24
Applicant: IBM
Inventor： CACHIN CHRISTIAN , KARJOTH GUNTER , CAMENISCH JAN , ALGESHEIMER-MULLER JOY
Abstract: The invention provides a method and system for processing securely an originator request of a customer. This originator request can be sent to at least one first entity. The method for processing the originator request comprises the steps of a) sending from the customer the originator request t o the or each first entity; b) connecting the or each first entity to a computation entity; c) adding by the or each first entity, on receipt of the originator request, information concerning the originator request thereby forming a first-modified request; d) sending at least part of the first modified request to at least the computation entity; e) having received at least part of the first-modified request by the computation entity deriving a computation-entity result from the atleast part of the first-modified reques t; f) sending at least part of the computation-entity result to the or each fir st entity; g) having received at least part of the computation-entity result by the or each first entity deriving therefrom a first-entity ressult and forwarding it at least in part; and h) having received at least part of the first-entity result by the customer deriving therefrom a customer result.
-
公开(公告)号：DE60207691D1
公开(公告)日：2006-01-05
申请号：DE60207691
申请日：2002-02-15
Applicant: IBM
Inventor： CACHIN CHRISTIAN , KURSAWE KLAUS , LYSYANSKAYA ANNA , STROBL RETO
Abstract: In accordance with the present invention, there is provided a method for sharing a secret value x among n participating network devices via an asynchronous network. The n participating network devices comprises t faulty devices and k sub-devices capable of reconstructing the secret value x, wherein t i and subshare values s ij of the secret value x by applying a linear secret sharing scheme and deriving verification values g s ij usable for verification of validity of the share values s i and the subshare values s ij ; sending to each participating network device a share message comprising the corresponding subshare values s Ai ,s iA , s Bi ,s iB , s Ci ,s iC ; broadcasting a verification message comprising the verification values g s ij ; receiving by at least l participating network devices the verification message comprising the verification values g s ij , wherein n-t>=l>=2t+1, and performing the following steps 1) to 4) for each recipient network device, 1) if a share message comprising subshare values s ij is received, determining the validity of the subshare values s ij in dependence on the verification values g s ij and 2) broadcasting in the event of positive determination an agree message comprising an agree-value Y; 3) receiving l agree messages comprising the agree-values Y A , Y B , Y c ; 4) in the event of l received agree messages, obtaining the share value s i either from the share message sent by the distributor D or from subshare values s ij received from participating network devices and determining the validity of the subshare values s ij in dependence on the verification values g s ij . In a second aspect of the present invention a method without broadcast is disclosed.
-
公开(公告)号：DE112018000143T5
公开(公告)日：2019-07-25
申请号：DE112018000143
申请日：2018-01-02
Applicant: IBM
Inventor： LEHMANN ANJA , CACHIN CHRISTIAN , CAMENISCH JAN , FREIRE STOGBUCHNER EDUARDA
IPC: G06F21/00
Abstract: Eine Datenmaskierung wird für mindestens ein vorher festgelegtes Datenelement in zu sendenden Daten bereitgestellt, indem eine Einweg-Funktion auf dieses Datenelement angewendet wird, um einen ersten Wert zu erzeugen, ein maskiertes Datenelement erzeugt wird, indem der erste Wert über ein deterministisches Verschlüsselungsschema unter Verwendung eines aktuellen Verschlüsselungsschlüssels für eine aktuelle Epoche verschlüsselt wird, und dieses Datenelement durch das maskierte Datenelement ersetzt wird. Ein Datenanbieter-Computer sendet die maskierten Daten an den Datenbenutzer-Computer. Nach Ablauf der aktuellen Epoche erzeugt der Datenanbieter-Computer einen neuen Verschlüsselungsschlüssel für das Verschlüsselungsschema in einer neuen Epoche, erzeugt Maskierungsaktualisierungsdaten, die von dem aktuellen und dem neuen Verschlüsselungsschlüssel abhängen, und sendet die Maskierungsaktualisierungsdaten an den Datenbenutzer-Computer. Die Maskierungsaktualisierungsdaten erlauben das Aktualisieren, an dem Datenbenutzer-Computer, von maskierten, mit dem aktuellen Verschlüsselungsschlüssel erzeugten Datenelementen auf maskierte, mit dem neuen Verschlüsselungsschlüssel erzeugte Datenelemente.
-
公开(公告)号：GB2529246A
公开(公告)日：2016-02-17
申请号：GB201414539
申请日：2014-08-15
Applicant: IBM
Inventor： BRANDENBURGER MARCUS , CACHIN CHRISTIAN , KNEZEVIC NIKOLA
IPC: G06F21/62
Abstract: A method and system for providing integrity and consistency of a cloud storage service 102,204 to a group of mutually trusted clients 108,110,112 involves the cloud storage service 102,104 offering a set of operations in respect to stored data to the clients and wherein each client only executes its own client operations when consuming one of the set of operations of a cloud storage service, and each client detects data correctness of a cloud storage service based on a protocol providing fork-linearizability. A client and server system is also provided utilising an invocation message with an operation, a reply message with list of pending operations, authentication value and proof, a commit message comprising a test result indication that the operation is not in conflict with the pending operations list, and further authentication value and proof.
-
公开(公告)号：AU1081402A
公开(公告)日：2002-05-15
申请号：AU1081402
申请日：2001-10-24
Applicant: IBM
Inventor： ALGESHEIMER-MULLER JOY , CACHIN CHRISTIAN , CAMENISCH JAN , KARJOTH GUNTER
Abstract: The invention provides a method and system for processing securely an originator request of a customer. This originator request can be sent to at least one first entity. The method for processing the originator request comprises the steps of (a) sending from the customer the originator request to the or each first entity; (b) connecting the or each first entity to a computation entity; (c) adding by the or each first entity, information concerning the originator request; (d) sending at least part of the first modified request to at least the computation entity; (e) deriving a computation-entity result from the at least part of the first-modified request; (f) sending at least part of the computation-entity result to the or each first entity; (g) deriving therefrom a first-entity result and forwarding it at least in part; and (h) deriving therefrom a customer result.
-
-
-
-
-
-
-
-
-
Search Results
10
records
(took 0.025 seconds)
