{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465195,0.0001321616,0.0001303477,0.00008342526,0.000276415,0.0001347713,0.0003063999,0.00005131121,0.000001991018],"category_scores_gemma":[0.000004667187,0.0001163678,0.00002902758,0.0001891686,0.00009349574,0.0004927469,0.0001884035,0.00008340023,0.000001114365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004602744,"about_ca_system_score_gemma":0.000005664605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008547854,"about_ca_topic_score_gemma":9.567781e-7,"domain_scores_codex":[0.9991466,0.00001465529,0.0002196938,0.000342847,0.0001070501,0.0001692026],"domain_scores_gemma":[0.9991708,0.00002534135,0.0001223018,0.0005498466,0.00004187686,0.00008980829],"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":[8.74176e-7,0.00008081376,0.0001548313,0.00007387194,0.00001374082,9.665812e-7,0.004079262,2.726409e-7,0.0008226148,0.9381212,0.000002583077,0.05664894],"study_design_scores_gemma":[0.0001652246,0.0000570436,0.001517923,0.00007464359,0.00002412604,0.00005402708,0.0003056663,0.3030341,0.005141517,0.68841,0.0008274293,0.000388236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005486544,0.0001048358,0.9915994,0.00005775643,0.000009441279,0.0003334497,0.000004937633,0.0003789735,0.00202465],"genre_scores_gemma":[0.2010623,0.0000657795,0.7985608,0.00002698839,0.00001976272,0.0002276578,0.000006209111,0.0000118221,0.00001864862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3030338,"threshold_uncertainty_score":0.474534,"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."}}