Fully homomorphic encryption using ideal lattices Export

@inproceedings{citeulike:4817890, abstract = {We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result -- that, to construct an encryption scheme that permits evaluation of arbitrary circuits , it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit ; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable .}, address = {New York, NY, USA}, author = {Gentry, Craig}, booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing}, citeulike-article-id = {4817890}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1536414.1536440}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1536414.1536440}, doi = {10.1145/1536414.1536440}, isbn = {978-1-60558-506-2}, keywords = {algebra, information-theory, mathematics, physics, quantum, quantum-information}, location = {Bethesda, MD, USA}, pages = {169--178}, posted-at = {2009-06-15 20:11:46}, priority = {2}, publisher = {ACM}, title = {Fully homomorphic encryption using ideal lattices}, url = {http://dx.doi.org/10.1145/1536414.1536440}, year = {2009} }

TY - CONF ID - citeulike:4817890 L3 - citeulike-article-id:4817890 N2 - We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result -- that, to construct an encryption scheme that permits evaluation of arbitrary circuits , it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit ; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable . CY - Bethesda, MD, USA SN - 978-1-60558-506-2 AD - New York, NY, USA EP - 178 TI - Fully homomorphic encryption using ideal lattices PB - ACM T2 - STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing SP - 169 KW - algebra KW - information-theory KW - mathematics KW - physics KW - quantum KW - quantum-information AU - Gentry, Craig PY - 2009/// UR - http://dx.doi.org/10.1145/1536414.1536440 ER -