Cryptology ePrint Archive: Report 2002/069

A Distributed and Computationally Secure Key Distribution Scheme

Vanesa Daza and Javier Herranz and Carles Padró and Germán Sáez

Abstract: In 1999, Naor, Pinkas and Reingold introduced schemes in which some groups of servers distribute keys among a set of users in a distributed way. They gave some specific proposals both in the unconditional and in the computational security framework. Their computationally secure scheme is based on the Decisional Diffie-Hellman Assumption. This model assumes secure communication between users and servers. Furthermore it requires users to do some expensive computations in order to obtain a key.

In this paper we modify the model introduced by Naor et al., requiring authenticated channels instead of assuming the existence of secure channels. Our model makes the user's computations easier, because most computations of the protocol are carried out by servers, keeping to a more realistic situation. We propose a basic scheme, that makes use of ElGamal cryptosystem, and that fits in with this model in the case of a passive adversary. We then add zero-knowledge proofs and verifiable secret sharing to prevent from the action of an active adversary. We consider general structures (not only the threshold ones) for those subsets of servers that can provide a key to a user and for those tolerated subsets of servers that can be corrupted by the adversary. We find necessary combinatorial conditions on these structures in order to provide security to our scheme.

Category / Keywords: cryptographic protocols / Key distribution, secret sharing schemes.

Publication Info: Proceedings of Information Security Conference, ISC'02. LNCS 2433, pp. 342--356

Date: received 1 Jun 2002, last revised 11 Apr 2003

Contact author: jherranz at mat upc es

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20030411:085507 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]