{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005459565,0.0007826624,0.0006300009,0.0006871477,0.0004183212,0.001433658,0.005628784,0.0004306924,0.0005368724],"category_scores_gemma":[0.0000807447,0.0006560151,0.0001825124,0.000985941,0.000843195,0.001806901,0.002323627,0.001237302,0.0001242992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001900273,"about_ca_system_score_gemma":0.0005486056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005491373,"about_ca_topic_score_gemma":0.0003281747,"domain_scores_codex":[0.9946024,0.00002581599,0.0005472615,0.002485421,0.00143617,0.0009029251],"domain_scores_gemma":[0.9960082,0.0006567275,0.0003633947,0.002202699,0.0004244407,0.0003445014],"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.00005411199,0.0002308626,0.001236572,0.0004427113,0.0001649276,0.0009432933,0.003792054,0.05060718,0.000186469,0.7795075,0.002092357,0.1607419],"study_design_scores_gemma":[0.0009565694,0.0005317203,0.001593748,0.001658103,0.00003118259,0.0003713113,0.000001138369,0.3093588,0.0003132603,0.6763293,0.006434974,0.002419929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003369171,0.0003746558,0.9914152,0.000712575,0.000871057,0.0005515224,0.000104265,0.0002736327,0.005360195],"genre_scores_gemma":[0.1076473,0.00005621302,0.8872426,0.003521779,0.0009539084,0.00005162245,0.0001499009,0.00008372485,0.000292998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2587516,"threshold_uncertainty_score":0.9997513,"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."}}