公开(公告)号：DE69531264D1

公开(公告)日：2003-08-21

申请号：DE69531264

申请日：1995-02-21

Applicant: IBM

Inventor： CANETTI RAN ,  HERZBERG AMIR

IPC: G06F12/14 ,  G06F21/20 ,  G06F21/24 ,  G09C1/00 ,  H04L9/08 ,  H04L9/10

Abstract: A method is provided which allows a set of servers to maintain a set of keys, shared with a client, in the presence of mobile eavesdroppers that occasionally break into servers and learn the entire contents of their memories. Static and dynamic schemes maintain secret keys common to the user and each of several servers in the presence of a mobile, transient adversary that occasionally breaks into servers in order to gather information on the users' secret keys. The schemes use periodic "refreshments" of every user's private keys. In each round the servers involve in a computation in which each server computes a new private key to be shared with the user, in a way that allows the user to keep track of the changing keys without any communication with the servers. The schemes are very efficient. In particular, a user has to interact only with one server in order to obtain a session key. The user may choose the server with whom it wants to interact. The method may be used to securely generate random numbers (i.e., using the keys as random numbers).

公开(公告)号：DE69531264T2

公开(公告)日：2004-06-09

申请号：DE69531264

申请日：1995-02-21

Applicant: IBM

Inventor： CANETTI RAN ,  HERZBERG AMIR

IPC: G06F12/14 ,  G06F21/20 ,  G06F21/24 ,  G09C1/00 ,  H04L9/08 ,  H04L9/10

Abstract: A method is provided which allows a set of servers to maintain a set of keys, shared with a client, in the presence of mobile eavesdroppers that occasionally break into servers and learn the entire contents of their memories. Static and dynamic schemes maintain secret keys common to the user and each of several servers in the presence of a mobile, transient adversary that occasionally breaks into servers in order to gather information on the users' secret keys. The schemes use periodic "refreshments" of every user's private keys. In each round the servers involve in a computation in which each server computes a new private key to be shared with the user, in a way that allows the user to keep track of the changing keys without any communication with the servers. The schemes are very efficient. In particular, a user has to interact only with one server in order to obtain a session key. The user may choose the server with whom it wants to interact. The method may be used to securely generate random numbers (i.e., using the keys as random numbers).