Cryptology ePrint Archive: Report 2008/356
Using Commutative Encryption to Share a Secret
Saied Hosseini Khayat
Abstract: It is shown how to use commutative encryption
to share a secret. Suppose Alice wants to share
a secret with Bob such that Bob cannot decrypt the secret
unless a group of trustees agree.
It is assumed that Alice, Bob and the trustees communicate
over insecure channels. This paper presents a scheme that
uses modular
exponentiation and does not require key exchange.
The security of the scheme rest of the difficulty of
the discrete logarithm problem.
Category / Keywords: cryptographic protocols / secret sharing, commutative cryptography
Publication Info: Not published elsewhere yet
Date: received 17 Aug 2008, last revised 18 Aug 2008
Contact author: shk at alum wustl edu
Available formats: PDF | BibTeX Citation
Version: 20080818:184648 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]