Key escrow with tree-based access structure

Authors:
Martin Schaffer;Peter Schartner
Affiliations:
Computer Science . System Security, University of Klagenfurt, Austria;Computer Science . System Security, University of Klagenfurt, Austria
Venue:
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Year:
2005

Citing 5
Cited 0

A public key cryptosystem and a signature scheme based on discrete logarithms

Proceedings of CRYPTO 84 on Advances in cryptology
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
Threshold Cryptosystems

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A threshold cryptosystem without a trusted party

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a system in which a set of people is able to confidentially communicate using a common session key. Due to required governmental surveillance properties, this key will be escrowed using a multi-party version of the ElGamal cryptosystem. The resulting shares of the ciphertext are stored over a set of trusted servers to provide availability and to hamper ciphertext-based attacks. Using a particular tree-based multi-party decryption, the session key can be reconstructed by a tree-structured set of escrow agencies without reconstructing the private ElGamal key and the ciphertext.