{"id":"W3117337916","doi":"10.48550/arxiv.1910.03551","title":"Quantum encryption with certified deletion","year":2019,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Plaintext; Ciphertext; Computer science; Encryption; Theoretical computer science; Qubit; Key (lock); Ciphertext indistinguishability; String (physics); Quantum; Algorithm; Computer security; Physics; Quantum mechanics; Malleability","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"],"consensus_categories":[],"category_scores_codex":[0.0004217087,0.0006670438,0.0007908172,0.0004461166,0.0002308786,0.0002261072,0.002126141,0.0004444833,0.00002651711],"category_scores_gemma":[0.00006085239,0.0005572928,0.0002736496,0.000243957,0.0002808105,0.0001249505,0.003270471,0.002092382,0.0003846109],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009110928,"about_ca_system_score_gemma":0.0004031688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007672027,"about_ca_topic_score_gemma":0.00003889545,"domain_scores_codex":[0.9958243,0.0005028839,0.0005870657,0.001784359,0.0004854484,0.0008159134],"domain_scores_gemma":[0.9966478,0.00041485,0.0005555184,0.00202179,0.0001618046,0.0001982082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009813563,0.000140177,0.001302021,0.0001403419,0.0001817728,0.0001322914,0.002865777,0.1099063,0.0007875038,0.8606899,0.0004099335,0.0233459],"study_design_scores_gemma":[0.0004118691,0.0002199081,0.006572138,0.000200915,0.00002522643,0.0001668237,0.00002588077,0.5186563,0.0003125509,0.4719728,0.000873182,0.0005624277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2004277,0.00009741403,0.7935539,0.002001211,0.00161091,0.0006330651,0.0000134868,0.0005151104,0.001147197],"genre_scores_gemma":[0.4350481,0.00004227762,0.5641351,0.0003042311,0.0002628842,0.00007861982,0.00007900943,0.00004515792,0.000004621553],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.40875,"threshold_uncertainty_score":0.9996879,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01338326459148,"score_gpt":0.2358763187042134,"score_spread":0.2224930541127334,"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."}}