Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ICME.2011.6012190 | ICME |
Keywords | Field | DocType |
encrypted domain,nand operation,equivalent plaintext domain operation,signal processing,data encryption,encrypted data,encrypted signal,homomorphic encryption,homomorphic cryptosystem,encrypted domain result,low-complexity attack,bitwise operation analysis,bitwise operation,equivalent operation,signal processing in encrypted domain,public key cryptography,plaintext domain,decrypted value,domain encryption,rsa cryptosystems,untrusted computer,nor operation,encryption,probabilistic logic | Signal processing,Homomorphic encryption,Bitwise operation,Computer science,Cryptosystem,Theoretical computer science,NAND gate,Encryption,Public-key cryptography,Plaintext | Conference |
ISSN | ISBN | Citations |
1945-7871 E-ISBN : 978-1-61284-349-0 | 978-1-61284-349-0 | 0 |
PageRank | References | Authors |
0.34 | 5 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sung Him Chui | 1 | 18 | 2.34 |
| Oscar C. Au | 2 | 1592 | 176.54 |
| Chun-Wing Kwok | 3 | 7 | 0.81 |
| Yujun Li | 4 | 104 | 18.20 |
| Lingfeng Xu | 5 | 53 | 9.81 |
| Wenxiu Sun | 6 | 160 | 20.79 |