{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001429262,0.001148096,0.001024031,0.001844251,0.0007150662,0.001443188,0.07096608,0.0009963906,0.00004588985],"category_scores_gemma":[0.006754601,0.001037749,0.0002333678,0.001814173,0.0033137,0.0006912928,0.1242749,0.001781297,0.0001015228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008889188,"about_ca_system_score_gemma":0.00102967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008556116,"about_ca_topic_score_gemma":0.0000744241,"domain_scores_codex":[0.991967,0.00009347159,0.0009625678,0.003242441,0.002210709,0.001523772],"domain_scores_gemma":[0.9793243,0.0008581869,0.0007371383,0.01826541,0.0005800377,0.0002349363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008571104,0.0002743315,0.00007946578,0.000359695,0.0001754234,0.001347163,0.002193351,0.5515367,0.004466467,0.0141323,0.007965987,0.4173834],"study_design_scores_gemma":[0.0003553342,0.0001338361,0.00002148082,0.0006978964,0.00001325153,0.00008794382,4.339811e-7,0.6877683,0.002974884,0.3061795,0.0009193965,0.0008477822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003761795,0.001165491,0.9855185,0.002595185,0.003933188,0.0007430792,0.00005682469,0.00117781,0.001048097],"genre_scores_gemma":[0.07654767,0.0000730447,0.9213006,0.001324738,0.0005138119,0.00001193971,0.00001529004,0.000092339,0.0001205478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4165356,"threshold_uncertainty_score":0.9995934,"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."}}