{"id":"W2809889031","doi":"10.1007/978-3-319-94667-2_5","title":"Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aggregate (composite); Signature (topology); Digital signature; Cover (algebra); Computer science; Upper and lower bounds; Set (abstract data type); Compression (physics); Algorithm; Scheme (mathematics); Approx; Compression ratio; Theoretical computer science; Mathematics; Computer security; Physics","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.002298672,0.0008723983,0.002184887,0.001026808,0.00185762,0.003741913,0.002910855,0.001502344,0.006181839],"category_scores_gemma":[0.01115938,0.0007347328,0.001473321,0.002086799,0.001748934,0.01003846,0.006277322,0.002839685,0.002387365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001765679,"about_ca_system_score_gemma":0.00215286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005324677,"about_ca_topic_score_gemma":0.0005729999,"domain_scores_codex":[0.9937847,0.0009885936,0.0004798685,0.0008582086,0.002892483,0.0009960365],"domain_scores_gemma":[0.9862855,0.005224776,0.0007517104,0.006219139,0.001156668,0.0003621746],"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.002638727,0.0004985964,0.001586731,0.0005501001,0.0001487612,0.0005339462,0.001145349,0.1921236,0.04621636,0.3966125,0.0155251,0.3424204],"study_design_scores_gemma":[0.0001363037,0.0002691392,0.00025766,0.00007710291,0.00007430906,0.0005478183,0.0002667837,0.5150509,0.03032707,0.4414675,0.01144154,0.00008390564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06792118,0.0004535896,0.9178544,0.0005969863,0.0001702067,0.0001920311,0.0004675914,0.004136842,0.008207263],"genre_scores_gemma":[0.7798275,0.0002769777,0.2109416,0.0002259005,0.0001432714,0.0002482677,0.0008317278,0.0005823101,0.006922481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006181839,"threshold_uncertainty_score":0.02068031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02526502986790034,"score_gpt":0.2606008672683133,"score_spread":0.235335837400413,"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."}}