{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009673467,0.0005612546,0.0006758313,0.000854991,0.0009329395,0.001261636,0.0009031313,0.001053232,0.001191391],"category_scores_gemma":[0.003278726,0.0003176784,0.0004414566,0.0009596495,0.00193096,0.002756662,0.001603721,0.001513631,0.000605121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007410926,"about_ca_system_score_gemma":0.001716977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004570063,"about_ca_topic_score_gemma":0.0003037621,"domain_scores_codex":[0.9979563,0.0003120176,0.0001036202,0.0002865592,0.001154081,0.0001873968],"domain_scores_gemma":[0.9976714,0.0008040275,0.0003812411,0.0006424992,0.0003947613,0.0001060566],"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.0004910168,0.0001355259,0.0008970074,0.0003490364,0.00006347569,0.0009896022,0.0003387623,0.06516193,0.08641053,0.7494375,0.003118632,0.09260699],"study_design_scores_gemma":[0.0003281495,0.0007471588,0.0005877702,0.0001631059,0.0001411152,0.003610924,0.0001033704,0.5232189,0.2262555,0.1906288,0.0539485,0.0002667298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05331564,0.0005794695,0.9387757,0.000711102,0.0002736174,0.0001418929,0.0001211346,0.0007800277,0.00530146],"genre_scores_gemma":[0.7011445,0.0009396743,0.2891998,0.0002869143,0.0002349352,0.0002636509,0.0001922927,0.0001894264,0.007548714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001261636,"threshold_uncertainty_score":0.005377054,"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."}}