{"id":"W2255779533","doi":"10.1007/978-3-642-39884-1_9","title":"Unconditionally-Secure Robust Secret Sharing with Minimum Share Size","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Secret sharing; Secrecy; Computer science; Secure multi-party computation; Cheating; Scheme (mathematics); Verifiable secret sharing; Shamir's Secret Sharing; Information-theoretic security; Homomorphic secret sharing; Robustness (evolution); Computer security; Set (abstract data type); Theoretical computer science; Cryptography; Mathematics","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.001635917,0.001033742,0.001583787,0.0005799585,0.0007340291,0.002010391,0.002390502,0.001671123,0.003661946],"category_scores_gemma":[0.005273126,0.0006666966,0.001228715,0.001056762,0.001914975,0.005658636,0.005000998,0.003046023,0.001731095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001038596,"about_ca_system_score_gemma":0.001108076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001753362,"about_ca_topic_score_gemma":0.0001429888,"domain_scores_codex":[0.9962282,0.0006030509,0.000246384,0.0005864957,0.001884052,0.0004518458],"domain_scores_gemma":[0.9952013,0.001670021,0.0004520683,0.002216853,0.0003495166,0.0001101902],"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.001026578,0.0001524299,0.0002341137,0.0004550591,0.0001661955,0.0003373657,0.0002825006,0.1200387,0.09675802,0.643846,0.005042798,0.1316602],"study_design_scores_gemma":[0.0001175096,0.0004028904,0.0002268075,0.00005412765,0.00008272361,0.0005821469,0.00004413959,0.3733494,0.05606034,0.5626782,0.006305693,0.0000960475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02538954,0.0004138139,0.9640159,0.0005139924,0.0001216053,0.00009938516,0.0001816727,0.001021452,0.008242637],"genre_scores_gemma":[0.851873,0.0005103035,0.1344516,0.0003134102,0.0002347305,0.0002221409,0.0002994023,0.0002870431,0.01180849],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003661946,"threshold_uncertainty_score":0.01225048,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01554854089249214,"score_gpt":0.2178874841389626,"score_spread":0.2023389432464705,"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."}}