On the public citation graph
A Decade of Lattice Cryptography
0 signed · 656 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.1006/jcss.1998.1618openalex-snapshot
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
inferredcites →https://doi.org/10.1006/jcss.1999.1686openalex-snapshot
On the Limits of Nonapproximability of Lattice Problems
inferredcites →https://doi.org/10.1007/3-540-36563-x_9openalex-snapshot
NTRUSign: Digital Signatures Using the NTRU Lattice
inferredcites →https://doi.org/10.1007/3-540-44670-2_11openalex-snapshot
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
inferredcites →https://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferredcites →https://doi.org/10.1007/3-540-44987-6_14openalex-snapshot
NSS: An NTRU Lattice-Based Signature Scheme
inferredcites →https://doi.org/10.1007/3-540-45325-3_32openalex-snapshot
An Identity Based Encryption Scheme Based on Quadratic Residues
inferredcites →https://doi.org/10.1007/3-540-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/3-540-48329-2_24openalex-snapshot
Cryptographic Primitives Based on Hard Learning Problems
inferredcites →https://doi.org/10.1007/3-540-48405-1_34openalex-snapshot
Secure Integration of Asymmetric and Symmetric Encryption Schemes
inferredcites →https://doi.org/10.1007/3-540-48523-6_1openalex-snapshot
Generating Hard Instances of the Short Basis Problem
inferredcites →https://doi.org/10.1007/3-540-48910-x_16openalex-snapshot
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
inferredcites →https://doi.org/10.1007/3-540-48910-x_23openalex-snapshot
Distributed Pseudo-random Functions and KDCs
inferredcites →https://doi.org/10.1007/3-540-49162-7_5openalex-snapshot
How to Enhance the Security of Public-Key Encryption at Minimum Cost
inferredcites →https://doi.org/10.1007/978-3-319-11659-4_12openalex-snapshot
Lattice Cryptography for the Internet
inferredcites →https://doi.org/10.1007/978-3-540-71039-4_4openalex-snapshot
SWIFFT: A Modest Proposal for FFT Hashing
inferredcites →https://doi.org/10.1007/978-3-540-78440-1_10openalex-snapshot
Lattice-Based Identification Schemes Secure Under Active Attacks
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_3openalex-snapshot
Asymptotically Efficient Lattice-Based Digital Signatures
inferredcites →https://doi.org/10.1007/978-3-540-78967-3_3openalex-snapshot
Predicting Lattice Reduction
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_30openalex-snapshot
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
inferredcites →https://doi.org/10.1007/978-3-540-85174-5_31openalex-snapshot
A Framework for Efficient and Composable Oblivious Transfer
inferredcites →https://doi.org/10.1007/978-3-540-89255-7_23openalex-snapshot
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
inferredcites →https://doi.org/10.1007/978-3-642-03356-8_34openalex-snapshot
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
inferredcites →https://doi.org/10.1007/978-3-642-03356-8_36openalex-snapshot
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_35openalex-snapshot
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_36openalex-snapshot
Efficient Public Key Encryption Based on Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_22openalex-snapshot
Public-Key Encryption Schemes with Auxiliary Inputs
inferredcites →https://doi.org/10.1007/978-3-642-11799-2_23openalex-snapshot
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
inferredcites →https://doi.org/10.1007/978-3-642-13013-7_29openalex-snapshot
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_13openalex-snapshot
Lattice Enumeration Using Extreme Pruning
inferredcites →https://doi.org/10.1007/978-3-642-13190-5_2openalex-snapshot
Fully Homomorphic Encryption over the Integers
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_5openalex-snapshot
An Efficient and Parallel Gaussian Sampler for Lattices
inferredcites →https://doi.org/10.1007/978-3-642-14623-7_7openalex-snapshot
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
inferredcites →https://doi.org/10.1007/978-3-642-19074-2_21openalex-snapshot
Better Key Sizes (and Attacks) for LWE-Based Encryption
inferredcites →https://doi.org/10.1007/978-3-642-19379-8_1openalex-snapshot
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
inferredcites →https://doi.org/10.1007/978-3-642-20465-4_4openalex-snapshot
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-642-20465-4_9openalex-snapshot
Implementing Gentry’s Fully-Homomorphic Encryption Scheme
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-642-22792-9_28openalex-snapshot
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_29openalex-snapshot
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_30openalex-snapshot
Bi-Deniable Public-Key Encryption
inferredcites →https://doi.org/10.1007/978-3-642-25385-0_1openalex-snapshot
BKZ 2.0: Better Lattice Security Estimates
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_15openalex-snapshot
Identity-Based (Lossy) Trapdoor Functions and Applications
inferredcites →https://doi.org/10.1007/978-3-642-29011-4_28openalex-snapshot
Fully Homomorphic Encryption with Polylog Overhead
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-29011-4_42openalex-snapshot
Pseudorandom Functions and Lattices
inferredcites →https://doi.org/10.1007/978-3-642-29011-4_43openalex-snapshot
Lattice Signatures without Trapdoors
inferredcites →https://doi.org/10.1007/978-3-642-30057-8_1openalex-snapshot
Better Bootstrapping in Fully Homomorphic Encryption
inferredcites →https://doi.org/10.1007/978-3-642-30057-8_20openalex-snapshot
Circular and KDM Security for Identity-Based Encryption
inferredcites →https://doi.org/10.1007/978-3-642-30057-8_3openalex-snapshot
Ring-LWE in Polynomial Rings
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_50openalex-snapshot
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
inferredcites →https://doi.org/10.1007/978-3-642-33027-8_31openalex-snapshot
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
inferredcites →https://doi.org/10.1007/978-3-642-34961-4_26openalex-snapshot
Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-34961-4_27openalex-snapshot
Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
inferredcites →https://doi.org/10.1007/978-3-642-36095-4_19openalex-snapshot
Solving BDD by Enumeration: An Update
inferredcites →https://doi.org/10.1007/978-3-642-36362-7_15openalex-snapshot
Improved (Hierarchical) Inner-Product Encryption from Lattices
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_1openalex-snapshot
Candidate Multilinear Maps from Ideal Lattices
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_2openalex-snapshot
Lossy Codes and a New Variant of the Learning-With-Errors Problem
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_20openalex-snapshot
Batch Fully Homomorphic Encryption over the Integers
inferredcites →https://doi.org/10.1007/978-3-642-38348-9_3openalex-snapshot
A Toolkit for Ring-LWE Cryptography
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_1openalex-snapshot
Practical Bootstrapping in Quasilinear Time
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_2openalex-snapshot
Hardness of SIS and LWE with Small Parameters
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_23openalex-snapshot
Key Homomorphic PRFs and Their Applications
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_26openalex-snapshot
Practical Multilinear Maps over the Integers
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_3openalex-snapshot
Lattice Signatures and Bimodal Gaussians
inferredcites →https://doi.org/10.1007/978-3-642-40041-4_5openalex-snapshot
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
inferredcites →https://doi.org/10.1007/978-3-642-42045-0_15openalex-snapshot
Constrained Pseudorandom Functions and Their Applications
inferredcites →https://doi.org/10.1007/978-3-642-54631-0_29openalex-snapshot
Functional Signatures and Pseudorandom Functions
inferredcites →https://doi.org/10.1007/978-3-642-55220-5_30openalex-snapshot
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
inferredcites →https://doi.org/10.1007/978-3-662-44371-2_17openalex-snapshot
Faster Bootstrapping with Polynomial Error
inferredcites →https://doi.org/10.1007/978-3-662-44371-2_18openalex-snapshot
Hardness of k-LWE and Applications in Traitor Tracing
inferredcites →https://doi.org/10.1007/978-3-662-44371-2_19openalex-snapshot
Improved Short Lattice Signatures in the Standard Model
inferredcites →https://doi.org/10.1007/978-3-662-44371-2_20openalex-snapshot
New and Improved Key-Homomorphic Pseudorandom Functions
inferredcites →https://doi.org/10.1007/978-3-662-46447-2_11openalex-snapshot
Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions
inferredcites →https://doi.org/10.1007/978-3-662-46447-2_32openalex-snapshot
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
inferredcites →https://doi.org/10.1007/978-3-662-46497-7_2openalex-snapshot
Key-Homomorphic Constrained Pseudorandom Functions
inferredcites →https://doi.org/10.1007/978-3-662-46497-7_20openalex-snapshot
Graph-Induced Multilinear Maps from Lattices
inferredcites →https://doi.org/10.1007/978-3-662-46706-0_3openalex-snapshot
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
inferredcites →https://doi.org/10.1007/978-3-662-46800-5_1openalex-snapshot
Cryptanalysis of the Multilinear Map over the Integers
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_12openalex-snapshot
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
inferredcites →https://doi.org/10.1007/978-3-662-47989-6_13openalex-snapshot
New Multilinear Maps Over the Integers
inferredcites →https://doi.org/10.1007/978-3-662-48000-7_25openalex-snapshot
Predicate Encryption for Circuits from LWE
inferredcites →https://doi.org/10.1007/978-3-662-49096-9_9openalex-snapshot
On the Hardness of Learning with Rounding over Small Modulus
inferredcites →https://doi.org/10.1007/bf00189260openalex-snapshot
Efficient cryptographic schemes provably as secure as subset sum
inferredcites →https://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferredcites →https://doi.org/10.1007/bf01445125openalex-snapshot
New bounds in some transference theorems in the geometry of numbers
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf02574039openalex-snapshot
Inequalities for convex bodies and polar reciprocal lattices inR n
inferredcites →https://doi.org/10.1007/bf02579403openalex-snapshot
On Lovász’ lattice reduction and the nearest lattice point problem
inferredcites →https://doi.org/10.1007/bfb0054868openalex-snapshot
NTRU: A ring-based public key cryptosystem
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.1007/s00037-008-0251-3openalex-snapshot
Limits on the Hardness of Lattice Problems in ℓ p Norms
inferredcites →https://doi.org/10.1007/s00145-008-9031-0openalex-snapshot
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
inferredcites →https://doi.org/10.1007/s00145-011-9105-2openalex-snapshot
Bonsai Trees, or How to Delegate a Lattice Basis
inferredcites →https://doi.org/10.1007/s00224-010-9278-3openalex-snapshot
Generating Shorter Bases for Hard Random Lattices
inferredcites →https://doi.org/10.1007/s10623-012-9720-4openalex-snapshot
Fully homomorphic SIMD operations
inferredcites →https://doi.org/10.1007/s10623-014-9938-4openalex-snapshot
Worst-case to average-case reductions for module lattices
inferredcites →https://doi.org/10.1007/s10623-015-0067-5openalex-snapshot
Finding shortest lattice vectors faster using quantum search
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1109/ccc.2010.26openalex-snapshot
The Learning with Errors Problem (Invited Survey)
inferredcites →https://doi.org/10.1109/focs.2007.4389533openalex-snapshot
Space-Efficient Identity Based EncryptionWithout Pairings
inferredcites →https://doi.org/10.1109/focs.2011.12openalex-snapshot
Efficient Fully Homomorphic Encryption from (Standard) LWE
inferredcites →https://doi.org/10.1109/focs.2011.94openalex-snapshot
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
inferredcites →https://doi.org/10.1109/focs.2011.98openalex-snapshot
Computing Blindfolded: New Developments in Fully Homomorphic Encryption
inferredcites →https://doi.org/10.1109/focs.2013.13openalex-snapshot
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
inferredcites →https://doi.org/10.1109/sfcs.2003.1238204openalex-snapshot
More on average case vs approximation complexity
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/080733954openalex-snapshot
Lossy Trapdoor Functions and Their Applications
inferredcites →https://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
inferredcites →https://doi.org/10.1137/s0097539701389257openalex-snapshot
Pseudorandom Functions and Factoring
inferredcites →https://doi.org/10.1137/s0097539701398521openalex-snapshot
Identity-Based Encryption from the Weil Pairing
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/1008731.1008734openalex-snapshot
The random oracle methodology, revisited
inferredcites →https://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
inferredcites →https://doi.org/10.1145/1060590.1060604openalex-snapshot
Representing hard lattices with O(n log n) bits
inferredcites →https://doi.org/10.1145/1089023.1089025openalex-snapshot
Lattice problems in NP ∩ coNP
inferredcites →https://doi.org/10.1145/1089023.1089027openalex-snapshot
Hardness of approximating the shortest vector problem in lattices
inferredcites →https://doi.org/10.1145/1180405.1180418openalex-snapshot
Attribute-based encryption for fine-grained access control of encrypted data
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/1250790.1250859openalex-snapshot
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
inferredcites →https://doi.org/10.1145/1250790.1250860openalex-snapshot
Lattices that admit logarithmic worst-case to average-case connection factors
inferredcites →https://doi.org/10.1145/1374376.1374407openalex-snapshot
Trapdoors for hard lattices and new cryptographic constructions
inferredcites →https://doi.org/10.1145/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
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/1666420.1666444openalex-snapshot
Computing arbitrary functions of encrypted data
inferredcites →https://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferredcites →https://doi.org/10.1145/2213977.2214086openalex-snapshot
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
inferredcites →https://doi.org/10.1145/2488608.2488677openalex-snapshot
Attribute-based encryption for circuits
inferredcites →https://doi.org/10.1145/2488608.2488680openalex-snapshot
Classical hardness of learning with errors
inferredcites →https://doi.org/10.1145/2508859.2516668openalex-snapshot
Delegatable pseudorandom functions and applications
inferredcites →https://doi.org/10.1145/2535925openalex-snapshot
On Ideal Lattices and Learning with Errors over Rings
inferredcites →https://doi.org/10.1145/2554797.2554799openalex-snapshot
Lattice-based FHE as secure as PKE
inferredcites →https://doi.org/10.1145/258533.258604openalex-snapshot
A public-key cryptosystem with worst-case/average-case equivalence
inferredcites →https://doi.org/10.1145/2591796.2591825openalex-snapshot
How to use indistinguishability obfuscation
inferredcites →https://doi.org/10.1145/2633600openalex-snapshot
(Leveled) Fully Homomorphic Encryption without Bootstrapping
inferredcites →https://doi.org/10.1145/2746539.2746576openalex-snapshot
Leveled Fully Homomorphic Signatures from Standard Lattices
inferredcites →https://doi.org/10.1145/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/380752.380857openalex-snapshot
A sieve algorithm for the shortest lattice vector problem
inferredcites →https://doi.org/10.1145/800061.808749openalex-snapshot
Improved algorithms for integer programming and related lattice problems
inferredcites →https://doi.org/10.1145/972639.972643openalex-snapshot
Number-theoretic constructions of efficient pseudo-random functions
inferredcites →https://doi.org/10.3233/jcs-130480openalex-snapshot
Field switching in BGV-style homomorphic encryption
inferredcites →https://doi.org/10.4230/dagsemproc.08491.4openalex-snapshot
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119527978.ch5openalex-snapshot
Lattice‐Based Cryptography and Internet of Things
inferred← citeshttps://doi.org/10.1002/9781119618232.ch6openalex-snapshot
Quantum‐Resistant Cryptography
inferred← citeshttps://doi.org/10.1002/cpe.70556openalex-snapshot
Lattice‐Based Public Auditing Schemes for Cloud Storage Security: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1002/ett.3255openalex-snapshot
Design of lattice‐based ElGamal encryption and signature schemes using SIS problem
inferred← citeshttps://doi.org/10.1002/int.22865openalex-snapshot
Consensus algorithm based on verifiable quantum random numbers
inferred← citeshttps://doi.org/10.1002/int.23004openalex-snapshot
Lattice‐based batch authentication scheme with dynamic identity revocation in VANET
inferred← citeshttps://doi.org/10.1002/int.23007openalex-snapshot
Intelligent federated learning on lattice‐based efficient heterogeneous signcryption
inferred← citeshttps://doi.org/10.1002/sat.70041openalex-snapshot
Secure Satellite Communication in the Post‐Quantum Era: A Lattice‐Based Cryptographic Approach
inferred← citeshttps://doi.org/10.1002/spy2.70020openalex-snapshot
Cryptanalysis of Group Ring NTRU: The Case of the Dihedral Group
inferred← citeshttps://doi.org/10.1007/978-3-030-01141-3_1openalex-snapshot
Achieving Strong Security and Verifier-Local Revocation for Dynamic Group Signatures from Lattice Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_17openalex-snapshot
Achieving Full Security for Lattice-Based Group Signatures with Verifier-Local Revocation
inferred← citeshttps://doi.org/10.1007/978-3-030-02744-5_10openalex-snapshot
Towards Security Authentication for IoT Devices with Lattice-Based ZK
inferred← citeshttps://doi.org/10.1007/978-3-030-05072-6_5openalex-snapshot
Addressing Side-Channel Vulnerabilities in the Discrete Ziggurat Sampler
inferred← citeshttps://doi.org/10.1007/978-3-030-17653-2_7openalex-snapshot
Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation
inferred← citeshttps://doi.org/10.1007/978-3-030-26948-7_6openalex-snapshot
Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-32101-7_23openalex-snapshot
LARA: A Design Concept for Lattice-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-35199-1_13openalex-snapshot
RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_1openalex-snapshot
Algebraically Structured LWE, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-030-39303-8_8openalex-snapshot
A Blind Ring Signature Based on the Short Integer Solution Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-41702-4_2openalex-snapshot
A Lattice-Based Enhanced Privacy ID
inferred← citeshttps://doi.org/10.1007/978-3-030-43725-1_23openalex-snapshot
Lattice-Based Proof of a Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_1openalex-snapshot
The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_22openalex-snapshot
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_10openalex-snapshot
Slide Reduction, Revisited—Filling the Gaps in SVP Approximation
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_8openalex-snapshot
Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP
inferred← citeshttps://doi.org/10.1007/978-3-030-59013-0_18openalex-snapshot
A Lattice-Based Key-Insulated and Privacy-Preserving Signature Scheme with Publicly Derived Public Key
inferred← citeshttps://doi.org/10.1007/978-3-030-61078-4_12openalex-snapshot
Lattice HIBE with Faster Trapdoor Delegation and Applications
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-64381-2_7openalex-snapshot
Classical Verification of Quantum Computations with Efficient Verifier
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_12openalex-snapshot
Twisted-PHS: Using the Product Formula to Solve Approx-SVP in Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-65277-7_27openalex-snapshot
Gadget-Based iNTRU Lattice Trapdoors
inferred← citeshttps://doi.org/10.1007/978-3-030-65411-5_29openalex-snapshot
A Secure Algorithm for Rounded Gaussian Sampling
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_19openalex-snapshot
SoK: How (not) to Design and Implement Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_17openalex-snapshot
A $$2^{n/2}$$-Time Algorithm for $$\sqrt{n}$$-SVP and $$\sqrt{n}$$-Hermite SVP, and an Improved Time-Approximation Tradeoff for (H)SVP
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_21openalex-snapshot
Secure Hybrid Encryption in the Standard Model from Hard Learning Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_12openalex-snapshot
Does Fiat-Shamir Require a Cryptographic Hash Function?
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_1openalex-snapshot
On the Hardness of the NTRU Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-92548-2_5openalex-snapshot
The Matrix Reloaded: Multiplication Strategies in FrodoKEM
inferred← citeshttps://doi.org/10.1007/978-3-030-95630-1_8openalex-snapshot
The Post-quantum Probabilistic Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-031-09234-3_24openalex-snapshot
Covert Authentication from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-20099-1_22openalex-snapshot
A Lattice-Based Aggregate Signature Based on Revocable Identity
inferred← citeshttps://doi.org/10.1007/978-3-031-22301-3_15openalex-snapshot
Fiat-Shamir Signatures Based on Module-NTRU
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_21openalex-snapshot
PPAD is as Hard as LWE and Iterated Squaring
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_3openalex-snapshot
Achievable CCA2 Relaxation for Homomorphic Encryption
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-23201-5_4openalex-snapshot
New Lattice-Based Signature Based on Fiat-Shamir Framework Without Aborts
inferred← citeshttps://doi.org/10.1007/978-3-031-26553-2_24openalex-snapshot
Subfield Attacks on HSVP in Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_9openalex-snapshot
Just How Hard Are Rotations of $$\mathbb {Z}^n$$? Algorithms and Cryptography with the Simplest Lattice
inferred← citeshttps://doi.org/10.1007/978-3-031-35486-1_17openalex-snapshot
Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-031-39828-5_9openalex-snapshot
Group Oriented Attribute-Based Encryption Scheme from Lattices with the Employment of Shamir’s Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1007/978-3-031-43214-9_2openalex-snapshot
Background and Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-031-45513-1_10openalex-snapshot
Constant-Size Group Signatures with Message-Dependent Opening from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-51583-5_1openalex-snapshot
Results on the Key Space of Group-Ring NTRU: The Case of the Dihedral Group
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_1openalex-snapshot
A Refined Hardness Estimation of LWE in Two-Step Mode
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_5openalex-snapshot
On Algebraic Embedding for Unstructured Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-58751-1_15openalex-snapshot
Evaluating the Security of CRYSTALS-Dilithium in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-031-64381-1_16openalex-snapshot
DiTRU: A Resurrection of NTRU over Dihedral Group
inferred← citeshttps://doi.org/10.1007/978-3-031-65494-7_2openalex-snapshot
Modern Homomorphic Encryption: Introduction
inferred← citeshttps://doi.org/10.1007/978-3-031-73417-5_8openalex-snapshot
A Comprehensive Comparison of Lattice-Based Password Authenticated Key Exchange Protocols Defined on Modules
inferred← citeshttps://doi.org/10.1007/978-3-031-80020-7_23openalex-snapshot
MALAI: ML-Based Attack on Learning with Error Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-86599-2_11openalex-snapshot
Giant Does NOT Mean Strong: Cryptanalysis of BQTRU
inferred← citeshttps://doi.org/10.1007/978-3-031-88372-9_12openalex-snapshot
Post-Quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-94445-1_9openalex-snapshot
BCPIR: More Efficient Keyword PIR via Block Building Codewords
inferred← citeshttps://doi.org/10.1007/978-3-032-00495-6_16openalex-snapshot
E2Easy: a Simple Lattice-Based in-Person End-to-End Voting Scheme
inferred← citeshttps://doi.org/10.1007/978-3-032-12243-8_31openalex-snapshot
AI-Driven Hybrid Post-Quantum Cryptographic Model for Secure Data Protection in the Quantum Era
inferred← citeshttps://doi.org/10.1007/978-3-032-12834-8_2openalex-snapshot
Review on the Implications of Crystals Kyber in LTE Networks
inferred← citeshttps://doi.org/10.1007/978-3-032-14350-1_9openalex-snapshot
A Hierarchical Lattice-Based Distributed Identity Authentication Scheme
inferred← citeshttps://doi.org/10.1007/978-3-032-18138-1_5openalex-snapshot
Novel Post-quantum Internet of Things (IoT) Security Algorithms and Protocols: Design and Analysis of Efficient and Secure PQC Schemes Tailored for Resource-Constrained IoT Devices
inferred← citeshttps://doi.org/10.1007/978-3-032-22698-3_4openalex-snapshot
A Practical Framework for Lattice-Based Non-interactive Publicly Verifiable Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-032-23341-7_14openalex-snapshot
Extended Review of Polynomial Commitments
inferred← citeshttps://doi.org/10.1007/978-3-032-24063-7_23openalex-snapshot
A Generic Construction for Withdrawable Signature
inferred← citeshttps://doi.org/10.1007/978-3-032-27248-5_3openalex-snapshot
QPRISM: An Optimized Lattice-Based Zero-Knowledge Proof Protocol for IoT Devices
inferred← citeshttps://doi.org/10.1007/978-3-032-30530-5_21openalex-snapshot
A Lightweight CRYSTALS-Dilithium Post-quantum Cryptography Signature for FPGA-Based Edge Computing
inferred← citeshttps://doi.org/10.1007/978-3-032-32764-2_22openalex-snapshot
Sinba: Low-Latency Vectorized Batch PIR via 2D Baby-Step/Giant-Step
inferred← citeshttps://doi.org/10.1007/978-3-032-32764-2_23openalex-snapshot
Decompressing LWE: Unlocking Field-Like Operations via Polynomial Matrices
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_15openalex-snapshot
Advanced Cryptography from Lattice Isomorphism—New Constructions of IBE and FHE
inferred← citeshttps://doi.org/10.1007/978-3-032-35418-1_17openalex-snapshot
Post-quantum Public-Key Pseudorandom Correlation Functions for OT
inferred← citeshttps://doi.org/10.1007/978-3-319-47422-9_22openalex-snapshot
Preventing Adaptive Key Recovery Attacks on the GSW Levelled Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-48965-0_25openalex-snapshot
SecReach: Secure Reachability Computation on Encrypted Location Check-in Data
inferred← citeshttps://doi.org/10.1007/978-3-319-48965-0_7openalex-snapshot
Server-Aided Revocable Identity-Based Encryption from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_18openalex-snapshot
Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_1openalex-snapshot
Revisiting Lattice Attacks on Overstretched NTRU Parameters
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_11openalex-snapshot
A Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_9openalex-snapshot
Revisiting TESLA in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-319-61204-1_1openalex-snapshot
Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_2openalex-snapshot
Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_16openalex-snapshot
An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_24openalex-snapshot
On Iterative Collision Search for LPN and Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-319-71667-1_18openalex-snapshot
Recovering Short Generators of Principal Fractional Ideals in Cyclotomic Fields of Conductor $$p^\alpha q^\beta $$ p α q β
inferred← citeshttps://doi.org/10.1007/978-3-319-71667-1_2openalex-snapshot
A Note on Ring-LWE Security in the Case of Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-3-319-75160-3_18openalex-snapshot
Predicate Fully Homomorphic Encryption: Achieving Fine-Grained Access Control over Manipulable Ciphertext
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_24openalex-snapshot
Learning with Errors and Extrapolated Dihedral Cosets
inferred← citeshttps://doi.org/10.1007/978-3-319-76953-0_5openalex-snapshot
Cryptanalysis of Compact-LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_7openalex-snapshot
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus
inferred← citeshttps://doi.org/10.1007/978-3-319-93638-3_29openalex-snapshot
Lattice-Based Universal Accumulator with Nonmembership Arguments
inferred← citeshttps://doi.org/10.1007/978-3-319-94015-1_5openalex-snapshot
Spherical Codes from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_56openalex-snapshot
Private-Key Fully Homomorphic Encryption for Private Classification
inferred← citeshttps://doi.org/10.1007/978-3-319-97643-3_5openalex-snapshot
Cryptographic Program Obfuscation: Practical Solutions and Application-Driven Models
inferred← citeshttps://doi.org/10.1007/978-3-319-98530-5_68openalex-snapshot
Zero-Knowledge Proof for Lattice-Based Group Signature Schemes with Verifier-Local Revocation
inferred← citeshttps://doi.org/10.1007/978-3-319-99807-7_14openalex-snapshot
Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_24openalex-snapshot
Circular Security Separations for Arbitrary Length Cycles from LWE
inferred← citeshttps://doi.org/10.1007/978-981-15-1675-7_10openalex-snapshot
Post-quantum Cryptography: An Introduction
inferred← citeshttps://doi.org/10.1007/978-981-15-5411-7_6openalex-snapshot
A Guests Managing System with Lattice-Based Verifier-Local Revocation Group Signature Scheme with Time-Bound Keys
inferred← citeshttps://doi.org/10.1007/978-981-16-7502-7_25openalex-snapshot
A Lattice-Based Anonymous Authentication for Privacy Protection of Medical Data
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/978-981-19-7644-5openalex-snapshot
Modern Cryptography Volume 2
inferred← citeshttps://doi.org/10.1007/978-981-19-8445-7_18openalex-snapshot
New Trapdoor and Preimage Sampling on NTRU Lattice
inferred← citeshttps://doi.org/10.1007/978-981-95-2961-2_8openalex-snapshot
Optimized Implementation of NTRU on RISC-V Platform
inferred← citeshttps://doi.org/10.1007/978-981-95-5099-9_6openalex-snapshot
Revisiting the Robustness of (R/M)LWR Under Polynomial Moduli with Its Applications
inferred← citeshttps://doi.org/10.1007/978-981-96-3358-6_34openalex-snapshot
A Survey on Development of Post-quantum Cryptographic Schemes
inferred← citeshttps://doi.org/10.1007/978-981-96-4948-8_18openalex-snapshot
Quantum Computing and Cybersecurity: Navigating Threats and Opportunities
inferred← citeshttps://doi.org/10.1007/978-981-96-7526-5_27openalex-snapshot
Analytical Perspective of Quantum Computing-Based Big Data Security Mechanisms
inferred← citeshttps://doi.org/10.1007/978-981-97-2550-2_12openalex-snapshot
Security Threats and Data Protection Methods Used in Cloud Computing: A Review
inferred← citeshttps://doi.org/10.1007/978-981-97-3442-9_27openalex-snapshot
Practical Implementation of the Model Classic McEliece Cryptosystem Using SageMath
inferred← citeshttps://doi.org/10.1007/978-981-97-8798-2_2openalex-snapshot
New Result for Breaking NTRU Encryption with Multiple Keys in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-981-99-1203-2_10openalex-snapshot
Lattice Cryptography-Based Geo-Encrypted Contact Tracing for Infection Detection
inferred← citeshttps://doi.org/10.1007/978-981-99-2366-3openalex-snapshot
Proceedings of the Second International Forum on Financial Mathematics and Financial Technology
inferred← citeshttps://doi.org/10.1007/978-981-99-8730-6_6openalex-snapshot
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem
inferred← citeshttps://doi.org/10.1007/978-981-99-9833-3_13openalex-snapshot
A New Quantum-Resistant Electronic Voting Based on Fully Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/s00037-025-00271-wopenalex-snapshot
Quantum Automating TC0-Frege Is LWE-Hard
inferred← citeshttps://doi.org/10.1007/s00145-017-9265-9openalex-snapshot
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance
inferred← citeshttps://doi.org/10.1007/s00145-024-09508-3openalex-snapshot
Algebraically Structured LWE, Revisited
inferred← citeshttps://doi.org/10.1007/s00145-024-09526-1openalex-snapshot
Achievable CCA2 Relaxation for Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/s00145-025-09546-5openalex-snapshot
Exploiting the Symmetry of $$\mathbb {Z}^n$$: Randomization and the Automorphism Problem
inferred← citeshttps://doi.org/10.1007/s00145-025-09551-8openalex-snapshot
Public-Coin Three-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash
inferred← citeshttps://doi.org/10.1007/s10207-017-0397-6openalex-snapshot
Comparing apples with apples: performance analysis of lattice-based authenticated key exchange protocols
inferred← citeshttps://doi.org/10.1007/s10489-025-06908-1openalex-snapshot
Collaborative penetration testing suite for emerging generative AI algorithms
inferred← citeshttps://doi.org/10.1007/s10586-021-03380-7openalex-snapshot
Lattice-based cryptosystems for the security of resource-constrained IoT devices in post-quantum world: a survey
inferred← citeshttps://doi.org/10.1007/s10586-024-04799-4openalex-snapshot
Securing the future: exploring post-quantum cryptography for authentication and user privacy in IoT devices
inferred← citeshttps://doi.org/10.1007/s10623-016-0289-1openalex-snapshot
Lattices from codes over $$\mathbb {Z}_q$$ Z q : generalization of constructions D, $$D'$$ D ′ and $$\overline{D}$$ D ¯
inferred← citeshttps://doi.org/10.1007/s10623-022-01083-7openalex-snapshot
Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
inferred← citeshttps://doi.org/10.1007/s10623-023-01233-5openalex-snapshot
A polynomial time algorithm for breaking NTRU encryption with multiple keys
inferred← citeshttps://doi.org/10.1007/s10623-023-01321-6openalex-snapshot
Lattice codes for lattice-based PKE
inferred← citeshttps://doi.org/10.1007/s10623-023-01333-2openalex-snapshot
Construction-D lattice from Garcia–Stichtenoth tower code
inferred← citeshttps://doi.org/10.1007/s10623-024-01473-zopenalex-snapshot
An algebraic algorithm for breaking NTRU with multiple keys
inferred← citeshttps://doi.org/10.1007/s10623-024-01524-5openalex-snapshot
Breaking the power-of-two barrier: noise estimation for BGV in NTT-friendly rings
inferred← citeshttps://doi.org/10.1007/s11042-023-15737-8openalex-snapshot
An efficient post-quantum secure dynamic EPID signature scheme using lattices
inferred← citeshttps://doi.org/10.1007/s11042-023-17939-6openalex-snapshot
Lattice basis reduction techniques
inferred← citeshttps://doi.org/10.1007/s11042-023-17984-1openalex-snapshot
Quantum-safe multi-server password-based authenticated key exchange protocol
inferred← citeshttps://doi.org/10.1007/s11128-022-03507-8openalex-snapshot
An improved quantum algorithm for the quantum learning with errors problem
inferred← citeshttps://doi.org/10.1007/s11128-025-04980-7openalex-snapshot
Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
inferred← citeshttps://doi.org/10.1007/s11128-026-05214-0openalex-snapshot
Quantum-resistant encrypted multi-signature aggregation and context-aware adversarial double deep Q-networks for cloud user authentication
inferred← citeshttps://doi.org/10.1007/s11227-023-05251-xopenalex-snapshot
A new password-authenticated module learning with rounding-based key exchange protocol: Saber.PAKE
inferred← citeshttps://doi.org/10.1007/s11227-025-07837-zopenalex-snapshot
QuantumResist: integrating shor’s algorithm, lattice-based cryptography, and quantum error correction for enhanced secure communication in post-quantum cryptography
inferred← citeshttps://doi.org/10.1007/s11227-026-08700-5openalex-snapshot
Efficient and Secure Lattice-Based Unique Ring Signature with Applications in IoT
inferred← citeshttps://doi.org/10.1007/s11235-025-01372-1openalex-snapshot
Lightweight post-quantum cryptographic frameworks for real-time secure communications in IoT edge networks
inferred← citeshttps://doi.org/10.1007/s11235-025-01395-8openalex-snapshot
AI-Powered security classification of generator-matrix s-box for post-quantum lightweight cryptography
inferred← citeshttps://doi.org/10.1007/s11277-021-08526-9openalex-snapshot
Identity Based Cryptography Using Matrices
inferred← citeshttps://doi.org/10.1007/s11432-022-3808-7openalex-snapshot
Provably secure attribute-based authenticated encryption with keyword search from ideal lattices
inferred← citeshttps://doi.org/10.1007/s11623-017-0717-zopenalex-snapshot
Quantencomputer und die Zukunft der Kryptographie
inferred← citeshttps://doi.org/10.1007/s11704-021-1073-6openalex-snapshot
On the hardness of NTRU problems
inferred← citeshttps://doi.org/10.1007/s12046-022-01808-3openalex-snapshot
A Quantum Resistant Anonymous Poxy Signature Scheme
inferred← citeshttps://doi.org/10.1007/s12083-023-01474-0openalex-snapshot
An identity-based traceable ring signatures based on lattice
inferred← citeshttps://doi.org/10.1007/s12243-021-00843-1openalex-snapshot
Lattice-based undeniable signature scheme
inferred← citeshttps://doi.org/10.1007/s13369-022-07235-0openalex-snapshot
Lightweight Two-Factor-Based User Authentication Protocol for IoT-Enabled Healthcare Ecosystem in Quantum Computing
inferred← citeshttps://doi.org/10.1007/s13369-023-08242-5openalex-snapshot
Quantum-Secure N2N Authentication Protocol Model for IoT Sensor Networks
inferred← citeshttps://doi.org/10.1007/s40747-022-00756-zopenalex-snapshot
A systematic review of homomorphic encryption and its contributions in healthcare industry
inferred← citeshttps://doi.org/10.1007/s41870-022-00891-3openalex-snapshot
Efficient group signature scheme using lattices
inferred← citeshttps://doi.org/10.1007/s42979-020-00221-zopenalex-snapshot
PudgyTurtle: Using Keystream to Encode and Encrypt
inferred← citeshttps://doi.org/10.1007/s44464-026-00008-wopenalex-snapshot
Quantum artificial intelligence and cryptographic security from a quantum cryptography perspective
inferred← citeshttps://doi.org/10.1016/b978-0-443-34125-0.00011-8openalex-snapshot
Progressions and unfilled gaps in homomorphic encryption for emerging application areas: A comprehensive literature review and preface
inferred← citeshttps://doi.org/10.1016/j.actaastro.2026.04.041openalex-snapshot
Post-quantum cryptography for space systems: Algorithms, implementation, and design constraints—A systematic survey
inferred← citeshttps://doi.org/10.1016/j.apenergy.2026.127519openalex-snapshot
Quantum-resistant homomorphic encryption for privacy-preserving demand flexibility and grid modernization: A systematized review
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111704openalex-snapshot
Efficient key encapsulation mechanisms from noncommutative NTRU
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111813openalex-snapshot
FedSHE–CQ: A communication-efficient homomorphic encryption framework for federated learning
inferred← citeshttps://doi.org/10.1016/j.comnet.2026.112506openalex-snapshot
Malicious signature localization in lattice-based batch-verifiable signature for VANETs
inferred← citeshttps://doi.org/10.1016/j.compbiomed.2018.11.018openalex-snapshot
Private naive bayes classification of personal biomedical data: Application in cancer data analysis
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2018.02.030openalex-snapshot
IoT application protection against power analysis attack
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2026.110971openalex-snapshot
From hardness assumptions to energy-secure protocols: A systematic survey of Euclidean lattice-based cryptography
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2026.111377openalex-snapshot
Post-quantum module-lattice multi-authority ciphertext-policy attribute-based encryption and context-bound hybrid key establishment for blockchain-enabled Internet of Things access control
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2026.111429openalex-snapshot
Quantum safe drone security: Authenticated key exchange and privacy preserving intrusion detection for low altitude intelligent transportation systems
inferred← citeshttps://doi.org/10.1016/j.cose.2024.103883openalex-snapshot
Navigating quantum security risks in networked environments: A comprehensive study of quantum-safe network protocols
inferred← citeshttps://doi.org/10.1016/j.cosrev.2021.100438openalex-snapshot
A survey of lattice based expressive attribute based encryption
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100865openalex-snapshot
Isogeny-based cryptography: A comprehensive review on advancements, analysis of attacks, and future directions
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100975openalex-snapshot
Survey on post-quantum cryptography implementations and deployment challenges
inferred← citeshttps://doi.org/10.1016/j.csi.2021.103549openalex-snapshot
Module learning with rounding based key agreement scheme with modified reconciliation
inferred← citeshttps://doi.org/10.1016/j.csi.2025.104090openalex-snapshot
Publicly verifiable secret sharing: Generic constructions and lattice-based instantiations in the standard model
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.018openalex-snapshot
Graph lattices constructed by super total graceful-type labelings and colorings of topological coding
inferred← citeshttps://doi.org/10.1016/j.drudis.2023.103820openalex-snapshot
Privacy-preserving techniques for decentralized and secure machine learning in drug discovery
inferred← citeshttps://doi.org/10.1016/j.future.2016.10.013openalex-snapshot
PICADOR: End-to-end encrypted Publish–Subscribe information distribution with proxy re-encryption
inferred← citeshttps://doi.org/10.1016/j.future.2017.01.031openalex-snapshot
A round-optimal lattice-based blind signature scheme for cloud services
inferred← citeshttps://doi.org/10.1016/j.future.2019.04.036openalex-snapshot
More efficient, provably-secure direct anonymous attestation from lattices
inferred← citeshttps://doi.org/10.1016/j.hcc.2026.100393openalex-snapshot
A survey of decentralized key management
inferred← citeshttps://doi.org/10.1016/j.heliyon.2023.e14917openalex-snapshot
Lattice-based group signatures with forward security for anonymous authentication
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.071openalex-snapshot
Verifiable single-server private information retrieval from LWE with binary errors
inferred← citeshttps://doi.org/10.1016/j.iot.2024.101228openalex-snapshot
PQCAIE: Post quantum cryptographic authentication scheme for IoT-based e-health systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106065openalex-snapshot
A note on the concrete hardness of the shortest independent vector in lattices
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.102788openalex-snapshot
Bi-GISIS KE: Modified key exchange protocol with reusable keys for IoT security
inferred← citeshttps://doi.org/10.1016/j.jisa.2021.103053openalex-snapshot
A new lattice-based authentication scheme for IoT
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103431openalex-snapshot
LWR-based Quantum-Safe Pseudo-Random Number Generator
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103432openalex-snapshot
A survey of quantum secure group signature schemes: Lattice-based approach
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104449openalex-snapshot
QuCloud : Enhancing cloud storage security by combining quantum key distribution, post-quantum cryptography, and custom proxy re-encryption
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104538openalex-snapshot
LHB-Auth: Lattice-based hierarchical access authentication mechanism of 6G satellite-terrestrial integrated networks
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104558openalex-snapshot
A post-quantum conditional identity-based broadcast proxy re-encryption scheme with anonymity and revocation
inferred← citeshttps://doi.org/10.1016/j.jisa.2026.104564openalex-snapshot
Secure and efficient federated learning using attribute-based homomorphic encryption
inferred← citeshttps://doi.org/10.1016/j.jksuci.2021.12.014openalex-snapshot
A constant-size lattice-based partially-dynamic group signature scheme in quantum random oracle model
inferred← citeshttps://doi.org/10.1016/j.jnca.2019.01.021openalex-snapshot
Towards dependable and trustworthy outsourced computing: A comprehensive survey and tutorial
showing the first 200 of 502 · page through all 502
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.