{"id":"W4411128495","doi":"10.21203/rs.3.rs-6556636/v1","title":"Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Group signature; Revocation; Computer science; Cryptography; Accumulator (cryptography); Scheme (mathematics); Computer security; Signature (topology); Group (periodic table); Ring signature; Lattice (music); Theoretical computer science; Digital signature; Merkle tree; Flexibility (engineering); Hash function; Public-key cryptography; Algorithm; Mathematics; Encryption; Cryptographic hash function; Statistics; Operating system","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","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002214202,0.0004028479,0.0004184021,0.001088332,0.0004906126,0.0009311945,0.002513909,0.0007073021,0.00003696854],"category_scores_gemma":[0.0002915454,0.0003792643,0.0002356151,0.001682524,0.0003129001,0.0001523462,0.005653008,0.00372143,0.00001950102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001719585,"about_ca_system_score_gemma":0.0007311717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001170872,"about_ca_topic_score_gemma":0.0001452471,"domain_scores_codex":[0.9948775,0.0006778198,0.0003364973,0.001600811,0.001587012,0.0009203221],"domain_scores_gemma":[0.9959723,0.0007736222,0.0001006765,0.002210442,0.000603597,0.000339368],"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.0002837806,0.001806765,0.002295074,0.01458007,0.0002951111,0.0005244331,0.00302303,0.00268414,0.0008006749,0.9283123,0.01102274,0.03437186],"study_design_scores_gemma":[0.001315131,0.0003844023,0.009402298,0.003133648,0.0000270278,0.000007315169,0.0002257135,0.9096233,0.0002150512,0.05211376,0.0224893,0.001063062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1343614,0.02828136,0.8140159,0.008719834,0.00165191,0.004822257,0.003044652,0.001205078,0.003897549],"genre_scores_gemma":[0.9240806,0.0004442192,0.07401135,0.0002561676,0.0001444503,0.0002757203,0.0006855486,0.00002952624,0.00007242354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9069391,"threshold_uncertainty_score":0.9998659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02476003019020106,"score_gpt":0.3494353440478149,"score_spread":0.3246753138576138,"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."}}