{"id":"W2164014144","doi":"10.1007/11941378_23","title":"A Simple and Unified Method of Proving Indistinguishability","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hash function; Computer science; Simple (philosophy); PMAC; Function (biology); Theoretical computer science; Class (philosophy); Discrete mathematics; Mathematics; Programming language","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.006199793,0.002815334,0.003917104,0.004536734,0.003690005,0.008833537,0.007366275,0.004158832,0.01564496],"category_scores_gemma":[0.02318301,0.002643034,0.004992144,0.003390452,0.0105522,0.02062578,0.01783395,0.01241726,0.008986753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002202856,"about_ca_system_score_gemma":0.002947562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007715844,"about_ca_topic_score_gemma":0.0009636424,"domain_scores_codex":[0.9848331,0.003237593,0.001141146,0.002472988,0.007342741,0.000972532],"domain_scores_gemma":[0.9838684,0.00666309,0.0004048205,0.00668861,0.001911918,0.000463126],"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.0001181103,0.0001534957,0.0002135336,0.0002756127,0.00008596149,0.0001597934,0.000383291,0.001925343,0.005266817,0.8980442,0.008353624,0.08502025],"study_design_scores_gemma":[0.00006677643,0.00007431453,0.0001520901,0.00007382923,0.0000940137,0.0003185366,0.00007086369,0.0175494,0.009964809,0.9491532,0.0223855,0.00009664096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001258559,0.0002086688,0.9869317,0.0003206615,0.0002540837,0.0001580898,0.00009374669,0.001141922,0.009632532],"genre_scores_gemma":[0.09526905,0.0006287992,0.8825364,0.0007991278,0.0005804305,0.0009367052,0.0005344533,0.001056151,0.01765896],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01564496,"threshold_uncertainty_score":0.05233765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01934112080263567,"score_gpt":0.2933339472767009,"score_spread":0.2739928264740652,"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."}}