{"id":"W2219863946","doi":"10.1142/s0129054118500089","title":"On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes","year":2018,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Hash function; Universal hashing; Hash chain; Cryptography; Perfect hash function; Integer (computer science); Secrecy; Information-theoretic security; Double hashing","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.0006391088,0.00008332357,0.00009685984,0.0007465488,0.0002367273,0.0003454566,0.001418909,0.0000180709,0.000007451396],"category_scores_gemma":[0.00002710905,0.00007139496,0.00003288524,0.0007814733,0.0004557287,0.001561911,0.0001546435,0.0000737531,0.000007910105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004858529,"about_ca_system_score_gemma":0.0002068409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005641158,"about_ca_topic_score_gemma":0.000005891663,"domain_scores_codex":[0.9987175,0.00003956027,0.0002561383,0.000237757,0.0006387113,0.000110341],"domain_scores_gemma":[0.9973842,0.0001095656,0.000263661,0.0002953337,0.001817116,0.0001301615],"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.00009851004,0.0001755207,0.0003199228,0.000001745904,0.00003889669,0.000001346384,0.00108379,0.0004813358,0.006720559,0.835677,0.00004906342,0.1553523],"study_design_scores_gemma":[0.002871334,0.01542903,0.1938574,0.0005199198,0.0001065071,0.0005434119,0.0004890897,0.1957581,0.01276294,0.5634133,0.01333662,0.0009123241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.24372,0.00000418066,0.7548873,0.0005842855,0.0004217866,0.00007795403,0.000001949181,0.0000170102,0.000285499],"genre_scores_gemma":[0.8416671,0.000002612019,0.1578714,0.0002875126,0.0001590549,0.00000282182,0.000001166192,0.0000027755,0.000005576672],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5979471,"threshold_uncertainty_score":0.3331246,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01575639365929202,"score_gpt":0.2878702573188158,"score_spread":0.2721138636595237,"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."}}