Paper 2014/104

Space-efficient, byte-wise incremental and perfectly private encryption schemes

Kévin Atighehchi

Abstract

The problem raised by incremental encryption is the overhead due to the larger storage space required by the provision of random blocks together with the ciphered versions of a given document. Besides, permitting variable-length modifications on the ciphertext leads to privacy preservation issues. In this paper we present incremental encryption schemes which are space-efficient, byte-wise incremental and which preserve perfect privacy in the sense that they hide the fact that an update operation has been performed on a ciphered document. For each scheme, the run time of updates performed turns out to be very efficient and we discuss the statistically adjustable trade-off between computational cost and storage space required by the produced ciphertexts.

Note: Preliminary version

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
secret-key cryptography
Contact author(s)
kevin atighehchi @ univ-amu fr
History
2014-02-18: last of 2 revisions
2014-02-14: received
See all versions
Short URL
https://ia.cr/2014/104
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/104,
      author = {Kévin Atighehchi},
      title = {Space-efficient, byte-wise incremental and perfectly private encryption schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2014/104},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/104}},
      url = {https://eprint.iacr.org/2014/104}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.