{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00223659,0.0006286051,0.0008004458,0.001309025,0.00124844,0.001346117,0.001104385,0.001118431,0.002462616],"category_scores_gemma":[0.007865245,0.0003245565,0.000890354,0.002236139,0.004942737,0.004116944,0.006084424,0.00247073,0.0005804775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009759408,"about_ca_system_score_gemma":0.0008185686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000638942,"about_ca_topic_score_gemma":0.0003786913,"domain_scores_codex":[0.9979498,0.0007502974,0.0001405581,0.0003809952,0.0005263578,0.0002519902],"domain_scores_gemma":[0.996159,0.001829535,0.0003808658,0.0009892497,0.000395259,0.0002461924],"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.00004358619,0.00001710829,0.0002425364,0.00003974393,0.000005411587,0.00007930291,0.0001581268,0.007043819,0.001803066,0.9748465,0.0005672085,0.0151536],"study_design_scores_gemma":[0.00002917143,0.0002068899,0.000263061,0.00004718691,0.00001573111,0.0004232537,0.00009335037,0.09107295,0.003946338,0.8928171,0.01102177,0.00006307125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05302189,0.001408614,0.9256471,0.001124355,0.0002798212,0.0001414101,0.000124762,0.0001972607,0.01805479],"genre_scores_gemma":[0.7214118,0.001898187,0.2654221,0.0006924588,0.0008661373,0.0002397716,0.0001886082,0.000106382,0.009174611],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002462616,"threshold_uncertainty_score":0.01182836,"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."}}