Popping Bubbles: Cryptanalysis of Homomorphic Encryption
Imagine an encryption scheme where it is possible to add and multiply numbers without any knowledge of the numbers. Instead one could manipulate encryptions of the numbers and then the decryption of the result would give the result of the arithmetic on the original numbers. Encryption algorithms wit...
Main Author: | Steele, Corre |
---|---|
Other Authors: | William J. Martin, Advisor |
Format: | Others |
Published: |
Digital WPI
2016
|
Subjects: | |
Online Access: | https://digitalcommons.wpi.edu/etd-theses/453 https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1452&context=etd-theses |
Similar Items
-
Attack and Improvement on a Symmetric Fully Homomorphic Encryption Scheme
by: Wenju Xu, et al.
Published: (2019-01-01) -
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
by: Choi Su-Jeong, et al.
Published: (2007-12-01) -
Improving the Efficiency of Homomorphic Encryption Schemes
by: Hu, Yin
Published: (2013) -
Towards practical fully homomorphic encryption
by: Alperin-Sheriff, Jacob
Published: (2015) -
Parameter Constraints on Homomorphic Encryption Over the Integers
by: Pabstel, Melanie Anne
Published: (2017)