{"id":"W2760015015","doi":"10.1007/978-3-030-29962-0_17","title":"An Efficiently Searchable Encrypted Data Structure for Range Queries","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Encryption; Plaintext; Overhead (engineering); Cryptanalysis; Data structure; Theoretical computer science; Data mining; Database; Computer security","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.0009226201,0.0004702512,0.0009609203,0.001050458,0.0006575644,0.002018736,0.001400608,0.0007057711,0.005289848],"category_scores_gemma":[0.003959494,0.0005190963,0.000630528,0.001774204,0.0008274273,0.003973347,0.003610565,0.001283898,0.002428235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012876,"about_ca_system_score_gemma":0.001654222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008137379,"about_ca_topic_score_gemma":0.0009878696,"domain_scores_codex":[0.9981768,0.0002200123,0.0002480298,0.0002010907,0.000928094,0.0002260208],"domain_scores_gemma":[0.996941,0.000631224,0.0002330538,0.001591319,0.0004936288,0.0001096087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002668369,0.0006037195,0.00216528,0.0008051412,0.0001388524,0.0006345643,0.0007632038,0.03512857,0.08948603,0.3065268,0.05882116,0.5022583],"study_design_scores_gemma":[0.0009182355,0.001081296,0.001476259,0.0002087679,0.0002968276,0.002140084,0.0003891799,0.4074038,0.1324933,0.3322404,0.1211445,0.0002073072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07997707,0.001211431,0.8943978,0.001270759,0.0003505715,0.0005164963,0.003167127,0.008150786,0.01095781],"genre_scores_gemma":[0.5052357,0.0007447625,0.4679053,0.0005159362,0.0002048322,0.000539674,0.005036272,0.001028975,0.0187886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005289848,"threshold_uncertainty_score":0.01769632,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03227953578566503,"score_gpt":0.3079968936761742,"score_spread":0.2757173578905092,"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."}}