{"id":"W2887133168","doi":"10.4230/lipics.itcs.2019.53","title":"Secret Sharing with Binary Shares","year":2018,"lang":"en","type":"preprint","venue":"DR-NTU (Nanyang Technological University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; National Science Foundation","keywords":"Secret sharing; Secrecy; Information-theoretic security; Mathematics; Homomorphic secret sharing; Secure multi-party computation; Discrete mathematics; Shamir's Secret Sharing; Binary number; Impossibility; Combinatorics; Computer science; Cryptography; Algorithm; Computer security; Arithmetic; Law","routes":{"ca_aff":true,"ca_fund":true,"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"],"consensus_categories":["open_science"],"category_scores_codex":[0.0002441416,0.0004737092,0.0004693679,0.001005227,0.0003705292,0.0002866207,0.006396867,0.0009782027,0.0001052206],"category_scores_gemma":[0.0000450736,0.0004102908,0.0002251927,0.001836003,0.0007729752,0.0005310517,0.01348284,0.001353558,0.00007366142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001389488,"about_ca_system_score_gemma":0.0001005518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007281997,"about_ca_topic_score_gemma":0.00004516632,"domain_scores_codex":[0.9970645,0.00006646037,0.0002086738,0.001663732,0.0003937846,0.0006027968],"domain_scores_gemma":[0.9970291,0.00006986938,0.0002335832,0.002334746,0.0001530959,0.0001796181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008852863,0.0003081448,0.005526022,0.0001235114,0.0001627027,0.002059353,0.0001353421,0.00003476647,0.0001482545,0.9811079,0.003985511,0.006320002],"study_design_scores_gemma":[0.002130994,0.001895372,0.01100005,0.001611833,0.0002533025,0.0001538058,0.0006135151,0.02116375,0.002366364,0.382272,0.5722641,0.00427497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3250247,0.0004660487,0.6384325,0.002531791,0.0006349446,0.0009722027,0.0002841192,0.008208973,0.02344473],"genre_scores_gemma":[0.9039052,0.0004188076,0.0946532,0.0002076368,0.0001317786,0.000009590371,0.000214038,0.00003811349,0.0004216294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5988359,"threshold_uncertainty_score":0.9998349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02165792439664143,"score_gpt":0.209451471898122,"score_spread":0.1877935475014806,"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."}}