{"id":"W2392237044","doi":"10.1109/lcomm.2016.2540625","title":"A Secure Code Based Cryptosystem via Random Insertions, Deletions, and Errors","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Cryptosystem; Hybrid cryptosystem; Goldwasser–Micali cryptosystem; Paillier cryptosystem; Computer science; Plaintext; Plaintext-aware encryption; Code word; Key encapsulation; Theoretical computer science; Key (lock); Public-key cryptography; Deterministic encryption; Threshold cryptosystem; Code (set theory); Cryptography; Key size; Decoding methods; Symmetric-key algorithm; Encryption; Algorithm; Computer security; Public key cryptosystem","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":[],"consensus_categories":[],"category_scores_codex":[0.000528604,0.0001581887,0.0001691557,0.0002511856,0.0005595969,0.000108875,0.001847636,0.00005847761,0.000009876362],"category_scores_gemma":[0.00004209951,0.0001242913,0.0001049866,0.0004892271,0.0002777657,0.0004001183,0.00023647,0.0001483506,0.00004415342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004595337,"about_ca_system_score_gemma":0.00004122412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001236205,"about_ca_topic_score_gemma":0.00005473477,"domain_scores_codex":[0.9984798,0.0005431193,0.0002915875,0.0002934072,0.0001623268,0.0002296966],"domain_scores_gemma":[0.9964219,0.0007362038,0.0001208394,0.002542375,0.00007343418,0.0001052796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001946057,0.0006677922,0.007942831,0.0001077155,0.0002502157,0.00001649422,0.002792926,0.0002100342,0.398922,0.3728321,0.02933166,0.1867317],"study_design_scores_gemma":[0.02293704,0.0005088163,0.01085071,0.002134032,0.0003416642,0.0003454673,0.0003660954,0.1572719,0.02958068,0.05849665,0.7128757,0.004291279],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05436812,0.0003069286,0.8749378,0.06955972,0.0001513168,0.0002191293,0.00001341296,0.0002923499,0.0001511962],"genre_scores_gemma":[0.9436089,0.00009318323,0.0527419,0.003370516,0.00002251532,0.0001320605,0.000004475432,0.00001246498,0.00001392734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8892409,"threshold_uncertainty_score":0.5068452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01922303624041374,"score_gpt":0.2407162867636635,"score_spread":0.2214932505232497,"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."}}