A Lossless Data Hiding Scheme in Public Key Encrypted Domain Based on Homomorphic Key-Switching

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a lossless data hiding in encrypted domain (RDH-ED) scheme. To realize the data extraction directly from the encrypted domain without the private key, a key-switching based least-significant-bit (KS-LSB) data hiding method has been designed. In application, the user first encrypts the plaintext and uploads ciphertext to the server. Then the server performs KS-LSB to obtain the marked ciphertext. Additional data can be extracted directly from the marked ciphertext by the server without the private key, which enables the (trusted or untrusted) third party to manage ciphertext flexibly under the premise of keeping the plaintext secret. The Experimental results demonstrate that the embedding capacity is 1bit per bit of plaintext. Data hiding would not affect the accuracy and the security of encryption.

Cite

CITATION STYLE

APA

Ke, Y., Zhang, M., Su, T., & Liu, J. (2020). A Lossless Data Hiding Scheme in Public Key Encrypted Domain Based on Homomorphic Key-Switching. In Communications in Computer and Information Science (Vol. 1149 CCIS, pp. 296–309). Springer. https://doi.org/10.1007/978-981-15-3418-8_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free