{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001391264,0.000292555,0.0004235132,0.0006408684,0.000197227,0.0002413043,0.001247298,0.0001512334,0.000009371208],"category_scores_gemma":[0.0001259754,0.0002737997,0.00008422469,0.0006233922,0.0005789028,0.0002656636,0.001030105,0.0003810952,5.406138e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008151292,"about_ca_system_score_gemma":0.0003174434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003444529,"about_ca_topic_score_gemma":0.0004222745,"domain_scores_codex":[0.9974596,0.00005048273,0.0005505082,0.001004068,0.0005617021,0.0003736489],"domain_scores_gemma":[0.9978772,0.000619693,0.0003355938,0.0008445459,0.0002383608,0.00008459149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004344035,0.00005300989,0.002795534,0.0001640861,0.00001233936,0.0000205181,0.001609785,0.002672752,0.0002170785,0.123521,0.00002403721,0.8689055],"study_design_scores_gemma":[0.0003515466,0.0001920978,0.005515723,0.0001416891,0.00001255405,0.00004050656,6.931569e-7,0.3297795,0.0009740813,0.6614626,0.0009798121,0.0005492219],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001044868,0.0001140651,0.9966053,0.0001244722,0.0002353164,0.0003599098,0.00001444471,0.00005775696,0.001443876],"genre_scores_gemma":[0.3771346,0.000004420116,0.6226022,0.0001470028,0.00007528163,0.0000044937,0.000006648885,0.00001020456,0.00001513939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8683563,"threshold_uncertainty_score":0.9999714,"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."}}