On the public citation graph
Public key encryption with conjunctive keyword search secure against keyword guessing attack from lattices
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11844662_6openalex-snapshot
Off-Line Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data
inferredcites →https://doi.org/10.1007/978-3-319-61273-7_20openalex-snapshot
Multi-authority Distributed Attribute-Based Encryption with Application to Searchable Encryption on Lattices
inferredcites →https://doi.org/10.1007/978-3-540-24676-3_30openalex-snapshot
Public Key Encryption with Keyword Search
inferredcites →https://doi.org/10.1007/978-3-540-31815-6_7openalex-snapshot
Public Key Encryption with Conjunctive Field Keyword Search
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_28openalex-snapshot
Efficient Lattice (H)IBE in the Standard Model
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_6openalex-snapshot
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
inferredcites →https://doi.org/10.1007/978-3-642-25385-0_2openalex-snapshot
Functional Encryption for Inner Product Predicates from Learning with Errors
inferredcites →https://doi.org/10.1007/978-3-642-29011-4_41openalex-snapshot
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
inferredcites →https://doi.org/10.1007/978-3-642-36594-2_8openalex-snapshot
Attribute-Based Functional Encryption on Lattices
inferredcites →https://doi.org/10.1007/978-3-662-46447-2_34openalex-snapshot
Predicate Encryption for Multi-dimensional Range Queries from Lattices
inferredcites →https://doi.org/10.1007/978-981-10-2741-3_10openalex-snapshot
Identity-Based Threshold Encryption on Lattices with Application to Searchable Encryption
inferredcites →https://doi.org/10.1007/s00145-007-9006-6openalex-snapshot
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
inferredcites →https://doi.org/10.1016/j.comcom.2008.11.018openalex-snapshot
Constructing PEKS schemes secure against keyword guessing attacks is possible?
inferredcites →https://doi.org/10.1049/cje.2018.01.012openalex-snapshot
Designated Cloud Server Public Key Encryption with Keyword Search from Lattice in the Standard Model
inferredcites →https://doi.org/10.1109/tc.2012.215openalex-snapshot
Public-Key Encryption with Fuzzy Keyword Search: A Provably Secure Scheme under Keyword Guessing Attack
inferredcites →https://doi.org/10.1109/tifs.2015.2510822openalex-snapshot
Dual-Server Public-Key Encryption With Keyword Search for Secure Cloud Storage
inferredcites →https://doi.org/10.1109/tifs.2016.2599293openalex-snapshot
Server-Aided Public Key Encryption With Keyword Search
inferredcites →https://doi.org/10.1145/1374376.1374407openalex-snapshot
Trapdoors for hard lattices and new cryptographic constructions
inferredcites →https://doi.org/10.1145/1568318.1568324openalex-snapshot
On lattices, learning with errors, random linear codes, and cryptography
inferredcites →https://doi.org/10.1145/237814.237838openalex-snapshot
Generating hard instances of lattice problems (extended abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.3905openalex-snapshot
Provable secure lightweight attribute‐based keyword search for cloud‐based Internet of Things networks
inferred← citeshttps://doi.org/10.1007/978-3-030-57884-8_10openalex-snapshot
Conjunctive Keywords Searchable Encryption Scheme Against Inside Keywords Guessing Attack from Lattice
inferred← citeshttps://doi.org/10.1007/978-981-95-3182-0_27openalex-snapshot
An Efficient Designated-Server Public-Key Encryption Scheme with Keyword Search Based on Lattices
inferred← citeshttps://doi.org/10.1007/s00500-022-07469-yopenalex-snapshot
Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from lattice
inferred← citeshttps://doi.org/10.1007/s10586-021-03488-wopenalex-snapshot
Lattice-based public-key encryption with conjunctive keyword search in multi-user setting for IIoT
inferred← citeshttps://doi.org/10.1007/s11227-023-05574-9openalex-snapshot
RLWE-based public key searchable encryption: securer, faster, and lower end-to-end delay for cloud computing
inferred← citeshttps://doi.org/10.1007/s11276-022-03033-6openalex-snapshot
Conjunctive searchable encryption with efficient authorization for group sharing
inferred← citeshttps://doi.org/10.1007/s12652-019-01254-wopenalex-snapshot
Public-key encryption with keyword search: a generic construction secure against online and offline keyword guessing attacks
inferred← citeshttps://doi.org/10.1007/s42044-022-00119-4openalex-snapshot
Quantum-secure plaintext checkable signcryption
inferred← citeshttps://doi.org/10.1016/j.ins.2022.12.035openalex-snapshot
Scalable CCA-secure public-key authenticated encryption with keyword search from ideal lattices in cloud computing
inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102709openalex-snapshot
Designated-ciphertext searchable encryption
inferred← citeshttps://doi.org/10.1016/j.jnca.2020.102755openalex-snapshot
Achieving forward unforgeability in keyword-field-free conjunctive search
inferred← citeshttps://doi.org/10.1093/comjnl/bxab119openalex-snapshot
Public-Key Authenticated Encryption with Keyword Search: A Generic Construction and Its Quantum-Resistant Instantiation
inferred← citeshttps://doi.org/10.1109/eiecc67963.2025.11409654openalex-snapshot
Conjunctive Keyword Search with Fine-Grained Access Control from Lattice
inferred← citeshttps://doi.org/10.1109/icpeca53709.2022.9718905openalex-snapshot
Construction of Hash Function Algorithm Based on Chen Chaotic System
inferred← citeshttps://doi.org/10.1109/icpeca53709.2022.9719092openalex-snapshot
Algorithm Research on Fuzzy Test Method of CAN Bus Based on Field Weight
inferred← citeshttps://doi.org/10.1109/tdsc.2026.3675085openalex-snapshot
VLMS: Verifiable Lattice-Based Encryption With Multi-Keyword Search in Cloud Storage
inferred← citeshttps://doi.org/10.1109/tifs.2024.3459646openalex-snapshot
Identity-Based Encryption With Disjunctive, Conjunctive and Range Keyword Search From Lattices
inferred← citeshttps://doi.org/10.1186/s13638-021-02006-1openalex-snapshot
Designated server-aided revocable identity-based keyword search on lattice
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3153867/v1openalex-snapshot
Improved Trapdoors and Public Key Search Encryption Based on Middle-Product LWE
inferred← citeshttps://doi.org/10.32604/cmc.2021.017216openalex-snapshot
Verifiable Identity-Based Encryption with Keyword Search for IoT from Lattice
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.