Title page for etd-0616113-170345


[Back to Results | New Search]

URN etd-0616113-170345
Author Chen-yu Tsai
Author's Email Address No Public.
Statistics This thesis had been viewed 5574 times. Download 1426 times.
Department Computer Science and Engineering
Year 2012
Semester 2
Degree Master
Type of Document
Language English
Title Applications of Homomorphic Encryption
Date of Defense 2013-06-20
Page Count 52
Keyword
  • IND-CPA
  • detect zero
  • symmetric encryption scheme
  • asymmetric encryption
  • homomorphic encryption
  • Abstract First, we prove that if an asymmetric homomorphic encryption (homomorphic on addoperation) which can detect zero, detect equality, compare the value or detect overflow without any restrictions, then the scheme is not IND-CPA. Form the proof, we can know that if we just want to detect zero few times, then the scheme is still secure. Hence, we analyze the methods of detecting zero in different situations, and give an idea of detecting zero. We then propose a symmetric homomorphic encryption based on the new version of ring-LWE. Based on this version of ring-LWE, our symmetric homomorphic encryption has two secret keys. Because the homomorphic encryption has two secret keys, one can partially decrypt the ciphertext, and send this ciphertext to another one to complete the decryption. We also transform this symmetric homomorphic encryption to asymmetric homomorphic encryption. Finally, we modify this symmetric homomorphic encryption to implement our idea of detecting zero. Hence, if we restrict the times of detecting zero, then we propose another symmetric homomorphic encryption which can detect zero.
    Advisory Committee
  • Chia-Mai Chen - chair
  • Chun-I Fan - co-chair
  • D. J. Guan - advisor
  • Files
  • etd-0616113-170345.pdf
  • indicate access worldwide
    Date of Submission 2013-07-16

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys