An analysis on bitwise operations in the encrypted domain

When encrypted data need to be sent to an untrusted computer for processing, it is highly desirable to have a homomorphic cryptosystem that allows the untrusted computer to process the encrypted signals totally without decryption such that, when the encrypted domain result is decrypted, the decrypte...

Full description

Saved in:
Bibliographic Details
Published in2011 IEEE International Conference on Multimedia and Expo pp. 1 - 5
Main Authors Sung-Him Chui, Au, Oscar C., Chun-Wing Kwok, Yujun Li, Lingfeng Xu, Wenxiu Sun
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2011
Subjects
Blogs
Complexity theory
Encryption
Equations
homomorphic encryption
Probabilistic logic
Signal processing algorithms
Signal processing in encrypted domain
Online AccessGet full text

Cover

More Information
Summary:When encrypted data need to be sent to an untrusted computer for processing, it is highly desirable to have a homomorphic cryptosystem that allows the untrusted computer to process the encrypted signals totally without decryption such that, when the encrypted domain result is decrypted, the decrypted value is the same as the equivalent plaintext domain operation. These operations range from basic arithmetic operations to complicated transformations. In this paper, we analyze the existence of equivalent operations in the encrypted domain for four of the common bitwise operations: OR, AND, NOR and NAND in plaintext domain. We will show that such equivalent operations should not exist. For otherwise, if such operations exist, the RSA cryptosystems can be broken by a low-complexity attack.
ISBN:1612843484
9781612843483
ISSN:1945-7871
1945-788X
DOI:10.1109/ICME.2011.6012190