On the Computational Security of a Distributed Key Distribution Scheme

Provided by: Universitat Rostock
Topic: Security
Format: PDF
In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a non-corrupted group. In this paper the authors formalize the security analysis of one of such schemes, which was not considered in the original proposal. They prove the scheme secure in the random oracle model, assuming that the decisional diffie-hellman problem is hard to solve.

Find By Topic