{"id":"W2026017982","doi":"10.1515/jmc-2013-5006","title":"Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematical Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Verifiable secret sharing; Access structure; Secure multi-party computation; Homomorphic secret sharing; Scheme (mathematics); Computer science; Property (philosophy); Robustness (evolution); Shamir's Secret Sharing; Mathematics; Set (abstract data type); Theoretical computer science; Cryptography; Computer security","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.0003172287,0.0001751192,0.0004233353,0.000178202,0.0001192022,0.0003181178,0.001093909,0.0001713791,0.0001742435],"category_scores_gemma":[0.000268658,0.0001293508,0.0001366611,0.0001173789,0.00008823586,0.001340732,0.0004043877,0.0003480736,0.000004703931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001538461,"about_ca_system_score_gemma":0.00004786937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001879278,"about_ca_topic_score_gemma":0.000003381362,"domain_scores_codex":[0.9985776,0.00002870805,0.0005742785,0.000257219,0.0002660906,0.000296136],"domain_scores_gemma":[0.9985389,0.0003409917,0.0003516928,0.0002813638,0.0002863113,0.0002007919],"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.00001818445,0.00007820271,0.001123248,0.0001690534,0.00007226631,0.00001257038,0.0002457731,0.00002136793,0.0003789597,0.9928424,0.003860749,0.001177278],"study_design_scores_gemma":[0.0007287971,0.000119515,0.00327527,0.00006346892,0.00002400148,0.0005322049,0.00006229177,0.02231745,0.0003212553,0.971854,0.0005494431,0.0001523178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390333,0.0001566096,0.7585019,0.001810721,0.0001690077,0.0002027225,0.00002831395,0.00002055572,0.00007681845],"genre_scores_gemma":[0.6375954,0.00001098807,0.3618807,0.0003376993,0.0001485822,0.00001062452,0.000005852065,0.000008566427,0.000001531917],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3985622,"threshold_uncertainty_score":0.5274773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03649148341082455,"score_gpt":0.2945608209996092,"score_spread":0.2580693375887846,"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."}}