{"id":"W1992282993","doi":"10.1109/focs.2011.12","title":"Efficient Fully Homomorphic Encryption from (Standard) LWE","year":2011,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1462,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Homomorphic encryption; Learning with errors; Security parameter; Encryption; Theoretical computer science; Computer science; Homomorphic secret sharing; Communication complexity; Scheme (mathematics); Public-key cryptography; Commitment scheme; Lattice problem; Discrete logarithm; Protocol (science); Reduction (mathematics); Cryptography; Mathematics; Algorithm; Secret sharing; Computer security","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02339945567962077,"score_gpt":0.2062763215648654,"score_spread":0.1828768658852446,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}