{"id":"W3193856494","doi":"10.48550/arxiv.1412.8766","title":"Quantum homomorphic encryption for circuits of low $T$-gate complexity","year":2014,"lang":"en","type":"preprint","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Probabilistic encryption; Theoretical computer science; Ciphertext; Encryption; Plaintext; Homomorphic encryption; Multiple encryption; Quantum computer; Computer science; Homomorphic secret sharing; Attribute-based encryption; Ciphertext indistinguishability; Mathematics; Cryptography; Deterministic encryption; Quantum; Algorithm; Public-key cryptography; Secure multi-party computation; Computer network; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396099,0.0005212014,0.0007417349,0.00068434,0.0008563281,0.002755457,0.001224552,0.00133478,0.003519254],"category_scores_gemma":[0.00493116,0.0004300007,0.001324969,0.0009102881,0.003007334,0.007373472,0.0024646,0.004163367,0.0005123656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002998104,"about_ca_system_score_gemma":0.001851993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005705199,"about_ca_topic_score_gemma":0.000571597,"domain_scores_codex":[0.998175,0.000396357,0.0001307974,0.000303914,0.0006709547,0.0003229457],"domain_scores_gemma":[0.9966815,0.001737172,0.0003638231,0.000874445,0.0002343141,0.0001087558],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004648851,0.00003022651,0.00007597872,0.00005720606,0.000007659914,0.00004455293,0.0001052613,0.007384442,0.003368497,0.9806552,0.0005545926,0.007669793],"study_design_scores_gemma":[0.00009477211,0.0001176857,0.0002552685,0.00004514807,0.00002498269,0.0001866714,0.00004420087,0.1430975,0.01380728,0.8344697,0.007813742,0.00004305447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.063873,0.0005224066,0.9152794,0.001339533,0.00009175112,0.0002306594,0.0001792078,0.0003914967,0.01809262],"genre_scores_gemma":[0.7452275,0.0007742897,0.2444773,0.0007060689,0.000168994,0.0005420776,0.000239667,0.0001437017,0.007720368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003519254,"threshold_uncertainty_score":0.02175283,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03786632930087028,"score_gpt":0.272549198165,"score_spread":0.2346828688641297,"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."}}