{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321351,0.0001419767,0.0002238183,0.0001458942,0.0001518924,0.00009276187,0.0008208423,0.00006029901,0.00005694218],"category_scores_gemma":[0.0001022665,0.00009081064,0.000379511,0.0003665698,0.00009740494,0.0006357999,0.00005294495,0.0002217486,0.00000929164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003170098,"about_ca_system_score_gemma":0.00009052817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005566016,"about_ca_topic_score_gemma":0.000008686075,"domain_scores_codex":[0.9985709,0.0000827984,0.0005032175,0.0001681623,0.0004650742,0.0002099133],"domain_scores_gemma":[0.9983077,0.0004179197,0.000484509,0.0004225325,0.0002674622,0.00009987788],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001698415,0.0005988022,0.0003941676,0.00003646198,0.0001711764,0.000006117071,0.001109024,0.0004412286,0.002991079,0.7627799,0.005712715,0.2255895],"study_design_scores_gemma":[0.0106103,0.003819338,0.008211544,0.0008908488,0.0003924381,0.0002734319,0.0009409121,0.4349745,0.08750635,0.2673552,0.1835053,0.001519787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04922596,0.0001664512,0.9465784,0.003013915,0.0002436527,0.0001706316,0.00006043454,0.00001892925,0.0005216448],"genre_scores_gemma":[0.6894718,0.0000512746,0.309775,0.0003242794,0.0003434455,0.000008904692,0.000007583394,0.000009216006,0.000008474375],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6402459,"threshold_uncertainty_score":0.3703151,"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."}}