Threshold Encryption into Multiple Ciphertexts

Martin Stanek

Paper 2011/107

Threshold Encryption into Multiple Ciphertexts

Martin Stanek

Abstract

We propose (T,N) multi-ciphertext scheme for symmetric encryption. The scheme encrypts a message into N distinct ciphertexts. The knowledge of the symmetric key allows decryption of the original message from any ciphertext. Moreover, knowing T+1 ciphertexts allows efficient recovery of the original message without the key (and without revealing the key as well). We define the security property of the scheme, and prove the security of the proposed scheme. We discuss several variants of the basic scheme that provides additional authenticity and efficiency.

Note: few typos corrected

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): stanek @ dcs fmph uniba sk
History: 2011-05-17: revised; 2011-03-05: received; See all versions
Short URL: https://ia.cr/2011/107
License: CC BY

BibTeX

@misc{cryptoeprint:2011/107,
      author = {Martin Stanek},
      title = {Threshold Encryption into Multiple Ciphertexts},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/107},
      year = {2011},
      url = {https://eprint.iacr.org/2011/107}
}