{"doi":"10.1145/1536414.1536440","title":"Fully homomorphic encryption using ideal lattices","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.","journal":"Proceedings of the forty-first annual ACM symposium on Theory of computing","year":2009,"id":2387,"datarank":21.40831953796357,"base_score":8.77770959579525,"endowment":8.77770959579525,"self_citation_contribution":1.3166564393692877,"citation_network_contribution":20.09166309859428,"self_endowment_contribution":1.3166564393692877,"citer_contribution":20.09166309859428,"corpus_percentile":92.3,"corpus_rank":2293,"citation_count":6487,"citer_count":185,"citers_with_citation_signal":185,"citers_with_endowment":185,"datacite_reuse_total":0,"is_dataset":false,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"2009-05-31","authors":[{"id":29275,"name":"Craig Gentry","orcid":null,"position":0,"is_corresponding":true}],"reference_count":58,"raw_metadata":{"citation_network_status":"fetched"},"created_at":"2026-03-01T18:20:47.508186Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}