{"id":"W2583896214","doi":"","title":"On a variant of multilinear modular hashing with applications to authentication and secrecy codes","year":2016,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Universal hashing; Multilinear map; Computer science; Theoretical computer science; Secrecy; Hash function; Universality (dynamical systems); Authentication (law); Modular design; Cryptography; Scheme (mathematics); Message authentication code; Binary code; Algorithm; Binary number; Double hashing; Mathematics; Computer security; Arithmetic; Hash table; 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":[],"consensus_categories":[],"category_scores_codex":[0.0004021119,0.0001172722,0.00009805696,0.0002075259,0.0001715499,0.000120062,0.0003938159,0.00004563873,0.00001459736],"category_scores_gemma":[0.00005625316,0.00008291967,0.00002471163,0.0002392624,0.00006050788,0.001112755,0.00009777094,0.00006066275,0.00004834097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002404525,"about_ca_system_score_gemma":0.00001956859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003917402,"about_ca_topic_score_gemma":0.000001476215,"domain_scores_codex":[0.999081,0.00004207948,0.0002995239,0.0002264126,0.0002465378,0.0001044629],"domain_scores_gemma":[0.9987022,0.0004325856,0.0001744093,0.0003508028,0.0002400316,0.00009994247],"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.00007333166,0.00007685623,0.00002370592,0.00001321162,0.00002445298,6.840521e-8,0.0007007861,0.0001067102,0.003190923,0.9770858,0.00001541882,0.01868874],"study_design_scores_gemma":[0.003144944,0.0008551686,0.005089808,0.0004516956,0.00006990406,0.00007304538,0.0003920967,0.02928484,0.03749933,0.8006179,0.1215297,0.0009914741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01750069,0.00001195566,0.9777915,0.002405871,0.00003094444,0.0006594918,0.0002410863,0.00006773417,0.00129076],"genre_scores_gemma":[0.9897091,0.00006589533,0.009011864,0.0005253729,0.00002986374,0.0005743572,0.00005683804,0.000004762207,0.0000219332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9722084,"threshold_uncertainty_score":0.3381366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006411805616823589,"score_gpt":0.2404554890895196,"score_spread":0.234043683472696,"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."}}