{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.001241324,0.0006752686,0.001506399,0.001808781,0.0002421392,0.00006928631,0.004418643,0.001789968,0.000009316455],"category_scores_gemma":[0.0006440577,0.0006973334,0.000668557,0.001428709,0.002015967,0.0003045365,0.002816484,0.001347856,0.00002857466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009382584,"about_ca_system_score_gemma":0.0003809182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007661578,"about_ca_topic_score_gemma":0.00003624932,"domain_scores_codex":[0.9957297,0.00007286034,0.001508616,0.001418502,0.0005491028,0.0007211607],"domain_scores_gemma":[0.9942163,0.00008156098,0.001582625,0.003199155,0.0007302338,0.0001901664],"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.00003065339,0.0003429376,0.0001900427,0.002431937,0.0001325281,0.000008207605,0.00007292893,0.000542024,0.003532241,0.9662427,0.0005134077,0.02596041],"study_design_scores_gemma":[0.0008844995,0.0004228121,0.0001619434,0.001099553,0.0001071959,0.0000279648,0.00001995145,0.07804342,0.02778658,0.8663217,0.02428285,0.0008415055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1254042,0.0004485247,0.8661429,0.00114404,0.002108092,0.001399406,0.002131291,0.0011534,0.0000681989],"genre_scores_gemma":[0.8503662,0.0001462367,0.1486847,0.00005753812,0.00009589303,0.0002713194,0.0003297414,0.00004679319,0.000001626299],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7249619,"threshold_uncertainty_score":0.9995478,"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."}}