{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004422699,0.0007228815,0.0005845653,0.0008236659,0.0004489131,0.0009667382,0.004167702,0.0004251384,0.0001306142],"category_scores_gemma":[0.00002691773,0.0006106954,0.000151169,0.0009043798,0.0009925326,0.001385569,0.001189933,0.001423617,0.00001829211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002183682,"about_ca_system_score_gemma":0.0007847275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000339191,"about_ca_topic_score_gemma":0.0001122098,"domain_scores_codex":[0.995065,0.00003007513,0.0004505033,0.00220707,0.001499123,0.000748203],"domain_scores_gemma":[0.9972915,0.0002422496,0.0002909785,0.001638523,0.0002824508,0.0002543077],"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.00005383211,0.00004791838,0.0001284245,0.00003634118,0.00005573576,0.0001596753,0.001005268,0.002833438,0.000024756,0.94791,0.00003336509,0.04771128],"study_design_scores_gemma":[0.00065141,0.0003594331,0.0003085986,0.0002460646,0.00001348526,0.0001376063,2.768465e-7,0.03021927,0.0004398575,0.9652271,0.001525838,0.0008710939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008343577,0.0001814494,0.9888165,0.0002214449,0.001428964,0.0005780443,0.00008670525,0.0002456481,0.007606893],"genre_scores_gemma":[0.3772927,0.00005162993,0.6193177,0.001431098,0.001560223,0.00003481377,0.000195798,0.00008172406,0.00003431863],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3764583,"threshold_uncertainty_score":0.9996344,"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."}}