{"id":"W2199032704","doi":"","title":"Using admissible interference to detect denial of service vulnerabilities","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cryptographic protocol; Process calculus; Cryptographic primitive; Bisimulation; Cryptography; Nondeterministic algorithm; Theoretical computer science; Protocol (science); Property (philosophy); Denial-of-service attack; Computer security; Universal composability; Computer network","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.006575615,0.001036084,0.0008089334,0.003843067,0.001331065,0.002413573,0.002254794,0.001412299,0.001618114],"category_scores_gemma":[0.02394407,0.0007162102,0.001715094,0.001477444,0.006352018,0.006279786,0.004018215,0.002973059,0.0002803884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00287964,"about_ca_system_score_gemma":0.002280588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002372711,"about_ca_topic_score_gemma":0.001249006,"domain_scores_codex":[0.9922742,0.002442256,0.0005430297,0.001043359,0.002803632,0.0008933975],"domain_scores_gemma":[0.9813184,0.01138284,0.001802509,0.003510184,0.001620107,0.0003659699],"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.0001988479,0.000107095,0.003409531,0.000113321,0.00007887695,0.0002464124,0.0006387904,0.08570401,0.01019883,0.8615156,0.0003436724,0.03744508],"study_design_scores_gemma":[0.00005123617,0.0001503128,0.0006565663,0.0000504602,0.00008682912,0.000226692,0.00008907167,0.4315996,0.03040741,0.531916,0.004691125,0.00007467684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02567444,0.00008836883,0.9707308,0.0001311336,0.00002062386,0.00009833345,0.00003181293,0.0005921664,0.002632249],"genre_scores_gemma":[0.7130788,0.0001681764,0.2846893,0.0001515112,0.00003272624,0.0003020906,0.0001068695,0.0001561174,0.001314449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006575615,"threshold_uncertainty_score":0.03477561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03515641318705895,"score_gpt":0.2756402924700026,"score_spread":0.2404838792829437,"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."}}