{"id":"W1503056535","doi":"10.1007/3-540-46513-8_15","title":"Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Verifiable secret sharing; Secret sharing; Scheme (mathematics); Cheating; Computer science; Access structure; Construct (python library); Computer security; Homomorphic secret sharing; Adversary; Theoretical computer science; Secure multi-party computation; Cryptography; Computer network; Mathematics; Set (abstract data type)","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.001398666,0.000713235,0.001025666,0.0008647532,0.001643704,0.003737195,0.002314395,0.00153649,0.004033326],"category_scores_gemma":[0.002898067,0.0005976363,0.0008864474,0.001671118,0.001773766,0.005128296,0.003875956,0.002755171,0.001711802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001564652,"about_ca_system_score_gemma":0.002660753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000234804,"about_ca_topic_score_gemma":0.0002732271,"domain_scores_codex":[0.9975006,0.0005774862,0.0001706067,0.0003605163,0.000969667,0.0004209939],"domain_scores_gemma":[0.9961547,0.001207571,0.0003804148,0.001725432,0.0002999589,0.0002319849],"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.0004959838,0.0001653798,0.0002454991,0.000163547,0.00004310319,0.000159933,0.0002135879,0.019409,0.02260712,0.9113979,0.003781797,0.04131711],"study_design_scores_gemma":[0.0002516523,0.0004297477,0.0003497142,0.00005532476,0.0001201816,0.0007670135,0.00008847906,0.1998184,0.03105288,0.7547935,0.01214088,0.000132213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1074064,0.000560595,0.8438461,0.001170648,0.0002388482,0.0003263261,0.0006255099,0.002057075,0.04376847],"genre_scores_gemma":[0.892531,0.0002955311,0.09110162,0.000253107,0.0001264267,0.0003125265,0.0005030417,0.000109672,0.01476708],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004033326,"threshold_uncertainty_score":0.01349282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01026310716023822,"score_gpt":0.2247177828630698,"score_spread":0.2144546757028315,"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."}}