{"id":"W2405997985","doi":"","title":"Sequential Secret Sharing as a New Hierarchical Access Structure.","year":2015,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Computer science; Access structure; Theoretical computer science; Context (archaeology); Verifiable secret sharing; Cryptography; Set (abstract data type); Computer security; Secure multi-party computation; Cryptographic primitive; Homomorphic secret sharing; Distributed computing; Cryptographic protocol; Programming language","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.001740585,0.0003165033,0.0004011503,0.0009183078,0.001279677,0.002416403,0.001424091,0.0009988914,0.004130803],"category_scores_gemma":[0.003658056,0.0004300745,0.0007807305,0.001375772,0.003043658,0.005853306,0.003771649,0.002093414,0.0008115971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170254,"about_ca_system_score_gemma":0.001563859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006974656,"about_ca_topic_score_gemma":0.0008284583,"domain_scores_codex":[0.9975287,0.0005897979,0.0001871979,0.0003834003,0.001051995,0.0002588876],"domain_scores_gemma":[0.9966234,0.0008173549,0.0004801608,0.001512798,0.0003069192,0.0002594152],"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.00005257746,0.00002773836,0.0002464468,0.00005991972,0.00001309533,0.0001075962,0.0003540085,0.004105845,0.009388315,0.9691896,0.0008183477,0.01563665],"study_design_scores_gemma":[0.00006147821,0.0002457075,0.0006064815,0.00006497129,0.00005094784,0.001032866,0.0002242909,0.1146059,0.01658996,0.8206862,0.04577353,0.00005767786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04166166,0.0004883778,0.9376341,0.0009797808,0.0001163582,0.0002747394,0.0002297005,0.0004352866,0.01818006],"genre_scores_gemma":[0.7316769,0.0006148661,0.2526374,0.0003756307,0.000155681,0.0003134184,0.0002448587,0.00006872274,0.01391256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004130803,"threshold_uncertainty_score":0.01381892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04896042530811537,"score_gpt":0.3320779916451271,"score_spread":0.2831175663370118,"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."}}