透過您的圖書館登入
IP:18.189.14.219

並列摘要


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.

被引用紀錄


Huang, S. I. (2010). 無線感測網路之安全資料聚集與資料搜尋方法設計 [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2010.00023

延伸閱讀