{"id":"W2224071963","doi":"10.4230/lipics.tqc.2015.147","title":"Making Existential-Unforgeable Signatures Strongly Unforgeable in the Quantum Random-Oracle Model","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Random oracle; Computer science; Schnorr signature; Oracle; Quantum; Theoretical computer science; Quantum computer; Signature (topology); Cryptography; Provable security; Algorithm; Digital signature; Mathematics; Hash function; Encryption; Blind signature; Public-key cryptography; Computer security; Programming language; Quantum mechanics; Physics","routes":{"ca_aff":true,"ca_fund":true,"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","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003624859,0.001021556,0.001217555,0.0007780462,0.0005872214,0.002443334,0.006463346,0.000913177,0.00001580131],"category_scores_gemma":[0.0002176769,0.0008050032,0.0008091473,0.0007893808,0.0002310788,0.003306097,0.003683731,0.002532513,0.0000491328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002393089,"about_ca_system_score_gemma":0.0006022671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001289927,"about_ca_topic_score_gemma":0.0001426186,"domain_scores_codex":[0.9936432,0.000186107,0.002210214,0.000823464,0.001509907,0.001627134],"domain_scores_gemma":[0.9944466,0.0003230907,0.00123877,0.00314325,0.0005749766,0.0002732508],"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.001285893,0.001951065,0.001355222,0.00464575,0.000723007,0.00006520886,0.0756811,0.1968344,0.00002849897,0.6269616,0.08503579,0.00543243],"study_design_scores_gemma":[0.004377261,0.000136159,0.00006513242,0.0004532152,0.00007913778,0.00002964963,0.001904038,0.9056359,0.00004512309,0.06235472,0.02392581,0.0009938884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03205124,0.0008130262,0.9459915,0.0005212774,0.00265759,0.004089152,0.003214253,0.0004625041,0.01019941],"genre_scores_gemma":[0.9113667,0.0001456702,0.08341916,0.001326808,0.0003145268,0.0006812984,0.002557893,0.00009172266,0.00009619303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8793155,"threshold_uncertainty_score":0.9997687,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06318378054687857,"score_gpt":0.3127094173486242,"score_spread":0.2495256368017456,"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."}}