{"id":"W2979929440","doi":"10.4230/lipics.tqc.2020.4","title":"Uncloneable Quantum Encryption via Oracles","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Encryption; Computer science; Pseudorandom function family; Theoretical computer science; Quantum cryptography; Random oracle; Quantum; Probabilistic encryption; Cryptography; Quantum information; Computer security; Public-key cryptography; Physics; Quantum mechanics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001113632,0.00103534,0.001137185,0.000593916,0.0005331128,0.001487709,0.003787764,0.0008751206,0.00002220457],"category_scores_gemma":[0.00009035914,0.0009320237,0.0007243499,0.000435037,0.0001383961,0.001124399,0.004313226,0.001987636,0.000527813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002486873,"about_ca_system_score_gemma":0.0003570372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008200818,"about_ca_topic_score_gemma":0.000009040711,"domain_scores_codex":[0.9947383,0.0001076091,0.001812904,0.0009308463,0.001037936,0.0013724],"domain_scores_gemma":[0.9949565,0.0002708761,0.001331413,0.002601019,0.0005089719,0.0003312005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004255606,0.002662911,0.004715016,0.01809381,0.002234297,0.00009797471,0.0546317,0.4317751,0.0005122428,0.098614,0.05112527,0.3351122],"study_design_scores_gemma":[0.001277706,0.0002633377,0.0003294628,0.0006176988,0.00004628048,0.00008632287,0.0001252449,0.9447594,0.000320277,0.01559305,0.03545635,0.001124932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1044271,0.000206329,0.8838455,0.0006852809,0.006335545,0.001948121,0.0004481228,0.0008400871,0.001263915],"genre_scores_gemma":[0.751034,0.0001454809,0.2431742,0.001788611,0.001079925,0.0002591993,0.001690621,0.0001865855,0.0006413781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6466069,"threshold_uncertainty_score":0.9995489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01342349499243985,"score_gpt":0.2472337597318089,"score_spread":0.233810264739369,"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."}}