On the public citation graph

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

0 signed · 246 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1472openalex-snapshot
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
inferredcites →https://doi.org/10.1006/jcss.1999.1649openalex-snapshot
Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions
inferredcites →https://doi.org/10.1007/11426639_2openalex-snapshot
How to Break MD5 and Other Hash Functions
inferredcites →https://doi.org/10.1007/11535218_2openalex-snapshot
Finding Collisions in the Full SHA-1
inferredcites →https://doi.org/10.1007/3-540-46521-9_22openalex-snapshot
Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7openalex-snapshot
Complexity of Lattice Problems
inferredcites →https://doi.org/10.1007/bfb0052231openalex-snapshot
Public-key cryptosystems from lattice reduction problems
inferredcites →https://doi.org/10.1007/s00493-003-0019-yopenalex-snapshot
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
inferredcites →https://doi.org/10.1109/focs.2004.31openalex-snapshot
Hardness of Approximating the Shortest Vector Problem in Lattices
inferredcites →https://doi.org/10.1109/sfcs.1997.646135openalex-snapshot
An improved worst-case to average-case connection for lattice problems
inferredcites →https://doi.org/10.1109/sfcs.2002.1181960openalex-snapshot
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
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/s0097539704443276openalex-snapshot
Bounds on the Efficiency of Generic Cryptographic Constructions
inferredcites →https://doi.org/10.1145/1039488.1039490openalex-snapshot
New lattice-based cryptographic constructions
inferredcites →https://doi.org/10.1145/1060590.1060603openalex-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)
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/276698.276705openalex-snapshot
The shortest vector problem in L 2 is NP -hard for randomized reductions (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/sec.1712openalex-snapshot
Short lattice signatures with constant‐size public keys
inferred← citeshttps://doi.org/10.1007/11780656_22openalex-snapshot
Efficient Primitives from Exponentiation in ℤ p
inferred← citeshttps://doi.org/10.1007/11787006_13openalex-snapshot
Generalized Compact Knapsacks Are Collision Resistant
inferred← citeshttps://doi.org/10.1007/11818175_8openalex-snapshot
Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_18openalex-snapshot
Towards Practical Lattice-Based One-Time Linkable Ring Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-03329-3_9openalex-snapshot
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_28openalex-snapshot
Accountable Tracing Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-17253-4_12openalex-snapshot
Short Discrete Log Proofs for FHE and Ring-LWE Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-030-21568-2_6openalex-snapshot
Raptor: A Practical Lattice-Based (Linkable) Ring Signature
inferred← citeshttps://doi.org/10.1007/978-3-030-25510-7_3openalex-snapshot
Forward-Secure Group Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-31578-8_1openalex-snapshot
Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
inferred← citeshttps://doi.org/10.1007/978-3-030-31919-9_6openalex-snapshot
A Practical Lattice-Based Sequential Aggregate Signature
inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_1openalex-snapshot
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_17openalex-snapshot
Homomorphic Encryption for Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_3openalex-snapshot
An LLL Algorithm for Module Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_4openalex-snapshot
Order-LWE and the Hardness of Ring-LWE with Entropic Secrets
inferred← citeshttps://doi.org/10.1007/978-3-030-34621-8_5openalex-snapshot
On the Non-existence of Short Vectors in Random Module Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_17openalex-snapshot
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_2openalex-snapshot
Lattice Trapdoors and IBE from Middle-Product LWE
inferred← citeshttps://doi.org/10.1007/978-3-030-41579-2_21openalex-snapshot
A Multi-Group Signature Scheme from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-030-43120-4_16openalex-snapshot
A Parallel GPU Implementation of SWIFFTX
inferred← citeshttps://doi.org/10.1007/978-3-030-44223-1_13openalex-snapshot
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_3openalex-snapshot
MPSign: A Signature from Small-Secret Middle-Product Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-030-55304-3_4openalex-snapshot
SKCN: Practical and Flexible Digital Signature from Module Lattice
inferred← citeshttps://doi.org/10.1007/978-3-030-56784-2_17openalex-snapshot
Incompressible Encodings
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_17openalex-snapshot
Practical Product Proofs for Lattice Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_18openalex-snapshot
Lattice-Based Blind Signatures, Revisited
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-56880-1_9openalex-snapshot
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
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-64834-3_9openalex-snapshot
Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings
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-77870-5_20openalex-snapshot
On the Ideal Shortest Vector Problem over Random Rational Primes
inferred← citeshttps://doi.org/10.1007/978-3-030-77870-5_23openalex-snapshot
On the Security of Homomorphic Encryption on Approximate Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_11openalex-snapshot
Implementation of Lattice Trapdoors on Modules and Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-88052-1_23openalex-snapshot
More Efficient Construction of Anonymous Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-90402-9_11openalex-snapshot
On the (M)iNTRU Assumption in the Integer Case
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_11openalex-snapshot
Asymptotically Quasi-Optimal Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_23openalex-snapshot
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-08896-4_6openalex-snapshot
Improved Lattice-Based Mix-Nets for Electronic Voting
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_17openalex-snapshot
Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_4openalex-snapshot
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable
inferred← citeshttps://doi.org/10.1007/978-3-031-15979-4_5openalex-snapshot
Practical Sublinear Proofs for R1CS from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-031-17146-8_25openalex-snapshot
Puncturable Signature: A Generic Construction and Instantiations
inferred← citeshttps://doi.org/10.1007/978-3-031-30620-4_10openalex-snapshot
Functional Commitments for All Functions, with Transparent Setup and from SIS
inferred← citeshttps://doi.org/10.1007/978-3-031-38554-4_27openalex-snapshot
Reductions from Module Lattices to Free Module Lattices, and Application to Dequantizing Module-LLL
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_3openalex-snapshot
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals
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-58740-5_5openalex-snapshot
Constant-Round Simulation-Secure Coin Tossing Extension with Guaranteed Output
inferred← citeshttps://doi.org/10.1007/978-3-031-64948-6_18openalex-snapshot
Certificateless Aggregate Signature Without Trapdoor for Cloud Storage
inferred← citeshttps://doi.org/10.1007/978-3-031-91823-0_10openalex-snapshot
Discrete Gaussians Modulo Sub-Lattices: New Leftover Hash Lemmas for Discrete Gaussians
inferred← citeshttps://doi.org/10.1007/978-3-031-91826-1_1openalex-snapshot
Tight Adaptive Simulation Security for Identity-Based Inner-Product FE in the (Quantum) Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-032-01855-7_12openalex-snapshot
Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_11openalex-snapshot
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_3openalex-snapshot
Simple and General Counterexamples for Private-Coin Evasive LWE
inferred← citeshttps://doi.org/10.1007/978-3-032-22695-2_9openalex-snapshot
$$\textsf {ABBA}$$: Lattice-Based Commitments from Commutators
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_20openalex-snapshot
Look Ahead! Practical CCA-Secure Steganography: Cover-Source Switching Meets Lattice Gaussian Sampling
inferred← citeshttps://doi.org/10.1007/978-3-032-26731-3_6openalex-snapshot
Improved Reduction from $$\textsf{RLWE}$$ to $$\textsf{MP}\text {-}\textsf{LWE}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_28openalex-snapshot
Practical Signatures from the Partial Fourier Recovery Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-11659-4_12openalex-snapshot
Lattice Cryptography for the Internet
inferred← citeshttps://doi.org/10.1007/978-3-319-24126-5_20openalex-snapshot
Compact Accumulator Using Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-24174-6_16openalex-snapshot
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
inferred← citeshttps://doi.org/10.1007/978-3-319-29485-8_20openalex-snapshot
NFLlib: NTT-Based Fast Lattice Library
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_12openalex-snapshot
Short Stickelberger Class Relations and Application to Ideal-SVP
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_16openalex-snapshot
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
inferred← citeshttps://doi.org/10.1007/978-3-319-61204-1_23openalex-snapshot
Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_10openalex-snapshot
Middle-Product Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_2openalex-snapshot
Two-Round PAKE from Approximate SPH and Instantiations from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-76581-5_3openalex-snapshot
Constant-Size Group Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_18openalex-snapshot
A Concrete Treatment of Fiat-Shamir Signatures in the Quantum Random-Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_6openalex-snapshot
On the Ring-LWE and Polynomial-LWE Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-78381-9_8openalex-snapshot
Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-79063-3_13openalex-snapshot
Practical Implementation of Ring-SIS/LWE Based Signature and IBE
inferred← citeshttps://doi.org/10.1007/978-3-319-93563-8_4openalex-snapshot
The Search Successive Minima Problem Is Equivalent to Its Optimization Version
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_20openalex-snapshot
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_23openalex-snapshot
Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_20openalex-snapshot
More Efficient Commitments from Structured Lattice Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_21openalex-snapshot
Multi-bit Cryptosystems Based on Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-88702-7_5openalex-snapshot
Lattice-based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_23openalex-snapshot
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_9openalex-snapshot
Hash Functions from Sigma Protocols and Improvements to VSH
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_13openalex-snapshot
Cryptographic Functions from Worst-Case Complexity Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_35openalex-snapshot
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_36openalex-snapshot
Efficient Public Key Encryption Based on Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_1openalex-snapshot
Secure Parameters for SWIFFT
inferred← citeshttps://doi.org/10.1007/978-3-642-12929-2_14openalex-snapshot
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_1openalex-snapshot
On Ideal Lattices and Learning with Errors over Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_23openalex-snapshot
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_27openalex-snapshot
Bonsai Trees, or How to Delegate a Lattice Basis
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_28openalex-snapshot
Efficient Lattice (H)IBE in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_15openalex-snapshot
Short Bases of Lattices over Number Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_7openalex-snapshot
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_8openalex-snapshot
Interpreting Hash Function Security Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_4openalex-snapshot
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-22497-3_10openalex-snapshot
Faster and Smoother – VSH Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_29openalex-snapshot
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
inferred← citeshttps://doi.org/10.1007/978-3-642-23082-0_7openalex-snapshot
The Geometry of Lattice Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_31openalex-snapshot
Subspace LWE
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_34openalex-snapshot
Tightly Secure Signatures From Lossy Identification Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_41openalex-snapshot
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_43openalex-snapshot
Lattice Signatures without Trapdoors
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_21openalex-snapshot
NTRUCCA: How to Strengthen NTRUEncrypt to Chosen-Ciphertext Security in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-642-30057-8_28openalex-snapshot
Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-30955-7_14openalex-snapshot
An Efficient Lattice-Based Secret Sharing Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_31openalex-snapshot
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34704-7_23openalex-snapshot
A Ciphertext Policy Attribute-Based Encryption Scheme without Pairings
inferred← citeshttps://doi.org/10.1007/978-3-642-36362-7_19openalex-snapshot
Tighter Reductions for Forward-Secure Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-38553-7_22openalex-snapshot
Sieving for Shortest Vectors in Ideal Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_3openalex-snapshot
Lattice Signatures and Bimodal Gaussians
inferred← citeshttps://doi.org/10.1007/978-3-642-40041-4_4openalex-snapshot
Learning with Rounding, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_3openalex-snapshot
Lattice-Based Group Signatures with Logarithmic Signature Size
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0openalex-snapshot
Public-key cryptography - PKC 2014 : 17th International Conference on Practice and Theory in Public-Key Cryptography Buenos Aires, Argentina, March 26-28, 2014 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_20openalex-snapshot
Lattice-Based Group Signature Scheme with Verifier-Local Revocation
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_19openalex-snapshot
Improved Short Lattice Signatures in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_18openalex-snapshot
Simpler Efficient Group Signatures from Lattices
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_19openalex-snapshot
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_32openalex-snapshot
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
inferred← citeshttps://doi.org/10.1007/978-3-662-46706-0_3openalex-snapshot
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_30openalex-snapshot
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices
inferred← citeshttps://doi.org/10.1007/978-3-662-48000-7_9openalex-snapshot
Parallel Hashing via List Recoverability
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_11openalex-snapshot
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
inferred← citeshttps://doi.org/10.1007/978-3-662-53890-6_7openalex-snapshot
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
inferred← citeshttps://doi.org/10.1007/978-3-662-63958-0_25openalex-snapshot
Post-quantum Online Voting Scheme
inferred← citeshttps://doi.org/10.1007/978-88-470-2481-6_9openalex-snapshot
Reticoli e crittografia
inferred← citeshttps://doi.org/10.1007/978-981-15-0818-9_8openalex-snapshot
Zero-Knowledge Proofs for Improved Lattice-Based Group Signature Scheme with Verifier-Local Revocation
inferred← citeshttps://doi.org/10.1007/978-981-15-8427-5_7openalex-snapshot
Digital Signatures
inferred← citeshttps://doi.org/10.1007/978-981-19-7242-3_7openalex-snapshot
Inner Product Encryption from Middle-Product Learning with Errors
inferred← citeshttps://doi.org/10.1007/978-981-19-9719-8_26openalex-snapshot
Quantum-defended Digital Signature on Lattice for IoT-enabled Systems
inferred← citeshttps://doi.org/10.1007/978-981-95-5099-9_11openalex-snapshot
LatticeFold: A Lattice-Based Folding Scheme and Its Applications to Succinct Proof Systems
inferred← citeshttps://doi.org/10.1007/978-981-96-0894-2_14openalex-snapshot
Evasive LWE Assumptions: Definitions, Classes, and Counterexamples
inferred← citeshttps://doi.org/10.1007/978-981-96-0954-3_9openalex-snapshot
Simple Construction of PEKS from LWE-Based IBE in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-981-96-1218-5_13openalex-snapshot
A Survey on Middle-Product Learning with Errors Cryptography
inferred← citeshttps://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00145-017-9270-zopenalex-snapshot
Asymptotically Efficient Lattice-Based Digital Signatures
inferred← citeshttps://doi.org/10.1007/s00145-018-9283-2openalex-snapshot
On the Tightness of Forward-Secure Signature Reductions
inferred← citeshttps://doi.org/10.1007/s00145-020-09371-yopenalex-snapshot
Tighter Security Proofs for GPV-IBE in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/s00145-023-09488-wopenalex-snapshot
Lattice-Based Programmable Hash Functions and Applications
inferred← citeshttps://doi.org/10.1007/s00145-024-09508-3openalex-snapshot
Algebraically Structured LWE, Revisited
inferred← citeshttps://doi.org/10.1007/s00145-024-09530-5openalex-snapshot
Lattice-Based Zero-Knowledge Proofs in Action: Applications to Electronic Voting
inferred← citeshttps://doi.org/10.1007/s00453-016-0221-0openalex-snapshot
Scalable Zero Knowledge Via Cycles of Elliptic Curves
inferred← citeshttps://doi.org/10.1007/s00454-014-9608-3openalex-snapshot
On the Geometry of Cyclic Lattices
inferred← citeshttps://doi.org/10.1007/s00607-009-0042-yopenalex-snapshot
Post-quantum cryptography: lattice signatures
inferred← citeshttps://doi.org/10.1007/s10623-014-9972-2openalex-snapshot
Strongly secure authenticated key exchange from factoring, codes, and lattices
inferred← citeshttps://doi.org/10.1007/s10623-021-00895-3openalex-snapshot
Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
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-025-01660-6openalex-snapshot
Generic construction of threshold ring signatures and lattice-based instantiations
inferred← citeshttps://doi.org/10.1007/s10623-025-01778-7openalex-snapshot
PAORE: public-key authenticated order-revealing encryption
inferred← citeshttps://doi.org/10.1007/s10623-026-01912-zopenalex-snapshot
Tagged-FHE: strong syntax, stronger security, and standard model
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/s11277-020-07396-xopenalex-snapshot
Ring Signature-Based Conditional Privacy-Preserving Authentication in VANETs
inferred← citeshttps://doi.org/10.1007/s11416-026-00646-9openalex-snapshot
On the construction of Barnes–Wall lattices and their application in cryptography
inferred← citeshttps://doi.org/10.1007/s12083-025-02040-6openalex-snapshot
Secure and efficient fully dynamic group signature based on RSIS and RLWE
inferred← citeshttps://doi.org/10.1007/s12652-018-0718-2openalex-snapshot
Trapdoor function based on the Ring-LWE and applications in communications
inferred← citeshttps://doi.org/10.1007/s13160-018-0306-zopenalex-snapshot
Security analysis of cryptosystems using short generators over ideal lattices
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.1049/ise2.12039openalex-snapshot
Lattice‐based hash‐and‐sign signatures using approximate trapdoor, revisited
inferred← citeshttps://doi.org/10.1049/ise2.12089openalex-snapshot
Improved lattice‐based mix‐nets for electronic voting
inferred← citeshttps://doi.org/10.1049/ise2.12101openalex-snapshot
Lattice‐based cryptosystems in standardisation processes: A survey
inferred← citeshttps://doi.org/10.1109/access.2018.2889242openalex-snapshot
An Efficient Strong Designated Verifier Signature Based on $\mathcal{R}-$ SIS Assumption
inferred← citeshttps://doi.org/10.1109/access.2019.2898717openalex-snapshot
A Lattice-Based Incremental Signature Scheme
inferred← citeshttps://doi.org/10.1109/access.2020.3011146openalex-snapshot
Reduction From Module-SIS to Ring-SIS Under Norm Constraint of Ring-SIS
inferred← citeshttps://doi.org/10.1109/access.2020.3038042openalex-snapshot
Privacy Protection of VANET Based on Traceable Ring Signature on Ideal Lattice
inferred← citeshttps://doi.org/10.1109/access.2021.3087808openalex-snapshot
Identity-Based Linkable Ring Signatures From Lattices
inferred← citeshttps://doi.org/10.1109/access.2021.3128139openalex-snapshot
Improved Reduction Between SIS Problems Over Structured Lattices
inferred← citeshttps://doi.org/10.1109/access.2024.3358670openalex-snapshot
A Concrete LIP-Based KEM With Simple Lattices
inferred← citeshttps://doi.org/10.1109/ccc.2010.26openalex-snapshot
The Learning with Errors Problem (Invited Survey)
inferred← citeshttps://doi.org/10.1109/eurosp.2018.00032openalex-snapshot
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
inferred← citeshttps://doi.org/10.1109/itoec57671.2023.10291519openalex-snapshot
Full Cycle Data Protection Scheme of Power Parameters in Smart Grid Based on Lattice Encryption
inferred← citeshttps://doi.org/10.1109/itw.2011.6089491openalex-snapshot
Search to decision reduction for the learning with errors over rings problem
inferred← citeshttps://doi.org/10.1109/jiot.2023.3328719openalex-snapshot
Efficient Key Generation on Lattice Cryptography for Privacy Protection in Mobile IoT Crowdsourcing
inferred← citeshttps://doi.org/10.1109/tc.2014.2346177openalex-snapshot
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1109/tc.2016.2642962openalex-snapshot
On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
inferred← citeshttps://doi.org/10.1109/tdsc.2024.3410695openalex-snapshot
Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler With Realizations
inferred← citeshttps://doi.org/10.1109/tifs.2024.3376206openalex-snapshot
Toward Efficient Key Extraction of LBC Over Ring: Fast Non-Spherical G-Lattice Sampler and Optimized Perturbation Generation
inferred← citeshttps://doi.org/10.1109/tifs.2025.3542248openalex-snapshot
Proofs of Retrievability With Public Verifiability From Lattices
inferred← citeshttps://doi.org/10.1137/23m1598507openalex-snapshot
Doubly Efficient Private Information Retrieval and Fully Homomorphic Ram Computation from Ring LWE
inferred← citeshttps://doi.org/10.1145/1250790.1250860openalex-snapshot
Lattices that admit logarithmic worst-case to average-case connection factors
inferred← citeshttps://doi.org/10.1145/1374376.1374407openalex-snapshot
Trapdoors for hard lattices and new cryptographic constructions
inferred← citeshttps://doi.org/10.1145/1536414.1536440openalex-snapshot
Fully homomorphic encryption using ideal lattices
inferred← citeshttps://doi.org/10.1145/2442829.2442844openalex-snapshot
A polynomial time algorithm for computing the HNF of a module over the integers of a number field
inferred← citeshttps://doi.org/10.1145/2488608.2488680openalex-snapshot
Classical hardness of learning with errors
inferred← citeshttps://doi.org/10.1145/2535925openalex-snapshot
On Ideal Lattices and Learning with Errors over Rings
inferred← citeshttps://doi.org/10.1145/3133956.3134101openalex-snapshot
Practical Quantum-Safe Voting from Lattices
inferred← citeshttps://doi.org/10.1145/3321705.3329837openalex-snapshot
K2SN-MSS
inferred← citeshttps://doi.org/10.1145/3431725openalex-snapshot
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
inferred← citeshttps://doi.org/10.1145/3564246.3585175openalex-snapshot
Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE
inferred← citeshttps://doi.org/10.1145/3564625.3564629openalex-snapshot
Parallel Small Polynomial Multiplication for Dilithium: A Faster Design and Implementation
inferred← citeshttps://doi.org/10.1145/3586165.3586172openalex-snapshot
The Complexity of the Shortest Vector Problem
inferred← citeshttps://doi.org/10.1145/3609223openalex-snapshot
Faster Implementation of Ideal Lattice-Based Cryptography Using AVX512
inferred← citeshttps://doi.org/10.1145/3708821.3736223openalex-snapshot
Ring-LWR based Commitments and ZK-PoKs with Application to Verifiable Quantum-Safe Searchable Symmetric Encryption
inferred← citeshttps://doi.org/10.1155/2014/371924openalex-snapshot
Strongly Unforgeable Ring Signature Scheme from Lattices in the Standard Model
inferred← citeshttps://doi.org/10.1186/s42400-020-00062-6openalex-snapshot
Inner product encryption from ring learning with errors
inferred← citeshttps://doi.org/10.1186/s42400-023-00198-1openalex-snapshot
A survey on lattice-based digital signature
inferred← citeshttps://doi.org/10.1186/s42400-025-00521-yopenalex-snapshot
Proving multiplicative relations for lattice commitments in batch
inferred← citeshttps://doi.org/10.1365/s13291-024-00286-2openalex-snapshot
Discriminants of Number Fields
inferred← citeshttps://doi.org/10.1371/journal.pone.0310708openalex-snapshot
GCKSign: Simple and efficient signatures from generalized compact knapsack problems
inferred← citeshttps://doi.org/10.17586/2226-1494-2025-25-3-446-456openalex-snapshot
Analysis of the applicability of existing secret separation schemes in the post-quaternary era
inferred← citeshttps://doi.org/10.18494/sam.2021.3044openalex-snapshot
Proxy Signature for Sensor Networks against Cyber Attack
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2981150/v1openalex-snapshot
Revocable Multiple Groups Outsourcing Data Integrity Auditing Scheme on Lattices
showing the first 200 of 228 · page through all 228
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.