{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005505133,0.0008653018,0.001079046,0.0007427104,0.0002596191,0.001019135,0.009033997,0.0008062059,0.0003901857],"category_scores_gemma":[0.0004837381,0.0008728526,0.0005214538,0.000454404,0.0005939729,0.0006680752,0.03025786,0.003659168,0.0001875728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001265493,"about_ca_system_score_gemma":0.002246974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000945304,"about_ca_topic_score_gemma":0.0007107928,"domain_scores_codex":[0.9940199,0.000496298,0.0008750672,0.002711946,0.0007419308,0.001154835],"domain_scores_gemma":[0.9942357,0.0003071426,0.0005239383,0.003419697,0.0001751102,0.001338443],"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.000124589,0.00008178921,0.003164662,0.00008863204,0.0002520383,0.0003141151,0.003340838,0.0005599327,0.0002243961,0.9808612,0.00633397,0.004653797],"study_design_scores_gemma":[0.0007364281,0.00009568612,0.002293453,0.0001040375,0.00005708101,0.0003153301,0.00002238951,0.007653381,0.0004399384,0.9804946,0.006931659,0.0008560102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08807197,0.0002405092,0.8998316,0.002400108,0.002918894,0.0007299447,0.0003801547,0.0005825268,0.00484432],"genre_scores_gemma":[0.1301378,0.0001265023,0.8656846,0.00151593,0.00139128,0.00008777221,0.000975051,0.00007817669,0.000002898956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04206587,"threshold_uncertainty_score":0.9993722,"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."}}