{"id":"W4205196355","doi":"10.5539/cis.v15n1p66","title":"Dual Fine-Grained Public-Key Searchable Encryption from Lattices","year":2022,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Keyword search; Scheme (mathematics); Encryption; Access control; Learning with errors; Key (lock); Dual (grammatical number); Public-key cryptography; Delegation; Computer security; Theoretical computer science; Information retrieval","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350822,0.0003823555,0.0008683069,0.0006385426,0.0007649718,0.0020518,0.001024225,0.0009410317,0.002241589],"category_scores_gemma":[0.003570426,0.0003413513,0.000824945,0.0009399076,0.002172675,0.004692866,0.003764916,0.002031215,0.000706945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001301305,"about_ca_system_score_gemma":0.00121491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004207356,"about_ca_topic_score_gemma":0.0003363157,"domain_scores_codex":[0.9976982,0.000585551,0.0002195452,0.0003465359,0.0007784562,0.0003716583],"domain_scores_gemma":[0.9978002,0.0006339176,0.0002897764,0.0009173283,0.0001948936,0.0001639722],"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.0003907022,0.0001210633,0.0004247787,0.0001814592,0.00002571807,0.0002466984,0.0003540333,0.03699525,0.02357158,0.8940112,0.002084153,0.04159329],"study_design_scores_gemma":[0.0002092404,0.0002366898,0.0002789323,0.00005924618,0.00002747342,0.0005727902,0.0001135283,0.3453926,0.02628489,0.611271,0.01544177,0.0001118456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08084694,0.0006371812,0.9066988,0.0007499185,0.0001015707,0.0002256289,0.0003427083,0.0007334485,0.009663772],"genre_scores_gemma":[0.8244402,0.0003123184,0.1694934,0.0002708954,0.00007367826,0.0002543165,0.0002517816,0.00007835901,0.004824983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002241589,"threshold_uncertainty_score":0.009441674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01953382986205142,"score_gpt":0.2390073405759783,"score_spread":0.2194735107139269,"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."}}