{"id":"W2045758343","doi":"10.1016/j.jda.2005.03.003","title":"On the mean number of encryptions for tree-based broadcast encryption schemes","year":2005,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Broadcast encryption; Computer science; Encryption; Stateless protocol; Scheme (mathematics); Cryptanalysis; Mathematics; Computer network; Tree (set theory); Theoretical computer science; Computer security; Discrete mathematics; Public-key cryptography; Combinatorics","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.01127962,0.001300291,0.00306929,0.002125357,0.003114973,0.004937376,0.003878849,0.002772212,0.005290189],"category_scores_gemma":[0.05370128,0.00118364,0.001783017,0.002093427,0.004927296,0.01416112,0.004725565,0.006728299,0.001005196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005126977,"about_ca_system_score_gemma":0.004523696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006860966,"about_ca_topic_score_gemma":0.001525403,"domain_scores_codex":[0.9907796,0.003375422,0.0004778933,0.001230077,0.00272894,0.00140809],"domain_scores_gemma":[0.920565,0.05602696,0.003961406,0.01142547,0.005543297,0.002477863],"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.002663589,0.0002166218,0.002146391,0.0003813557,0.0001743521,0.000133087,0.0004410794,0.09792612,0.01015119,0.8123839,0.01223028,0.06115197],"study_design_scores_gemma":[0.0001553562,0.0003373603,0.0007393385,0.0001068815,0.0001132398,0.0003620917,0.0001274528,0.3475827,0.004135585,0.642849,0.003405179,0.00008589709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1567675,0.004842901,0.811009,0.006015238,0.0008485835,0.0002367947,0.0005759498,0.0009197865,0.01878429],"genre_scores_gemma":[0.8252248,0.00244313,0.1601461,0.001021491,0.0008258682,0.0005330274,0.000515819,0.0005558737,0.008734016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01127962,"threshold_uncertainty_score":0.0596531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01908618021055641,"score_gpt":0.288083670207468,"score_spread":0.2689974899969116,"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."}}