{"id":"W2083681472","doi":"10.1142/s1793830911001292","title":"BREAKING AND REPAIRING AN APPROXIMATE MESSAGE AUTHENTICATION SCHEME","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Hash function; Hash chain; Hash-based message authentication code; Computer science; Message authentication code; Cryptographic hash function; Scheme (mathematics); Theoretical computer science; Function (biology); Authentication (law); Collision resistance; Double hashing; Algorithm; Cryptography; Mathematics; Computer security","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.002413674,0.0006073212,0.00120585,0.0008036438,0.001029306,0.001297724,0.001576381,0.001800758,0.001508064],"category_scores_gemma":[0.009105137,0.0004676077,0.0009407677,0.0009129381,0.001760852,0.003862435,0.003373015,0.001909423,0.0006916522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008302986,"about_ca_system_score_gemma":0.001030978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004407514,"about_ca_topic_score_gemma":0.0002216737,"domain_scores_codex":[0.9958626,0.0009779045,0.0003870877,0.000631669,0.00161508,0.0005255677],"domain_scores_gemma":[0.9925733,0.001896848,0.0009403827,0.003689582,0.0007324141,0.0001674179],"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.001608826,0.0002112307,0.00425295,0.0004240439,0.0002666954,0.001507074,0.00169458,0.1135401,0.1983247,0.402968,0.002581497,0.2726203],"study_design_scores_gemma":[0.0002450733,0.00107302,0.001777785,0.00008392823,0.0002312209,0.002798439,0.0003120502,0.6551516,0.1613287,0.1549183,0.021848,0.0002318102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1565311,0.0003255817,0.8393486,0.0004260251,0.0001438344,0.0001097404,0.00006304224,0.0006189761,0.002433032],"genre_scores_gemma":[0.7882645,0.0002160507,0.2076956,0.0001564968,0.00008608042,0.0001024438,0.0001113137,0.00005681977,0.003310708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002413674,"threshold_uncertainty_score":0.01276487,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02708206846653067,"score_gpt":0.2692125488899711,"score_spread":0.2421304804234405,"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."}}