{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003627446,0.0009834967,0.001471057,0.002075233,0.002473995,0.001970575,0.00110998,0.0016015,0.004102339],"category_scores_gemma":[0.01496725,0.0006065837,0.001880736,0.002911388,0.006011731,0.007310722,0.006060922,0.003476853,0.0007581948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002202624,"about_ca_system_score_gemma":0.001324906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001271474,"about_ca_topic_score_gemma":0.0004805404,"domain_scores_codex":[0.9967271,0.001015303,0.0002060879,0.0007001517,0.0009211806,0.0004301257],"domain_scores_gemma":[0.9896753,0.006700773,0.0008052074,0.001362127,0.0008506993,0.0006058588],"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.00007106168,0.00002843103,0.000396262,0.0000716808,0.00001047578,0.0001240759,0.0003801999,0.009355797,0.001526972,0.9754477,0.0007155625,0.01187184],"study_design_scores_gemma":[0.00003129353,0.0001023129,0.0002570185,0.00004844803,0.00002384026,0.0003420166,0.00009933214,0.06051446,0.00205229,0.9307379,0.005738928,0.00005215824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1807451,0.002979674,0.7737795,0.0030571,0.0002262379,0.0002008971,0.0003599144,0.0004487177,0.03820282],"genre_scores_gemma":[0.8492988,0.002763327,0.1347518,0.000678002,0.0006699225,0.0003347551,0.0004055421,0.0001542814,0.01094341],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004102339,"threshold_uncertainty_score":0.01918399,"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."}}