{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002149147,0.0005509626,0.0007536192,0.0005095051,0.0009156482,0.00192909,0.0014874,0.00153702,0.003523326],"category_scores_gemma":[0.006483012,0.0003855057,0.0009738698,0.0009465695,0.00306235,0.005744739,0.004079486,0.002221642,0.0006729211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001606796,"about_ca_system_score_gemma":0.0009076971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003280969,"about_ca_topic_score_gemma":0.0001892107,"domain_scores_codex":[0.9968521,0.0008815626,0.0001697744,0.0006352322,0.0009040179,0.0005573202],"domain_scores_gemma":[0.9972796,0.0008408786,0.0003026183,0.001256242,0.000204363,0.0001162703],"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.0002294212,0.00003503149,0.0003017127,0.00008853999,0.00002338512,0.0001191971,0.0002826767,0.02580002,0.006935498,0.9513443,0.0008198961,0.01402028],"study_design_scores_gemma":[0.0000702876,0.0001493975,0.0003159711,0.00006252045,0.00003194718,0.0003929026,0.00008945585,0.233712,0.01375676,0.7427264,0.00863002,0.00006219076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1914311,0.0008676734,0.7597693,0.00149717,0.0001632485,0.0002005277,0.0004125217,0.000411404,0.04524697],"genre_scores_gemma":[0.9386849,0.0003501364,0.05500939,0.0002095009,0.00008341234,0.0001032552,0.0001419954,0.00004636299,0.005371208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003523326,"threshold_uncertainty_score":0.0117867,"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."}}