{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578456,0.0003104418,0.0007170027,0.0004811429,0.0007512949,0.001576214,0.001440349,0.0009122737,0.002817922],"category_scores_gemma":[0.004184894,0.0002209225,0.0008944384,0.0006135619,0.001518023,0.003913463,0.003426452,0.001367545,0.0004841083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261663,"about_ca_system_score_gemma":0.001036359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003453661,"about_ca_topic_score_gemma":0.0001942969,"domain_scores_codex":[0.9976516,0.0004785527,0.0002088448,0.0003636389,0.0009381802,0.0003591358],"domain_scores_gemma":[0.9965774,0.0008802991,0.0007805142,0.001189419,0.0003297004,0.0002426363],"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.0007170611,0.0001123497,0.0008746693,0.0002050208,0.00009688638,0.0004166095,0.0005791637,0.05307187,0.0619674,0.8498637,0.001214176,0.03088106],"study_design_scores_gemma":[0.0001786369,0.0004410079,0.000839957,0.00005150633,0.00009295167,0.000870119,0.0001542805,0.5456277,0.05648556,0.3870651,0.008066806,0.0001264533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1813231,0.0001997042,0.8085805,0.0004608696,0.00005861077,0.0001476046,0.0003257999,0.0004318039,0.008472104],"genre_scores_gemma":[0.9564653,0.00007161721,0.04140724,0.00005640642,0.00002778078,0.00006991377,0.0001071409,0.00001701841,0.001777555],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002817922,"threshold_uncertainty_score":0.009426892,"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."}}