On the public citation graph
https://doi.org/10.4086/toc.2018.v014a013
0 signed · 60 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/978-3-031-40744-4_5openalex-snapshot
Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct
inferredcites →https://doi.org/10.1007/978-3-319openalex-snapshot
Magnitude and complex based diffusion signal reconstruction
inferredcites →https://doi.org/10.1007/978-3-319-08344-5_21openalex-snapshot
Lattice Decoding Attacks on Binary LWE
inferredcites →https://doi.org/10.1007/978-3-319-31517-1_2openalex-snapshot
On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
inferredcites →https://doi.org/10.1007/978-3-319-56614-6_4openalex-snapshot
On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
inferredcites →https://doi.org/10.1007/978-3-642-03356-8_35openalex-snapshot
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
inferredcites →https://doi.org/10.1007/978-3-642-22006-7_34openalex-snapshot
New Algorithms for Learning in Presence of Errors
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_26openalex-snapshot
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
inferredcites →https://doi.org/10.1007/978-3-662-46800-5_24openalex-snapshot
FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
inferredcites →https://doi.org/10.1007/978-3-662-47989-6_3openalex-snapshot
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
inferredcites →https://doi.org/10.1007/978-3-662-53887-6_1openalex-snapshot
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
inferredcites →https://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferredcites →https://doi.org/10.1109/ccc.2010.26openalex-snapshot
The Learning with Errors Problem (Invited Survey)
inferredcites →https://doi.org/10.1137/s0097539705447360openalex-snapshot
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
inferredcites →https://doi.org/10.1137/s0097539793244708openalex-snapshot
A Pseudorandom Generator from any One-way Function
inferredcites →https://doi.org/10.1145/1374376.1374407openalex-snapshot
Trapdoors for hard lattices and new cryptographic constructions
inferredcites →https://doi.org/10.1145/1536414.1536461openalex-snapshot
Public-key cryptosystems from the worst-case shortest vector problem
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/2488608.2488680openalex-snapshot
Classical hardness of learning with errors
inferredcites →https://doi.org/10.1145/2535925openalex-snapshot
On Ideal Lattices and Learning with Errors over Rings
inferredcites →https://doi.org/10.1145/2815111.2815158openalex-snapshot
Algebraic algorithms for LWE problems
inferredcites →https://doi.org/10.1145/3055399.3055489openalex-snapshot
Pseudorandomness of ring-LWE for any ring and modulus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_2openalex-snapshot
Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller Sizes
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_19openalex-snapshot
Hardness of LWE on General Entropic Distributions
inferred← citeshttps://doi.org/10.1007/978-3-030-64375-1_1openalex-snapshot
Lossiness and Entropic Hardness for Ring-LWE
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_10openalex-snapshot
Towards Classical Hardness of Module-LWE: The Linear Rank Case
inferred← citeshttps://doi.org/10.1007/978-3-030-75245-3_16openalex-snapshot
Rate-1 Key-Dependent Message Security via Reusable Homomorphic Extractor Against Correlated-Source Attacks
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_21openalex-snapshot
On the Hardness of Module-LWE with Binary Secret
inferred← citeshttps://doi.org/10.1007/978-3-030-90567-5_33openalex-snapshot
Lattice-Based Secure Biometric Authentication for Hamming Distance
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_4openalex-snapshot
Entropic Hardness of Module-LWE from Module-NTRU
inferred← citeshttps://doi.org/10.1007/978-3-031-30620-4_8openalex-snapshot
Efficient FHEW Bootstrapping with Small Evaluation Keys, and Applications to Threshold Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_2openalex-snapshot
On the Multi-user Security of LWE-Based NIKE
inferred← citeshttps://doi.org/10.1007/978-3-031-50594-2_14openalex-snapshot
Sequential Half-Aggregation of Lattice-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-57728-4_10openalex-snapshot
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-58734-4_13openalex-snapshot
The Complexity of Algebraic Algorithms for LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-68382-4_7openalex-snapshot
A Systematic Study of Sparse LWE
inferred← citeshttps://doi.org/10.1007/978-3-031-78017-2_10openalex-snapshot
Sparse Linear Regression and Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-031-86599-2_9openalex-snapshot
Module Learning with Errors with Truncated Matrices
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_7openalex-snapshot
Weighted Cryptography with Weight-Independent Complexity
inferred← citeshttps://doi.org/10.1007/978-981-95-4434-9_14openalex-snapshot
Faster FHEW Bootstrapping with Adaptive Key Update
inferred← citeshttps://doi.org/10.1007/s00145-019-09319-xopenalex-snapshot
TFHE: Fast Fully Homomorphic Encryption Over the Torus
inferred← citeshttps://doi.org/10.1007/s00145-022-09441-3openalex-snapshot
On the Hardness of Module Learning with Errors with Short Distributions
inferred← citeshttps://doi.org/10.1007/s12652-022-03864-3openalex-snapshot
Secure and efficient multi-key FHE scheme supporting multi-bit messages from LWE preserving non-interactive decryption
inferred← citeshttps://doi.org/10.1049/ise2.12009openalex-snapshot
Analysis on Aigis‐Enc: Asymmetrical and symmetrical
inferred← citeshttps://doi.org/10.1049/ise2.12101openalex-snapshot
Lattice‐based cryptosystems in standardisation processes: A survey
inferred← citeshttps://doi.org/10.1088/1402-4896/ae8a8fopenalex-snapshot
Research on a hybrid compressive sensing public key encryption scheme based on chaos and lattice-based cryptography
inferred← citeshttps://doi.org/10.1109/access.2019.2922685openalex-snapshot
Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
inferred← citeshttps://doi.org/10.1109/fccm57271.2023.00021openalex-snapshot
Efficient Implementation of Ring-Binary-LWE-based Lightweight PQC Accelerator on the FPGA Platform
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00112openalex-snapshot
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
inferred← citeshttps://doi.org/10.1109/jiot.2023.3348122openalex-snapshot
An Efficient FHE-Enabled Secure Cloud–Edge Computing Architecture for IoMT Data Protection With its Application to Pandemic Modeling
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3353536openalex-snapshot
Efficient FHE-Based Privacy-Enhanced Neural Network for Trustworthy AI-as-a-Service
inferred← citeshttps://doi.org/10.1109/tvlsi.2023.3302289openalex-snapshot
KINA: Karatsuba Initiated Novel Accelerator for Ring-Binary-LWE (RBLWE)-Based Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1145/3474366.3486924openalex-snapshot
Bootstrapping in FHEW-like Cryptosystems
inferred← citeshttps://doi.org/10.1145/3637215openalex-snapshot
AEKA: FPGA Implementation of Area-Efficient Karatsuba Accelerator for Ring-Binary-LWE-Based Lightweight PQC
inferred← citeshttps://doi.org/10.1515/jmc-2023-0012openalex-snapshot
Revocable policy-based chameleon hash using lattices
inferred← citeshttps://doi.org/10.46586/tches.v2023.i1.501-537openalex-snapshot
FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.48175/ijarsct-38401openalex-snapshot
Verilog-Based FPGA Realization of KINA: A Karatsuba-Initiated Accelerator for Ring-Binary-LWE Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.70675/3b6aefefz9fbcz4fe5z9654zf389d7eb83f9openalex-snapshot
Theoretical and practical contributions to homomorphic encryption
inferred← citeshttps://doi.org/10.70675/a477cda1z1f32z481ezbe0fzcadc18756bf0openalex-snapshot
Lattice algorithms and lattice-based cryptography
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.