{"id":"W2979325266","doi":"10.1515/jmc-2019-0048","title":"On the equivalence of authentication codes and robust (2, 2)-threshold schemes","year":2020,"lang":"en","type":"preprint","venue":"Journal of Mathematical Cryptology","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society","keywords":"Equivalence (formal languages); Authentication (law); Computer science; Secret sharing; Theoretical computer science; Mathematics; Discrete mathematics; Computer security; Cryptography","routes":{"ca_aff":true,"ca_fund":true,"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.002712671,0.0003752334,0.0004785994,0.00116132,0.001183017,0.002558939,0.0008262537,0.001748372,0.006849274],"category_scores_gemma":[0.01245795,0.0003361431,0.0008503741,0.0009685917,0.005051853,0.005957978,0.004445764,0.003542497,0.0006852892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012376,"about_ca_system_score_gemma":0.0008043802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004300735,"about_ca_topic_score_gemma":0.0001615974,"domain_scores_codex":[0.9952886,0.001521262,0.0002492742,0.0007612801,0.001582331,0.0005972169],"domain_scores_gemma":[0.9898595,0.005733398,0.001021898,0.001845012,0.001158788,0.0003814039],"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.00004019727,0.00001764617,0.0001584718,0.00001733195,0.000005046406,0.00005546467,0.0002114482,0.001774518,0.001263755,0.9915751,0.0003754135,0.004505785],"study_design_scores_gemma":[0.00002125709,0.00005520698,0.0001911371,0.00002177659,0.000007944344,0.0001586929,0.00006488206,0.01736897,0.002008235,0.9771252,0.002957952,0.00001880424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2803524,0.0006834266,0.6368698,0.002736544,0.0003940304,0.0001901717,0.0002935671,0.0002698433,0.07821025],"genre_scores_gemma":[0.9615352,0.0002774805,0.03158212,0.0005232252,0.0002125428,0.0000973118,0.0001184204,0.00005512013,0.005598743],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006849274,"threshold_uncertainty_score":0.02291304,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06202159025001362,"score_gpt":0.2836574490103651,"score_spread":0.2216358587603515,"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."}}