{"id":"W3028617919","doi":"","title":"Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures.","year":2009,"lang":"en","type":"preprint","venue":"BIROn (Birkbeck, University of London)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Overhead (engineering); Computer science; Access structure; Scheme (mathematics); Adversary; Monotone polygon; Transmission (telecommunications); Decoding methods; Connection (principal bundle); Set (abstract data type); Theoretical computer science; Computer network; Mathematics; Computer security; Algorithm; Cryptography; Telecommunications","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.002256426,0.0005574036,0.0007165461,0.0004849806,0.0009593328,0.00137641,0.001061028,0.001427847,0.002050607],"category_scores_gemma":[0.01226642,0.0004063187,0.0007881885,0.0007160679,0.003467022,0.005092022,0.002488392,0.002428232,0.0003860969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00166075,"about_ca_system_score_gemma":0.001330353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003864125,"about_ca_topic_score_gemma":0.0003121459,"domain_scores_codex":[0.9976286,0.0008116323,0.0001181643,0.0003717355,0.0007652821,0.0003044672],"domain_scores_gemma":[0.9904585,0.0056982,0.001383556,0.00197717,0.0002959569,0.0001865738],"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.0003619199,0.00005348842,0.0004596263,0.0002277801,0.00004420396,0.000317546,0.0005178136,0.08553938,0.02141002,0.8802754,0.0005090582,0.01028375],"study_design_scores_gemma":[0.0001065402,0.0003137594,0.0004836174,0.0000686647,0.00006316767,0.0009711229,0.0001361891,0.4734162,0.03453923,0.4841544,0.005678875,0.00006827071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1642184,0.0006576907,0.8193315,0.0008989558,0.00005982819,0.0002366486,0.000156883,0.0001905262,0.01424962],"genre_scores_gemma":[0.9185724,0.0005688148,0.07554131,0.0001143773,0.0000462806,0.0001745769,0.0001283354,0.00003600609,0.004817868],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002256426,"threshold_uncertainty_score":0.01204962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202141040254749,"score_gpt":0.2328595851750756,"score_spread":0.2108381747725281,"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."}}