Informally, Privacy Homomorphism (PH) refers to encryption schemes with a homomorphic property allowing to obtain Ek(a + b) or Ek(a × b) from ciphertexts Ek(a) and Ek(b) without the knowledge of the decryption key. Privacy homomorphisms, especially algebraic ones, have a wide range of applications in information security due to the homomorphic property. In this paper, we correct a misunderstanding regarding the security of additive PH, give a definition for efficient PH, and discuss the security of algebraic PH in the black-box model to show that any PH is at most semantically secure under non-adaptive chosen-ciphertext attacks (i.e. IND-CCA1 secure), which also implies that we can simulate an IND-CCA1 secure algebraic PH with a small amount of hardware.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。